/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 16:13:37,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 16:13:38,001 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 16:13:38,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 16:13:38,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 16:13:38,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 16:13:38,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 16:13:38,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 16:13:38,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 16:13:38,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 16:13:38,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 16:13:38,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 16:13:38,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 16:13:38,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 16:13:38,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 16:13:38,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 16:13:38,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 16:13:38,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 16:13:38,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 16:13:38,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 16:13:38,055 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 16:13:38,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 16:13:38,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 16:13:38,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 16:13:38,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 16:13:38,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 16:13:38,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 16:13:38,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 16:13:38,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 16:13:38,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 16:13:38,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 16:13:38,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 16:13:38,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 16:13:38,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 16:13:38,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 16:13:38,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 16:13:38,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 16:13:38,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 16:13:38,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 16:13:38,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 16:13:38,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 16:13:38,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 16:13:38,068 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:13:38,086 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 16:13:38,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 16:13:38,086 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 16:13:38,086 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 16:13:38,086 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 16:13:38,086 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 16:13:38,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 16:13:38,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 16:13:38,091 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 16:13:38,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 16:13:38,092 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 16:13:38,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 16:13:38,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 16:13:38,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 16:13:38,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 16:13:38,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 16:13:38,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 16:13:38,093 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 16:13:38,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 16:13:38,093 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 16:13:38,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 16:13:38,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 16:13:38,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 16:13:38,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 16:13:38,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 16:13:38,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 16:13:38,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 16:13:38,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 16:13:38,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 16:13:38,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 16:13:38,094 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 16:13:38,094 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 16:13:38,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 16:13:38,094 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:13:38,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 16:13:38,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 16:13:38,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 16:13:38,300 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 16:13:38,300 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 16:13:38,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2022-04-14 16:13:38,345 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d8d4eb7/77dbe98b2d52415fbcddf1e5daa5f4c1/FLAGb2c3baf9b [2022-04-14 16:13:38,707 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 16:13:38,708 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2022-04-14 16:13:38,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d8d4eb7/77dbe98b2d52415fbcddf1e5daa5f4c1/FLAGb2c3baf9b [2022-04-14 16:13:38,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d8d4eb7/77dbe98b2d52415fbcddf1e5daa5f4c1 [2022-04-14 16:13:38,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 16:13:38,721 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 16:13:38,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 16:13:38,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 16:13:38,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 16:13:38,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:13:38" (1/1) ... [2022-04-14 16:13:38,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dea8fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:13:38, skipping insertion in model container [2022-04-14 16:13:38,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:13:38" (1/1) ... [2022-04-14 16:13:38,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 16:13:38,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 16:13:38,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c[535,548] [2022-04-14 16:13:38,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 16:13:38,939 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 16:13:38,953 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c[535,548] [2022-04-14 16:13:38,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 16:13:38,983 INFO L208 MainTranslator]: Completed translation [2022-04-14 16:13:38,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:13:38 WrapperNode [2022-04-14 16:13:38,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 16:13:38,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 16:13:38,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 16:13:38,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 16:13:38,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:13:38" (1/1) ... [2022-04-14 16:13:38,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:13:38" (1/1) ... [2022-04-14 16:13:39,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:13:38" (1/1) ... [2022-04-14 16:13:39,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:13:38" (1/1) ... [2022-04-14 16:13:39,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:13:38" (1/1) ... [2022-04-14 16:13:39,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:13:38" (1/1) ... [2022-04-14 16:13:39,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:13:38" (1/1) ... [2022-04-14 16:13:39,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 16:13:39,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 16:13:39,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 16:13:39,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 16:13:39,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:13:38" (1/1) ... [2022-04-14 16:13:39,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 16:13:39,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:13:39,047 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:13:39,064 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:13:39,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 16:13:39,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 16:13:39,075 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 16:13:39,076 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 16:13:39,077 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 16:13:39,077 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 16:13:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 16:13:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 16:13:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 16:13:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 16:13:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 16:13:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 16:13:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 16:13:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 16:13:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 16:13:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 16:13:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 16:13:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 16:13:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 16:13:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 16:13:39,127 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 16:13:39,128 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 16:13:39,268 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 16:13:39,274 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 16:13:39,274 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-14 16:13:39,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 04:13:39 BoogieIcfgContainer [2022-04-14 16:13:39,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 16:13:39,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 16:13:39,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 16:13:39,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 16:13:39,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 04:13:38" (1/3) ... [2022-04-14 16:13:39,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc08d6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:13:39, skipping insertion in model container [2022-04-14 16:13:39,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:13:38" (2/3) ... [2022-04-14 16:13:39,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc08d6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:13:39, skipping insertion in model container [2022-04-14 16:13:39,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 04:13:39" (3/3) ... [2022-04-14 16:13:39,288 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound100.c [2022-04-14 16:13:39,291 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 16:13:39,291 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 16:13:39,320 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 16:13:39,324 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:13:39,324 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 16:13:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 16:13:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 16:13:39,340 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:13:39,340 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:13:39,340 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:13:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:13:39,343 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-14 16:13:39,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:13:39,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871626470] [2022-04-14 16:13:39,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:13:39,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:13:39,464 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:13:39,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [996904034] [2022-04-14 16:13:39,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:13:39,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:13:39,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:13:39,467 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:13:39,468 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:13:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:13:39,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-14 16:13:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:13:39,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:13:39,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-14 16:13:39,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-14 16:13:39,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-14 16:13:39,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-14 16:13:39,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-14 16:13:39,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-14 16:13:39,650 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40#true} is VALID [2022-04-14 16:13:39,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 16:13:39,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 16:13:39,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 16:13:39,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-14 16:13:39,652 INFO L272 TraceCheckUtils]: 11: Hoare triple {41#false} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {41#false} is VALID [2022-04-14 16:13:39,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-14 16:13:39,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 16:13:39,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 16:13:39,652 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-14 16:13:39,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41#false} is VALID [2022-04-14 16:13:39,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-14 16:13:39,653 INFO L272 TraceCheckUtils]: 18: Hoare triple {41#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41#false} is VALID [2022-04-14 16:13:39,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-14 16:13:39,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-14 16:13:39,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-14 16:13:39,654 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:13:39,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:13:39,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:13:39,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871626470] [2022-04-14 16:13:39,654 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:13:39,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996904034] [2022-04-14 16:13:39,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996904034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:13:39,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:13:39,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-14 16:13:39,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529041923] [2022-04-14 16:13:39,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:13:39,662 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:13:39,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:13:39,665 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:13:39,693 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:13:39,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-14 16:13:39,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:13:39,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-14 16:13:39,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-14 16:13:39,713 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:13:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:13:39,780 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-14 16:13:39,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-14 16:13:39,780 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:13:39,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:13:39,781 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:13:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-14 16:13:39,787 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:13:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-14 16:13:39,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-14 16:13:39,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:13:39,914 INFO L225 Difference]: With dead ends: 67 [2022-04-14 16:13:39,914 INFO L226 Difference]: Without dead ends: 32 [2022-04-14 16:13:39,916 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:13:39,920 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:13:39,921 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:13:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-14 16:13:39,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-14 16:13:39,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:13:39,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 16:13:39,952 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 16:13:39,952 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 16:13:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:13:39,960 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-14 16:13:39,961 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-14 16:13:39,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:13:39,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:13:39,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-14 16:13:39,964 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-14 16:13:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:13:39,966 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-14 16:13:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-14 16:13:39,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:13:39,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:13:39,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:13:39,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:13:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 16:13:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-14 16:13:39,970 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-14 16:13:39,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:13:39,970 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-14 16:13:39,970 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:13:39,971 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-14 16:13:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 16:13:39,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:13:39,974 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:13:39,993 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:13:40,193 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:13:40,193 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:13:40,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:13:40,194 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-14 16:13:40,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:13:40,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674670132] [2022-04-14 16:13:40,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:13:40,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:13:40,213 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:13:40,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582547314] [2022-04-14 16:13:40,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:13:40,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:13:40,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:13:40,215 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:13:40,217 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:13:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:13:40,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 16:13:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:13:40,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:13:40,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-14 16:13:40,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {315#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:40,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:40,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {315#(<= ~counter~0 0)} {307#true} #102#return; {315#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:40,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {315#(<= ~counter~0 0)} call #t~ret9 := main(); {315#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:40,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {315#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {315#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:40,386 INFO L272 TraceCheckUtils]: 6: Hoare triple {315#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {315#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:40,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:40,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:40,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:40,387 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #90#return; {315#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:40,388 INFO L272 TraceCheckUtils]: 11: Hoare triple {315#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {315#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:40,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:40,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:40,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:40,390 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #92#return; {315#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:40,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {315#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {315#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:40,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {364#(<= |main_#t~post6| 0)} is VALID [2022-04-14 16:13:40,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {308#false} is VALID [2022-04-14 16:13:40,391 INFO L272 TraceCheckUtils]: 19: Hoare triple {308#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {308#false} is VALID [2022-04-14 16:13:40,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2022-04-14 16:13:40,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {308#false} assume 0 == ~cond; {308#false} is VALID [2022-04-14 16:13:40,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-14 16:13:40,392 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:13:40,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:13:40,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:13:40,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674670132] [2022-04-14 16:13:40,392 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:13:40,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582547314] [2022-04-14 16:13:40,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582547314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:13:40,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:13:40,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 16:13:40,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759676061] [2022-04-14 16:13:40,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:13:40,394 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:13:40,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:13:40,394 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:13:40,409 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:13:40,409 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 16:13:40,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:13:40,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 16:13:40,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 16:13:40,410 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:13:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:13:40,478 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-14 16:13:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 16:13:40,478 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:13:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:13:40,479 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:13:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-14 16:13:40,481 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:13:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-14 16:13:40,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-14 16:13:40,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:13:40,517 INFO L225 Difference]: With dead ends: 41 [2022-04-14 16:13:40,517 INFO L226 Difference]: Without dead ends: 34 [2022-04-14 16:13:40,517 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:13:40,518 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:13:40,518 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:13:40,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-14 16:13:40,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-14 16:13:40,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:13:40,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 16:13:40,525 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 16:13:40,525 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 16:13:40,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:13:40,527 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-14 16:13:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-14 16:13:40,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:13:40,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:13:40,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-14 16:13:40,528 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-14 16:13:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:13:40,530 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-14 16:13:40,530 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-14 16:13:40,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:13:40,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:13:40,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:13:40,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:13:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 16:13:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-14 16:13:40,533 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-14 16:13:40,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:13:40,533 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-14 16:13:40,533 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:13:40,533 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-14 16:13:40,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 16:13:40,534 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:13:40,534 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:13:40,571 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:13:40,750 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:13:40,750 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:13:40,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:13:40,751 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-14 16:13:40,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:13:40,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769717143] [2022-04-14 16:13:40,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:13:40,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:13:40,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:13:40,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112649907] [2022-04-14 16:13:40,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:13:40,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:13:40,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:13:40,762 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:13:40,763 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:13:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:13:40,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 16:13:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-14 16:13:48,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:13:49,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-14 16:13:49,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {554#true} is VALID [2022-04-14 16:13:49,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-14 16:13:49,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #102#return; {554#true} is VALID [2022-04-14 16:13:49,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret9 := main(); {554#true} is VALID [2022-04-14 16:13:49,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {554#true} is VALID [2022-04-14 16:13:49,657 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {554#true} is VALID [2022-04-14 16:13:49,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-14 16:13:49,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-14 16:13:49,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-14 16:13:49,658 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} #90#return; {554#true} is VALID [2022-04-14 16:13:49,658 INFO L272 TraceCheckUtils]: 11: Hoare triple {554#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {554#true} is VALID [2022-04-14 16:13:49,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-14 16:13:49,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-14 16:13:49,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-14 16:13:49,659 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} #92#return; {554#true} is VALID [2022-04-14 16:13:51,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {554#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-14 16:13:51,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-14 16:13:51,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-14 16:13:51,763 INFO L272 TraceCheckUtils]: 19: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {617#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:13:51,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:13:51,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {555#false} is VALID [2022-04-14 16:13:51,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-14 16:13:51,765 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:13:51,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:13:51,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:13:51,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769717143] [2022-04-14 16:13:51,765 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:13:51,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112649907] [2022-04-14 16:13:51,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112649907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:13:51,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:13:51,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 16:13:51,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359380763] [2022-04-14 16:13:51,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:13:51,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-14 16:13:51,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:13:51,767 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:13:54,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 16:13:54,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 16:13:54,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:13:54,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 16:13:54,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 16:13:54,203 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:13:58,704 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:14:02,346 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:14:14,945 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:14:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:15,012 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-14 16:14:15,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 16:14:15,012 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:14:15,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:15,013 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:14:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-14 16:14:15,016 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:14:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-14 16:14:15,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-14 16:14:20,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:20,675 INFO L225 Difference]: With dead ends: 53 [2022-04-14 16:14:20,675 INFO L226 Difference]: Without dead ends: 51 [2022-04-14 16:14:20,675 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:14:20,678 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 16 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:20,678 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 122 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2022-04-14 16:14:20,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-14 16:14:20,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-14 16:14:20,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:20,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 16:14:20,687 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 16:14:20,688 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 16:14:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:20,690 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-14 16:14:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-14 16:14:20,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:20,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:20,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-14 16:14:20,691 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-14 16:14:20,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:20,693 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-14 16:14:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-14 16:14:20,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:20,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:20,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:20,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 16:14:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-14 16:14:20,696 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-14 16:14:20,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:20,696 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-14 16:14:20,696 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:14:20,696 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-14 16:14:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 16:14:20,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:20,697 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:14:20,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-14 16:14:20,911 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:14:20,912 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:20,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:20,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-14 16:14:20,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:20,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982334466] [2022-04-14 16:14:20,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:20,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:20,923 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:20,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2051785141] [2022-04-14 16:14:20,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:20,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:20,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:20,925 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:14:20,926 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:14:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:20,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-14 16:14:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:20,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:14:21,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-14 16:14:21,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {877#true} is VALID [2022-04-14 16:14:21,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-14 16:14:21,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-14 16:14:21,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-14 16:14:21,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {877#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {877#true} is VALID [2022-04-14 16:14:21,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {877#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {877#true} is VALID [2022-04-14 16:14:21,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-14 16:14:21,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-14 16:14:21,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-14 16:14:21,126 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-14 16:14:21,126 INFO L272 TraceCheckUtils]: 11: Hoare triple {877#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {877#true} is VALID [2022-04-14 16:14:21,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-14 16:14:21,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-14 16:14:21,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-14 16:14:21,126 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-14 16:14:21,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {877#true} is VALID [2022-04-14 16:14:21,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-14 16:14:21,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 100);havoc #t~post6; {877#true} is VALID [2022-04-14 16:14:21,127 INFO L272 TraceCheckUtils]: 19: Hoare triple {877#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {877#true} is VALID [2022-04-14 16:14:21,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} ~cond := #in~cond; {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:14:21,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:14:21,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:14:21,129 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} {877#true} #94#return; {953#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-14 16:14:21,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {953#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} assume !(0 != ~r~0); {957#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-14 16:14:21,130 INFO L272 TraceCheckUtils]: 25: Hoare triple {957#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:14:21,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:14:21,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-14 16:14:21,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-14 16:14:21,131 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:14:21,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:14:21,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-14 16:14:21,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-14 16:14:21,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:14:21,512 INFO L272 TraceCheckUtils]: 25: Hoare triple {957#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:14:21,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {984#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} assume !(0 != ~r~0); {957#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-14 16:14:21,513 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} {877#true} #94#return; {984#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-14 16:14:21,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:14:21,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {997#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:14:21,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} ~cond := #in~cond; {997#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:14:21,514 INFO L272 TraceCheckUtils]: 19: Hoare triple {877#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {877#true} is VALID [2022-04-14 16:14:21,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 100);havoc #t~post6; {877#true} is VALID [2022-04-14 16:14:21,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-14 16:14:21,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {877#true} is VALID [2022-04-14 16:14:21,515 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-14 16:14:21,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-14 16:14:21,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-14 16:14:21,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-14 16:14:21,515 INFO L272 TraceCheckUtils]: 11: Hoare triple {877#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {877#true} is VALID [2022-04-14 16:14:21,515 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-14 16:14:21,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-14 16:14:21,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-14 16:14:21,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-14 16:14:21,516 INFO L272 TraceCheckUtils]: 6: Hoare triple {877#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {877#true} is VALID [2022-04-14 16:14:21,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {877#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {877#true} is VALID [2022-04-14 16:14:21,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-14 16:14:21,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-14 16:14:21,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-14 16:14:21,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {877#true} is VALID [2022-04-14 16:14:21,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-14 16:14:21,517 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:14:21,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:14:21,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982334466] [2022-04-14 16:14:21,517 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:14:21,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051785141] [2022-04-14 16:14:21,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051785141] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:14:21,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:14:21,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-14 16:14:21,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814915928] [2022-04-14 16:14:21,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:14:21,518 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:14:21,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:14:21,518 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:14:21,539 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:14:21,539 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 16:14:21,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:14:21,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 16:14:21,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-14 16:14:21,540 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 16:14:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:22,068 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-14 16:14:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 16:14:22,068 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:14:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:22,068 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:14:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-14 16:14:22,070 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:14:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-14 16:14:22,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-14 16:14:22,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:22,109 INFO L225 Difference]: With dead ends: 57 [2022-04-14 16:14:22,109 INFO L226 Difference]: Without dead ends: 52 [2022-04-14 16:14:22,109 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:14:22,110 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:22,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 171 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 16:14:22,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-14 16:14:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-14 16:14:22,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:22,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 16:14:22,120 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 16:14:22,120 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 16:14:22,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:22,122 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-14 16:14:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-14 16:14:22,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:22,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:22,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-14 16:14:22,123 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-14 16:14:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:22,125 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-14 16:14:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-14 16:14:22,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:22,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:22,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:22,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 16:14:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-14 16:14:22,134 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 29 [2022-04-14 16:14:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:22,134 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-04-14 16:14:22,135 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:14:22,135 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-14 16:14:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-14 16:14:22,135 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:22,135 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:14:22,159 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:14:22,359 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:14:22,359 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:22,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:22,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-14 16:14:22,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:22,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885755646] [2022-04-14 16:14:22,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:22,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:22,379 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:22,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [711908731] [2022-04-14 16:14:22,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:22,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:22,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:22,393 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:14:22,394 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:14:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:22,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 16:14:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:22,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:14:22,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {1324#true} call ULTIMATE.init(); {1324#true} is VALID [2022-04-14 16:14:22,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {1324#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1332#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:22,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {1332#(<= ~counter~0 0)} assume true; {1332#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:22,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1332#(<= ~counter~0 0)} {1324#true} #102#return; {1332#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:22,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {1332#(<= ~counter~0 0)} call #t~ret9 := main(); {1332#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:22,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {1332#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1332#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:22,589 INFO L272 TraceCheckUtils]: 6: Hoare triple {1332#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1332#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:22,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {1332#(<= ~counter~0 0)} ~cond := #in~cond; {1332#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:22,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {1332#(<= ~counter~0 0)} assume !(0 == ~cond); {1332#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:22,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {1332#(<= ~counter~0 0)} assume true; {1332#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:22,591 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1332#(<= ~counter~0 0)} {1332#(<= ~counter~0 0)} #90#return; {1332#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:22,592 INFO L272 TraceCheckUtils]: 11: Hoare triple {1332#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1332#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:22,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {1332#(<= ~counter~0 0)} ~cond := #in~cond; {1332#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:22,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {1332#(<= ~counter~0 0)} assume !(0 == ~cond); {1332#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:22,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {1332#(<= ~counter~0 0)} assume true; {1332#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:22,593 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1332#(<= ~counter~0 0)} {1332#(<= ~counter~0 0)} #92#return; {1332#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:22,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {1332#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1332#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:22,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {1332#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1381#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:22,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {1381#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1381#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:22,595 INFO L272 TraceCheckUtils]: 19: Hoare triple {1381#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1381#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:22,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {1381#(<= ~counter~0 1)} ~cond := #in~cond; {1381#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:22,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {1381#(<= ~counter~0 1)} assume !(0 == ~cond); {1381#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:22,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {1381#(<= ~counter~0 1)} assume true; {1381#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:22,597 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1381#(<= ~counter~0 1)} {1381#(<= ~counter~0 1)} #94#return; {1381#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:22,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {1381#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1381#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:22,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {1381#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1406#(<= |main_#t~post7| 1)} is VALID [2022-04-14 16:14:22,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {1406#(<= |main_#t~post7| 1)} assume !(#t~post7 < 100);havoc #t~post7; {1325#false} is VALID [2022-04-14 16:14:22,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {1325#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1325#false} is VALID [2022-04-14 16:14:22,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {1325#false} assume !(#t~post8 < 100);havoc #t~post8; {1325#false} is VALID [2022-04-14 16:14:22,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {1325#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1325#false} is VALID [2022-04-14 16:14:22,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {1325#false} assume !(#t~post6 < 100);havoc #t~post6; {1325#false} is VALID [2022-04-14 16:14:22,600 INFO L272 TraceCheckUtils]: 31: Hoare triple {1325#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1325#false} is VALID [2022-04-14 16:14:22,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {1325#false} ~cond := #in~cond; {1325#false} is VALID [2022-04-14 16:14:22,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {1325#false} assume 0 == ~cond; {1325#false} is VALID [2022-04-14 16:14:22,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {1325#false} assume !false; {1325#false} is VALID [2022-04-14 16:14:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:14:22,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:14:22,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:14:22,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885755646] [2022-04-14 16:14:22,601 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:14:22,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711908731] [2022-04-14 16:14:22,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711908731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:14:22,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:14:22,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 16:14:22,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933151252] [2022-04-14 16:14:22,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:14:22,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-14 16:14:22,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:14:22,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 16:14:22,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:22,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 16:14:22,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:14:22,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 16:14:22,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 16:14:22,630 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 16:14:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:22,732 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-14 16:14:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 16:14:22,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-14 16:14:22,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 16:14:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-14 16:14:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 16:14:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-14 16:14:22,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-14 16:14:22,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:22,791 INFO L225 Difference]: With dead ends: 97 [2022-04-14 16:14:22,791 INFO L226 Difference]: Without dead ends: 60 [2022-04-14 16:14:22,792 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 16:14:22,792 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:22,793 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 120 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:14:22,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-14 16:14:22,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-14 16:14:22,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:22,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 16:14:22,804 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 16:14:22,804 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 16:14:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:22,806 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-14 16:14:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-14 16:14:22,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:22,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:22,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-14 16:14:22,807 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-14 16:14:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:22,808 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-14 16:14:22,809 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-14 16:14:22,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:22,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:22,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:22,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 16:14:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-14 16:14:22,811 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 35 [2022-04-14 16:14:22,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:22,811 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-04-14 16:14:22,811 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 16:14:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-14 16:14:22,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-14 16:14:22,812 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:22,812 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:14:22,830 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:14:23,030 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:14:23,030 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:23,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:23,031 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-14 16:14:23,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:23,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947469364] [2022-04-14 16:14:23,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:23,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:23,045 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:23,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2117420744] [2022-04-14 16:14:23,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:23,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:23,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:23,049 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:14:23,082 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:14:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:23,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 16:14:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:23,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:14:23,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {1774#true} call ULTIMATE.init(); {1774#true} is VALID [2022-04-14 16:14:23,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1782#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:23,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {1782#(<= ~counter~0 0)} assume true; {1782#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:23,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1782#(<= ~counter~0 0)} {1774#true} #102#return; {1782#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:23,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {1782#(<= ~counter~0 0)} call #t~ret9 := main(); {1782#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:23,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {1782#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1782#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:23,293 INFO L272 TraceCheckUtils]: 6: Hoare triple {1782#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1782#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:23,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {1782#(<= ~counter~0 0)} ~cond := #in~cond; {1782#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:23,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {1782#(<= ~counter~0 0)} assume !(0 == ~cond); {1782#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:23,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {1782#(<= ~counter~0 0)} assume true; {1782#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:23,294 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1782#(<= ~counter~0 0)} {1782#(<= ~counter~0 0)} #90#return; {1782#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:23,294 INFO L272 TraceCheckUtils]: 11: Hoare triple {1782#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1782#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:23,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {1782#(<= ~counter~0 0)} ~cond := #in~cond; {1782#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:23,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {1782#(<= ~counter~0 0)} assume !(0 == ~cond); {1782#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:23,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {1782#(<= ~counter~0 0)} assume true; {1782#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:23,295 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1782#(<= ~counter~0 0)} {1782#(<= ~counter~0 0)} #92#return; {1782#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:23,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {1782#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1782#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:23,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {1782#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1831#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:23,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {1831#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1831#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:23,298 INFO L272 TraceCheckUtils]: 19: Hoare triple {1831#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1831#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:23,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {1831#(<= ~counter~0 1)} ~cond := #in~cond; {1831#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:23,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {1831#(<= ~counter~0 1)} assume !(0 == ~cond); {1831#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:23,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {1831#(<= ~counter~0 1)} assume true; {1831#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:23,300 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1831#(<= ~counter~0 1)} {1831#(<= ~counter~0 1)} #94#return; {1831#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:23,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {1831#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1831#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:23,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {1831#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1856#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:23,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {1856#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {1856#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:23,304 INFO L272 TraceCheckUtils]: 27: Hoare triple {1856#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1856#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:23,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {1856#(<= ~counter~0 2)} ~cond := #in~cond; {1856#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:23,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {1856#(<= ~counter~0 2)} assume !(0 == ~cond); {1856#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:23,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {1856#(<= ~counter~0 2)} assume true; {1856#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:23,305 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1856#(<= ~counter~0 2)} {1856#(<= ~counter~0 2)} #96#return; {1856#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:23,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {1856#(<= ~counter~0 2)} assume !(~r~0 > 0); {1856#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:23,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {1856#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1881#(<= |main_#t~post8| 2)} is VALID [2022-04-14 16:14:23,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {1881#(<= |main_#t~post8| 2)} assume !(#t~post8 < 100);havoc #t~post8; {1775#false} is VALID [2022-04-14 16:14:23,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1775#false} is VALID [2022-04-14 16:14:23,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#false} assume !(#t~post6 < 100);havoc #t~post6; {1775#false} is VALID [2022-04-14 16:14:23,306 INFO L272 TraceCheckUtils]: 37: Hoare triple {1775#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1775#false} is VALID [2022-04-14 16:14:23,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {1775#false} ~cond := #in~cond; {1775#false} is VALID [2022-04-14 16:14:23,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {1775#false} assume 0 == ~cond; {1775#false} is VALID [2022-04-14 16:14:23,307 INFO L290 TraceCheckUtils]: 40: Hoare triple {1775#false} assume !false; {1775#false} is VALID [2022-04-14 16:14:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:14:23,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:14:23,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {1775#false} assume !false; {1775#false} is VALID [2022-04-14 16:14:23,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {1775#false} assume 0 == ~cond; {1775#false} is VALID [2022-04-14 16:14:23,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {1775#false} ~cond := #in~cond; {1775#false} is VALID [2022-04-14 16:14:23,500 INFO L272 TraceCheckUtils]: 37: Hoare triple {1775#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1775#false} is VALID [2022-04-14 16:14:23,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#false} assume !(#t~post6 < 100);havoc #t~post6; {1775#false} is VALID [2022-04-14 16:14:23,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1775#false} is VALID [2022-04-14 16:14:23,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {1921#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {1775#false} is VALID [2022-04-14 16:14:23,501 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1921#(< |main_#t~post8| 100)} is VALID [2022-04-14 16:14:23,501 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#(< ~counter~0 100)} assume !(~r~0 > 0); {1925#(< ~counter~0 100)} is VALID [2022-04-14 16:14:23,501 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1774#true} {1925#(< ~counter~0 100)} #96#return; {1925#(< ~counter~0 100)} is VALID [2022-04-14 16:14:23,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-14 16:14:23,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {1774#true} assume !(0 == ~cond); {1774#true} is VALID [2022-04-14 16:14:23,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {1774#true} ~cond := #in~cond; {1774#true} is VALID [2022-04-14 16:14:23,502 INFO L272 TraceCheckUtils]: 27: Hoare triple {1925#(< ~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)); {1774#true} is VALID [2022-04-14 16:14:23,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {1925#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {1925#(< ~counter~0 100)} is VALID [2022-04-14 16:14:23,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {1950#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1925#(< ~counter~0 100)} is VALID [2022-04-14 16:14:23,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {1950#(< ~counter~0 99)} assume !!(0 != ~r~0); {1950#(< ~counter~0 99)} is VALID [2022-04-14 16:14:23,503 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1774#true} {1950#(< ~counter~0 99)} #94#return; {1950#(< ~counter~0 99)} is VALID [2022-04-14 16:14:23,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-14 16:14:23,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {1774#true} assume !(0 == ~cond); {1774#true} is VALID [2022-04-14 16:14:23,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {1774#true} ~cond := #in~cond; {1774#true} is VALID [2022-04-14 16:14:23,504 INFO L272 TraceCheckUtils]: 19: Hoare triple {1950#(< ~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)); {1774#true} is VALID [2022-04-14 16:14:23,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {1950#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {1950#(< ~counter~0 99)} is VALID [2022-04-14 16:14:23,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {1975#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1950#(< ~counter~0 99)} is VALID [2022-04-14 16:14:23,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {1975#(< ~counter~0 98)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1975#(< ~counter~0 98)} is VALID [2022-04-14 16:14:23,505 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1774#true} {1975#(< ~counter~0 98)} #92#return; {1975#(< ~counter~0 98)} is VALID [2022-04-14 16:14:23,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-14 16:14:23,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {1774#true} assume !(0 == ~cond); {1774#true} is VALID [2022-04-14 16:14:23,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {1774#true} ~cond := #in~cond; {1774#true} is VALID [2022-04-14 16:14:23,505 INFO L272 TraceCheckUtils]: 11: Hoare triple {1975#(< ~counter~0 98)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1774#true} is VALID [2022-04-14 16:14:23,506 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1774#true} {1975#(< ~counter~0 98)} #90#return; {1975#(< ~counter~0 98)} is VALID [2022-04-14 16:14:23,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-14 16:14:23,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {1774#true} assume !(0 == ~cond); {1774#true} is VALID [2022-04-14 16:14:23,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {1774#true} ~cond := #in~cond; {1774#true} is VALID [2022-04-14 16:14:23,506 INFO L272 TraceCheckUtils]: 6: Hoare triple {1975#(< ~counter~0 98)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1774#true} is VALID [2022-04-14 16:14:23,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {1975#(< ~counter~0 98)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1975#(< ~counter~0 98)} is VALID [2022-04-14 16:14:23,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {1975#(< ~counter~0 98)} call #t~ret9 := main(); {1975#(< ~counter~0 98)} is VALID [2022-04-14 16:14:23,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1975#(< ~counter~0 98)} {1774#true} #102#return; {1975#(< ~counter~0 98)} is VALID [2022-04-14 16:14:23,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {1975#(< ~counter~0 98)} assume true; {1975#(< ~counter~0 98)} is VALID [2022-04-14 16:14:23,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1975#(< ~counter~0 98)} is VALID [2022-04-14 16:14:23,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {1774#true} call ULTIMATE.init(); {1774#true} is VALID [2022-04-14 16:14:23,508 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-14 16:14:23,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:14:23,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947469364] [2022-04-14 16:14:23,508 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:14:23,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117420744] [2022-04-14 16:14:23,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117420744] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 16:14:23,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 16:14:23,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-14 16:14:23,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388037940] [2022-04-14 16:14:23,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:14:23,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-14 16:14:23,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:14:23,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-14 16:14:23,536 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:14:23,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 16:14:23,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:14:23,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 16:14:23,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-14 16:14:23,537 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-14 16:14:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:23,679 INFO L93 Difference]: Finished difference Result 106 states and 135 transitions. [2022-04-14 16:14:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 16:14:23,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-14 16:14:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-14 16:14:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-14 16:14:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-14 16:14:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-14 16:14:23,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-14 16:14:23,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:23,739 INFO L225 Difference]: With dead ends: 106 [2022-04-14 16:14:23,739 INFO L226 Difference]: Without dead ends: 69 [2022-04-14 16:14:23,740 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-14 16:14:23,740 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:23,741 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:14:23,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-14 16:14:23,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-14 16:14:23,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:23,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 16:14:23,758 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 16:14:23,758 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 16:14:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:23,760 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-14 16:14:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-14 16:14:23,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:23,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:23,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-14 16:14:23,761 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-14 16:14:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:23,762 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-14 16:14:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-14 16:14:23,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:23,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:23,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:23,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 16:14:23,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-14 16:14:23,764 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 41 [2022-04-14 16:14:23,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:23,765 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-14 16:14:23,765 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-14 16:14:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-14 16:14:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 16:14:23,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:23,765 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:14:23,783 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:14:23,983 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:14:23,984 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:23,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:23,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-14 16:14:23,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:23,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801921001] [2022-04-14 16:14:23,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:23,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:23,994 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:23,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2146152705] [2022-04-14 16:14:23,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:23,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:23,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:23,995 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:14:23,996 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:14:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:24,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 16:14:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:24,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:14:24,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {2410#true} call ULTIMATE.init(); {2410#true} is VALID [2022-04-14 16:14:24,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {2410#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2418#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:24,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#(<= ~counter~0 0)} assume true; {2418#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:24,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#(<= ~counter~0 0)} {2410#true} #102#return; {2418#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:24,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#(<= ~counter~0 0)} call #t~ret9 := main(); {2418#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:24,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2418#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:24,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {2418#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2418#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:24,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {2418#(<= ~counter~0 0)} ~cond := #in~cond; {2418#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:24,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {2418#(<= ~counter~0 0)} assume !(0 == ~cond); {2418#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:24,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#(<= ~counter~0 0)} assume true; {2418#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:24,218 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2418#(<= ~counter~0 0)} {2418#(<= ~counter~0 0)} #90#return; {2418#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:24,219 INFO L272 TraceCheckUtils]: 11: Hoare triple {2418#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2418#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:24,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {2418#(<= ~counter~0 0)} ~cond := #in~cond; {2418#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:24,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {2418#(<= ~counter~0 0)} assume !(0 == ~cond); {2418#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:24,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#(<= ~counter~0 0)} assume true; {2418#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:24,220 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2418#(<= ~counter~0 0)} {2418#(<= ~counter~0 0)} #92#return; {2418#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:24,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2418#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:24,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {2418#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2467#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:24,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {2467#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {2467#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:24,222 INFO L272 TraceCheckUtils]: 19: Hoare triple {2467#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2467#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:24,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {2467#(<= ~counter~0 1)} ~cond := #in~cond; {2467#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:24,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {2467#(<= ~counter~0 1)} assume !(0 == ~cond); {2467#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:24,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {2467#(<= ~counter~0 1)} assume true; {2467#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:24,223 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2467#(<= ~counter~0 1)} {2467#(<= ~counter~0 1)} #94#return; {2467#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:24,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {2467#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2467#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:24,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {2467#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2492#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:24,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {2492#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {2492#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:24,225 INFO L272 TraceCheckUtils]: 27: Hoare triple {2492#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2492#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:24,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {2492#(<= ~counter~0 2)} ~cond := #in~cond; {2492#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:24,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {2492#(<= ~counter~0 2)} assume !(0 == ~cond); {2492#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:24,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {2492#(<= ~counter~0 2)} assume true; {2492#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:24,226 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2492#(<= ~counter~0 2)} {2492#(<= ~counter~0 2)} #96#return; {2492#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:24,227 INFO L290 TraceCheckUtils]: 32: Hoare triple {2492#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2492#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:24,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {2492#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2517#(<= |main_#t~post7| 2)} is VALID [2022-04-14 16:14:24,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {2517#(<= |main_#t~post7| 2)} assume !(#t~post7 < 100);havoc #t~post7; {2411#false} is VALID [2022-04-14 16:14:24,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {2411#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2411#false} is VALID [2022-04-14 16:14:24,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {2411#false} assume !(#t~post8 < 100);havoc #t~post8; {2411#false} is VALID [2022-04-14 16:14:24,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {2411#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2411#false} is VALID [2022-04-14 16:14:24,228 INFO L290 TraceCheckUtils]: 38: Hoare triple {2411#false} assume !(#t~post6 < 100);havoc #t~post6; {2411#false} is VALID [2022-04-14 16:14:24,228 INFO L272 TraceCheckUtils]: 39: Hoare triple {2411#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2411#false} is VALID [2022-04-14 16:14:24,228 INFO L290 TraceCheckUtils]: 40: Hoare triple {2411#false} ~cond := #in~cond; {2411#false} is VALID [2022-04-14 16:14:24,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {2411#false} assume 0 == ~cond; {2411#false} is VALID [2022-04-14 16:14:24,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {2411#false} assume !false; {2411#false} is VALID [2022-04-14 16:14:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:14:24,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:14:24,442 INFO L290 TraceCheckUtils]: 42: Hoare triple {2411#false} assume !false; {2411#false} is VALID [2022-04-14 16:14:24,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {2411#false} assume 0 == ~cond; {2411#false} is VALID [2022-04-14 16:14:24,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {2411#false} ~cond := #in~cond; {2411#false} is VALID [2022-04-14 16:14:24,443 INFO L272 TraceCheckUtils]: 39: Hoare triple {2411#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2411#false} is VALID [2022-04-14 16:14:24,443 INFO L290 TraceCheckUtils]: 38: Hoare triple {2411#false} assume !(#t~post6 < 100);havoc #t~post6; {2411#false} is VALID [2022-04-14 16:14:24,443 INFO L290 TraceCheckUtils]: 37: Hoare triple {2411#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2411#false} is VALID [2022-04-14 16:14:24,443 INFO L290 TraceCheckUtils]: 36: Hoare triple {2411#false} assume !(#t~post8 < 100);havoc #t~post8; {2411#false} is VALID [2022-04-14 16:14:24,443 INFO L290 TraceCheckUtils]: 35: Hoare triple {2411#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2411#false} is VALID [2022-04-14 16:14:24,443 INFO L290 TraceCheckUtils]: 34: Hoare triple {2569#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {2411#false} is VALID [2022-04-14 16:14:24,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {2573#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2569#(< |main_#t~post7| 100)} is VALID [2022-04-14 16:14:24,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {2573#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2573#(< ~counter~0 100)} is VALID [2022-04-14 16:14:24,445 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2410#true} {2573#(< ~counter~0 100)} #96#return; {2573#(< ~counter~0 100)} is VALID [2022-04-14 16:14:24,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {2410#true} assume true; {2410#true} is VALID [2022-04-14 16:14:24,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {2410#true} assume !(0 == ~cond); {2410#true} is VALID [2022-04-14 16:14:24,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {2410#true} ~cond := #in~cond; {2410#true} is VALID [2022-04-14 16:14:24,445 INFO L272 TraceCheckUtils]: 27: Hoare triple {2573#(< ~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)); {2410#true} is VALID [2022-04-14 16:14:24,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {2573#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {2573#(< ~counter~0 100)} is VALID [2022-04-14 16:14:24,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {2598#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2573#(< ~counter~0 100)} is VALID [2022-04-14 16:14:24,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {2598#(< ~counter~0 99)} assume !!(0 != ~r~0); {2598#(< ~counter~0 99)} is VALID [2022-04-14 16:14:24,447 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2410#true} {2598#(< ~counter~0 99)} #94#return; {2598#(< ~counter~0 99)} is VALID [2022-04-14 16:14:24,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {2410#true} assume true; {2410#true} is VALID [2022-04-14 16:14:24,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {2410#true} assume !(0 == ~cond); {2410#true} is VALID [2022-04-14 16:14:24,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {2410#true} ~cond := #in~cond; {2410#true} is VALID [2022-04-14 16:14:24,447 INFO L272 TraceCheckUtils]: 19: Hoare triple {2598#(< ~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)); {2410#true} is VALID [2022-04-14 16:14:24,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {2598#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {2598#(< ~counter~0 99)} is VALID [2022-04-14 16:14:24,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {2623#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2598#(< ~counter~0 99)} is VALID [2022-04-14 16:14:24,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {2623#(< ~counter~0 98)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2623#(< ~counter~0 98)} is VALID [2022-04-14 16:14:24,448 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2410#true} {2623#(< ~counter~0 98)} #92#return; {2623#(< ~counter~0 98)} is VALID [2022-04-14 16:14:24,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {2410#true} assume true; {2410#true} is VALID [2022-04-14 16:14:24,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {2410#true} assume !(0 == ~cond); {2410#true} is VALID [2022-04-14 16:14:24,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {2410#true} ~cond := #in~cond; {2410#true} is VALID [2022-04-14 16:14:24,449 INFO L272 TraceCheckUtils]: 11: Hoare triple {2623#(< ~counter~0 98)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2410#true} is VALID [2022-04-14 16:14:24,449 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2410#true} {2623#(< ~counter~0 98)} #90#return; {2623#(< ~counter~0 98)} is VALID [2022-04-14 16:14:24,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {2410#true} assume true; {2410#true} is VALID [2022-04-14 16:14:24,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {2410#true} assume !(0 == ~cond); {2410#true} is VALID [2022-04-14 16:14:24,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {2410#true} ~cond := #in~cond; {2410#true} is VALID [2022-04-14 16:14:24,450 INFO L272 TraceCheckUtils]: 6: Hoare triple {2623#(< ~counter~0 98)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2410#true} is VALID [2022-04-14 16:14:24,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {2623#(< ~counter~0 98)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2623#(< ~counter~0 98)} is VALID [2022-04-14 16:14:24,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {2623#(< ~counter~0 98)} call #t~ret9 := main(); {2623#(< ~counter~0 98)} is VALID [2022-04-14 16:14:24,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2623#(< ~counter~0 98)} {2410#true} #102#return; {2623#(< ~counter~0 98)} is VALID [2022-04-14 16:14:24,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {2623#(< ~counter~0 98)} assume true; {2623#(< ~counter~0 98)} is VALID [2022-04-14 16:14:24,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {2410#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2623#(< ~counter~0 98)} is VALID [2022-04-14 16:14:24,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {2410#true} call ULTIMATE.init(); {2410#true} is VALID [2022-04-14 16:14:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-14 16:14:24,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:14:24,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801921001] [2022-04-14 16:14:24,452 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:14:24,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146152705] [2022-04-14 16:14:24,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146152705] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:14:24,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:14:24,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-14 16:14:24,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172017636] [2022-04-14 16:14:24,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:14:24,453 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 43 [2022-04-14 16:14:24,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:14:24,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-14 16:14:24,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:24,503 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 16:14:24,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:14:24,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 16:14:24,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-14 16:14:24,503 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-14 16:14:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:24,858 INFO L93 Difference]: Finished difference Result 189 states and 244 transitions. [2022-04-14 16:14:24,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 16:14:24,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 43 [2022-04-14 16:14:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-14 16:14:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2022-04-14 16:14:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-14 16:14:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2022-04-14 16:14:24,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 156 transitions. [2022-04-14 16:14:24,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:24,964 INFO L225 Difference]: With dead ends: 189 [2022-04-14 16:14:24,964 INFO L226 Difference]: Without dead ends: 152 [2022-04-14 16:14:24,965 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-14 16:14:24,965 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 81 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:24,965 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 179 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 16:14:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-14 16:14:25,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 136. [2022-04-14 16:14:25,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:25,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 16:14:25,006 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 16:14:25,006 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 16:14:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:25,009 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2022-04-14 16:14:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2022-04-14 16:14:25,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:25,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:25,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 152 states. [2022-04-14 16:14:25,011 INFO L87 Difference]: Start difference. First operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 152 states. [2022-04-14 16:14:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:25,014 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2022-04-14 16:14:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2022-04-14 16:14:25,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:25,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:25,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:25,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 16:14:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 172 transitions. [2022-04-14 16:14:25,018 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 172 transitions. Word has length 43 [2022-04-14 16:14:25,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:25,018 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 172 transitions. [2022-04-14 16:14:25,018 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-14 16:14:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 172 transitions. [2022-04-14 16:14:25,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-14 16:14:25,019 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:25,019 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:14:25,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-14 16:14:25,231 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:14:25,231 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:25,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:25,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-14 16:14:25,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:25,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960398621] [2022-04-14 16:14:25,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:25,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:25,244 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:25,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [319374059] [2022-04-14 16:14:25,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:25,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:25,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:25,245 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:14:25,246 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:14:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:25,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-14 16:14:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:25,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:14:25,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {3440#true} call ULTIMATE.init(); {3440#true} is VALID [2022-04-14 16:14:25,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {3440#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3440#true} is VALID [2022-04-14 16:14:25,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-14 16:14:25,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3440#true} {3440#true} #102#return; {3440#true} is VALID [2022-04-14 16:14:25,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {3440#true} call #t~ret9 := main(); {3440#true} is VALID [2022-04-14 16:14:25,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {3440#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {3440#true} is VALID [2022-04-14 16:14:25,419 INFO L272 TraceCheckUtils]: 6: Hoare triple {3440#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3440#true} is VALID [2022-04-14 16:14:25,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {3440#true} ~cond := #in~cond; {3440#true} is VALID [2022-04-14 16:14:25,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {3440#true} assume !(0 == ~cond); {3440#true} is VALID [2022-04-14 16:14:25,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-14 16:14:25,419 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3440#true} {3440#true} #90#return; {3440#true} is VALID [2022-04-14 16:14:25,419 INFO L272 TraceCheckUtils]: 11: Hoare triple {3440#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3440#true} is VALID [2022-04-14 16:14:25,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {3440#true} ~cond := #in~cond; {3440#true} is VALID [2022-04-14 16:14:25,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {3440#true} assume !(0 == ~cond); {3440#true} is VALID [2022-04-14 16:14:25,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-14 16:14:25,420 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3440#true} {3440#true} #92#return; {3440#true} is VALID [2022-04-14 16:14:25,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {3440#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3440#true} is VALID [2022-04-14 16:14:25,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {3440#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3440#true} is VALID [2022-04-14 16:14:25,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {3440#true} assume !!(#t~post6 < 100);havoc #t~post6; {3440#true} is VALID [2022-04-14 16:14:25,420 INFO L272 TraceCheckUtils]: 19: Hoare triple {3440#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3440#true} is VALID [2022-04-14 16:14:25,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {3440#true} ~cond := #in~cond; {3440#true} is VALID [2022-04-14 16:14:25,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {3440#true} assume !(0 == ~cond); {3440#true} is VALID [2022-04-14 16:14:25,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-14 16:14:25,420 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3440#true} {3440#true} #94#return; {3440#true} is VALID [2022-04-14 16:14:25,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {3440#true} assume !!(0 != ~r~0); {3517#(not (= main_~r~0 0))} is VALID [2022-04-14 16:14:25,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {3517#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3517#(not (= main_~r~0 0))} is VALID [2022-04-14 16:14:25,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {3517#(not (= main_~r~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {3517#(not (= main_~r~0 0))} is VALID [2022-04-14 16:14:25,421 INFO L272 TraceCheckUtils]: 27: Hoare triple {3517#(not (= main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3440#true} is VALID [2022-04-14 16:14:25,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {3440#true} ~cond := #in~cond; {3440#true} is VALID [2022-04-14 16:14:25,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {3440#true} assume !(0 == ~cond); {3440#true} is VALID [2022-04-14 16:14:25,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-14 16:14:25,422 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3440#true} {3517#(not (= main_~r~0 0))} #96#return; {3517#(not (= main_~r~0 0))} is VALID [2022-04-14 16:14:25,422 INFO L290 TraceCheckUtils]: 32: Hoare triple {3517#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-14 16:14:25,422 INFO L290 TraceCheckUtils]: 33: Hoare triple {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-14 16:14:25,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-14 16:14:25,423 INFO L272 TraceCheckUtils]: 35: Hoare triple {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3440#true} is VALID [2022-04-14 16:14:25,423 INFO L290 TraceCheckUtils]: 36: Hoare triple {3440#true} ~cond := #in~cond; {3440#true} is VALID [2022-04-14 16:14:25,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {3440#true} assume !(0 == ~cond); {3440#true} is VALID [2022-04-14 16:14:25,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-14 16:14:25,427 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3440#true} {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-14 16:14:25,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {3441#false} is VALID [2022-04-14 16:14:25,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {3441#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3441#false} is VALID [2022-04-14 16:14:25,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {3441#false} assume !(#t~post6 < 100);havoc #t~post6; {3441#false} is VALID [2022-04-14 16:14:25,428 INFO L272 TraceCheckUtils]: 43: Hoare triple {3441#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3441#false} is VALID [2022-04-14 16:14:25,428 INFO L290 TraceCheckUtils]: 44: Hoare triple {3441#false} ~cond := #in~cond; {3441#false} is VALID [2022-04-14 16:14:25,428 INFO L290 TraceCheckUtils]: 45: Hoare triple {3441#false} assume 0 == ~cond; {3441#false} is VALID [2022-04-14 16:14:25,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {3441#false} assume !false; {3441#false} is VALID [2022-04-14 16:14:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-14 16:14:25,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:14:25,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:14:25,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960398621] [2022-04-14 16:14:25,429 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:14:25,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319374059] [2022-04-14 16:14:25,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319374059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:14:25,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:14:25,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 16:14:25,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527877776] [2022-04-14 16:14:25,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:14:25,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-14 16:14:25,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:14:25,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:14:25,459 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:14:25,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 16:14:25,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:14:25,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 16:14:25,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-14 16:14:25,460 INFO L87 Difference]: Start difference. First operand 136 states and 172 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:14:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:25,599 INFO L93 Difference]: Finished difference Result 227 states and 304 transitions. [2022-04-14 16:14:25,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 16:14:25,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-14 16:14:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:14:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-14 16:14:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:14:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-14 16:14:25,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-14 16:14:25,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:25,674 INFO L225 Difference]: With dead ends: 227 [2022-04-14 16:14:25,674 INFO L226 Difference]: Without dead ends: 172 [2022-04-14 16:14:25,674 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-14 16:14:25,675 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 23 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:25,675 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 94 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:14:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-14 16:14:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 154. [2022-04-14 16:14:25,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:25,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-14 16:14:25,715 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-14 16:14:25,715 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-14 16:14:25,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:25,719 INFO L93 Difference]: Finished difference Result 172 states and 229 transitions. [2022-04-14 16:14:25,719 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2022-04-14 16:14:25,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:25,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:25,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 172 states. [2022-04-14 16:14:25,721 INFO L87 Difference]: Start difference. First operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 172 states. [2022-04-14 16:14:25,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:25,725 INFO L93 Difference]: Finished difference Result 172 states and 229 transitions. [2022-04-14 16:14:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2022-04-14 16:14:25,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:25,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:25,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:25,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-14 16:14:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 201 transitions. [2022-04-14 16:14:25,729 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 201 transitions. Word has length 47 [2022-04-14 16:14:25,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:25,730 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 201 transitions. [2022-04-14 16:14:25,730 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:14:25,730 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 201 transitions. [2022-04-14 16:14:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-14 16:14:25,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:25,730 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:14:25,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-14 16:14:25,946 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:14:25,946 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:25,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:25,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-14 16:14:25,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:25,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052375733] [2022-04-14 16:14:25,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:25,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:25,965 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:25,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [925204299] [2022-04-14 16:14:25,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:25,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:25,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:25,976 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:14:25,977 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:14:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:26,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 16:14:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:26,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:14:26,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {4460#true} call ULTIMATE.init(); {4460#true} is VALID [2022-04-14 16:14:26,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {4460#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4468#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:26,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {4468#(<= ~counter~0 0)} assume true; {4468#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:26,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4468#(<= ~counter~0 0)} {4460#true} #102#return; {4468#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:26,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {4468#(<= ~counter~0 0)} call #t~ret9 := main(); {4468#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:26,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {4468#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4468#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:26,216 INFO L272 TraceCheckUtils]: 6: Hoare triple {4468#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4468#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:26,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {4468#(<= ~counter~0 0)} ~cond := #in~cond; {4468#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:26,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {4468#(<= ~counter~0 0)} assume !(0 == ~cond); {4468#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:26,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {4468#(<= ~counter~0 0)} assume true; {4468#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:26,218 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4468#(<= ~counter~0 0)} {4468#(<= ~counter~0 0)} #90#return; {4468#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:26,218 INFO L272 TraceCheckUtils]: 11: Hoare triple {4468#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4468#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:26,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {4468#(<= ~counter~0 0)} ~cond := #in~cond; {4468#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:26,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {4468#(<= ~counter~0 0)} assume !(0 == ~cond); {4468#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:26,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {4468#(<= ~counter~0 0)} assume true; {4468#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:26,219 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4468#(<= ~counter~0 0)} {4468#(<= ~counter~0 0)} #92#return; {4468#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:26,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {4468#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4468#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:26,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {4468#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4517#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:26,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {4517#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {4517#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:26,229 INFO L272 TraceCheckUtils]: 19: Hoare triple {4517#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4517#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:26,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {4517#(<= ~counter~0 1)} ~cond := #in~cond; {4517#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:26,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {4517#(<= ~counter~0 1)} assume !(0 == ~cond); {4517#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:26,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {4517#(<= ~counter~0 1)} assume true; {4517#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:26,231 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4517#(<= ~counter~0 1)} {4517#(<= ~counter~0 1)} #94#return; {4517#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:26,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {4517#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4517#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:26,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {4517#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4542#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:26,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {4542#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {4542#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:26,232 INFO L272 TraceCheckUtils]: 27: Hoare triple {4542#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4542#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:26,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {4542#(<= ~counter~0 2)} ~cond := #in~cond; {4542#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:26,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {4542#(<= ~counter~0 2)} assume !(0 == ~cond); {4542#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:26,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {4542#(<= ~counter~0 2)} assume true; {4542#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:26,233 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4542#(<= ~counter~0 2)} {4542#(<= ~counter~0 2)} #96#return; {4542#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:26,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {4542#(<= ~counter~0 2)} assume !(~r~0 > 0); {4542#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:26,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {4542#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4567#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:26,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {4567#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {4567#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:26,234 INFO L272 TraceCheckUtils]: 35: Hoare triple {4567#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4567#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:26,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {4567#(<= ~counter~0 3)} ~cond := #in~cond; {4567#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:26,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {4567#(<= ~counter~0 3)} assume !(0 == ~cond); {4567#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:26,235 INFO L290 TraceCheckUtils]: 38: Hoare triple {4567#(<= ~counter~0 3)} assume true; {4567#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:26,236 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4567#(<= ~counter~0 3)} {4567#(<= ~counter~0 3)} #98#return; {4567#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:26,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {4567#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4567#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:26,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {4567#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4592#(<= |main_#t~post8| 3)} is VALID [2022-04-14 16:14:26,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {4592#(<= |main_#t~post8| 3)} assume !(#t~post8 < 100);havoc #t~post8; {4461#false} is VALID [2022-04-14 16:14:26,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {4461#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4461#false} is VALID [2022-04-14 16:14:26,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {4461#false} assume !(#t~post6 < 100);havoc #t~post6; {4461#false} is VALID [2022-04-14 16:14:26,237 INFO L272 TraceCheckUtils]: 45: Hoare triple {4461#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4461#false} is VALID [2022-04-14 16:14:26,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {4461#false} ~cond := #in~cond; {4461#false} is VALID [2022-04-14 16:14:26,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {4461#false} assume 0 == ~cond; {4461#false} is VALID [2022-04-14 16:14:26,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {4461#false} assume !false; {4461#false} is VALID [2022-04-14 16:14:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:14:26,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:14:26,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {4461#false} assume !false; {4461#false} is VALID [2022-04-14 16:14:26,466 INFO L290 TraceCheckUtils]: 47: Hoare triple {4461#false} assume 0 == ~cond; {4461#false} is VALID [2022-04-14 16:14:26,466 INFO L290 TraceCheckUtils]: 46: Hoare triple {4461#false} ~cond := #in~cond; {4461#false} is VALID [2022-04-14 16:14:26,466 INFO L272 TraceCheckUtils]: 45: Hoare triple {4461#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4461#false} is VALID [2022-04-14 16:14:26,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {4461#false} assume !(#t~post6 < 100);havoc #t~post6; {4461#false} is VALID [2022-04-14 16:14:26,466 INFO L290 TraceCheckUtils]: 43: Hoare triple {4461#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4461#false} is VALID [2022-04-14 16:14:26,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {4632#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {4461#false} is VALID [2022-04-14 16:14:26,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {4636#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4632#(< |main_#t~post8| 100)} is VALID [2022-04-14 16:14:26,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {4636#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4636#(< ~counter~0 100)} is VALID [2022-04-14 16:14:26,468 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4460#true} {4636#(< ~counter~0 100)} #98#return; {4636#(< ~counter~0 100)} is VALID [2022-04-14 16:14:26,468 INFO L290 TraceCheckUtils]: 38: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-14 16:14:26,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {4460#true} assume !(0 == ~cond); {4460#true} is VALID [2022-04-14 16:14:26,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {4460#true} ~cond := #in~cond; {4460#true} is VALID [2022-04-14 16:14:26,468 INFO L272 TraceCheckUtils]: 35: Hoare triple {4636#(< ~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)); {4460#true} is VALID [2022-04-14 16:14:26,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {4636#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {4636#(< ~counter~0 100)} is VALID [2022-04-14 16:14:26,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {4661#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4636#(< ~counter~0 100)} is VALID [2022-04-14 16:14:26,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {4661#(< ~counter~0 99)} assume !(~r~0 > 0); {4661#(< ~counter~0 99)} is VALID [2022-04-14 16:14:26,469 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4460#true} {4661#(< ~counter~0 99)} #96#return; {4661#(< ~counter~0 99)} is VALID [2022-04-14 16:14:26,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-14 16:14:26,469 INFO L290 TraceCheckUtils]: 29: Hoare triple {4460#true} assume !(0 == ~cond); {4460#true} is VALID [2022-04-14 16:14:26,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {4460#true} ~cond := #in~cond; {4460#true} is VALID [2022-04-14 16:14:26,470 INFO L272 TraceCheckUtils]: 27: Hoare triple {4661#(< ~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)); {4460#true} is VALID [2022-04-14 16:14:26,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {4661#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {4661#(< ~counter~0 99)} is VALID [2022-04-14 16:14:26,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {4686#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4661#(< ~counter~0 99)} is VALID [2022-04-14 16:14:26,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {4686#(< ~counter~0 98)} assume !!(0 != ~r~0); {4686#(< ~counter~0 98)} is VALID [2022-04-14 16:14:26,471 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4460#true} {4686#(< ~counter~0 98)} #94#return; {4686#(< ~counter~0 98)} is VALID [2022-04-14 16:14:26,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-14 16:14:26,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {4460#true} assume !(0 == ~cond); {4460#true} is VALID [2022-04-14 16:14:26,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {4460#true} ~cond := #in~cond; {4460#true} is VALID [2022-04-14 16:14:26,471 INFO L272 TraceCheckUtils]: 19: Hoare triple {4686#(< ~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)); {4460#true} is VALID [2022-04-14 16:14:26,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {4686#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {4686#(< ~counter~0 98)} is VALID [2022-04-14 16:14:26,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {4711#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4686#(< ~counter~0 98)} is VALID [2022-04-14 16:14:26,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {4711#(< ~counter~0 97)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4711#(< ~counter~0 97)} is VALID [2022-04-14 16:14:26,473 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4460#true} {4711#(< ~counter~0 97)} #92#return; {4711#(< ~counter~0 97)} is VALID [2022-04-14 16:14:26,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-14 16:14:26,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {4460#true} assume !(0 == ~cond); {4460#true} is VALID [2022-04-14 16:14:26,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {4460#true} ~cond := #in~cond; {4460#true} is VALID [2022-04-14 16:14:26,473 INFO L272 TraceCheckUtils]: 11: Hoare triple {4711#(< ~counter~0 97)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4460#true} is VALID [2022-04-14 16:14:26,473 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4460#true} {4711#(< ~counter~0 97)} #90#return; {4711#(< ~counter~0 97)} is VALID [2022-04-14 16:14:26,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-14 16:14:26,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {4460#true} assume !(0 == ~cond); {4460#true} is VALID [2022-04-14 16:14:26,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {4460#true} ~cond := #in~cond; {4460#true} is VALID [2022-04-14 16:14:26,474 INFO L272 TraceCheckUtils]: 6: Hoare triple {4711#(< ~counter~0 97)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4460#true} is VALID [2022-04-14 16:14:26,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {4711#(< ~counter~0 97)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4711#(< ~counter~0 97)} is VALID [2022-04-14 16:14:26,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {4711#(< ~counter~0 97)} call #t~ret9 := main(); {4711#(< ~counter~0 97)} is VALID [2022-04-14 16:14:26,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4711#(< ~counter~0 97)} {4460#true} #102#return; {4711#(< ~counter~0 97)} is VALID [2022-04-14 16:14:26,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {4711#(< ~counter~0 97)} assume true; {4711#(< ~counter~0 97)} is VALID [2022-04-14 16:14:26,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {4460#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4711#(< ~counter~0 97)} is VALID [2022-04-14 16:14:26,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {4460#true} call ULTIMATE.init(); {4460#true} is VALID [2022-04-14 16:14:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-14 16:14:26,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:14:26,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052375733] [2022-04-14 16:14:26,476 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:14:26,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925204299] [2022-04-14 16:14:26,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925204299] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:14:26,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:14:26,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-14 16:14:26,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602429686] [2022-04-14 16:14:26,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:14:26,481 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 49 [2022-04-14 16:14:26,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:14:26,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-14 16:14:26,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:26,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-14 16:14:26,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:14:26,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-14 16:14:26,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-14 16:14:26,531 INFO L87 Difference]: Start difference. First operand 154 states and 201 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-14 16:14:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:27,051 INFO L93 Difference]: Finished difference Result 343 states and 458 transitions. [2022-04-14 16:14:27,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-14 16:14:27,051 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 49 [2022-04-14 16:14:27,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-14 16:14:27,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-04-14 16:14:27,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-14 16:14:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-04-14 16:14:27,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 194 transitions. [2022-04-14 16:14:27,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:27,184 INFO L225 Difference]: With dead ends: 343 [2022-04-14 16:14:27,184 INFO L226 Difference]: Without dead ends: 258 [2022-04-14 16:14:27,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-04-14 16:14:27,185 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 133 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:27,185 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 262 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 16:14:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-04-14 16:14:27,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 236. [2022-04-14 16:14:27,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:27,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-14 16:14:27,253 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-14 16:14:27,253 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-14 16:14:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:27,258 INFO L93 Difference]: Finished difference Result 258 states and 329 transitions. [2022-04-14 16:14:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 329 transitions. [2022-04-14 16:14:27,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:27,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:27,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand 258 states. [2022-04-14 16:14:27,259 INFO L87 Difference]: Start difference. First operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand 258 states. [2022-04-14 16:14:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:27,264 INFO L93 Difference]: Finished difference Result 258 states and 329 transitions. [2022-04-14 16:14:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 329 transitions. [2022-04-14 16:14:27,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:27,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:27,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:27,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-14 16:14:27,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 310 transitions. [2022-04-14 16:14:27,270 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 310 transitions. Word has length 49 [2022-04-14 16:14:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:27,270 INFO L478 AbstractCegarLoop]: Abstraction has 236 states and 310 transitions. [2022-04-14 16:14:27,270 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-14 16:14:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 310 transitions. [2022-04-14 16:14:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-14 16:14:27,270 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:27,271 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:14:27,286 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:14:27,486 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:14:27,487 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:27,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-14 16:14:27,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:27,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524470677] [2022-04-14 16:14:27,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:27,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:27,496 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:27,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2004142791] [2022-04-14 16:14:27,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:27,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:27,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:27,497 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:14:27,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-14 16:14:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:27,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 16:14:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:27,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:14:27,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {6091#true} call ULTIMATE.init(); {6091#true} is VALID [2022-04-14 16:14:27,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {6091#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6099#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:27,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {6099#(<= ~counter~0 0)} assume true; {6099#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:27,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6099#(<= ~counter~0 0)} {6091#true} #102#return; {6099#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:27,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {6099#(<= ~counter~0 0)} call #t~ret9 := main(); {6099#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:27,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {6099#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {6099#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:27,836 INFO L272 TraceCheckUtils]: 6: Hoare triple {6099#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6099#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:27,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {6099#(<= ~counter~0 0)} ~cond := #in~cond; {6099#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:27,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {6099#(<= ~counter~0 0)} assume !(0 == ~cond); {6099#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:27,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {6099#(<= ~counter~0 0)} assume true; {6099#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:27,838 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6099#(<= ~counter~0 0)} {6099#(<= ~counter~0 0)} #90#return; {6099#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:27,838 INFO L272 TraceCheckUtils]: 11: Hoare triple {6099#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {6099#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:27,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {6099#(<= ~counter~0 0)} ~cond := #in~cond; {6099#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:27,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {6099#(<= ~counter~0 0)} assume !(0 == ~cond); {6099#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:27,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {6099#(<= ~counter~0 0)} assume true; {6099#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:27,839 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6099#(<= ~counter~0 0)} {6099#(<= ~counter~0 0)} #92#return; {6099#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:27,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {6099#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6099#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:27,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {6099#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6148#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:27,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {6148#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {6148#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:27,841 INFO L272 TraceCheckUtils]: 19: Hoare triple {6148#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6148#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:27,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {6148#(<= ~counter~0 1)} ~cond := #in~cond; {6148#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:27,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {6148#(<= ~counter~0 1)} assume !(0 == ~cond); {6148#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:27,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {6148#(<= ~counter~0 1)} assume true; {6148#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:27,842 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6148#(<= ~counter~0 1)} {6148#(<= ~counter~0 1)} #94#return; {6148#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:27,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {6148#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6148#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:27,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {6148#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6173#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:27,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {6173#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {6173#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:27,844 INFO L272 TraceCheckUtils]: 27: Hoare triple {6173#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6173#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:27,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {6173#(<= ~counter~0 2)} ~cond := #in~cond; {6173#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:27,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {6173#(<= ~counter~0 2)} assume !(0 == ~cond); {6173#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:27,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {6173#(<= ~counter~0 2)} assume true; {6173#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:27,849 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6173#(<= ~counter~0 2)} {6173#(<= ~counter~0 2)} #96#return; {6173#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:27,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {6173#(<= ~counter~0 2)} assume !(~r~0 > 0); {6173#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:27,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {6173#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6198#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:27,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {6198#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {6198#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:27,851 INFO L272 TraceCheckUtils]: 35: Hoare triple {6198#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6198#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:27,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {6198#(<= ~counter~0 3)} ~cond := #in~cond; {6198#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:27,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {6198#(<= ~counter~0 3)} assume !(0 == ~cond); {6198#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:27,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {6198#(<= ~counter~0 3)} assume true; {6198#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:27,852 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6198#(<= ~counter~0 3)} {6198#(<= ~counter~0 3)} #98#return; {6198#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:27,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {6198#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6198#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:27,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {6198#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6223#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:27,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {6223#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {6223#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:27,854 INFO L272 TraceCheckUtils]: 43: Hoare triple {6223#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6223#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:27,854 INFO L290 TraceCheckUtils]: 44: Hoare triple {6223#(<= ~counter~0 4)} ~cond := #in~cond; {6223#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:27,854 INFO L290 TraceCheckUtils]: 45: Hoare triple {6223#(<= ~counter~0 4)} assume !(0 == ~cond); {6223#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:27,855 INFO L290 TraceCheckUtils]: 46: Hoare triple {6223#(<= ~counter~0 4)} assume true; {6223#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:27,855 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6223#(<= ~counter~0 4)} {6223#(<= ~counter~0 4)} #98#return; {6223#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:27,855 INFO L290 TraceCheckUtils]: 48: Hoare triple {6223#(<= ~counter~0 4)} assume !(~r~0 < 0); {6223#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:27,856 INFO L290 TraceCheckUtils]: 49: Hoare triple {6223#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6248#(<= |main_#t~post6| 4)} is VALID [2022-04-14 16:14:27,856 INFO L290 TraceCheckUtils]: 50: Hoare triple {6248#(<= |main_#t~post6| 4)} assume !(#t~post6 < 100);havoc #t~post6; {6092#false} is VALID [2022-04-14 16:14:27,856 INFO L272 TraceCheckUtils]: 51: Hoare triple {6092#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6092#false} is VALID [2022-04-14 16:14:27,856 INFO L290 TraceCheckUtils]: 52: Hoare triple {6092#false} ~cond := #in~cond; {6092#false} is VALID [2022-04-14 16:14:27,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {6092#false} assume 0 == ~cond; {6092#false} is VALID [2022-04-14 16:14:27,856 INFO L290 TraceCheckUtils]: 54: Hoare triple {6092#false} assume !false; {6092#false} is VALID [2022-04-14 16:14:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:14:27,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:14:28,133 INFO L290 TraceCheckUtils]: 54: Hoare triple {6092#false} assume !false; {6092#false} is VALID [2022-04-14 16:14:28,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {6092#false} assume 0 == ~cond; {6092#false} is VALID [2022-04-14 16:14:28,134 INFO L290 TraceCheckUtils]: 52: Hoare triple {6092#false} ~cond := #in~cond; {6092#false} is VALID [2022-04-14 16:14:28,134 INFO L272 TraceCheckUtils]: 51: Hoare triple {6092#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6092#false} is VALID [2022-04-14 16:14:28,134 INFO L290 TraceCheckUtils]: 50: Hoare triple {6276#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {6092#false} is VALID [2022-04-14 16:14:28,134 INFO L290 TraceCheckUtils]: 49: Hoare triple {6280#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6276#(< |main_#t~post6| 100)} is VALID [2022-04-14 16:14:28,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {6280#(< ~counter~0 100)} assume !(~r~0 < 0); {6280#(< ~counter~0 100)} is VALID [2022-04-14 16:14:28,135 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6091#true} {6280#(< ~counter~0 100)} #98#return; {6280#(< ~counter~0 100)} is VALID [2022-04-14 16:14:28,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 16:14:28,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-14 16:14:28,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-14 16:14:28,135 INFO L272 TraceCheckUtils]: 43: Hoare triple {6280#(< ~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)); {6091#true} is VALID [2022-04-14 16:14:28,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {6280#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {6280#(< ~counter~0 100)} is VALID [2022-04-14 16:14:28,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {6305#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6280#(< ~counter~0 100)} is VALID [2022-04-14 16:14:28,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {6305#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6305#(< ~counter~0 99)} is VALID [2022-04-14 16:14:28,137 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6091#true} {6305#(< ~counter~0 99)} #98#return; {6305#(< ~counter~0 99)} is VALID [2022-04-14 16:14:28,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 16:14:28,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-14 16:14:28,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-14 16:14:28,137 INFO L272 TraceCheckUtils]: 35: Hoare triple {6305#(< ~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)); {6091#true} is VALID [2022-04-14 16:14:28,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {6305#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {6305#(< ~counter~0 99)} is VALID [2022-04-14 16:14:28,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {6330#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6305#(< ~counter~0 99)} is VALID [2022-04-14 16:14:28,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {6330#(< ~counter~0 98)} assume !(~r~0 > 0); {6330#(< ~counter~0 98)} is VALID [2022-04-14 16:14:28,139 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6091#true} {6330#(< ~counter~0 98)} #96#return; {6330#(< ~counter~0 98)} is VALID [2022-04-14 16:14:28,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 16:14:28,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-14 16:14:28,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-14 16:14:28,139 INFO L272 TraceCheckUtils]: 27: Hoare triple {6330#(< ~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)); {6091#true} is VALID [2022-04-14 16:14:28,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {6330#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {6330#(< ~counter~0 98)} is VALID [2022-04-14 16:14:28,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {6355#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6330#(< ~counter~0 98)} is VALID [2022-04-14 16:14:28,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {6355#(< ~counter~0 97)} assume !!(0 != ~r~0); {6355#(< ~counter~0 97)} is VALID [2022-04-14 16:14:28,141 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6091#true} {6355#(< ~counter~0 97)} #94#return; {6355#(< ~counter~0 97)} is VALID [2022-04-14 16:14:28,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 16:14:28,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-14 16:14:28,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-14 16:14:28,141 INFO L272 TraceCheckUtils]: 19: Hoare triple {6355#(< ~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)); {6091#true} is VALID [2022-04-14 16:14:28,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {6355#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {6355#(< ~counter~0 97)} is VALID [2022-04-14 16:14:28,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {6380#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6355#(< ~counter~0 97)} is VALID [2022-04-14 16:14:28,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {6380#(< ~counter~0 96)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6380#(< ~counter~0 96)} is VALID [2022-04-14 16:14:28,143 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6091#true} {6380#(< ~counter~0 96)} #92#return; {6380#(< ~counter~0 96)} is VALID [2022-04-14 16:14:28,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 16:14:28,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-14 16:14:28,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-14 16:14:28,143 INFO L272 TraceCheckUtils]: 11: Hoare triple {6380#(< ~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)); {6091#true} is VALID [2022-04-14 16:14:28,143 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6091#true} {6380#(< ~counter~0 96)} #90#return; {6380#(< ~counter~0 96)} is VALID [2022-04-14 16:14:28,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 16:14:28,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-14 16:14:28,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-14 16:14:28,144 INFO L272 TraceCheckUtils]: 6: Hoare triple {6380#(< ~counter~0 96)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6091#true} is VALID [2022-04-14 16:14:28,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {6380#(< ~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; {6380#(< ~counter~0 96)} is VALID [2022-04-14 16:14:28,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {6380#(< ~counter~0 96)} call #t~ret9 := main(); {6380#(< ~counter~0 96)} is VALID [2022-04-14 16:14:28,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6380#(< ~counter~0 96)} {6091#true} #102#return; {6380#(< ~counter~0 96)} is VALID [2022-04-14 16:14:28,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {6380#(< ~counter~0 96)} assume true; {6380#(< ~counter~0 96)} is VALID [2022-04-14 16:14:28,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {6091#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6380#(< ~counter~0 96)} is VALID [2022-04-14 16:14:28,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {6091#true} call ULTIMATE.init(); {6091#true} is VALID [2022-04-14 16:14:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-14 16:14:28,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:14:28,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524470677] [2022-04-14 16:14:28,146 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:14:28,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004142791] [2022-04-14 16:14:28,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004142791] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:14:28,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:14:28,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-14 16:14:28,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873072770] [2022-04-14 16:14:28,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:14:28,147 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 55 [2022-04-14 16:14:28,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:14:28,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-14 16:14:28,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:28,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-14 16:14:28,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:14:28,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-14 16:14:28,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-14 16:14:28,215 INFO L87 Difference]: Start difference. First operand 236 states and 310 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-14 16:14:29,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:29,059 INFO L93 Difference]: Finished difference Result 338 states and 453 transitions. [2022-04-14 16:14:29,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-14 16:14:29,059 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 55 [2022-04-14 16:14:29,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:29,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-14 16:14:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-04-14 16:14:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-14 16:14:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-04-14 16:14:29,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 204 transitions. [2022-04-14 16:14:29,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:29,205 INFO L225 Difference]: With dead ends: 338 [2022-04-14 16:14:29,205 INFO L226 Difference]: Without dead ends: 333 [2022-04-14 16:14:29,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2022-04-14 16:14:29,206 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 296 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:29,206 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 226 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 16:14:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-04-14 16:14:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 319. [2022-04-14 16:14:29,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:29,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2022-04-14 16:14:29,310 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2022-04-14 16:14:29,310 INFO L87 Difference]: Start difference. First operand 333 states. Second operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2022-04-14 16:14:29,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:29,316 INFO L93 Difference]: Finished difference Result 333 states and 435 transitions. [2022-04-14 16:14:29,316 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 435 transitions. [2022-04-14 16:14:29,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:29,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:29,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) Second operand 333 states. [2022-04-14 16:14:29,318 INFO L87 Difference]: Start difference. First operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) Second operand 333 states. [2022-04-14 16:14:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:29,325 INFO L93 Difference]: Finished difference Result 333 states and 435 transitions. [2022-04-14 16:14:29,325 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 435 transitions. [2022-04-14 16:14:29,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:29,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:29,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:29,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2022-04-14 16:14:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 418 transitions. [2022-04-14 16:14:29,332 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 418 transitions. Word has length 55 [2022-04-14 16:14:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:29,333 INFO L478 AbstractCegarLoop]: Abstraction has 319 states and 418 transitions. [2022-04-14 16:14:29,333 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-14 16:14:29,333 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 418 transitions. [2022-04-14 16:14:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-14 16:14:29,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:29,334 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:14:29,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-14 16:14:29,550 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-14 16:14:29,550 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:29,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:29,551 INFO L85 PathProgramCache]: Analyzing trace with hash -304792209, now seen corresponding path program 1 times [2022-04-14 16:14:29,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:29,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501017095] [2022-04-14 16:14:29,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:29,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:29,562 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:29,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1370245859] [2022-04-14 16:14:29,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:29,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:29,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:29,564 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:14:29,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-14 16:14:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:29,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-14 16:14:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:29,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:14:29,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {8022#true} call ULTIMATE.init(); {8022#true} is VALID [2022-04-14 16:14:29,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {8022#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8022#true} is VALID [2022-04-14 16:14:29,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:29,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8022#true} {8022#true} #102#return; {8022#true} is VALID [2022-04-14 16:14:29,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {8022#true} call #t~ret9 := main(); {8022#true} is VALID [2022-04-14 16:14:29,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {8022#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {8022#true} is VALID [2022-04-14 16:14:29,850 INFO L272 TraceCheckUtils]: 6: Hoare triple {8022#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:29,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:29,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:29,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:29,850 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8022#true} {8022#true} #90#return; {8022#true} is VALID [2022-04-14 16:14:29,851 INFO L272 TraceCheckUtils]: 11: Hoare triple {8022#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:29,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:29,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:29,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:29,851 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8022#true} {8022#true} #92#return; {8022#true} is VALID [2022-04-14 16:14:29,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {8022#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {8075#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,852 INFO L272 TraceCheckUtils]: 19: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:29,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:29,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:29,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:29,852 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #94#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {8075#(<= main_~v~0 1)} assume !!(0 != ~r~0); {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {8075#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,853 INFO L272 TraceCheckUtils]: 27: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:29,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:29,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:29,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:29,855 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #96#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {8075#(<= main_~v~0 1)} assume !(~r~0 > 0); {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {8075#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,856 INFO L272 TraceCheckUtils]: 35: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:29,856 INFO L290 TraceCheckUtils]: 36: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:29,856 INFO L290 TraceCheckUtils]: 37: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:29,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:29,860 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #98#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {8075#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {8075#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,861 INFO L272 TraceCheckUtils]: 43: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:29,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:29,861 INFO L290 TraceCheckUtils]: 45: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:29,861 INFO L290 TraceCheckUtils]: 46: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:29,861 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #98#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,862 INFO L290 TraceCheckUtils]: 48: Hoare triple {8075#(<= main_~v~0 1)} assume !(~r~0 < 0); {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,862 INFO L290 TraceCheckUtils]: 49: Hoare triple {8075#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,862 INFO L290 TraceCheckUtils]: 50: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,862 INFO L272 TraceCheckUtils]: 51: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:29,862 INFO L290 TraceCheckUtils]: 52: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:29,862 INFO L290 TraceCheckUtils]: 53: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:29,862 INFO L290 TraceCheckUtils]: 54: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:29,863 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #94#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,863 INFO L290 TraceCheckUtils]: 56: Hoare triple {8075#(<= main_~v~0 1)} assume !!(0 != ~r~0); {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,863 INFO L290 TraceCheckUtils]: 57: Hoare triple {8075#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,864 INFO L272 TraceCheckUtils]: 59: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:29,864 INFO L290 TraceCheckUtils]: 60: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:29,864 INFO L290 TraceCheckUtils]: 61: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:29,864 INFO L290 TraceCheckUtils]: 62: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:29,864 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #96#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:29,865 INFO L290 TraceCheckUtils]: 64: Hoare triple {8075#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-14 16:14:29,865 INFO L290 TraceCheckUtils]: 65: Hoare triple {8220#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-14 16:14:29,865 INFO L290 TraceCheckUtils]: 66: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !(#t~post7 < 100);havoc #t~post7; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-14 16:14:29,865 INFO L290 TraceCheckUtils]: 67: Hoare triple {8220#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-14 16:14:29,872 INFO L290 TraceCheckUtils]: 68: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-14 16:14:29,872 INFO L272 TraceCheckUtils]: 69: Hoare triple {8220#(< 0 (+ main_~r~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:29,873 INFO L290 TraceCheckUtils]: 70: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:29,873 INFO L290 TraceCheckUtils]: 71: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:29,873 INFO L290 TraceCheckUtils]: 72: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:29,873 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8022#true} {8220#(< 0 (+ main_~r~0 1))} #98#return; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-14 16:14:29,874 INFO L290 TraceCheckUtils]: 74: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8023#false} is VALID [2022-04-14 16:14:29,874 INFO L290 TraceCheckUtils]: 75: Hoare triple {8023#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8023#false} is VALID [2022-04-14 16:14:29,874 INFO L290 TraceCheckUtils]: 76: Hoare triple {8023#false} assume !!(#t~post8 < 100);havoc #t~post8; {8023#false} is VALID [2022-04-14 16:14:29,874 INFO L272 TraceCheckUtils]: 77: Hoare triple {8023#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8023#false} is VALID [2022-04-14 16:14:29,874 INFO L290 TraceCheckUtils]: 78: Hoare triple {8023#false} ~cond := #in~cond; {8023#false} is VALID [2022-04-14 16:14:29,874 INFO L290 TraceCheckUtils]: 79: Hoare triple {8023#false} assume !(0 == ~cond); {8023#false} is VALID [2022-04-14 16:14:29,874 INFO L290 TraceCheckUtils]: 80: Hoare triple {8023#false} assume true; {8023#false} is VALID [2022-04-14 16:14:29,874 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8023#false} {8023#false} #98#return; {8023#false} is VALID [2022-04-14 16:14:29,874 INFO L290 TraceCheckUtils]: 82: Hoare triple {8023#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8023#false} is VALID [2022-04-14 16:14:29,874 INFO L290 TraceCheckUtils]: 83: Hoare triple {8023#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8023#false} is VALID [2022-04-14 16:14:29,874 INFO L290 TraceCheckUtils]: 84: Hoare triple {8023#false} assume !(#t~post8 < 100);havoc #t~post8; {8023#false} is VALID [2022-04-14 16:14:29,874 INFO L290 TraceCheckUtils]: 85: Hoare triple {8023#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8023#false} is VALID [2022-04-14 16:14:29,874 INFO L290 TraceCheckUtils]: 86: Hoare triple {8023#false} assume !(#t~post6 < 100);havoc #t~post6; {8023#false} is VALID [2022-04-14 16:14:29,875 INFO L272 TraceCheckUtils]: 87: Hoare triple {8023#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8023#false} is VALID [2022-04-14 16:14:29,875 INFO L290 TraceCheckUtils]: 88: Hoare triple {8023#false} ~cond := #in~cond; {8023#false} is VALID [2022-04-14 16:14:29,875 INFO L290 TraceCheckUtils]: 89: Hoare triple {8023#false} assume 0 == ~cond; {8023#false} is VALID [2022-04-14 16:14:29,875 INFO L290 TraceCheckUtils]: 90: Hoare triple {8023#false} assume !false; {8023#false} is VALID [2022-04-14 16:14:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 64 proven. 12 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-04-14 16:14:29,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:14:30,142 INFO L290 TraceCheckUtils]: 90: Hoare triple {8023#false} assume !false; {8023#false} is VALID [2022-04-14 16:14:30,143 INFO L290 TraceCheckUtils]: 89: Hoare triple {8023#false} assume 0 == ~cond; {8023#false} is VALID [2022-04-14 16:14:30,143 INFO L290 TraceCheckUtils]: 88: Hoare triple {8023#false} ~cond := #in~cond; {8023#false} is VALID [2022-04-14 16:14:30,143 INFO L272 TraceCheckUtils]: 87: Hoare triple {8023#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8023#false} is VALID [2022-04-14 16:14:30,143 INFO L290 TraceCheckUtils]: 86: Hoare triple {8023#false} assume !(#t~post6 < 100);havoc #t~post6; {8023#false} is VALID [2022-04-14 16:14:30,143 INFO L290 TraceCheckUtils]: 85: Hoare triple {8023#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8023#false} is VALID [2022-04-14 16:14:30,143 INFO L290 TraceCheckUtils]: 84: Hoare triple {8023#false} assume !(#t~post8 < 100);havoc #t~post8; {8023#false} is VALID [2022-04-14 16:14:30,143 INFO L290 TraceCheckUtils]: 83: Hoare triple {8023#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8023#false} is VALID [2022-04-14 16:14:30,143 INFO L290 TraceCheckUtils]: 82: Hoare triple {8023#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8023#false} is VALID [2022-04-14 16:14:30,143 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8022#true} {8023#false} #98#return; {8023#false} is VALID [2022-04-14 16:14:30,143 INFO L290 TraceCheckUtils]: 80: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:30,143 INFO L290 TraceCheckUtils]: 79: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:30,143 INFO L290 TraceCheckUtils]: 78: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:30,143 INFO L272 TraceCheckUtils]: 77: Hoare triple {8023#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:30,143 INFO L290 TraceCheckUtils]: 76: Hoare triple {8023#false} assume !!(#t~post8 < 100);havoc #t~post8; {8023#false} is VALID [2022-04-14 16:14:30,143 INFO L290 TraceCheckUtils]: 75: Hoare triple {8023#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8023#false} is VALID [2022-04-14 16:14:30,144 INFO L290 TraceCheckUtils]: 74: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8023#false} is VALID [2022-04-14 16:14:30,145 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8022#true} {8220#(< 0 (+ main_~r~0 1))} #98#return; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-14 16:14:30,145 INFO L290 TraceCheckUtils]: 72: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:30,145 INFO L290 TraceCheckUtils]: 71: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:30,145 INFO L290 TraceCheckUtils]: 70: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:30,145 INFO L272 TraceCheckUtils]: 69: Hoare triple {8220#(< 0 (+ main_~r~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:30,145 INFO L290 TraceCheckUtils]: 68: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-14 16:14:30,145 INFO L290 TraceCheckUtils]: 67: Hoare triple {8220#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-14 16:14:30,146 INFO L290 TraceCheckUtils]: 66: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !(#t~post7 < 100);havoc #t~post7; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-14 16:14:30,146 INFO L290 TraceCheckUtils]: 65: Hoare triple {8220#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-14 16:14:30,146 INFO L290 TraceCheckUtils]: 64: Hoare triple {8075#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-14 16:14:30,147 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #96#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,147 INFO L290 TraceCheckUtils]: 62: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:30,147 INFO L290 TraceCheckUtils]: 61: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:30,147 INFO L290 TraceCheckUtils]: 60: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:30,147 INFO L272 TraceCheckUtils]: 59: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:30,147 INFO L290 TraceCheckUtils]: 58: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,148 INFO L290 TraceCheckUtils]: 57: Hoare triple {8075#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,148 INFO L290 TraceCheckUtils]: 56: Hoare triple {8075#(<= main_~v~0 1)} assume !!(0 != ~r~0); {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,148 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #94#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,148 INFO L290 TraceCheckUtils]: 54: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:30,148 INFO L290 TraceCheckUtils]: 53: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:30,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:30,149 INFO L272 TraceCheckUtils]: 51: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:30,149 INFO L290 TraceCheckUtils]: 50: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,149 INFO L290 TraceCheckUtils]: 49: Hoare triple {8075#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,149 INFO L290 TraceCheckUtils]: 48: Hoare triple {8075#(<= main_~v~0 1)} assume !(~r~0 < 0); {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,150 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #98#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:30,150 INFO L290 TraceCheckUtils]: 45: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:30,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:30,150 INFO L272 TraceCheckUtils]: 43: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:30,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {8075#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {8075#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,151 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #98#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:30,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:30,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:30,152 INFO L272 TraceCheckUtils]: 35: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:30,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {8075#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {8075#(<= main_~v~0 1)} assume !(~r~0 > 0); {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,153 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #96#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:30,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:30,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:30,153 INFO L272 TraceCheckUtils]: 27: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:30,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {8075#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {8075#(<= main_~v~0 1)} assume !!(0 != ~r~0); {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,154 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #94#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:30,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:30,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:30,155 INFO L272 TraceCheckUtils]: 19: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:30,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {8075#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {8022#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8075#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:30,156 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8022#true} {8022#true} #92#return; {8022#true} is VALID [2022-04-14 16:14:30,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:30,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:30,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:30,156 INFO L272 TraceCheckUtils]: 11: Hoare triple {8022#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:30,156 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8022#true} {8022#true} #90#return; {8022#true} is VALID [2022-04-14 16:14:30,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:30,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-14 16:14:30,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-14 16:14:30,156 INFO L272 TraceCheckUtils]: 6: Hoare triple {8022#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8022#true} is VALID [2022-04-14 16:14:30,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {8022#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {8022#true} is VALID [2022-04-14 16:14:30,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {8022#true} call #t~ret9 := main(); {8022#true} is VALID [2022-04-14 16:14:30,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8022#true} {8022#true} #102#return; {8022#true} is VALID [2022-04-14 16:14:30,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-14 16:14:30,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {8022#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8022#true} is VALID [2022-04-14 16:14:30,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {8022#true} call ULTIMATE.init(); {8022#true} is VALID [2022-04-14 16:14:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-04-14 16:14:30,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:14:30,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501017095] [2022-04-14 16:14:30,157 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:14:30,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370245859] [2022-04-14 16:14:30,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370245859] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:14:30,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:14:30,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-14 16:14:30,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13801999] [2022-04-14 16:14:30,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:14:30,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 91 [2022-04-14 16:14:30,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:14:30,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 16:14:30,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:30,193 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 16:14:30,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:14:30,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 16:14:30,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 16:14:30,194 INFO L87 Difference]: Start difference. First operand 319 states and 418 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 16:14:30,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:30,599 INFO L93 Difference]: Finished difference Result 571 states and 778 transitions. [2022-04-14 16:14:30,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 16:14:30,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 91 [2022-04-14 16:14:30,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 16:14:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-14 16:14:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 16:14:30,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-14 16:14:30,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 129 transitions. [2022-04-14 16:14:30,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:30,687 INFO L225 Difference]: With dead ends: 571 [2022-04-14 16:14:30,687 INFO L226 Difference]: Without dead ends: 383 [2022-04-14 16:14:30,689 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-14 16:14:30,689 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 18 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:30,689 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 139 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:14:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-14 16:14:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2022-04-14 16:14:30,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:30,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-14 16:14:30,848 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-14 16:14:30,849 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-14 16:14:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:30,857 INFO L93 Difference]: Finished difference Result 383 states and 508 transitions. [2022-04-14 16:14:30,857 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 508 transitions. [2022-04-14 16:14:30,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:30,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:30,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) Second operand 383 states. [2022-04-14 16:14:30,859 INFO L87 Difference]: Start difference. First operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) Second operand 383 states. [2022-04-14 16:14:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:30,867 INFO L93 Difference]: Finished difference Result 383 states and 508 transitions. [2022-04-14 16:14:30,867 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 508 transitions. [2022-04-14 16:14:30,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:30,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:30,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:30,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-14 16:14:30,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 505 transitions. [2022-04-14 16:14:30,877 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 505 transitions. Word has length 91 [2022-04-14 16:14:30,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:30,877 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 505 transitions. [2022-04-14 16:14:30,877 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 16:14:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 505 transitions. [2022-04-14 16:14:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-14 16:14:30,878 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:30,878 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:14:30,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-14 16:14:31,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-14 16:14:31,091 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:31,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:31,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1103092705, now seen corresponding path program 2 times [2022-04-14 16:14:31,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:31,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773993557] [2022-04-14 16:14:31,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:31,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:31,105 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:31,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1941745727] [2022-04-14 16:14:31,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 16:14:31,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:31,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:31,106 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:14:31,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-14 16:14:31,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 16:14:31,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:14:31,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-14 16:14:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:31,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:14:31,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {10665#true} call ULTIMATE.init(); {10665#true} is VALID [2022-04-14 16:14:31,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {10665#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10673#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:31,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {10673#(<= ~counter~0 0)} assume true; {10673#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:31,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10673#(<= ~counter~0 0)} {10665#true} #102#return; {10673#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:31,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {10673#(<= ~counter~0 0)} call #t~ret9 := main(); {10673#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:31,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {10673#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {10673#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:31,576 INFO L272 TraceCheckUtils]: 6: Hoare triple {10673#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10673#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:31,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {10673#(<= ~counter~0 0)} ~cond := #in~cond; {10673#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:31,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {10673#(<= ~counter~0 0)} assume !(0 == ~cond); {10673#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:31,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {10673#(<= ~counter~0 0)} assume true; {10673#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:31,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10673#(<= ~counter~0 0)} {10673#(<= ~counter~0 0)} #90#return; {10673#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:31,578 INFO L272 TraceCheckUtils]: 11: Hoare triple {10673#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {10673#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:31,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {10673#(<= ~counter~0 0)} ~cond := #in~cond; {10673#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:31,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {10673#(<= ~counter~0 0)} assume !(0 == ~cond); {10673#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:31,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {10673#(<= ~counter~0 0)} assume true; {10673#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:31,579 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10673#(<= ~counter~0 0)} {10673#(<= ~counter~0 0)} #92#return; {10673#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:31,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {10673#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10673#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:31,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {10673#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10722#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:31,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {10722#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {10722#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:31,581 INFO L272 TraceCheckUtils]: 19: Hoare triple {10722#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10722#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:31,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {10722#(<= ~counter~0 1)} ~cond := #in~cond; {10722#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:31,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {10722#(<= ~counter~0 1)} assume !(0 == ~cond); {10722#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:31,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {10722#(<= ~counter~0 1)} assume true; {10722#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:31,582 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10722#(<= ~counter~0 1)} {10722#(<= ~counter~0 1)} #94#return; {10722#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:31,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {10722#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10722#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:31,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {10722#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10747#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:31,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {10747#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {10747#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:31,584 INFO L272 TraceCheckUtils]: 27: Hoare triple {10747#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10747#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:31,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {10747#(<= ~counter~0 2)} ~cond := #in~cond; {10747#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:31,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {10747#(<= ~counter~0 2)} assume !(0 == ~cond); {10747#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:31,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {10747#(<= ~counter~0 2)} assume true; {10747#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:31,585 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10747#(<= ~counter~0 2)} {10747#(<= ~counter~0 2)} #96#return; {10747#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:31,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {10747#(<= ~counter~0 2)} assume !(~r~0 > 0); {10747#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:31,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {10747#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10772#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:31,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {10772#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {10772#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:31,586 INFO L272 TraceCheckUtils]: 35: Hoare triple {10772#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10772#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:31,587 INFO L290 TraceCheckUtils]: 36: Hoare triple {10772#(<= ~counter~0 3)} ~cond := #in~cond; {10772#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:31,587 INFO L290 TraceCheckUtils]: 37: Hoare triple {10772#(<= ~counter~0 3)} assume !(0 == ~cond); {10772#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:31,587 INFO L290 TraceCheckUtils]: 38: Hoare triple {10772#(<= ~counter~0 3)} assume true; {10772#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:31,588 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10772#(<= ~counter~0 3)} {10772#(<= ~counter~0 3)} #98#return; {10772#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:31,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {10772#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10772#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:31,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {10772#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10797#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:31,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {10797#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {10797#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:31,589 INFO L272 TraceCheckUtils]: 43: Hoare triple {10797#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10797#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:31,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {10797#(<= ~counter~0 4)} ~cond := #in~cond; {10797#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:31,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {10797#(<= ~counter~0 4)} assume !(0 == ~cond); {10797#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:31,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {10797#(<= ~counter~0 4)} assume true; {10797#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:31,591 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10797#(<= ~counter~0 4)} {10797#(<= ~counter~0 4)} #98#return; {10797#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:31,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {10797#(<= ~counter~0 4)} assume !(~r~0 < 0); {10797#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:31,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {10797#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10822#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:31,592 INFO L290 TraceCheckUtils]: 50: Hoare triple {10822#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {10822#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:31,592 INFO L272 TraceCheckUtils]: 51: Hoare triple {10822#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10822#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:31,592 INFO L290 TraceCheckUtils]: 52: Hoare triple {10822#(<= ~counter~0 5)} ~cond := #in~cond; {10822#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:31,593 INFO L290 TraceCheckUtils]: 53: Hoare triple {10822#(<= ~counter~0 5)} assume !(0 == ~cond); {10822#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:31,593 INFO L290 TraceCheckUtils]: 54: Hoare triple {10822#(<= ~counter~0 5)} assume true; {10822#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:31,593 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10822#(<= ~counter~0 5)} {10822#(<= ~counter~0 5)} #94#return; {10822#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:31,593 INFO L290 TraceCheckUtils]: 56: Hoare triple {10822#(<= ~counter~0 5)} assume !!(0 != ~r~0); {10822#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:31,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {10822#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10847#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:31,594 INFO L290 TraceCheckUtils]: 58: Hoare triple {10847#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {10847#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:31,595 INFO L272 TraceCheckUtils]: 59: Hoare triple {10847#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10847#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:31,595 INFO L290 TraceCheckUtils]: 60: Hoare triple {10847#(<= ~counter~0 6)} ~cond := #in~cond; {10847#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:31,595 INFO L290 TraceCheckUtils]: 61: Hoare triple {10847#(<= ~counter~0 6)} assume !(0 == ~cond); {10847#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:31,595 INFO L290 TraceCheckUtils]: 62: Hoare triple {10847#(<= ~counter~0 6)} assume true; {10847#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:31,596 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10847#(<= ~counter~0 6)} {10847#(<= ~counter~0 6)} #96#return; {10847#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:31,596 INFO L290 TraceCheckUtils]: 64: Hoare triple {10847#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10847#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:31,596 INFO L290 TraceCheckUtils]: 65: Hoare triple {10847#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10872#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:31,597 INFO L290 TraceCheckUtils]: 66: Hoare triple {10872#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {10872#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:31,597 INFO L272 TraceCheckUtils]: 67: Hoare triple {10872#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10872#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:31,597 INFO L290 TraceCheckUtils]: 68: Hoare triple {10872#(<= ~counter~0 7)} ~cond := #in~cond; {10872#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:31,598 INFO L290 TraceCheckUtils]: 69: Hoare triple {10872#(<= ~counter~0 7)} assume !(0 == ~cond); {10872#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:31,598 INFO L290 TraceCheckUtils]: 70: Hoare triple {10872#(<= ~counter~0 7)} assume true; {10872#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:31,598 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10872#(<= ~counter~0 7)} {10872#(<= ~counter~0 7)} #96#return; {10872#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:31,599 INFO L290 TraceCheckUtils]: 72: Hoare triple {10872#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10872#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:31,607 INFO L290 TraceCheckUtils]: 73: Hoare triple {10872#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10897#(<= |main_#t~post7| 7)} is VALID [2022-04-14 16:14:31,608 INFO L290 TraceCheckUtils]: 74: Hoare triple {10897#(<= |main_#t~post7| 7)} assume !(#t~post7 < 100);havoc #t~post7; {10666#false} is VALID [2022-04-14 16:14:31,608 INFO L290 TraceCheckUtils]: 75: Hoare triple {10666#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10666#false} is VALID [2022-04-14 16:14:31,608 INFO L290 TraceCheckUtils]: 76: Hoare triple {10666#false} assume !!(#t~post8 < 100);havoc #t~post8; {10666#false} is VALID [2022-04-14 16:14:31,608 INFO L272 TraceCheckUtils]: 77: Hoare triple {10666#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10666#false} is VALID [2022-04-14 16:14:31,608 INFO L290 TraceCheckUtils]: 78: Hoare triple {10666#false} ~cond := #in~cond; {10666#false} is VALID [2022-04-14 16:14:31,608 INFO L290 TraceCheckUtils]: 79: Hoare triple {10666#false} assume !(0 == ~cond); {10666#false} is VALID [2022-04-14 16:14:31,608 INFO L290 TraceCheckUtils]: 80: Hoare triple {10666#false} assume true; {10666#false} is VALID [2022-04-14 16:14:31,608 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10666#false} {10666#false} #98#return; {10666#false} is VALID [2022-04-14 16:14:31,608 INFO L290 TraceCheckUtils]: 82: Hoare triple {10666#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10666#false} is VALID [2022-04-14 16:14:31,608 INFO L290 TraceCheckUtils]: 83: Hoare triple {10666#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10666#false} is VALID [2022-04-14 16:14:31,608 INFO L290 TraceCheckUtils]: 84: Hoare triple {10666#false} assume !(#t~post8 < 100);havoc #t~post8; {10666#false} is VALID [2022-04-14 16:14:31,608 INFO L290 TraceCheckUtils]: 85: Hoare triple {10666#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10666#false} is VALID [2022-04-14 16:14:31,609 INFO L290 TraceCheckUtils]: 86: Hoare triple {10666#false} assume !(#t~post6 < 100);havoc #t~post6; {10666#false} is VALID [2022-04-14 16:14:31,609 INFO L272 TraceCheckUtils]: 87: Hoare triple {10666#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10666#false} is VALID [2022-04-14 16:14:31,609 INFO L290 TraceCheckUtils]: 88: Hoare triple {10666#false} ~cond := #in~cond; {10666#false} is VALID [2022-04-14 16:14:31,609 INFO L290 TraceCheckUtils]: 89: Hoare triple {10666#false} assume 0 == ~cond; {10666#false} is VALID [2022-04-14 16:14:31,609 INFO L290 TraceCheckUtils]: 90: Hoare triple {10666#false} assume !false; {10666#false} is VALID [2022-04-14 16:14:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 58 proven. 110 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-14 16:14:31,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:14:32,006 INFO L290 TraceCheckUtils]: 90: Hoare triple {10666#false} assume !false; {10666#false} is VALID [2022-04-14 16:14:32,006 INFO L290 TraceCheckUtils]: 89: Hoare triple {10666#false} assume 0 == ~cond; {10666#false} is VALID [2022-04-14 16:14:32,006 INFO L290 TraceCheckUtils]: 88: Hoare triple {10666#false} ~cond := #in~cond; {10666#false} is VALID [2022-04-14 16:14:32,006 INFO L272 TraceCheckUtils]: 87: Hoare triple {10666#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10666#false} is VALID [2022-04-14 16:14:32,006 INFO L290 TraceCheckUtils]: 86: Hoare triple {10666#false} assume !(#t~post6 < 100);havoc #t~post6; {10666#false} is VALID [2022-04-14 16:14:32,006 INFO L290 TraceCheckUtils]: 85: Hoare triple {10666#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10666#false} is VALID [2022-04-14 16:14:32,007 INFO L290 TraceCheckUtils]: 84: Hoare triple {10666#false} assume !(#t~post8 < 100);havoc #t~post8; {10666#false} is VALID [2022-04-14 16:14:32,007 INFO L290 TraceCheckUtils]: 83: Hoare triple {10666#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10666#false} is VALID [2022-04-14 16:14:32,007 INFO L290 TraceCheckUtils]: 82: Hoare triple {10666#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10666#false} is VALID [2022-04-14 16:14:32,007 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10665#true} {10666#false} #98#return; {10666#false} is VALID [2022-04-14 16:14:32,007 INFO L290 TraceCheckUtils]: 80: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-14 16:14:32,007 INFO L290 TraceCheckUtils]: 79: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-14 16:14:32,007 INFO L290 TraceCheckUtils]: 78: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-14 16:14:32,007 INFO L272 TraceCheckUtils]: 77: Hoare triple {10666#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10665#true} is VALID [2022-04-14 16:14:32,007 INFO L290 TraceCheckUtils]: 76: Hoare triple {10666#false} assume !!(#t~post8 < 100);havoc #t~post8; {10666#false} is VALID [2022-04-14 16:14:32,007 INFO L290 TraceCheckUtils]: 75: Hoare triple {10666#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10666#false} is VALID [2022-04-14 16:14:32,007 INFO L290 TraceCheckUtils]: 74: Hoare triple {10997#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {10666#false} is VALID [2022-04-14 16:14:32,008 INFO L290 TraceCheckUtils]: 73: Hoare triple {11001#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10997#(< |main_#t~post7| 100)} is VALID [2022-04-14 16:14:32,008 INFO L290 TraceCheckUtils]: 72: Hoare triple {11001#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {11001#(< ~counter~0 100)} is VALID [2022-04-14 16:14:32,008 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10665#true} {11001#(< ~counter~0 100)} #96#return; {11001#(< ~counter~0 100)} is VALID [2022-04-14 16:14:32,008 INFO L290 TraceCheckUtils]: 70: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-14 16:14:32,009 INFO L290 TraceCheckUtils]: 69: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-14 16:14:32,009 INFO L290 TraceCheckUtils]: 68: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-14 16:14:32,009 INFO L272 TraceCheckUtils]: 67: Hoare triple {11001#(< ~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)); {10665#true} is VALID [2022-04-14 16:14:32,009 INFO L290 TraceCheckUtils]: 66: Hoare triple {11001#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {11001#(< ~counter~0 100)} is VALID [2022-04-14 16:14:32,009 INFO L290 TraceCheckUtils]: 65: Hoare triple {11026#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11001#(< ~counter~0 100)} is VALID [2022-04-14 16:14:32,010 INFO L290 TraceCheckUtils]: 64: Hoare triple {11026#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {11026#(< ~counter~0 99)} is VALID [2022-04-14 16:14:32,010 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10665#true} {11026#(< ~counter~0 99)} #96#return; {11026#(< ~counter~0 99)} is VALID [2022-04-14 16:14:32,010 INFO L290 TraceCheckUtils]: 62: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-14 16:14:32,010 INFO L290 TraceCheckUtils]: 61: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-14 16:14:32,010 INFO L290 TraceCheckUtils]: 60: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-14 16:14:32,010 INFO L272 TraceCheckUtils]: 59: Hoare triple {11026#(< ~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)); {10665#true} is VALID [2022-04-14 16:14:32,011 INFO L290 TraceCheckUtils]: 58: Hoare triple {11026#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {11026#(< ~counter~0 99)} is VALID [2022-04-14 16:14:32,011 INFO L290 TraceCheckUtils]: 57: Hoare triple {11051#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11026#(< ~counter~0 99)} is VALID [2022-04-14 16:14:32,011 INFO L290 TraceCheckUtils]: 56: Hoare triple {11051#(< ~counter~0 98)} assume !!(0 != ~r~0); {11051#(< ~counter~0 98)} is VALID [2022-04-14 16:14:32,012 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10665#true} {11051#(< ~counter~0 98)} #94#return; {11051#(< ~counter~0 98)} is VALID [2022-04-14 16:14:32,012 INFO L290 TraceCheckUtils]: 54: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-14 16:14:32,012 INFO L290 TraceCheckUtils]: 53: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-14 16:14:32,012 INFO L290 TraceCheckUtils]: 52: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-14 16:14:32,012 INFO L272 TraceCheckUtils]: 51: Hoare triple {11051#(< ~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)); {10665#true} is VALID [2022-04-14 16:14:32,012 INFO L290 TraceCheckUtils]: 50: Hoare triple {11051#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {11051#(< ~counter~0 98)} is VALID [2022-04-14 16:14:32,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {11076#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11051#(< ~counter~0 98)} is VALID [2022-04-14 16:14:32,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {11076#(< ~counter~0 97)} assume !(~r~0 < 0); {11076#(< ~counter~0 97)} is VALID [2022-04-14 16:14:32,013 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10665#true} {11076#(< ~counter~0 97)} #98#return; {11076#(< ~counter~0 97)} is VALID [2022-04-14 16:14:32,013 INFO L290 TraceCheckUtils]: 46: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-14 16:14:32,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-14 16:14:32,013 INFO L290 TraceCheckUtils]: 44: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-14 16:14:32,014 INFO L272 TraceCheckUtils]: 43: Hoare triple {11076#(< ~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)); {10665#true} is VALID [2022-04-14 16:14:32,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {11076#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {11076#(< ~counter~0 97)} is VALID [2022-04-14 16:14:32,014 INFO L290 TraceCheckUtils]: 41: Hoare triple {11101#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11076#(< ~counter~0 97)} is VALID [2022-04-14 16:14:32,015 INFO L290 TraceCheckUtils]: 40: Hoare triple {11101#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11101#(< ~counter~0 96)} is VALID [2022-04-14 16:14:32,015 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10665#true} {11101#(< ~counter~0 96)} #98#return; {11101#(< ~counter~0 96)} is VALID [2022-04-14 16:14:32,015 INFO L290 TraceCheckUtils]: 38: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-14 16:14:32,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-14 16:14:32,015 INFO L290 TraceCheckUtils]: 36: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-14 16:14:32,015 INFO L272 TraceCheckUtils]: 35: Hoare triple {11101#(< ~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)); {10665#true} is VALID [2022-04-14 16:14:32,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {11101#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {11101#(< ~counter~0 96)} is VALID [2022-04-14 16:14:32,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {11126#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11101#(< ~counter~0 96)} is VALID [2022-04-14 16:14:32,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {11126#(< ~counter~0 95)} assume !(~r~0 > 0); {11126#(< ~counter~0 95)} is VALID [2022-04-14 16:14:32,027 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10665#true} {11126#(< ~counter~0 95)} #96#return; {11126#(< ~counter~0 95)} is VALID [2022-04-14 16:14:32,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-14 16:14:32,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-14 16:14:32,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-14 16:14:32,027 INFO L272 TraceCheckUtils]: 27: Hoare triple {11126#(< ~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)); {10665#true} is VALID [2022-04-14 16:14:32,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {11126#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {11126#(< ~counter~0 95)} is VALID [2022-04-14 16:14:32,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {11151#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11126#(< ~counter~0 95)} is VALID [2022-04-14 16:14:32,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {11151#(< ~counter~0 94)} assume !!(0 != ~r~0); {11151#(< ~counter~0 94)} is VALID [2022-04-14 16:14:32,029 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10665#true} {11151#(< ~counter~0 94)} #94#return; {11151#(< ~counter~0 94)} is VALID [2022-04-14 16:14:32,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-14 16:14:32,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-14 16:14:32,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-14 16:14:32,029 INFO L272 TraceCheckUtils]: 19: Hoare triple {11151#(< ~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)); {10665#true} is VALID [2022-04-14 16:14:32,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {11151#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {11151#(< ~counter~0 94)} is VALID [2022-04-14 16:14:32,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {11176#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11151#(< ~counter~0 94)} is VALID [2022-04-14 16:14:32,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {11176#(< ~counter~0 93)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11176#(< ~counter~0 93)} is VALID [2022-04-14 16:14:32,030 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10665#true} {11176#(< ~counter~0 93)} #92#return; {11176#(< ~counter~0 93)} is VALID [2022-04-14 16:14:32,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-14 16:14:32,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-14 16:14:32,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-14 16:14:32,031 INFO L272 TraceCheckUtils]: 11: Hoare triple {11176#(< ~counter~0 93)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {10665#true} is VALID [2022-04-14 16:14:32,031 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10665#true} {11176#(< ~counter~0 93)} #90#return; {11176#(< ~counter~0 93)} is VALID [2022-04-14 16:14:32,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-14 16:14:32,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-14 16:14:32,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-14 16:14:32,031 INFO L272 TraceCheckUtils]: 6: Hoare triple {11176#(< ~counter~0 93)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10665#true} is VALID [2022-04-14 16:14:32,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {11176#(< ~counter~0 93)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {11176#(< ~counter~0 93)} is VALID [2022-04-14 16:14:32,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {11176#(< ~counter~0 93)} call #t~ret9 := main(); {11176#(< ~counter~0 93)} is VALID [2022-04-14 16:14:32,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11176#(< ~counter~0 93)} {10665#true} #102#return; {11176#(< ~counter~0 93)} is VALID [2022-04-14 16:14:32,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {11176#(< ~counter~0 93)} assume true; {11176#(< ~counter~0 93)} is VALID [2022-04-14 16:14:32,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {10665#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11176#(< ~counter~0 93)} is VALID [2022-04-14 16:14:32,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {10665#true} call ULTIMATE.init(); {10665#true} is VALID [2022-04-14 16:14:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-04-14 16:14:32,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:14:32,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773993557] [2022-04-14 16:14:32,033 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:14:32,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941745727] [2022-04-14 16:14:32,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941745727] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:14:32,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:14:32,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-14 16:14:32,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627764484] [2022-04-14 16:14:32,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:14:32,034 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) Word has length 91 [2022-04-14 16:14:32,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:14:32,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) [2022-04-14 16:14:32,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:32,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-14 16:14:32,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:14:32,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-14 16:14:32,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-14 16:14:32,122 INFO L87 Difference]: Start difference. First operand 380 states and 505 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) [2022-04-14 16:14:33,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:33,915 INFO L93 Difference]: Finished difference Result 1123 states and 1577 transitions. [2022-04-14 16:14:33,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-14 16:14:33,916 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) Word has length 91 [2022-04-14 16:14:33,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) [2022-04-14 16:14:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 373 transitions. [2022-04-14 16:14:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) [2022-04-14 16:14:33,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 373 transitions. [2022-04-14 16:14:33,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 373 transitions. [2022-04-14 16:14:34,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 373 edges. 373 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:34,199 INFO L225 Difference]: With dead ends: 1123 [2022-04-14 16:14:34,199 INFO L226 Difference]: Without dead ends: 962 [2022-04-14 16:14:34,200 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=403, Invalid=719, Unknown=0, NotChecked=0, Total=1122 [2022-04-14 16:14:34,200 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 378 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:34,200 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 451 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 16:14:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-04-14 16:14:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 907. [2022-04-14 16:14:34,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:34,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 962 states. Second operand has 907 states, 686 states have (on average 1.2434402332361516) internal successors, (853), 697 states have internal predecessors, (853), 190 states have call successors, (190), 32 states have call predecessors, (190), 30 states have return successors, (188), 177 states have call predecessors, (188), 188 states have call successors, (188) [2022-04-14 16:14:34,698 INFO L74 IsIncluded]: Start isIncluded. First operand 962 states. Second operand has 907 states, 686 states have (on average 1.2434402332361516) internal successors, (853), 697 states have internal predecessors, (853), 190 states have call successors, (190), 32 states have call predecessors, (190), 30 states have return successors, (188), 177 states have call predecessors, (188), 188 states have call successors, (188) [2022-04-14 16:14:34,699 INFO L87 Difference]: Start difference. First operand 962 states. Second operand has 907 states, 686 states have (on average 1.2434402332361516) internal successors, (853), 697 states have internal predecessors, (853), 190 states have call successors, (190), 32 states have call predecessors, (190), 30 states have return successors, (188), 177 states have call predecessors, (188), 188 states have call successors, (188) [2022-04-14 16:14:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:34,729 INFO L93 Difference]: Finished difference Result 962 states and 1283 transitions. [2022-04-14 16:14:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1283 transitions. [2022-04-14 16:14:34,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:34,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:34,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 686 states have (on average 1.2434402332361516) internal successors, (853), 697 states have internal predecessors, (853), 190 states have call successors, (190), 32 states have call predecessors, (190), 30 states have return successors, (188), 177 states have call predecessors, (188), 188 states have call successors, (188) Second operand 962 states. [2022-04-14 16:14:34,734 INFO L87 Difference]: Start difference. First operand has 907 states, 686 states have (on average 1.2434402332361516) internal successors, (853), 697 states have internal predecessors, (853), 190 states have call successors, (190), 32 states have call predecessors, (190), 30 states have return successors, (188), 177 states have call predecessors, (188), 188 states have call successors, (188) Second operand 962 states. [2022-04-14 16:14:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:34,764 INFO L93 Difference]: Finished difference Result 962 states and 1283 transitions. [2022-04-14 16:14:34,764 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1283 transitions. [2022-04-14 16:14:34,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:34,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:34,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:34,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:34,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 686 states have (on average 1.2434402332361516) internal successors, (853), 697 states have internal predecessors, (853), 190 states have call successors, (190), 32 states have call predecessors, (190), 30 states have return successors, (188), 177 states have call predecessors, (188), 188 states have call successors, (188) [2022-04-14 16:14:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1231 transitions. [2022-04-14 16:14:34,802 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1231 transitions. Word has length 91 [2022-04-14 16:14:34,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:34,803 INFO L478 AbstractCegarLoop]: Abstraction has 907 states and 1231 transitions. [2022-04-14 16:14:34,803 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) [2022-04-14 16:14:34,803 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1231 transitions. [2022-04-14 16:14:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-14 16:14:34,804 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:34,804 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:14:34,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-14 16:14:35,019 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-14 16:14:35,019 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:35,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:35,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 1 times [2022-04-14 16:14:35,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:35,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798085190] [2022-04-14 16:14:35,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:35,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:35,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:35,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [378040111] [2022-04-14 16:14:35,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:35,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:35,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:35,039 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:14:35,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-14 16:14:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:35,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-14 16:14:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:35,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:14:35,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {16032#true} call ULTIMATE.init(); {16032#true} is VALID [2022-04-14 16:14:35,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {16032#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16040#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:35,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {16040#(<= ~counter~0 0)} assume true; {16040#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:35,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16040#(<= ~counter~0 0)} {16032#true} #102#return; {16040#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:35,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {16040#(<= ~counter~0 0)} call #t~ret9 := main(); {16040#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:35,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {16040#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {16040#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:35,539 INFO L272 TraceCheckUtils]: 6: Hoare triple {16040#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {16040#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:35,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {16040#(<= ~counter~0 0)} ~cond := #in~cond; {16040#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:35,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {16040#(<= ~counter~0 0)} assume !(0 == ~cond); {16040#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:35,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {16040#(<= ~counter~0 0)} assume true; {16040#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:35,540 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16040#(<= ~counter~0 0)} {16040#(<= ~counter~0 0)} #90#return; {16040#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:35,541 INFO L272 TraceCheckUtils]: 11: Hoare triple {16040#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {16040#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:35,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {16040#(<= ~counter~0 0)} ~cond := #in~cond; {16040#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:35,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {16040#(<= ~counter~0 0)} assume !(0 == ~cond); {16040#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:35,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {16040#(<= ~counter~0 0)} assume true; {16040#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:35,542 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16040#(<= ~counter~0 0)} {16040#(<= ~counter~0 0)} #92#return; {16040#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:35,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {16040#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {16040#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:35,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {16040#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16089#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:35,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {16089#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {16089#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:35,543 INFO L272 TraceCheckUtils]: 19: Hoare triple {16089#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16089#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:35,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {16089#(<= ~counter~0 1)} ~cond := #in~cond; {16089#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:35,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {16089#(<= ~counter~0 1)} assume !(0 == ~cond); {16089#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:35,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {16089#(<= ~counter~0 1)} assume true; {16089#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:35,544 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16089#(<= ~counter~0 1)} {16089#(<= ~counter~0 1)} #94#return; {16089#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:35,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {16089#(<= ~counter~0 1)} assume !!(0 != ~r~0); {16089#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:35,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {16089#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16114#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:35,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {16114#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {16114#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:35,546 INFO L272 TraceCheckUtils]: 27: Hoare triple {16114#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16114#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:35,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {16114#(<= ~counter~0 2)} ~cond := #in~cond; {16114#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:35,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {16114#(<= ~counter~0 2)} assume !(0 == ~cond); {16114#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:35,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {16114#(<= ~counter~0 2)} assume true; {16114#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:35,547 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16114#(<= ~counter~0 2)} {16114#(<= ~counter~0 2)} #96#return; {16114#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:35,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {16114#(<= ~counter~0 2)} assume !(~r~0 > 0); {16114#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:35,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {16114#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16139#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:35,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {16139#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {16139#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:35,548 INFO L272 TraceCheckUtils]: 35: Hoare triple {16139#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16139#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:35,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {16139#(<= ~counter~0 3)} ~cond := #in~cond; {16139#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:35,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {16139#(<= ~counter~0 3)} assume !(0 == ~cond); {16139#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:35,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {16139#(<= ~counter~0 3)} assume true; {16139#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:35,549 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16139#(<= ~counter~0 3)} {16139#(<= ~counter~0 3)} #98#return; {16139#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:35,550 INFO L290 TraceCheckUtils]: 40: Hoare triple {16139#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16139#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:35,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {16139#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16164#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:35,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {16164#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {16164#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:35,560 INFO L272 TraceCheckUtils]: 43: Hoare triple {16164#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16164#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:35,561 INFO L290 TraceCheckUtils]: 44: Hoare triple {16164#(<= ~counter~0 4)} ~cond := #in~cond; {16164#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:35,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {16164#(<= ~counter~0 4)} assume !(0 == ~cond); {16164#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:35,561 INFO L290 TraceCheckUtils]: 46: Hoare triple {16164#(<= ~counter~0 4)} assume true; {16164#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:35,562 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16164#(<= ~counter~0 4)} {16164#(<= ~counter~0 4)} #98#return; {16164#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:35,562 INFO L290 TraceCheckUtils]: 48: Hoare triple {16164#(<= ~counter~0 4)} assume !(~r~0 < 0); {16164#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:35,562 INFO L290 TraceCheckUtils]: 49: Hoare triple {16164#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16189#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:35,563 INFO L290 TraceCheckUtils]: 50: Hoare triple {16189#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {16189#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:35,563 INFO L272 TraceCheckUtils]: 51: Hoare triple {16189#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16189#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:35,563 INFO L290 TraceCheckUtils]: 52: Hoare triple {16189#(<= ~counter~0 5)} ~cond := #in~cond; {16189#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:35,564 INFO L290 TraceCheckUtils]: 53: Hoare triple {16189#(<= ~counter~0 5)} assume !(0 == ~cond); {16189#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:35,564 INFO L290 TraceCheckUtils]: 54: Hoare triple {16189#(<= ~counter~0 5)} assume true; {16189#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:35,565 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16189#(<= ~counter~0 5)} {16189#(<= ~counter~0 5)} #94#return; {16189#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:35,565 INFO L290 TraceCheckUtils]: 56: Hoare triple {16189#(<= ~counter~0 5)} assume !!(0 != ~r~0); {16189#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:35,565 INFO L290 TraceCheckUtils]: 57: Hoare triple {16189#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16214#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:35,566 INFO L290 TraceCheckUtils]: 58: Hoare triple {16214#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {16214#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:35,566 INFO L272 TraceCheckUtils]: 59: Hoare triple {16214#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16214#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:35,566 INFO L290 TraceCheckUtils]: 60: Hoare triple {16214#(<= ~counter~0 6)} ~cond := #in~cond; {16214#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:35,566 INFO L290 TraceCheckUtils]: 61: Hoare triple {16214#(<= ~counter~0 6)} assume !(0 == ~cond); {16214#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:35,567 INFO L290 TraceCheckUtils]: 62: Hoare triple {16214#(<= ~counter~0 6)} assume true; {16214#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:35,567 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16214#(<= ~counter~0 6)} {16214#(<= ~counter~0 6)} #96#return; {16214#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:35,567 INFO L290 TraceCheckUtils]: 64: Hoare triple {16214#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16214#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:35,568 INFO L290 TraceCheckUtils]: 65: Hoare triple {16214#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16239#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:35,568 INFO L290 TraceCheckUtils]: 66: Hoare triple {16239#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {16239#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:35,568 INFO L272 TraceCheckUtils]: 67: Hoare triple {16239#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16239#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:35,569 INFO L290 TraceCheckUtils]: 68: Hoare triple {16239#(<= ~counter~0 7)} ~cond := #in~cond; {16239#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:35,569 INFO L290 TraceCheckUtils]: 69: Hoare triple {16239#(<= ~counter~0 7)} assume !(0 == ~cond); {16239#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:35,569 INFO L290 TraceCheckUtils]: 70: Hoare triple {16239#(<= ~counter~0 7)} assume true; {16239#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:35,570 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16239#(<= ~counter~0 7)} {16239#(<= ~counter~0 7)} #96#return; {16239#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:35,570 INFO L290 TraceCheckUtils]: 72: Hoare triple {16239#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16239#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:35,570 INFO L290 TraceCheckUtils]: 73: Hoare triple {16239#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16264#(<= ~counter~0 8)} is VALID [2022-04-14 16:14:35,571 INFO L290 TraceCheckUtils]: 74: Hoare triple {16264#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {16264#(<= ~counter~0 8)} is VALID [2022-04-14 16:14:35,571 INFO L272 TraceCheckUtils]: 75: Hoare triple {16264#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16264#(<= ~counter~0 8)} is VALID [2022-04-14 16:14:35,571 INFO L290 TraceCheckUtils]: 76: Hoare triple {16264#(<= ~counter~0 8)} ~cond := #in~cond; {16264#(<= ~counter~0 8)} is VALID [2022-04-14 16:14:35,571 INFO L290 TraceCheckUtils]: 77: Hoare triple {16264#(<= ~counter~0 8)} assume !(0 == ~cond); {16264#(<= ~counter~0 8)} is VALID [2022-04-14 16:14:35,572 INFO L290 TraceCheckUtils]: 78: Hoare triple {16264#(<= ~counter~0 8)} assume true; {16264#(<= ~counter~0 8)} is VALID [2022-04-14 16:14:35,572 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {16264#(<= ~counter~0 8)} {16264#(<= ~counter~0 8)} #96#return; {16264#(<= ~counter~0 8)} is VALID [2022-04-14 16:14:35,572 INFO L290 TraceCheckUtils]: 80: Hoare triple {16264#(<= ~counter~0 8)} assume !(~r~0 > 0); {16264#(<= ~counter~0 8)} is VALID [2022-04-14 16:14:35,573 INFO L290 TraceCheckUtils]: 81: Hoare triple {16264#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16289#(<= ~counter~0 9)} is VALID [2022-04-14 16:14:35,573 INFO L290 TraceCheckUtils]: 82: Hoare triple {16289#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {16289#(<= ~counter~0 9)} is VALID [2022-04-14 16:14:35,573 INFO L272 TraceCheckUtils]: 83: Hoare triple {16289#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16289#(<= ~counter~0 9)} is VALID [2022-04-14 16:14:35,574 INFO L290 TraceCheckUtils]: 84: Hoare triple {16289#(<= ~counter~0 9)} ~cond := #in~cond; {16289#(<= ~counter~0 9)} is VALID [2022-04-14 16:14:35,574 INFO L290 TraceCheckUtils]: 85: Hoare triple {16289#(<= ~counter~0 9)} assume !(0 == ~cond); {16289#(<= ~counter~0 9)} is VALID [2022-04-14 16:14:35,574 INFO L290 TraceCheckUtils]: 86: Hoare triple {16289#(<= ~counter~0 9)} assume true; {16289#(<= ~counter~0 9)} is VALID [2022-04-14 16:14:35,575 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {16289#(<= ~counter~0 9)} {16289#(<= ~counter~0 9)} #98#return; {16289#(<= ~counter~0 9)} is VALID [2022-04-14 16:14:35,575 INFO L290 TraceCheckUtils]: 88: Hoare triple {16289#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16289#(<= ~counter~0 9)} is VALID [2022-04-14 16:14:35,575 INFO L290 TraceCheckUtils]: 89: Hoare triple {16289#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16314#(<= |main_#t~post8| 9)} is VALID [2022-04-14 16:14:35,576 INFO L290 TraceCheckUtils]: 90: Hoare triple {16314#(<= |main_#t~post8| 9)} assume !(#t~post8 < 100);havoc #t~post8; {16033#false} is VALID [2022-04-14 16:14:35,576 INFO L290 TraceCheckUtils]: 91: Hoare triple {16033#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16033#false} is VALID [2022-04-14 16:14:35,576 INFO L290 TraceCheckUtils]: 92: Hoare triple {16033#false} assume !(#t~post6 < 100);havoc #t~post6; {16033#false} is VALID [2022-04-14 16:14:35,576 INFO L272 TraceCheckUtils]: 93: Hoare triple {16033#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16033#false} is VALID [2022-04-14 16:14:35,576 INFO L290 TraceCheckUtils]: 94: Hoare triple {16033#false} ~cond := #in~cond; {16033#false} is VALID [2022-04-14 16:14:35,576 INFO L290 TraceCheckUtils]: 95: Hoare triple {16033#false} assume 0 == ~cond; {16033#false} is VALID [2022-04-14 16:14:35,576 INFO L290 TraceCheckUtils]: 96: Hoare triple {16033#false} assume !false; {16033#false} is VALID [2022-04-14 16:14:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:14:35,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:14:36,100 INFO L290 TraceCheckUtils]: 96: Hoare triple {16033#false} assume !false; {16033#false} is VALID [2022-04-14 16:14:36,101 INFO L290 TraceCheckUtils]: 95: Hoare triple {16033#false} assume 0 == ~cond; {16033#false} is VALID [2022-04-14 16:14:36,101 INFO L290 TraceCheckUtils]: 94: Hoare triple {16033#false} ~cond := #in~cond; {16033#false} is VALID [2022-04-14 16:14:36,101 INFO L272 TraceCheckUtils]: 93: Hoare triple {16033#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16033#false} is VALID [2022-04-14 16:14:36,101 INFO L290 TraceCheckUtils]: 92: Hoare triple {16033#false} assume !(#t~post6 < 100);havoc #t~post6; {16033#false} is VALID [2022-04-14 16:14:36,101 INFO L290 TraceCheckUtils]: 91: Hoare triple {16033#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16033#false} is VALID [2022-04-14 16:14:36,101 INFO L290 TraceCheckUtils]: 90: Hoare triple {16354#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {16033#false} is VALID [2022-04-14 16:14:36,101 INFO L290 TraceCheckUtils]: 89: Hoare triple {16358#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16354#(< |main_#t~post8| 100)} is VALID [2022-04-14 16:14:36,102 INFO L290 TraceCheckUtils]: 88: Hoare triple {16358#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16358#(< ~counter~0 100)} is VALID [2022-04-14 16:14:36,102 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {16032#true} {16358#(< ~counter~0 100)} #98#return; {16358#(< ~counter~0 100)} is VALID [2022-04-14 16:14:36,102 INFO L290 TraceCheckUtils]: 86: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-14 16:14:36,102 INFO L290 TraceCheckUtils]: 85: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-14 16:14:36,102 INFO L290 TraceCheckUtils]: 84: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-14 16:14:36,102 INFO L272 TraceCheckUtils]: 83: Hoare triple {16358#(< ~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)); {16032#true} is VALID [2022-04-14 16:14:36,103 INFO L290 TraceCheckUtils]: 82: Hoare triple {16358#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {16358#(< ~counter~0 100)} is VALID [2022-04-14 16:14:36,103 INFO L290 TraceCheckUtils]: 81: Hoare triple {16383#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16358#(< ~counter~0 100)} is VALID [2022-04-14 16:14:36,103 INFO L290 TraceCheckUtils]: 80: Hoare triple {16383#(< ~counter~0 99)} assume !(~r~0 > 0); {16383#(< ~counter~0 99)} is VALID [2022-04-14 16:14:36,104 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {16032#true} {16383#(< ~counter~0 99)} #96#return; {16383#(< ~counter~0 99)} is VALID [2022-04-14 16:14:36,104 INFO L290 TraceCheckUtils]: 78: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-14 16:14:36,104 INFO L290 TraceCheckUtils]: 77: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-14 16:14:36,104 INFO L290 TraceCheckUtils]: 76: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-14 16:14:36,104 INFO L272 TraceCheckUtils]: 75: Hoare triple {16383#(< ~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)); {16032#true} is VALID [2022-04-14 16:14:36,104 INFO L290 TraceCheckUtils]: 74: Hoare triple {16383#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {16383#(< ~counter~0 99)} is VALID [2022-04-14 16:14:36,105 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16383#(< ~counter~0 99)} is VALID [2022-04-14 16:14:36,105 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16408#(< ~counter~0 98)} is VALID [2022-04-14 16:14:36,115 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16032#true} {16408#(< ~counter~0 98)} #96#return; {16408#(< ~counter~0 98)} is VALID [2022-04-14 16:14:36,115 INFO L290 TraceCheckUtils]: 70: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-14 16:14:36,115 INFO L290 TraceCheckUtils]: 69: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-14 16:14:36,115 INFO L290 TraceCheckUtils]: 68: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-14 16:14:36,115 INFO L272 TraceCheckUtils]: 67: Hoare triple {16408#(< ~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)); {16032#true} is VALID [2022-04-14 16:14:36,115 INFO L290 TraceCheckUtils]: 66: Hoare triple {16408#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {16408#(< ~counter~0 98)} is VALID [2022-04-14 16:14:36,116 INFO L290 TraceCheckUtils]: 65: Hoare triple {16433#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16408#(< ~counter~0 98)} is VALID [2022-04-14 16:14:36,116 INFO L290 TraceCheckUtils]: 64: Hoare triple {16433#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16433#(< ~counter~0 97)} is VALID [2022-04-14 16:14:36,116 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16032#true} {16433#(< ~counter~0 97)} #96#return; {16433#(< ~counter~0 97)} is VALID [2022-04-14 16:14:36,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-14 16:14:36,116 INFO L290 TraceCheckUtils]: 61: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-14 16:14:36,117 INFO L290 TraceCheckUtils]: 60: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-14 16:14:36,117 INFO L272 TraceCheckUtils]: 59: Hoare triple {16433#(< ~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)); {16032#true} is VALID [2022-04-14 16:14:36,117 INFO L290 TraceCheckUtils]: 58: Hoare triple {16433#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {16433#(< ~counter~0 97)} is VALID [2022-04-14 16:14:36,117 INFO L290 TraceCheckUtils]: 57: Hoare triple {16458#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16433#(< ~counter~0 97)} is VALID [2022-04-14 16:14:36,118 INFO L290 TraceCheckUtils]: 56: Hoare triple {16458#(< ~counter~0 96)} assume !!(0 != ~r~0); {16458#(< ~counter~0 96)} is VALID [2022-04-14 16:14:36,118 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16032#true} {16458#(< ~counter~0 96)} #94#return; {16458#(< ~counter~0 96)} is VALID [2022-04-14 16:14:36,118 INFO L290 TraceCheckUtils]: 54: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-14 16:14:36,118 INFO L290 TraceCheckUtils]: 53: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-14 16:14:36,118 INFO L290 TraceCheckUtils]: 52: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-14 16:14:36,118 INFO L272 TraceCheckUtils]: 51: Hoare triple {16458#(< ~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)); {16032#true} is VALID [2022-04-14 16:14:36,118 INFO L290 TraceCheckUtils]: 50: Hoare triple {16458#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {16458#(< ~counter~0 96)} is VALID [2022-04-14 16:14:36,119 INFO L290 TraceCheckUtils]: 49: Hoare triple {16483#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16458#(< ~counter~0 96)} is VALID [2022-04-14 16:14:36,119 INFO L290 TraceCheckUtils]: 48: Hoare triple {16483#(< ~counter~0 95)} assume !(~r~0 < 0); {16483#(< ~counter~0 95)} is VALID [2022-04-14 16:14:36,120 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16032#true} {16483#(< ~counter~0 95)} #98#return; {16483#(< ~counter~0 95)} is VALID [2022-04-14 16:14:36,120 INFO L290 TraceCheckUtils]: 46: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-14 16:14:36,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-14 16:14:36,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-14 16:14:36,120 INFO L272 TraceCheckUtils]: 43: Hoare triple {16483#(< ~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)); {16032#true} is VALID [2022-04-14 16:14:36,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {16483#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {16483#(< ~counter~0 95)} is VALID [2022-04-14 16:14:36,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {16508#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16483#(< ~counter~0 95)} is VALID [2022-04-14 16:14:36,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {16508#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16508#(< ~counter~0 94)} is VALID [2022-04-14 16:14:36,137 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16032#true} {16508#(< ~counter~0 94)} #98#return; {16508#(< ~counter~0 94)} is VALID [2022-04-14 16:14:36,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-14 16:14:36,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-14 16:14:36,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-14 16:14:36,137 INFO L272 TraceCheckUtils]: 35: Hoare triple {16508#(< ~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)); {16032#true} is VALID [2022-04-14 16:14:36,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {16508#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {16508#(< ~counter~0 94)} is VALID [2022-04-14 16:14:36,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {16533#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16508#(< ~counter~0 94)} is VALID [2022-04-14 16:14:36,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {16533#(< ~counter~0 93)} assume !(~r~0 > 0); {16533#(< ~counter~0 93)} is VALID [2022-04-14 16:14:36,138 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16032#true} {16533#(< ~counter~0 93)} #96#return; {16533#(< ~counter~0 93)} is VALID [2022-04-14 16:14:36,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-14 16:14:36,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-14 16:14:36,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-14 16:14:36,139 INFO L272 TraceCheckUtils]: 27: Hoare triple {16533#(< ~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)); {16032#true} is VALID [2022-04-14 16:14:36,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {16533#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {16533#(< ~counter~0 93)} is VALID [2022-04-14 16:14:36,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {16558#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16533#(< ~counter~0 93)} is VALID [2022-04-14 16:14:36,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {16558#(< ~counter~0 92)} assume !!(0 != ~r~0); {16558#(< ~counter~0 92)} is VALID [2022-04-14 16:14:36,140 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16032#true} {16558#(< ~counter~0 92)} #94#return; {16558#(< ~counter~0 92)} is VALID [2022-04-14 16:14:36,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-14 16:14:36,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-14 16:14:36,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-14 16:14:36,140 INFO L272 TraceCheckUtils]: 19: Hoare triple {16558#(< ~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)); {16032#true} is VALID [2022-04-14 16:14:36,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {16558#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {16558#(< ~counter~0 92)} is VALID [2022-04-14 16:14:36,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {16583#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16558#(< ~counter~0 92)} is VALID [2022-04-14 16:14:36,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {16583#(< ~counter~0 91)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {16583#(< ~counter~0 91)} is VALID [2022-04-14 16:14:36,142 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16032#true} {16583#(< ~counter~0 91)} #92#return; {16583#(< ~counter~0 91)} is VALID [2022-04-14 16:14:36,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-14 16:14:36,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-14 16:14:36,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-14 16:14:36,142 INFO L272 TraceCheckUtils]: 11: Hoare triple {16583#(< ~counter~0 91)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {16032#true} is VALID [2022-04-14 16:14:36,142 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16032#true} {16583#(< ~counter~0 91)} #90#return; {16583#(< ~counter~0 91)} is VALID [2022-04-14 16:14:36,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-14 16:14:36,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-14 16:14:36,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-14 16:14:36,143 INFO L272 TraceCheckUtils]: 6: Hoare triple {16583#(< ~counter~0 91)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {16032#true} is VALID [2022-04-14 16:14:36,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {16583#(< ~counter~0 91)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {16583#(< ~counter~0 91)} is VALID [2022-04-14 16:14:36,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {16583#(< ~counter~0 91)} call #t~ret9 := main(); {16583#(< ~counter~0 91)} is VALID [2022-04-14 16:14:36,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16583#(< ~counter~0 91)} {16032#true} #102#return; {16583#(< ~counter~0 91)} is VALID [2022-04-14 16:14:36,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {16583#(< ~counter~0 91)} assume true; {16583#(< ~counter~0 91)} is VALID [2022-04-14 16:14:36,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {16032#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16583#(< ~counter~0 91)} is VALID [2022-04-14 16:14:36,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {16032#true} call ULTIMATE.init(); {16032#true} is VALID [2022-04-14 16:14:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-14 16:14:36,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:14:36,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798085190] [2022-04-14 16:14:36,145 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:14:36,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378040111] [2022-04-14 16:14:36,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378040111] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:14:36,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:14:36,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-14 16:14:36,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783202198] [2022-04-14 16:14:36,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:14:36,147 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) Word has length 97 [2022-04-14 16:14:36,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:14:36,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2022-04-14 16:14:36,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:36,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-14 16:14:36,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:14:36,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-14 16:14:36,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-14 16:14:36,247 INFO L87 Difference]: Start difference. First operand 907 states and 1231 transitions. Second operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2022-04-14 16:14:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:38,617 INFO L93 Difference]: Finished difference Result 1471 states and 1986 transitions. [2022-04-14 16:14:38,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-14 16:14:38,617 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) Word has length 97 [2022-04-14 16:14:38,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2022-04-14 16:14:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 467 transitions. [2022-04-14 16:14:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2022-04-14 16:14:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 467 transitions. [2022-04-14 16:14:38,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 467 transitions. [2022-04-14 16:14:38,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:38,992 INFO L225 Difference]: With dead ends: 1471 [2022-04-14 16:14:38,992 INFO L226 Difference]: Without dead ends: 869 [2022-04-14 16:14:38,994 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=584, Invalid=1056, Unknown=0, NotChecked=0, Total=1640 [2022-04-14 16:14:38,994 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 727 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:38,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [727 Valid, 517 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-14 16:14:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-04-14 16:14:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 814. [2022-04-14 16:14:39,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:39,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 869 states. Second operand has 814 states, 609 states have (on average 1.2036124794745484) internal successors, (733), 613 states have internal predecessors, (733), 166 states have call successors, (166), 40 states have call predecessors, (166), 38 states have return successors, (164), 160 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-14 16:14:39,406 INFO L74 IsIncluded]: Start isIncluded. First operand 869 states. Second operand has 814 states, 609 states have (on average 1.2036124794745484) internal successors, (733), 613 states have internal predecessors, (733), 166 states have call successors, (166), 40 states have call predecessors, (166), 38 states have return successors, (164), 160 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-14 16:14:39,407 INFO L87 Difference]: Start difference. First operand 869 states. Second operand has 814 states, 609 states have (on average 1.2036124794745484) internal successors, (733), 613 states have internal predecessors, (733), 166 states have call successors, (166), 40 states have call predecessors, (166), 38 states have return successors, (164), 160 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-14 16:14:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:39,434 INFO L93 Difference]: Finished difference Result 869 states and 1109 transitions. [2022-04-14 16:14:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1109 transitions. [2022-04-14 16:14:39,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:39,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:39,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 814 states, 609 states have (on average 1.2036124794745484) internal successors, (733), 613 states have internal predecessors, (733), 166 states have call successors, (166), 40 states have call predecessors, (166), 38 states have return successors, (164), 160 states have call predecessors, (164), 164 states have call successors, (164) Second operand 869 states. [2022-04-14 16:14:39,437 INFO L87 Difference]: Start difference. First operand has 814 states, 609 states have (on average 1.2036124794745484) internal successors, (733), 613 states have internal predecessors, (733), 166 states have call successors, (166), 40 states have call predecessors, (166), 38 states have return successors, (164), 160 states have call predecessors, (164), 164 states have call successors, (164) Second operand 869 states. [2022-04-14 16:14:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:39,462 INFO L93 Difference]: Finished difference Result 869 states and 1109 transitions. [2022-04-14 16:14:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1109 transitions. [2022-04-14 16:14:39,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:39,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:39,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:39,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 609 states have (on average 1.2036124794745484) internal successors, (733), 613 states have internal predecessors, (733), 166 states have call successors, (166), 40 states have call predecessors, (166), 38 states have return successors, (164), 160 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-14 16:14:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1063 transitions. [2022-04-14 16:14:39,493 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1063 transitions. Word has length 97 [2022-04-14 16:14:39,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:39,493 INFO L478 AbstractCegarLoop]: Abstraction has 814 states and 1063 transitions. [2022-04-14 16:14:39,493 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2022-04-14 16:14:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1063 transitions. [2022-04-14 16:14:39,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-14 16:14:39,494 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:39,495 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:14:39,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-14 16:14:39,707 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-14 16:14:39,707 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:39,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 1 times [2022-04-14 16:14:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:39,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654983547] [2022-04-14 16:14:39,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:39,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:39,724 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:39,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913098785] [2022-04-14 16:14:39,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:39,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:39,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:39,726 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:14:39,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-14 16:14:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:39,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-14 16:14:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:39,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:14:40,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {21583#true} call ULTIMATE.init(); {21583#true} is VALID [2022-04-14 16:14:40,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {21583#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21591#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:40,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {21591#(<= ~counter~0 0)} assume true; {21591#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:40,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21591#(<= ~counter~0 0)} {21583#true} #102#return; {21591#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:40,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {21591#(<= ~counter~0 0)} call #t~ret9 := main(); {21591#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:40,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {21591#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {21591#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:40,326 INFO L272 TraceCheckUtils]: 6: Hoare triple {21591#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21591#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:40,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {21591#(<= ~counter~0 0)} ~cond := #in~cond; {21591#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:40,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {21591#(<= ~counter~0 0)} assume !(0 == ~cond); {21591#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:40,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {21591#(<= ~counter~0 0)} assume true; {21591#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:40,327 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21591#(<= ~counter~0 0)} {21591#(<= ~counter~0 0)} #90#return; {21591#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:40,328 INFO L272 TraceCheckUtils]: 11: Hoare triple {21591#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {21591#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:40,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {21591#(<= ~counter~0 0)} ~cond := #in~cond; {21591#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:40,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {21591#(<= ~counter~0 0)} assume !(0 == ~cond); {21591#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:40,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {21591#(<= ~counter~0 0)} assume true; {21591#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:40,329 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21591#(<= ~counter~0 0)} {21591#(<= ~counter~0 0)} #92#return; {21591#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:40,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {21591#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21591#(<= ~counter~0 0)} is VALID [2022-04-14 16:14:40,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {21591#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21640#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:40,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {21640#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {21640#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:40,330 INFO L272 TraceCheckUtils]: 19: Hoare triple {21640#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21640#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:40,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {21640#(<= ~counter~0 1)} ~cond := #in~cond; {21640#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:40,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {21640#(<= ~counter~0 1)} assume !(0 == ~cond); {21640#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:40,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {21640#(<= ~counter~0 1)} assume true; {21640#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:40,332 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21640#(<= ~counter~0 1)} {21640#(<= ~counter~0 1)} #94#return; {21640#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:40,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {21640#(<= ~counter~0 1)} assume !!(0 != ~r~0); {21640#(<= ~counter~0 1)} is VALID [2022-04-14 16:14:40,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {21640#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21665#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:40,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {21665#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {21665#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:40,333 INFO L272 TraceCheckUtils]: 27: Hoare triple {21665#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21665#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:40,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {21665#(<= ~counter~0 2)} ~cond := #in~cond; {21665#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:40,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {21665#(<= ~counter~0 2)} assume !(0 == ~cond); {21665#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:40,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {21665#(<= ~counter~0 2)} assume true; {21665#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:40,335 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21665#(<= ~counter~0 2)} {21665#(<= ~counter~0 2)} #96#return; {21665#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:40,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {21665#(<= ~counter~0 2)} assume !(~r~0 > 0); {21665#(<= ~counter~0 2)} is VALID [2022-04-14 16:14:40,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {21665#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21690#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:40,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {21690#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {21690#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:40,336 INFO L272 TraceCheckUtils]: 35: Hoare triple {21690#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21690#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:40,336 INFO L290 TraceCheckUtils]: 36: Hoare triple {21690#(<= ~counter~0 3)} ~cond := #in~cond; {21690#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:40,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {21690#(<= ~counter~0 3)} assume !(0 == ~cond); {21690#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:40,337 INFO L290 TraceCheckUtils]: 38: Hoare triple {21690#(<= ~counter~0 3)} assume true; {21690#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:40,337 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21690#(<= ~counter~0 3)} {21690#(<= ~counter~0 3)} #98#return; {21690#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:40,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {21690#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21690#(<= ~counter~0 3)} is VALID [2022-04-14 16:14:40,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {21690#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21715#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:40,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {21715#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {21715#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:40,339 INFO L272 TraceCheckUtils]: 43: Hoare triple {21715#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21715#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:40,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {21715#(<= ~counter~0 4)} ~cond := #in~cond; {21715#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:40,339 INFO L290 TraceCheckUtils]: 45: Hoare triple {21715#(<= ~counter~0 4)} assume !(0 == ~cond); {21715#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:40,340 INFO L290 TraceCheckUtils]: 46: Hoare triple {21715#(<= ~counter~0 4)} assume true; {21715#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:40,340 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21715#(<= ~counter~0 4)} {21715#(<= ~counter~0 4)} #98#return; {21715#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:40,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {21715#(<= ~counter~0 4)} assume !(~r~0 < 0); {21715#(<= ~counter~0 4)} is VALID [2022-04-14 16:14:40,341 INFO L290 TraceCheckUtils]: 49: Hoare triple {21715#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21740#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:40,341 INFO L290 TraceCheckUtils]: 50: Hoare triple {21740#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {21740#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:40,342 INFO L272 TraceCheckUtils]: 51: Hoare triple {21740#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21740#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:40,342 INFO L290 TraceCheckUtils]: 52: Hoare triple {21740#(<= ~counter~0 5)} ~cond := #in~cond; {21740#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:40,342 INFO L290 TraceCheckUtils]: 53: Hoare triple {21740#(<= ~counter~0 5)} assume !(0 == ~cond); {21740#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:40,342 INFO L290 TraceCheckUtils]: 54: Hoare triple {21740#(<= ~counter~0 5)} assume true; {21740#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:40,343 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21740#(<= ~counter~0 5)} {21740#(<= ~counter~0 5)} #94#return; {21740#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:40,343 INFO L290 TraceCheckUtils]: 56: Hoare triple {21740#(<= ~counter~0 5)} assume !!(0 != ~r~0); {21740#(<= ~counter~0 5)} is VALID [2022-04-14 16:14:40,344 INFO L290 TraceCheckUtils]: 57: Hoare triple {21740#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21765#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:40,344 INFO L290 TraceCheckUtils]: 58: Hoare triple {21765#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {21765#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:40,344 INFO L272 TraceCheckUtils]: 59: Hoare triple {21765#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21765#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:40,345 INFO L290 TraceCheckUtils]: 60: Hoare triple {21765#(<= ~counter~0 6)} ~cond := #in~cond; {21765#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:40,345 INFO L290 TraceCheckUtils]: 61: Hoare triple {21765#(<= ~counter~0 6)} assume !(0 == ~cond); {21765#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:40,345 INFO L290 TraceCheckUtils]: 62: Hoare triple {21765#(<= ~counter~0 6)} assume true; {21765#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:40,346 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21765#(<= ~counter~0 6)} {21765#(<= ~counter~0 6)} #96#return; {21765#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:40,346 INFO L290 TraceCheckUtils]: 64: Hoare triple {21765#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21765#(<= ~counter~0 6)} is VALID [2022-04-14 16:14:40,346 INFO L290 TraceCheckUtils]: 65: Hoare triple {21765#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21790#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:40,347 INFO L290 TraceCheckUtils]: 66: Hoare triple {21790#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {21790#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:40,347 INFO L272 TraceCheckUtils]: 67: Hoare triple {21790#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21790#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:40,347 INFO L290 TraceCheckUtils]: 68: Hoare triple {21790#(<= ~counter~0 7)} ~cond := #in~cond; {21790#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:40,348 INFO L290 TraceCheckUtils]: 69: Hoare triple {21790#(<= ~counter~0 7)} assume !(0 == ~cond); {21790#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:40,348 INFO L290 TraceCheckUtils]: 70: Hoare triple {21790#(<= ~counter~0 7)} assume true; {21790#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:40,348 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21790#(<= ~counter~0 7)} {21790#(<= ~counter~0 7)} #96#return; {21790#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:40,349 INFO L290 TraceCheckUtils]: 72: Hoare triple {21790#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21790#(<= ~counter~0 7)} is VALID [2022-04-14 16:14:40,349 INFO L290 TraceCheckUtils]: 73: Hoare triple {21790#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21815#(<= ~counter~0 8)} is VALID [2022-04-14 16:14:40,349 INFO L290 TraceCheckUtils]: 74: Hoare triple {21815#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {21815#(<= ~counter~0 8)} is VALID [2022-04-14 16:14:40,350 INFO L272 TraceCheckUtils]: 75: Hoare triple {21815#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21815#(<= ~counter~0 8)} is VALID [2022-04-14 16:14:40,350 INFO L290 TraceCheckUtils]: 76: Hoare triple {21815#(<= ~counter~0 8)} ~cond := #in~cond; {21815#(<= ~counter~0 8)} is VALID [2022-04-14 16:14:40,350 INFO L290 TraceCheckUtils]: 77: Hoare triple {21815#(<= ~counter~0 8)} assume !(0 == ~cond); {21815#(<= ~counter~0 8)} is VALID [2022-04-14 16:14:40,351 INFO L290 TraceCheckUtils]: 78: Hoare triple {21815#(<= ~counter~0 8)} assume true; {21815#(<= ~counter~0 8)} is VALID [2022-04-14 16:14:40,351 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {21815#(<= ~counter~0 8)} {21815#(<= ~counter~0 8)} #96#return; {21815#(<= ~counter~0 8)} is VALID [2022-04-14 16:14:40,352 INFO L290 TraceCheckUtils]: 80: Hoare triple {21815#(<= ~counter~0 8)} assume !(~r~0 > 0); {21815#(<= ~counter~0 8)} is VALID [2022-04-14 16:14:40,352 INFO L290 TraceCheckUtils]: 81: Hoare triple {21815#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21840#(<= ~counter~0 9)} is VALID [2022-04-14 16:14:40,352 INFO L290 TraceCheckUtils]: 82: Hoare triple {21840#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {21840#(<= ~counter~0 9)} is VALID [2022-04-14 16:14:40,353 INFO L272 TraceCheckUtils]: 83: Hoare triple {21840#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21840#(<= ~counter~0 9)} is VALID [2022-04-14 16:14:40,353 INFO L290 TraceCheckUtils]: 84: Hoare triple {21840#(<= ~counter~0 9)} ~cond := #in~cond; {21840#(<= ~counter~0 9)} is VALID [2022-04-14 16:14:40,353 INFO L290 TraceCheckUtils]: 85: Hoare triple {21840#(<= ~counter~0 9)} assume !(0 == ~cond); {21840#(<= ~counter~0 9)} is VALID [2022-04-14 16:14:40,354 INFO L290 TraceCheckUtils]: 86: Hoare triple {21840#(<= ~counter~0 9)} assume true; {21840#(<= ~counter~0 9)} is VALID [2022-04-14 16:14:40,354 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {21840#(<= ~counter~0 9)} {21840#(<= ~counter~0 9)} #98#return; {21840#(<= ~counter~0 9)} is VALID [2022-04-14 16:14:40,354 INFO L290 TraceCheckUtils]: 88: Hoare triple {21840#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21840#(<= ~counter~0 9)} is VALID [2022-04-14 16:14:40,355 INFO L290 TraceCheckUtils]: 89: Hoare triple {21840#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21865#(<= ~counter~0 10)} is VALID [2022-04-14 16:14:40,355 INFO L290 TraceCheckUtils]: 90: Hoare triple {21865#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {21865#(<= ~counter~0 10)} is VALID [2022-04-14 16:14:40,356 INFO L272 TraceCheckUtils]: 91: Hoare triple {21865#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21865#(<= ~counter~0 10)} is VALID [2022-04-14 16:14:40,356 INFO L290 TraceCheckUtils]: 92: Hoare triple {21865#(<= ~counter~0 10)} ~cond := #in~cond; {21865#(<= ~counter~0 10)} is VALID [2022-04-14 16:14:40,356 INFO L290 TraceCheckUtils]: 93: Hoare triple {21865#(<= ~counter~0 10)} assume !(0 == ~cond); {21865#(<= ~counter~0 10)} is VALID [2022-04-14 16:14:40,356 INFO L290 TraceCheckUtils]: 94: Hoare triple {21865#(<= ~counter~0 10)} assume true; {21865#(<= ~counter~0 10)} is VALID [2022-04-14 16:14:40,357 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {21865#(<= ~counter~0 10)} {21865#(<= ~counter~0 10)} #98#return; {21865#(<= ~counter~0 10)} is VALID [2022-04-14 16:14:40,357 INFO L290 TraceCheckUtils]: 96: Hoare triple {21865#(<= ~counter~0 10)} assume !(~r~0 < 0); {21865#(<= ~counter~0 10)} is VALID [2022-04-14 16:14:40,357 INFO L290 TraceCheckUtils]: 97: Hoare triple {21865#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21890#(<= |main_#t~post6| 10)} is VALID [2022-04-14 16:14:40,358 INFO L290 TraceCheckUtils]: 98: Hoare triple {21890#(<= |main_#t~post6| 10)} assume !(#t~post6 < 100);havoc #t~post6; {21584#false} is VALID [2022-04-14 16:14:40,358 INFO L272 TraceCheckUtils]: 99: Hoare triple {21584#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21584#false} is VALID [2022-04-14 16:14:40,358 INFO L290 TraceCheckUtils]: 100: Hoare triple {21584#false} ~cond := #in~cond; {21584#false} is VALID [2022-04-14 16:14:40,358 INFO L290 TraceCheckUtils]: 101: Hoare triple {21584#false} assume 0 == ~cond; {21584#false} is VALID [2022-04-14 16:14:40,358 INFO L290 TraceCheckUtils]: 102: Hoare triple {21584#false} assume !false; {21584#false} is VALID [2022-04-14 16:14:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 236 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:14:40,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:14:40,914 INFO L290 TraceCheckUtils]: 102: Hoare triple {21584#false} assume !false; {21584#false} is VALID [2022-04-14 16:14:40,914 INFO L290 TraceCheckUtils]: 101: Hoare triple {21584#false} assume 0 == ~cond; {21584#false} is VALID [2022-04-14 16:14:40,914 INFO L290 TraceCheckUtils]: 100: Hoare triple {21584#false} ~cond := #in~cond; {21584#false} is VALID [2022-04-14 16:14:40,914 INFO L272 TraceCheckUtils]: 99: Hoare triple {21584#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21584#false} is VALID [2022-04-14 16:14:40,914 INFO L290 TraceCheckUtils]: 98: Hoare triple {21918#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {21584#false} is VALID [2022-04-14 16:14:40,916 INFO L290 TraceCheckUtils]: 97: Hoare triple {21922#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21918#(< |main_#t~post6| 100)} is VALID [2022-04-14 16:14:40,916 INFO L290 TraceCheckUtils]: 96: Hoare triple {21922#(< ~counter~0 100)} assume !(~r~0 < 0); {21922#(< ~counter~0 100)} is VALID [2022-04-14 16:14:40,917 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {21583#true} {21922#(< ~counter~0 100)} #98#return; {21922#(< ~counter~0 100)} is VALID [2022-04-14 16:14:40,917 INFO L290 TraceCheckUtils]: 94: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-14 16:14:40,917 INFO L290 TraceCheckUtils]: 93: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-14 16:14:40,917 INFO L290 TraceCheckUtils]: 92: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-14 16:14:40,917 INFO L272 TraceCheckUtils]: 91: Hoare triple {21922#(< ~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)); {21583#true} is VALID [2022-04-14 16:14:40,917 INFO L290 TraceCheckUtils]: 90: Hoare triple {21922#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {21922#(< ~counter~0 100)} is VALID [2022-04-14 16:14:40,918 INFO L290 TraceCheckUtils]: 89: Hoare triple {21947#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21922#(< ~counter~0 100)} is VALID [2022-04-14 16:14:40,918 INFO L290 TraceCheckUtils]: 88: Hoare triple {21947#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21947#(< ~counter~0 99)} is VALID [2022-04-14 16:14:40,918 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {21583#true} {21947#(< ~counter~0 99)} #98#return; {21947#(< ~counter~0 99)} is VALID [2022-04-14 16:14:40,918 INFO L290 TraceCheckUtils]: 86: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-14 16:14:40,918 INFO L290 TraceCheckUtils]: 85: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-14 16:14:40,919 INFO L290 TraceCheckUtils]: 84: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-14 16:14:40,919 INFO L272 TraceCheckUtils]: 83: Hoare triple {21947#(< ~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)); {21583#true} is VALID [2022-04-14 16:14:40,919 INFO L290 TraceCheckUtils]: 82: Hoare triple {21947#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {21947#(< ~counter~0 99)} is VALID [2022-04-14 16:14:40,919 INFO L290 TraceCheckUtils]: 81: Hoare triple {21972#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21947#(< ~counter~0 99)} is VALID [2022-04-14 16:14:40,919 INFO L290 TraceCheckUtils]: 80: Hoare triple {21972#(< ~counter~0 98)} assume !(~r~0 > 0); {21972#(< ~counter~0 98)} is VALID [2022-04-14 16:14:40,920 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {21583#true} {21972#(< ~counter~0 98)} #96#return; {21972#(< ~counter~0 98)} is VALID [2022-04-14 16:14:40,920 INFO L290 TraceCheckUtils]: 78: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-14 16:14:40,920 INFO L290 TraceCheckUtils]: 77: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-14 16:14:40,920 INFO L290 TraceCheckUtils]: 76: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-14 16:14:40,920 INFO L272 TraceCheckUtils]: 75: Hoare triple {21972#(< ~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)); {21583#true} is VALID [2022-04-14 16:14:40,920 INFO L290 TraceCheckUtils]: 74: Hoare triple {21972#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {21972#(< ~counter~0 98)} is VALID [2022-04-14 16:14:40,921 INFO L290 TraceCheckUtils]: 73: Hoare triple {21997#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21972#(< ~counter~0 98)} is VALID [2022-04-14 16:14:40,921 INFO L290 TraceCheckUtils]: 72: Hoare triple {21997#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21997#(< ~counter~0 97)} is VALID [2022-04-14 16:14:40,922 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21583#true} {21997#(< ~counter~0 97)} #96#return; {21997#(< ~counter~0 97)} is VALID [2022-04-14 16:14:40,922 INFO L290 TraceCheckUtils]: 70: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-14 16:14:40,922 INFO L290 TraceCheckUtils]: 69: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-14 16:14:40,922 INFO L290 TraceCheckUtils]: 68: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-14 16:14:40,922 INFO L272 TraceCheckUtils]: 67: Hoare triple {21997#(< ~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)); {21583#true} is VALID [2022-04-14 16:14:40,922 INFO L290 TraceCheckUtils]: 66: Hoare triple {21997#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {21997#(< ~counter~0 97)} is VALID [2022-04-14 16:14:40,922 INFO L290 TraceCheckUtils]: 65: Hoare triple {22022#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21997#(< ~counter~0 97)} is VALID [2022-04-14 16:14:40,923 INFO L290 TraceCheckUtils]: 64: Hoare triple {22022#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22022#(< ~counter~0 96)} is VALID [2022-04-14 16:14:40,923 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21583#true} {22022#(< ~counter~0 96)} #96#return; {22022#(< ~counter~0 96)} is VALID [2022-04-14 16:14:40,923 INFO L290 TraceCheckUtils]: 62: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-14 16:14:40,923 INFO L290 TraceCheckUtils]: 61: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-14 16:14:40,923 INFO L290 TraceCheckUtils]: 60: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-14 16:14:40,923 INFO L272 TraceCheckUtils]: 59: Hoare triple {22022#(< ~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)); {21583#true} is VALID [2022-04-14 16:14:40,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {22022#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {22022#(< ~counter~0 96)} is VALID [2022-04-14 16:14:40,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {22047#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22022#(< ~counter~0 96)} is VALID [2022-04-14 16:14:40,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {22047#(< ~counter~0 95)} assume !!(0 != ~r~0); {22047#(< ~counter~0 95)} is VALID [2022-04-14 16:14:40,925 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21583#true} {22047#(< ~counter~0 95)} #94#return; {22047#(< ~counter~0 95)} is VALID [2022-04-14 16:14:40,925 INFO L290 TraceCheckUtils]: 54: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-14 16:14:40,925 INFO L290 TraceCheckUtils]: 53: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-14 16:14:40,925 INFO L290 TraceCheckUtils]: 52: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-14 16:14:40,925 INFO L272 TraceCheckUtils]: 51: Hoare triple {22047#(< ~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)); {21583#true} is VALID [2022-04-14 16:14:40,925 INFO L290 TraceCheckUtils]: 50: Hoare triple {22047#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {22047#(< ~counter~0 95)} is VALID [2022-04-14 16:14:40,926 INFO L290 TraceCheckUtils]: 49: Hoare triple {22072#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22047#(< ~counter~0 95)} is VALID [2022-04-14 16:14:40,926 INFO L290 TraceCheckUtils]: 48: Hoare triple {22072#(< ~counter~0 94)} assume !(~r~0 < 0); {22072#(< ~counter~0 94)} is VALID [2022-04-14 16:14:40,926 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21583#true} {22072#(< ~counter~0 94)} #98#return; {22072#(< ~counter~0 94)} is VALID [2022-04-14 16:14:40,926 INFO L290 TraceCheckUtils]: 46: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-14 16:14:40,927 INFO L290 TraceCheckUtils]: 45: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-14 16:14:40,927 INFO L290 TraceCheckUtils]: 44: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-14 16:14:40,927 INFO L272 TraceCheckUtils]: 43: Hoare triple {22072#(< ~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)); {21583#true} is VALID [2022-04-14 16:14:40,927 INFO L290 TraceCheckUtils]: 42: Hoare triple {22072#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {22072#(< ~counter~0 94)} is VALID [2022-04-14 16:14:40,927 INFO L290 TraceCheckUtils]: 41: Hoare triple {22097#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22072#(< ~counter~0 94)} is VALID [2022-04-14 16:14:40,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {22097#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22097#(< ~counter~0 93)} is VALID [2022-04-14 16:14:40,928 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21583#true} {22097#(< ~counter~0 93)} #98#return; {22097#(< ~counter~0 93)} is VALID [2022-04-14 16:14:40,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-14 16:14:40,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-14 16:14:40,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-14 16:14:40,928 INFO L272 TraceCheckUtils]: 35: Hoare triple {22097#(< ~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)); {21583#true} is VALID [2022-04-14 16:14:40,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {22097#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {22097#(< ~counter~0 93)} is VALID [2022-04-14 16:14:40,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {22122#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22097#(< ~counter~0 93)} is VALID [2022-04-14 16:14:40,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {22122#(< ~counter~0 92)} assume !(~r~0 > 0); {22122#(< ~counter~0 92)} is VALID [2022-04-14 16:14:40,930 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21583#true} {22122#(< ~counter~0 92)} #96#return; {22122#(< ~counter~0 92)} is VALID [2022-04-14 16:14:40,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-14 16:14:40,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-14 16:14:40,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-14 16:14:40,930 INFO L272 TraceCheckUtils]: 27: Hoare triple {22122#(< ~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)); {21583#true} is VALID [2022-04-14 16:14:40,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {22122#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {22122#(< ~counter~0 92)} is VALID [2022-04-14 16:14:40,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {22147#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22122#(< ~counter~0 92)} is VALID [2022-04-14 16:14:40,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {22147#(< ~counter~0 91)} assume !!(0 != ~r~0); {22147#(< ~counter~0 91)} is VALID [2022-04-14 16:14:40,931 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21583#true} {22147#(< ~counter~0 91)} #94#return; {22147#(< ~counter~0 91)} is VALID [2022-04-14 16:14:40,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-14 16:14:40,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-14 16:14:40,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-14 16:14:40,931 INFO L272 TraceCheckUtils]: 19: Hoare triple {22147#(< ~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)); {21583#true} is VALID [2022-04-14 16:14:40,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {22147#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {22147#(< ~counter~0 91)} is VALID [2022-04-14 16:14:40,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {22172#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22147#(< ~counter~0 91)} is VALID [2022-04-14 16:14:40,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {22172#(< ~counter~0 90)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {22172#(< ~counter~0 90)} is VALID [2022-04-14 16:14:40,933 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21583#true} {22172#(< ~counter~0 90)} #92#return; {22172#(< ~counter~0 90)} is VALID [2022-04-14 16:14:40,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-14 16:14:40,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-14 16:14:40,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-14 16:14:40,933 INFO L272 TraceCheckUtils]: 11: Hoare triple {22172#(< ~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)); {21583#true} is VALID [2022-04-14 16:14:40,933 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21583#true} {22172#(< ~counter~0 90)} #90#return; {22172#(< ~counter~0 90)} is VALID [2022-04-14 16:14:40,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-14 16:14:40,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-14 16:14:40,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-14 16:14:40,934 INFO L272 TraceCheckUtils]: 6: Hoare triple {22172#(< ~counter~0 90)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21583#true} is VALID [2022-04-14 16:14:40,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {22172#(< ~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; {22172#(< ~counter~0 90)} is VALID [2022-04-14 16:14:40,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {22172#(< ~counter~0 90)} call #t~ret9 := main(); {22172#(< ~counter~0 90)} is VALID [2022-04-14 16:14:40,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22172#(< ~counter~0 90)} {21583#true} #102#return; {22172#(< ~counter~0 90)} is VALID [2022-04-14 16:14:40,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {22172#(< ~counter~0 90)} assume true; {22172#(< ~counter~0 90)} is VALID [2022-04-14 16:14:40,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {21583#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22172#(< ~counter~0 90)} is VALID [2022-04-14 16:14:40,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {21583#true} call ULTIMATE.init(); {21583#true} is VALID [2022-04-14 16:14:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-14 16:14:40,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:14:40,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654983547] [2022-04-14 16:14:40,949 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:14:40,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913098785] [2022-04-14 16:14:40,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913098785] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:14:40,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:14:40,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-14 16:14:40,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291252686] [2022-04-14 16:14:40,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:14:40,950 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) Word has length 103 [2022-04-14 16:14:40,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:14:40,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-14 16:14:41,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:41,059 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-14 16:14:41,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:14:41,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-14 16:14:41,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-14 16:14:41,060 INFO L87 Difference]: Start difference. First operand 814 states and 1063 transitions. Second operand has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-14 16:14:43,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:43,232 INFO L93 Difference]: Finished difference Result 937 states and 1235 transitions. [2022-04-14 16:14:43,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-14 16:14:43,233 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) Word has length 103 [2022-04-14 16:14:43,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:43,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-14 16:14:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 452 transitions. [2022-04-14 16:14:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-14 16:14:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 452 transitions. [2022-04-14 16:14:43,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 452 transitions. [2022-04-14 16:14:43,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:43,590 INFO L225 Difference]: With dead ends: 937 [2022-04-14 16:14:43,590 INFO L226 Difference]: Without dead ends: 932 [2022-04-14 16:14:43,591 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=670, Invalid=1222, Unknown=0, NotChecked=0, Total=1892 [2022-04-14 16:14:43,591 INFO L913 BasicCegarLoop]: 93 mSDtfsCounter, 467 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:43,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 455 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-14 16:14:43,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-04-14 16:14:44,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 916. [2022-04-14 16:14:44,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:44,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 932 states. Second operand has 916 states, 687 states have (on average 1.1834061135371179) internal successors, (813), 693 states have internal predecessors, (813), 186 states have call successors, (186), 44 states have call predecessors, (186), 42 states have return successors, (184), 178 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-14 16:14:44,117 INFO L74 IsIncluded]: Start isIncluded. First operand 932 states. Second operand has 916 states, 687 states have (on average 1.1834061135371179) internal successors, (813), 693 states have internal predecessors, (813), 186 states have call successors, (186), 44 states have call predecessors, (186), 42 states have return successors, (184), 178 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-14 16:14:44,118 INFO L87 Difference]: Start difference. First operand 932 states. Second operand has 916 states, 687 states have (on average 1.1834061135371179) internal successors, (813), 693 states have internal predecessors, (813), 186 states have call successors, (186), 44 states have call predecessors, (186), 42 states have return successors, (184), 178 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-14 16:14:44,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:44,145 INFO L93 Difference]: Finished difference Result 932 states and 1203 transitions. [2022-04-14 16:14:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1203 transitions. [2022-04-14 16:14:44,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:44,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:44,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 916 states, 687 states have (on average 1.1834061135371179) internal successors, (813), 693 states have internal predecessors, (813), 186 states have call successors, (186), 44 states have call predecessors, (186), 42 states have return successors, (184), 178 states have call predecessors, (184), 184 states have call successors, (184) Second operand 932 states. [2022-04-14 16:14:44,149 INFO L87 Difference]: Start difference. First operand has 916 states, 687 states have (on average 1.1834061135371179) internal successors, (813), 693 states have internal predecessors, (813), 186 states have call successors, (186), 44 states have call predecessors, (186), 42 states have return successors, (184), 178 states have call predecessors, (184), 184 states have call successors, (184) Second operand 932 states. [2022-04-14 16:14:44,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:44,175 INFO L93 Difference]: Finished difference Result 932 states and 1203 transitions. [2022-04-14 16:14:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1203 transitions. [2022-04-14 16:14:44,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:44,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:44,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:44,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 687 states have (on average 1.1834061135371179) internal successors, (813), 693 states have internal predecessors, (813), 186 states have call successors, (186), 44 states have call predecessors, (186), 42 states have return successors, (184), 178 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-14 16:14:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1183 transitions. [2022-04-14 16:14:44,211 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1183 transitions. Word has length 103 [2022-04-14 16:14:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:44,211 INFO L478 AbstractCegarLoop]: Abstraction has 916 states and 1183 transitions. [2022-04-14 16:14:44,211 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-14 16:14:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1183 transitions. [2022-04-14 16:14:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-04-14 16:14:44,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:44,214 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 19, 9, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:14:44,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-14 16:14:44,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:44,427 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:44,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:44,428 INFO L85 PathProgramCache]: Analyzing trace with hash -599363247, now seen corresponding path program 3 times [2022-04-14 16:14:44,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:44,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932509924] [2022-04-14 16:14:44,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:44,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:44,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:44,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1441176838] [2022-04-14 16:14:44,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 16:14:44,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:44,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:44,451 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:14:44,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-14 16:14:44,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-14 16:14:44,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:14:44,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-14 16:14:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:44,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:14:44,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {26697#true} call ULTIMATE.init(); {26697#true} is VALID [2022-04-14 16:14:44,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {26697#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26697#true} is VALID [2022-04-14 16:14:44,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26697#true} {26697#true} #102#return; {26697#true} is VALID [2022-04-14 16:14:44,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {26697#true} call #t~ret9 := main(); {26697#true} is VALID [2022-04-14 16:14:44,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {26697#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {26697#true} is VALID [2022-04-14 16:14:44,851 INFO L272 TraceCheckUtils]: 6: Hoare triple {26697#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,851 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26697#true} {26697#true} #90#return; {26697#true} is VALID [2022-04-14 16:14:44,851 INFO L272 TraceCheckUtils]: 11: Hoare triple {26697#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,851 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26697#true} {26697#true} #92#return; {26697#true} is VALID [2022-04-14 16:14:44,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {26697#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26697#true} is VALID [2022-04-14 16:14:44,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {26697#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {26697#true} assume !!(#t~post6 < 100);havoc #t~post6; {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L272 TraceCheckUtils]: 19: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26697#true} {26697#true} #94#return; {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {26697#true} assume !!(0 != ~r~0); {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {26697#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {26697#true} assume !!(#t~post7 < 100);havoc #t~post7; {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L272 TraceCheckUtils]: 27: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26697#true} {26697#true} #96#return; {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {26697#true} assume !(~r~0 > 0); {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {26697#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26697#true} is VALID [2022-04-14 16:14:44,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {26697#true} assume !!(#t~post8 < 100);havoc #t~post8; {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L272 TraceCheckUtils]: 35: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L290 TraceCheckUtils]: 38: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26697#true} {26697#true} #98#return; {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L290 TraceCheckUtils]: 40: Hoare triple {26697#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {26697#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {26697#true} assume !!(#t~post8 < 100);havoc #t~post8; {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L272 TraceCheckUtils]: 43: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26697#true} {26697#true} #98#return; {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L290 TraceCheckUtils]: 48: Hoare triple {26697#true} assume !(~r~0 < 0); {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {26697#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L290 TraceCheckUtils]: 50: Hoare triple {26697#true} assume !!(#t~post6 < 100);havoc #t~post6; {26697#true} is VALID [2022-04-14 16:14:44,853 INFO L272 TraceCheckUtils]: 51: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L290 TraceCheckUtils]: 52: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L290 TraceCheckUtils]: 53: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L290 TraceCheckUtils]: 54: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26697#true} {26697#true} #94#return; {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L290 TraceCheckUtils]: 56: Hoare triple {26697#true} assume !!(0 != ~r~0); {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L290 TraceCheckUtils]: 57: Hoare triple {26697#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L290 TraceCheckUtils]: 58: Hoare triple {26697#true} assume !!(#t~post7 < 100);havoc #t~post7; {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L272 TraceCheckUtils]: 59: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L290 TraceCheckUtils]: 60: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L290 TraceCheckUtils]: 62: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26697#true} {26697#true} #96#return; {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L290 TraceCheckUtils]: 64: Hoare triple {26697#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L290 TraceCheckUtils]: 65: Hoare triple {26697#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L290 TraceCheckUtils]: 66: Hoare triple {26697#true} assume !!(#t~post7 < 100);havoc #t~post7; {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L272 TraceCheckUtils]: 67: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,854 INFO L290 TraceCheckUtils]: 68: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L290 TraceCheckUtils]: 69: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L290 TraceCheckUtils]: 70: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26697#true} {26697#true} #96#return; {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L290 TraceCheckUtils]: 72: Hoare triple {26697#true} assume !(~r~0 > 0); {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L290 TraceCheckUtils]: 73: Hoare triple {26697#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L290 TraceCheckUtils]: 74: Hoare triple {26697#true} assume !!(#t~post8 < 100);havoc #t~post8; {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L272 TraceCheckUtils]: 75: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L290 TraceCheckUtils]: 76: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L290 TraceCheckUtils]: 77: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L290 TraceCheckUtils]: 78: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26697#true} {26697#true} #98#return; {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L290 TraceCheckUtils]: 80: Hoare triple {26697#true} assume !(~r~0 < 0); {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L290 TraceCheckUtils]: 81: Hoare triple {26697#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L290 TraceCheckUtils]: 82: Hoare triple {26697#true} assume !!(#t~post6 < 100);havoc #t~post6; {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L272 TraceCheckUtils]: 83: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L290 TraceCheckUtils]: 84: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,855 INFO L290 TraceCheckUtils]: 85: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L290 TraceCheckUtils]: 86: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {26697#true} {26697#true} #94#return; {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L290 TraceCheckUtils]: 88: Hoare triple {26697#true} assume !!(0 != ~r~0); {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L290 TraceCheckUtils]: 89: Hoare triple {26697#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L290 TraceCheckUtils]: 90: Hoare triple {26697#true} assume !!(#t~post7 < 100);havoc #t~post7; {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L272 TraceCheckUtils]: 91: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L290 TraceCheckUtils]: 92: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L290 TraceCheckUtils]: 93: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L290 TraceCheckUtils]: 94: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {26697#true} {26697#true} #96#return; {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L290 TraceCheckUtils]: 96: Hoare triple {26697#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L290 TraceCheckUtils]: 97: Hoare triple {26697#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L290 TraceCheckUtils]: 98: Hoare triple {26697#true} assume !!(#t~post7 < 100);havoc #t~post7; {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L272 TraceCheckUtils]: 99: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L290 TraceCheckUtils]: 100: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L290 TraceCheckUtils]: 101: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,856 INFO L290 TraceCheckUtils]: 102: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {26697#true} {26697#true} #96#return; {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L290 TraceCheckUtils]: 104: Hoare triple {26697#true} assume !(~r~0 > 0); {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L290 TraceCheckUtils]: 105: Hoare triple {26697#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L290 TraceCheckUtils]: 106: Hoare triple {26697#true} assume !!(#t~post8 < 100);havoc #t~post8; {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L272 TraceCheckUtils]: 107: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L290 TraceCheckUtils]: 108: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L290 TraceCheckUtils]: 109: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L290 TraceCheckUtils]: 110: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {26697#true} {26697#true} #98#return; {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L290 TraceCheckUtils]: 112: Hoare triple {26697#true} assume !(~r~0 < 0); {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L290 TraceCheckUtils]: 113: Hoare triple {26697#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L290 TraceCheckUtils]: 114: Hoare triple {26697#true} assume !!(#t~post6 < 100);havoc #t~post6; {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L272 TraceCheckUtils]: 115: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L290 TraceCheckUtils]: 116: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L290 TraceCheckUtils]: 117: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L290 TraceCheckUtils]: 118: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,857 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {26697#true} {26697#true} #94#return; {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L290 TraceCheckUtils]: 120: Hoare triple {26697#true} assume !!(0 != ~r~0); {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L290 TraceCheckUtils]: 121: Hoare triple {26697#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L290 TraceCheckUtils]: 122: Hoare triple {26697#true} assume !!(#t~post7 < 100);havoc #t~post7; {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L272 TraceCheckUtils]: 123: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L290 TraceCheckUtils]: 124: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L290 TraceCheckUtils]: 125: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L290 TraceCheckUtils]: 126: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {26697#true} {26697#true} #96#return; {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L290 TraceCheckUtils]: 128: Hoare triple {26697#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L290 TraceCheckUtils]: 129: Hoare triple {26697#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L290 TraceCheckUtils]: 130: Hoare triple {26697#true} assume !!(#t~post7 < 100);havoc #t~post7; {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L272 TraceCheckUtils]: 131: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L290 TraceCheckUtils]: 132: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L290 TraceCheckUtils]: 133: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L290 TraceCheckUtils]: 134: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {26697#true} {26697#true} #96#return; {26697#true} is VALID [2022-04-14 16:14:44,858 INFO L290 TraceCheckUtils]: 136: Hoare triple {26697#true} assume !(~r~0 > 0); {26697#true} is VALID [2022-04-14 16:14:44,859 INFO L290 TraceCheckUtils]: 137: Hoare triple {26697#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26697#true} is VALID [2022-04-14 16:14:44,859 INFO L290 TraceCheckUtils]: 138: Hoare triple {26697#true} assume !!(#t~post8 < 100);havoc #t~post8; {26697#true} is VALID [2022-04-14 16:14:44,859 INFO L272 TraceCheckUtils]: 139: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,859 INFO L290 TraceCheckUtils]: 140: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,859 INFO L290 TraceCheckUtils]: 141: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,859 INFO L290 TraceCheckUtils]: 142: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,859 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {26697#true} {26697#true} #98#return; {26697#true} is VALID [2022-04-14 16:14:44,859 INFO L290 TraceCheckUtils]: 144: Hoare triple {26697#true} assume !(~r~0 < 0); {26697#true} is VALID [2022-04-14 16:14:44,859 INFO L290 TraceCheckUtils]: 145: Hoare triple {26697#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26697#true} is VALID [2022-04-14 16:14:44,859 INFO L290 TraceCheckUtils]: 146: Hoare triple {26697#true} assume !!(#t~post6 < 100);havoc #t~post6; {26697#true} is VALID [2022-04-14 16:14:44,859 INFO L272 TraceCheckUtils]: 147: Hoare triple {26697#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26697#true} is VALID [2022-04-14 16:14:44,859 INFO L290 TraceCheckUtils]: 148: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-14 16:14:44,859 INFO L290 TraceCheckUtils]: 149: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-14 16:14:44,859 INFO L290 TraceCheckUtils]: 150: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-14 16:14:44,859 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {26697#true} {26697#true} #94#return; {26697#true} is VALID [2022-04-14 16:14:44,859 INFO L290 TraceCheckUtils]: 152: Hoare triple {26697#true} assume !!(0 != ~r~0); {26697#true} is VALID [2022-04-14 16:14:44,863 INFO L290 TraceCheckUtils]: 153: Hoare triple {26697#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27161#(<= (+ |main_#t~post7| 1) ~counter~0)} is VALID [2022-04-14 16:14:44,864 INFO L290 TraceCheckUtils]: 154: Hoare triple {27161#(<= (+ |main_#t~post7| 1) ~counter~0)} assume !(#t~post7 < 100);havoc #t~post7; {27165#(<= 101 ~counter~0)} is VALID [2022-04-14 16:14:44,864 INFO L290 TraceCheckUtils]: 155: Hoare triple {27165#(<= 101 ~counter~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {27169#(<= 102 ~counter~0)} is VALID [2022-04-14 16:14:44,865 INFO L290 TraceCheckUtils]: 156: Hoare triple {27169#(<= 102 ~counter~0)} assume !!(#t~post8 < 100);havoc #t~post8; {27169#(<= 102 ~counter~0)} is VALID [2022-04-14 16:14:44,865 INFO L272 TraceCheckUtils]: 157: Hoare triple {27169#(<= 102 ~counter~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {27169#(<= 102 ~counter~0)} is VALID [2022-04-14 16:14:44,865 INFO L290 TraceCheckUtils]: 158: Hoare triple {27169#(<= 102 ~counter~0)} ~cond := #in~cond; {27169#(<= 102 ~counter~0)} is VALID [2022-04-14 16:14:44,866 INFO L290 TraceCheckUtils]: 159: Hoare triple {27169#(<= 102 ~counter~0)} assume !(0 == ~cond); {27169#(<= 102 ~counter~0)} is VALID [2022-04-14 16:14:44,866 INFO L290 TraceCheckUtils]: 160: Hoare triple {27169#(<= 102 ~counter~0)} assume true; {27169#(<= 102 ~counter~0)} is VALID [2022-04-14 16:14:44,866 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {27169#(<= 102 ~counter~0)} {27169#(<= 102 ~counter~0)} #98#return; {27169#(<= 102 ~counter~0)} is VALID [2022-04-14 16:14:44,867 INFO L290 TraceCheckUtils]: 162: Hoare triple {27169#(<= 102 ~counter~0)} assume !(~r~0 < 0); {27169#(<= 102 ~counter~0)} is VALID [2022-04-14 16:14:44,867 INFO L290 TraceCheckUtils]: 163: Hoare triple {27169#(<= 102 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27194#(<= 102 |main_#t~post6|)} is VALID [2022-04-14 16:14:44,867 INFO L290 TraceCheckUtils]: 164: Hoare triple {27194#(<= 102 |main_#t~post6|)} assume !!(#t~post6 < 100);havoc #t~post6; {26698#false} is VALID [2022-04-14 16:14:44,867 INFO L272 TraceCheckUtils]: 165: Hoare triple {26698#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26698#false} is VALID [2022-04-14 16:14:44,867 INFO L290 TraceCheckUtils]: 166: Hoare triple {26698#false} ~cond := #in~cond; {26698#false} is VALID [2022-04-14 16:14:44,867 INFO L290 TraceCheckUtils]: 167: Hoare triple {26698#false} assume !(0 == ~cond); {26698#false} is VALID [2022-04-14 16:14:44,868 INFO L290 TraceCheckUtils]: 168: Hoare triple {26698#false} assume true; {26698#false} is VALID [2022-04-14 16:14:44,868 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {26698#false} {26698#false} #94#return; {26698#false} is VALID [2022-04-14 16:14:44,868 INFO L290 TraceCheckUtils]: 170: Hoare triple {26698#false} assume !!(0 != ~r~0); {26698#false} is VALID [2022-04-14 16:14:44,868 INFO L290 TraceCheckUtils]: 171: Hoare triple {26698#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26698#false} is VALID [2022-04-14 16:14:44,868 INFO L290 TraceCheckUtils]: 172: Hoare triple {26698#false} assume !(#t~post7 < 100);havoc #t~post7; {26698#false} is VALID [2022-04-14 16:14:44,868 INFO L290 TraceCheckUtils]: 173: Hoare triple {26698#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26698#false} is VALID [2022-04-14 16:14:44,868 INFO L290 TraceCheckUtils]: 174: Hoare triple {26698#false} assume !(#t~post8 < 100);havoc #t~post8; {26698#false} is VALID [2022-04-14 16:14:44,868 INFO L290 TraceCheckUtils]: 175: Hoare triple {26698#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26698#false} is VALID [2022-04-14 16:14:44,868 INFO L290 TraceCheckUtils]: 176: Hoare triple {26698#false} assume !(#t~post6 < 100);havoc #t~post6; {26698#false} is VALID [2022-04-14 16:14:44,868 INFO L272 TraceCheckUtils]: 177: Hoare triple {26698#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26698#false} is VALID [2022-04-14 16:14:44,868 INFO L290 TraceCheckUtils]: 178: Hoare triple {26698#false} ~cond := #in~cond; {26698#false} is VALID [2022-04-14 16:14:44,868 INFO L290 TraceCheckUtils]: 179: Hoare triple {26698#false} assume 0 == ~cond; {26698#false} is VALID [2022-04-14 16:14:44,868 INFO L290 TraceCheckUtils]: 180: Hoare triple {26698#false} assume !false; {26698#false} is VALID [2022-04-14 16:14:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2022-04-14 16:14:44,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:14:44,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:14:44,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932509924] [2022-04-14 16:14:44,869 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:14:44,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441176838] [2022-04-14 16:14:44,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441176838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:14:44,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:14:44,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 16:14:44,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877748186] [2022-04-14 16:14:44,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:14:44,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 181 [2022-04-14 16:14:44,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:14:44,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-14 16:14:44,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:44,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 16:14:44,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:14:44,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 16:14:44,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-14 16:14:44,904 INFO L87 Difference]: Start difference. First operand 916 states and 1183 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-14 16:14:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:45,671 INFO L93 Difference]: Finished difference Result 1223 states and 1589 transitions. [2022-04-14 16:14:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 16:14:45,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 181 [2022-04-14 16:14:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-14 16:14:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-14 16:14:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-14 16:14:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-14 16:14:45,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2022-04-14 16:14:45,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:45,759 INFO L225 Difference]: With dead ends: 1223 [2022-04-14 16:14:45,759 INFO L226 Difference]: Without dead ends: 986 [2022-04-14 16:14:45,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-14 16:14:45,762 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:45,763 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 194 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:14:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2022-04-14 16:14:46,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 947. [2022-04-14 16:14:46,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:46,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 986 states. Second operand has 947 states, 711 states have (on average 1.1631504922644162) internal successors, (827), 718 states have internal predecessors, (827), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 179 states have call predecessors, (186), 186 states have call successors, (186) [2022-04-14 16:14:46,279 INFO L74 IsIncluded]: Start isIncluded. First operand 986 states. Second operand has 947 states, 711 states have (on average 1.1631504922644162) internal successors, (827), 718 states have internal predecessors, (827), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 179 states have call predecessors, (186), 186 states have call successors, (186) [2022-04-14 16:14:46,280 INFO L87 Difference]: Start difference. First operand 986 states. Second operand has 947 states, 711 states have (on average 1.1631504922644162) internal successors, (827), 718 states have internal predecessors, (827), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 179 states have call predecessors, (186), 186 states have call successors, (186) [2022-04-14 16:14:46,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:46,308 INFO L93 Difference]: Finished difference Result 986 states and 1246 transitions. [2022-04-14 16:14:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1246 transitions. [2022-04-14 16:14:46,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:46,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:46,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 947 states, 711 states have (on average 1.1631504922644162) internal successors, (827), 718 states have internal predecessors, (827), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 179 states have call predecessors, (186), 186 states have call successors, (186) Second operand 986 states. [2022-04-14 16:14:46,313 INFO L87 Difference]: Start difference. First operand has 947 states, 711 states have (on average 1.1631504922644162) internal successors, (827), 718 states have internal predecessors, (827), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 179 states have call predecessors, (186), 186 states have call successors, (186) Second operand 986 states. [2022-04-14 16:14:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:46,341 INFO L93 Difference]: Finished difference Result 986 states and 1246 transitions. [2022-04-14 16:14:46,341 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1246 transitions. [2022-04-14 16:14:46,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:46,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:46,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:46,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:46,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 711 states have (on average 1.1631504922644162) internal successors, (827), 718 states have internal predecessors, (827), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 179 states have call predecessors, (186), 186 states have call successors, (186) [2022-04-14 16:14:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1201 transitions. [2022-04-14 16:14:46,377 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1201 transitions. Word has length 181 [2022-04-14 16:14:46,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:46,378 INFO L478 AbstractCegarLoop]: Abstraction has 947 states and 1201 transitions. [2022-04-14 16:14:46,378 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-14 16:14:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1201 transitions. [2022-04-14 16:14:46,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-14 16:14:46,380 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:46,380 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 9, 8, 8, 8, 8, 7, 7, 7, 6, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:14:46,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-14 16:14:46,593 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-14 16:14:46,593 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:46,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1408642227, now seen corresponding path program 4 times [2022-04-14 16:14:46,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:46,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259197244] [2022-04-14 16:14:46,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:46,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:46,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:46,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533184317] [2022-04-14 16:14:46,615 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 16:14:46,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:46,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:46,616 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:14:46,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-14 16:14:46,688 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 16:14:46,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:14:46,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjunts are in the unsatisfiable core [2022-04-14 16:14:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:46,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:14:46,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {32222#true} call ULTIMATE.init(); {32222#true} is VALID [2022-04-14 16:14:46,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {32222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32222#true} is VALID [2022-04-14 16:14:46,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-14 16:14:46,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32222#true} {32222#true} #102#return; {32222#true} is VALID [2022-04-14 16:14:46,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {32222#true} call #t~ret9 := main(); {32222#true} is VALID [2022-04-14 16:14:46,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {32222#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {32222#true} is VALID [2022-04-14 16:14:46,973 INFO L272 TraceCheckUtils]: 6: Hoare triple {32222#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {32222#true} is VALID [2022-04-14 16:14:46,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-14 16:14:46,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-14 16:14:46,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-14 16:14:46,973 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32222#true} {32222#true} #90#return; {32222#true} is VALID [2022-04-14 16:14:46,973 INFO L272 TraceCheckUtils]: 11: Hoare triple {32222#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {32222#true} is VALID [2022-04-14 16:14:46,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-14 16:14:46,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-14 16:14:46,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-14 16:14:46,973 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32222#true} {32222#true} #92#return; {32222#true} is VALID [2022-04-14 16:14:46,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {32222#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {32222#true} is VALID [2022-04-14 16:14:46,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {32222#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32222#true} is VALID [2022-04-14 16:14:46,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {32222#true} assume !!(#t~post6 < 100);havoc #t~post6; {32222#true} is VALID [2022-04-14 16:14:46,973 INFO L272 TraceCheckUtils]: 19: Hoare triple {32222#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32222#true} is VALID [2022-04-14 16:14:46,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-14 16:14:46,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {32222#true} {32222#true} #94#return; {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {32222#true} assume !!(0 != ~r~0); {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {32222#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {32222#true} assume !!(#t~post7 < 100);havoc #t~post7; {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L272 TraceCheckUtils]: 27: Hoare triple {32222#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {32222#true} {32222#true} #96#return; {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {32222#true} assume !(~r~0 > 0); {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {32222#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {32222#true} assume !!(#t~post8 < 100);havoc #t~post8; {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L272 TraceCheckUtils]: 35: Hoare triple {32222#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-14 16:14:46,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {32222#true} {32222#true} #98#return; {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {32222#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {32222#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {32222#true} assume !!(#t~post8 < 100);havoc #t~post8; {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L272 TraceCheckUtils]: 43: Hoare triple {32222#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {32222#true} {32222#true} #98#return; {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {32222#true} assume !(~r~0 < 0); {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {32222#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L290 TraceCheckUtils]: 50: Hoare triple {32222#true} assume !!(#t~post6 < 100);havoc #t~post6; {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L272 TraceCheckUtils]: 51: Hoare triple {32222#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L290 TraceCheckUtils]: 52: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L290 TraceCheckUtils]: 53: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L290 TraceCheckUtils]: 54: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-14 16:14:46,975 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {32222#true} {32222#true} #94#return; {32222#true} is VALID [2022-04-14 16:14:46,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {32222#true} assume !!(0 != ~r~0); {32222#true} is VALID [2022-04-14 16:14:46,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {32222#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32222#true} is VALID [2022-04-14 16:14:46,976 INFO L290 TraceCheckUtils]: 58: Hoare triple {32222#true} assume !!(#t~post7 < 100);havoc #t~post7; {32222#true} is VALID [2022-04-14 16:14:46,976 INFO L272 TraceCheckUtils]: 59: Hoare triple {32222#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32222#true} is VALID [2022-04-14 16:14:46,976 INFO L290 TraceCheckUtils]: 60: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-14 16:14:46,976 INFO L290 TraceCheckUtils]: 61: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-14 16:14:46,976 INFO L290 TraceCheckUtils]: 62: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-14 16:14:46,976 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {32222#true} {32222#true} #96#return; {32222#true} is VALID [2022-04-14 16:14:46,976 INFO L290 TraceCheckUtils]: 64: Hoare triple {32222#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32222#true} is VALID [2022-04-14 16:14:46,976 INFO L290 TraceCheckUtils]: 65: Hoare triple {32222#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32222#true} is VALID [2022-04-14 16:14:46,976 INFO L290 TraceCheckUtils]: 66: Hoare triple {32222#true} assume !!(#t~post7 < 100);havoc #t~post7; {32222#true} is VALID [2022-04-14 16:14:46,976 INFO L272 TraceCheckUtils]: 67: Hoare triple {32222#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32222#true} is VALID [2022-04-14 16:14:46,976 INFO L290 TraceCheckUtils]: 68: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-14 16:14:46,976 INFO L290 TraceCheckUtils]: 69: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-14 16:14:46,976 INFO L290 TraceCheckUtils]: 70: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-14 16:14:46,976 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32222#true} {32222#true} #96#return; {32222#true} is VALID [2022-04-14 16:14:46,977 INFO L290 TraceCheckUtils]: 72: Hoare triple {32222#true} assume !(~r~0 > 0); {32443#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:14:46,977 INFO L290 TraceCheckUtils]: 73: Hoare triple {32443#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:14:46,977 INFO L290 TraceCheckUtils]: 74: Hoare triple {32443#(not (< 0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:14:46,977 INFO L272 TraceCheckUtils]: 75: Hoare triple {32443#(not (< 0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32222#true} is VALID [2022-04-14 16:14:46,977 INFO L290 TraceCheckUtils]: 76: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-14 16:14:46,977 INFO L290 TraceCheckUtils]: 77: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-14 16:14:46,977 INFO L290 TraceCheckUtils]: 78: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-14 16:14:46,978 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {32222#true} {32443#(not (< 0 main_~r~0))} #98#return; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:14:46,978 INFO L290 TraceCheckUtils]: 80: Hoare triple {32443#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {32443#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:14:46,978 INFO L290 TraceCheckUtils]: 81: Hoare triple {32443#(not (< 0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:14:46,978 INFO L290 TraceCheckUtils]: 82: Hoare triple {32443#(not (< 0 main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:14:46,978 INFO L272 TraceCheckUtils]: 83: Hoare triple {32443#(not (< 0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32222#true} is VALID [2022-04-14 16:14:46,978 INFO L290 TraceCheckUtils]: 84: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-14 16:14:46,979 INFO L290 TraceCheckUtils]: 85: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-14 16:14:46,979 INFO L290 TraceCheckUtils]: 86: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-14 16:14:46,979 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32222#true} {32443#(not (< 0 main_~r~0))} #94#return; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:14:46,979 INFO L290 TraceCheckUtils]: 88: Hoare triple {32443#(not (< 0 main_~r~0))} assume !!(0 != ~r~0); {32443#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:14:46,979 INFO L290 TraceCheckUtils]: 89: Hoare triple {32443#(not (< 0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:14:46,980 INFO L290 TraceCheckUtils]: 90: Hoare triple {32443#(not (< 0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:14:46,980 INFO L272 TraceCheckUtils]: 91: Hoare triple {32443#(not (< 0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32222#true} is VALID [2022-04-14 16:14:46,980 INFO L290 TraceCheckUtils]: 92: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-14 16:14:46,980 INFO L290 TraceCheckUtils]: 93: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-14 16:14:46,980 INFO L290 TraceCheckUtils]: 94: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-14 16:14:46,980 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {32222#true} {32443#(not (< 0 main_~r~0))} #96#return; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:14:46,980 INFO L290 TraceCheckUtils]: 96: Hoare triple {32443#(not (< 0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32223#false} is VALID [2022-04-14 16:14:46,980 INFO L290 TraceCheckUtils]: 97: Hoare triple {32223#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32223#false} is VALID [2022-04-14 16:14:46,980 INFO L290 TraceCheckUtils]: 98: Hoare triple {32223#false} assume !!(#t~post7 < 100);havoc #t~post7; {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L272 TraceCheckUtils]: 99: Hoare triple {32223#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L290 TraceCheckUtils]: 100: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L290 TraceCheckUtils]: 101: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L290 TraceCheckUtils]: 102: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {32223#false} {32223#false} #96#return; {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L290 TraceCheckUtils]: 104: Hoare triple {32223#false} assume !(~r~0 > 0); {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L290 TraceCheckUtils]: 105: Hoare triple {32223#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L290 TraceCheckUtils]: 106: Hoare triple {32223#false} assume !!(#t~post8 < 100);havoc #t~post8; {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L272 TraceCheckUtils]: 107: Hoare triple {32223#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L290 TraceCheckUtils]: 108: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L290 TraceCheckUtils]: 109: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L290 TraceCheckUtils]: 110: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {32223#false} {32223#false} #98#return; {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L290 TraceCheckUtils]: 112: Hoare triple {32223#false} assume !(~r~0 < 0); {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L290 TraceCheckUtils]: 113: Hoare triple {32223#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L290 TraceCheckUtils]: 114: Hoare triple {32223#false} assume !!(#t~post6 < 100);havoc #t~post6; {32223#false} is VALID [2022-04-14 16:14:46,981 INFO L272 TraceCheckUtils]: 115: Hoare triple {32223#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32223#false} is VALID [2022-04-14 16:14:46,982 INFO L290 TraceCheckUtils]: 116: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-14 16:14:46,982 INFO L290 TraceCheckUtils]: 117: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-14 16:14:46,982 INFO L290 TraceCheckUtils]: 118: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-14 16:14:46,982 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {32223#false} {32223#false} #94#return; {32223#false} is VALID [2022-04-14 16:14:46,982 INFO L290 TraceCheckUtils]: 120: Hoare triple {32223#false} assume !!(0 != ~r~0); {32223#false} is VALID [2022-04-14 16:14:46,982 INFO L290 TraceCheckUtils]: 121: Hoare triple {32223#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32223#false} is VALID [2022-04-14 16:14:46,982 INFO L290 TraceCheckUtils]: 122: Hoare triple {32223#false} assume !!(#t~post7 < 100);havoc #t~post7; {32223#false} is VALID [2022-04-14 16:14:46,982 INFO L272 TraceCheckUtils]: 123: Hoare triple {32223#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32223#false} is VALID [2022-04-14 16:14:46,982 INFO L290 TraceCheckUtils]: 124: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-14 16:14:46,982 INFO L290 TraceCheckUtils]: 125: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-14 16:14:46,982 INFO L290 TraceCheckUtils]: 126: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-14 16:14:46,982 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {32223#false} {32223#false} #96#return; {32223#false} is VALID [2022-04-14 16:14:46,982 INFO L290 TraceCheckUtils]: 128: Hoare triple {32223#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32223#false} is VALID [2022-04-14 16:14:46,982 INFO L290 TraceCheckUtils]: 129: Hoare triple {32223#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32223#false} is VALID [2022-04-14 16:14:46,982 INFO L290 TraceCheckUtils]: 130: Hoare triple {32223#false} assume !!(#t~post7 < 100);havoc #t~post7; {32223#false} is VALID [2022-04-14 16:14:46,983 INFO L272 TraceCheckUtils]: 131: Hoare triple {32223#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32223#false} is VALID [2022-04-14 16:14:46,983 INFO L290 TraceCheckUtils]: 132: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-14 16:14:46,983 INFO L290 TraceCheckUtils]: 133: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-14 16:14:46,983 INFO L290 TraceCheckUtils]: 134: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-14 16:14:46,983 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {32223#false} {32223#false} #96#return; {32223#false} is VALID [2022-04-14 16:14:46,983 INFO L290 TraceCheckUtils]: 136: Hoare triple {32223#false} assume !(~r~0 > 0); {32223#false} is VALID [2022-04-14 16:14:46,983 INFO L290 TraceCheckUtils]: 137: Hoare triple {32223#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32223#false} is VALID [2022-04-14 16:14:46,983 INFO L290 TraceCheckUtils]: 138: Hoare triple {32223#false} assume !!(#t~post8 < 100);havoc #t~post8; {32223#false} is VALID [2022-04-14 16:14:46,983 INFO L272 TraceCheckUtils]: 139: Hoare triple {32223#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32223#false} is VALID [2022-04-14 16:14:46,983 INFO L290 TraceCheckUtils]: 140: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-14 16:14:46,983 INFO L290 TraceCheckUtils]: 141: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-14 16:14:46,983 INFO L290 TraceCheckUtils]: 142: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {32223#false} {32223#false} #98#return; {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L290 TraceCheckUtils]: 144: Hoare triple {32223#false} assume !(~r~0 < 0); {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L290 TraceCheckUtils]: 145: Hoare triple {32223#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L290 TraceCheckUtils]: 146: Hoare triple {32223#false} assume !!(#t~post6 < 100);havoc #t~post6; {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L272 TraceCheckUtils]: 147: Hoare triple {32223#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L290 TraceCheckUtils]: 148: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L290 TraceCheckUtils]: 149: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L290 TraceCheckUtils]: 150: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {32223#false} {32223#false} #94#return; {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L290 TraceCheckUtils]: 152: Hoare triple {32223#false} assume !!(0 != ~r~0); {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L290 TraceCheckUtils]: 153: Hoare triple {32223#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L290 TraceCheckUtils]: 154: Hoare triple {32223#false} assume !!(#t~post7 < 100);havoc #t~post7; {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L272 TraceCheckUtils]: 155: Hoare triple {32223#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L290 TraceCheckUtils]: 156: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L290 TraceCheckUtils]: 157: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L290 TraceCheckUtils]: 158: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-14 16:14:46,984 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {32223#false} {32223#false} #96#return; {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L290 TraceCheckUtils]: 160: Hoare triple {32223#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L290 TraceCheckUtils]: 161: Hoare triple {32223#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L290 TraceCheckUtils]: 162: Hoare triple {32223#false} assume !(#t~post7 < 100);havoc #t~post7; {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L290 TraceCheckUtils]: 163: Hoare triple {32223#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L290 TraceCheckUtils]: 164: Hoare triple {32223#false} assume !!(#t~post8 < 100);havoc #t~post8; {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L272 TraceCheckUtils]: 165: Hoare triple {32223#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L290 TraceCheckUtils]: 166: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L290 TraceCheckUtils]: 167: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L290 TraceCheckUtils]: 168: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {32223#false} {32223#false} #98#return; {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L290 TraceCheckUtils]: 170: Hoare triple {32223#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L290 TraceCheckUtils]: 171: Hoare triple {32223#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L290 TraceCheckUtils]: 172: Hoare triple {32223#false} assume !!(#t~post8 < 100);havoc #t~post8; {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L272 TraceCheckUtils]: 173: Hoare triple {32223#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L290 TraceCheckUtils]: 174: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L290 TraceCheckUtils]: 175: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-14 16:14:46,985 INFO L290 TraceCheckUtils]: 176: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-14 16:14:46,986 INFO L284 TraceCheckUtils]: 177: Hoare quadruple {32223#false} {32223#false} #98#return; {32223#false} is VALID [2022-04-14 16:14:46,986 INFO L290 TraceCheckUtils]: 178: Hoare triple {32223#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32223#false} is VALID [2022-04-14 16:14:46,986 INFO L290 TraceCheckUtils]: 179: Hoare triple {32223#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32223#false} is VALID [2022-04-14 16:14:46,986 INFO L290 TraceCheckUtils]: 180: Hoare triple {32223#false} assume !(#t~post8 < 100);havoc #t~post8; {32223#false} is VALID [2022-04-14 16:14:46,986 INFO L290 TraceCheckUtils]: 181: Hoare triple {32223#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32223#false} is VALID [2022-04-14 16:14:46,986 INFO L290 TraceCheckUtils]: 182: Hoare triple {32223#false} assume !(#t~post6 < 100);havoc #t~post6; {32223#false} is VALID [2022-04-14 16:14:46,986 INFO L272 TraceCheckUtils]: 183: Hoare triple {32223#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32223#false} is VALID [2022-04-14 16:14:46,986 INFO L290 TraceCheckUtils]: 184: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-14 16:14:46,986 INFO L290 TraceCheckUtils]: 185: Hoare triple {32223#false} assume 0 == ~cond; {32223#false} is VALID [2022-04-14 16:14:46,986 INFO L290 TraceCheckUtils]: 186: Hoare triple {32223#false} assume !false; {32223#false} is VALID [2022-04-14 16:14:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2022-04-14 16:14:46,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:14:46,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:14:46,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259197244] [2022-04-14 16:14:46,987 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:14:46,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533184317] [2022-04-14 16:14:46,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533184317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:14:46,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:14:46,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 16:14:46,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287324793] [2022-04-14 16:14:46,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:14:46,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 187 [2022-04-14 16:14:46,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:14:46,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-14 16:14:47,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:47,040 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 16:14:47,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:14:47,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 16:14:47,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 16:14:47,041 INFO L87 Difference]: Start difference. First operand 947 states and 1201 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-14 16:14:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:47,837 INFO L93 Difference]: Finished difference Result 1548 states and 1989 transitions. [2022-04-14 16:14:47,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 16:14:47,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 187 [2022-04-14 16:14:47,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-14 16:14:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-04-14 16:14:47,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-14 16:14:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-04-14 16:14:47,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2022-04-14 16:14:47,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:47,930 INFO L225 Difference]: With dead ends: 1548 [2022-04-14 16:14:47,931 INFO L226 Difference]: Without dead ends: 1005 [2022-04-14 16:14:47,932 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 16:14:47,932 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 3 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:47,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:14:47,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2022-04-14 16:14:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 953. [2022-04-14 16:14:48,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:48,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1005 states. Second operand has 953 states, 717 states have (on average 1.1617852161785216) internal successors, (833), 726 states have internal predecessors, (833), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 177 states have call predecessors, (186), 186 states have call successors, (186) [2022-04-14 16:14:48,425 INFO L74 IsIncluded]: Start isIncluded. First operand 1005 states. Second operand has 953 states, 717 states have (on average 1.1617852161785216) internal successors, (833), 726 states have internal predecessors, (833), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 177 states have call predecessors, (186), 186 states have call successors, (186) [2022-04-14 16:14:48,426 INFO L87 Difference]: Start difference. First operand 1005 states. Second operand has 953 states, 717 states have (on average 1.1617852161785216) internal successors, (833), 726 states have internal predecessors, (833), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 177 states have call predecessors, (186), 186 states have call successors, (186) [2022-04-14 16:14:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:48,455 INFO L93 Difference]: Finished difference Result 1005 states and 1275 transitions. [2022-04-14 16:14:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1275 transitions. [2022-04-14 16:14:48,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:48,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:48,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 953 states, 717 states have (on average 1.1617852161785216) internal successors, (833), 726 states have internal predecessors, (833), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 177 states have call predecessors, (186), 186 states have call successors, (186) Second operand 1005 states. [2022-04-14 16:14:48,459 INFO L87 Difference]: Start difference. First operand has 953 states, 717 states have (on average 1.1617852161785216) internal successors, (833), 726 states have internal predecessors, (833), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 177 states have call predecessors, (186), 186 states have call successors, (186) Second operand 1005 states. [2022-04-14 16:14:48,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:48,488 INFO L93 Difference]: Finished difference Result 1005 states and 1275 transitions. [2022-04-14 16:14:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1275 transitions. [2022-04-14 16:14:48,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:48,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:48,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:48,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 717 states have (on average 1.1617852161785216) internal successors, (833), 726 states have internal predecessors, (833), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 177 states have call predecessors, (186), 186 states have call successors, (186) [2022-04-14 16:14:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1207 transitions. [2022-04-14 16:14:48,525 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1207 transitions. Word has length 187 [2022-04-14 16:14:48,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:48,525 INFO L478 AbstractCegarLoop]: Abstraction has 953 states and 1207 transitions. [2022-04-14 16:14:48,525 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-14 16:14:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1207 transitions. [2022-04-14 16:14:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-14 16:14:48,528 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:48,528 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 10, 9, 9, 9, 8, 7, 7, 7, 6, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:14:48,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-14 16:14:48,744 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-14 16:14:48,744 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:48,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:48,745 INFO L85 PathProgramCache]: Analyzing trace with hash -464040263, now seen corresponding path program 5 times [2022-04-14 16:14:48,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:48,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713486738] [2022-04-14 16:14:48,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:48,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:48,766 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:48,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2051406870] [2022-04-14 16:14:48,767 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-14 16:14:48,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:48,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:48,767 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:14:48,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-14 16:14:49,101 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-04-14 16:14:49,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:14:49,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-14 16:14:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:49,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:14:49,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {38259#true} call ULTIMATE.init(); {38259#true} is VALID [2022-04-14 16:14:49,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {38259#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38259#true} is VALID [2022-04-14 16:14:49,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38259#true} {38259#true} #102#return; {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {38259#true} call #t~ret9 := main(); {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {38259#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L272 TraceCheckUtils]: 6: Hoare triple {38259#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38259#true} {38259#true} #90#return; {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L272 TraceCheckUtils]: 11: Hoare triple {38259#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38259#true} {38259#true} #92#return; {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {38259#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {38259#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {38259#true} assume !!(#t~post6 < 100);havoc #t~post6; {38259#true} is VALID [2022-04-14 16:14:49,423 INFO L272 TraceCheckUtils]: 19: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {38259#true} {38259#true} #94#return; {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {38259#true} assume !!(0 != ~r~0); {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {38259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {38259#true} assume !!(#t~post7 < 100);havoc #t~post7; {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L272 TraceCheckUtils]: 27: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {38259#true} {38259#true} #96#return; {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {38259#true} assume !(~r~0 > 0); {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {38259#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {38259#true} assume !!(#t~post8 < 100);havoc #t~post8; {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L272 TraceCheckUtils]: 35: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {38259#true} {38259#true} #98#return; {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L290 TraceCheckUtils]: 40: Hoare triple {38259#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L290 TraceCheckUtils]: 41: Hoare triple {38259#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {38259#true} assume !!(#t~post8 < 100);havoc #t~post8; {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L272 TraceCheckUtils]: 43: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {38259#true} {38259#true} #98#return; {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L290 TraceCheckUtils]: 48: Hoare triple {38259#true} assume !(~r~0 < 0); {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L290 TraceCheckUtils]: 49: Hoare triple {38259#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L290 TraceCheckUtils]: 50: Hoare triple {38259#true} assume !!(#t~post6 < 100);havoc #t~post6; {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L272 TraceCheckUtils]: 51: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L290 TraceCheckUtils]: 52: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,425 INFO L290 TraceCheckUtils]: 53: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L290 TraceCheckUtils]: 54: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {38259#true} {38259#true} #94#return; {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L290 TraceCheckUtils]: 56: Hoare triple {38259#true} assume !!(0 != ~r~0); {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L290 TraceCheckUtils]: 57: Hoare triple {38259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L290 TraceCheckUtils]: 58: Hoare triple {38259#true} assume !!(#t~post7 < 100);havoc #t~post7; {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L272 TraceCheckUtils]: 59: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L290 TraceCheckUtils]: 60: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L290 TraceCheckUtils]: 61: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L290 TraceCheckUtils]: 62: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {38259#true} {38259#true} #96#return; {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L290 TraceCheckUtils]: 64: Hoare triple {38259#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L290 TraceCheckUtils]: 65: Hoare triple {38259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L290 TraceCheckUtils]: 66: Hoare triple {38259#true} assume !!(#t~post7 < 100);havoc #t~post7; {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L272 TraceCheckUtils]: 67: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L290 TraceCheckUtils]: 68: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L290 TraceCheckUtils]: 69: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,426 INFO L290 TraceCheckUtils]: 70: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,427 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {38259#true} {38259#true} #96#return; {38259#true} is VALID [2022-04-14 16:14:49,427 INFO L290 TraceCheckUtils]: 72: Hoare triple {38259#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38259#true} is VALID [2022-04-14 16:14:49,427 INFO L290 TraceCheckUtils]: 73: Hoare triple {38259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38259#true} is VALID [2022-04-14 16:14:49,427 INFO L290 TraceCheckUtils]: 74: Hoare triple {38259#true} assume !!(#t~post7 < 100);havoc #t~post7; {38259#true} is VALID [2022-04-14 16:14:49,427 INFO L272 TraceCheckUtils]: 75: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,427 INFO L290 TraceCheckUtils]: 76: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,427 INFO L290 TraceCheckUtils]: 77: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,427 INFO L290 TraceCheckUtils]: 78: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,427 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {38259#true} {38259#true} #96#return; {38259#true} is VALID [2022-04-14 16:14:49,427 INFO L290 TraceCheckUtils]: 80: Hoare triple {38259#true} assume !(~r~0 > 0); {38259#true} is VALID [2022-04-14 16:14:49,427 INFO L290 TraceCheckUtils]: 81: Hoare triple {38259#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38259#true} is VALID [2022-04-14 16:14:49,427 INFO L290 TraceCheckUtils]: 82: Hoare triple {38259#true} assume !!(#t~post8 < 100);havoc #t~post8; {38259#true} is VALID [2022-04-14 16:14:49,427 INFO L272 TraceCheckUtils]: 83: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,427 INFO L290 TraceCheckUtils]: 84: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,427 INFO L290 TraceCheckUtils]: 85: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,427 INFO L290 TraceCheckUtils]: 86: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {38259#true} {38259#true} #98#return; {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L290 TraceCheckUtils]: 88: Hoare triple {38259#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L290 TraceCheckUtils]: 89: Hoare triple {38259#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L290 TraceCheckUtils]: 90: Hoare triple {38259#true} assume !!(#t~post8 < 100);havoc #t~post8; {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L272 TraceCheckUtils]: 91: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L290 TraceCheckUtils]: 92: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L290 TraceCheckUtils]: 93: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L290 TraceCheckUtils]: 94: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {38259#true} {38259#true} #98#return; {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L290 TraceCheckUtils]: 96: Hoare triple {38259#true} assume !(~r~0 < 0); {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L290 TraceCheckUtils]: 97: Hoare triple {38259#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L290 TraceCheckUtils]: 98: Hoare triple {38259#true} assume !!(#t~post6 < 100);havoc #t~post6; {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L272 TraceCheckUtils]: 99: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L290 TraceCheckUtils]: 100: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L290 TraceCheckUtils]: 101: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L290 TraceCheckUtils]: 102: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {38259#true} {38259#true} #94#return; {38259#true} is VALID [2022-04-14 16:14:49,428 INFO L290 TraceCheckUtils]: 104: Hoare triple {38259#true} assume !!(0 != ~r~0); {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L290 TraceCheckUtils]: 105: Hoare triple {38259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L290 TraceCheckUtils]: 106: Hoare triple {38259#true} assume !!(#t~post7 < 100);havoc #t~post7; {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L272 TraceCheckUtils]: 107: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L290 TraceCheckUtils]: 108: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L290 TraceCheckUtils]: 109: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L290 TraceCheckUtils]: 110: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {38259#true} {38259#true} #96#return; {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L290 TraceCheckUtils]: 112: Hoare triple {38259#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L290 TraceCheckUtils]: 113: Hoare triple {38259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L290 TraceCheckUtils]: 114: Hoare triple {38259#true} assume !!(#t~post7 < 100);havoc #t~post7; {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L272 TraceCheckUtils]: 115: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L290 TraceCheckUtils]: 116: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L290 TraceCheckUtils]: 117: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L290 TraceCheckUtils]: 118: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {38259#true} {38259#true} #96#return; {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L290 TraceCheckUtils]: 120: Hoare triple {38259#true} assume !(~r~0 > 0); {38259#true} is VALID [2022-04-14 16:14:49,429 INFO L290 TraceCheckUtils]: 121: Hoare triple {38259#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L290 TraceCheckUtils]: 122: Hoare triple {38259#true} assume !!(#t~post8 < 100);havoc #t~post8; {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L272 TraceCheckUtils]: 123: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L290 TraceCheckUtils]: 124: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L290 TraceCheckUtils]: 125: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L290 TraceCheckUtils]: 126: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {38259#true} {38259#true} #98#return; {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L290 TraceCheckUtils]: 128: Hoare triple {38259#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L290 TraceCheckUtils]: 129: Hoare triple {38259#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L290 TraceCheckUtils]: 130: Hoare triple {38259#true} assume !!(#t~post8 < 100);havoc #t~post8; {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L272 TraceCheckUtils]: 131: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L290 TraceCheckUtils]: 132: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L290 TraceCheckUtils]: 133: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L290 TraceCheckUtils]: 134: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {38259#true} {38259#true} #98#return; {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L290 TraceCheckUtils]: 136: Hoare triple {38259#true} assume !(~r~0 < 0); {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L290 TraceCheckUtils]: 137: Hoare triple {38259#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38259#true} is VALID [2022-04-14 16:14:49,430 INFO L290 TraceCheckUtils]: 138: Hoare triple {38259#true} assume !!(#t~post6 < 100);havoc #t~post6; {38259#true} is VALID [2022-04-14 16:14:49,431 INFO L272 TraceCheckUtils]: 139: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,431 INFO L290 TraceCheckUtils]: 140: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,431 INFO L290 TraceCheckUtils]: 141: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,431 INFO L290 TraceCheckUtils]: 142: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,431 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {38259#true} {38259#true} #94#return; {38259#true} is VALID [2022-04-14 16:14:49,431 INFO L290 TraceCheckUtils]: 144: Hoare triple {38259#true} assume !!(0 != ~r~0); {38259#true} is VALID [2022-04-14 16:14:49,431 INFO L290 TraceCheckUtils]: 145: Hoare triple {38259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38259#true} is VALID [2022-04-14 16:14:49,431 INFO L290 TraceCheckUtils]: 146: Hoare triple {38259#true} assume !!(#t~post7 < 100);havoc #t~post7; {38259#true} is VALID [2022-04-14 16:14:49,431 INFO L272 TraceCheckUtils]: 147: Hoare triple {38259#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38259#true} is VALID [2022-04-14 16:14:49,431 INFO L290 TraceCheckUtils]: 148: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-14 16:14:49,431 INFO L290 TraceCheckUtils]: 149: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-14 16:14:49,431 INFO L290 TraceCheckUtils]: 150: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-14 16:14:49,431 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {38259#true} {38259#true} #96#return; {38259#true} is VALID [2022-04-14 16:14:49,431 INFO L290 TraceCheckUtils]: 152: Hoare triple {38259#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38259#true} is VALID [2022-04-14 16:14:49,446 INFO L290 TraceCheckUtils]: 153: Hoare triple {38259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38723#(<= (+ |main_#t~post7| 1) ~counter~0)} is VALID [2022-04-14 16:14:49,447 INFO L290 TraceCheckUtils]: 154: Hoare triple {38723#(<= (+ |main_#t~post7| 1) ~counter~0)} assume !(#t~post7 < 100);havoc #t~post7; {38727#(<= 101 ~counter~0)} is VALID [2022-04-14 16:14:49,448 INFO L290 TraceCheckUtils]: 155: Hoare triple {38727#(<= 101 ~counter~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38731#(<= 101 |main_#t~post8|)} is VALID [2022-04-14 16:14:49,448 INFO L290 TraceCheckUtils]: 156: Hoare triple {38731#(<= 101 |main_#t~post8|)} assume !!(#t~post8 < 100);havoc #t~post8; {38260#false} is VALID [2022-04-14 16:14:49,448 INFO L272 TraceCheckUtils]: 157: Hoare triple {38260#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38260#false} is VALID [2022-04-14 16:14:49,448 INFO L290 TraceCheckUtils]: 158: Hoare triple {38260#false} ~cond := #in~cond; {38260#false} is VALID [2022-04-14 16:14:49,448 INFO L290 TraceCheckUtils]: 159: Hoare triple {38260#false} assume !(0 == ~cond); {38260#false} is VALID [2022-04-14 16:14:49,448 INFO L290 TraceCheckUtils]: 160: Hoare triple {38260#false} assume true; {38260#false} is VALID [2022-04-14 16:14:49,448 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {38260#false} {38260#false} #98#return; {38260#false} is VALID [2022-04-14 16:14:49,448 INFO L290 TraceCheckUtils]: 162: Hoare triple {38260#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38260#false} is VALID [2022-04-14 16:14:49,448 INFO L290 TraceCheckUtils]: 163: Hoare triple {38260#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38260#false} is VALID [2022-04-14 16:14:49,448 INFO L290 TraceCheckUtils]: 164: Hoare triple {38260#false} assume !!(#t~post8 < 100);havoc #t~post8; {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L272 TraceCheckUtils]: 165: Hoare triple {38260#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L290 TraceCheckUtils]: 166: Hoare triple {38260#false} ~cond := #in~cond; {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L290 TraceCheckUtils]: 167: Hoare triple {38260#false} assume !(0 == ~cond); {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L290 TraceCheckUtils]: 168: Hoare triple {38260#false} assume true; {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {38260#false} {38260#false} #98#return; {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L290 TraceCheckUtils]: 170: Hoare triple {38260#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L290 TraceCheckUtils]: 171: Hoare triple {38260#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L290 TraceCheckUtils]: 172: Hoare triple {38260#false} assume !!(#t~post8 < 100);havoc #t~post8; {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L272 TraceCheckUtils]: 173: Hoare triple {38260#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L290 TraceCheckUtils]: 174: Hoare triple {38260#false} ~cond := #in~cond; {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L290 TraceCheckUtils]: 175: Hoare triple {38260#false} assume !(0 == ~cond); {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L290 TraceCheckUtils]: 176: Hoare triple {38260#false} assume true; {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L284 TraceCheckUtils]: 177: Hoare quadruple {38260#false} {38260#false} #98#return; {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L290 TraceCheckUtils]: 178: Hoare triple {38260#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L290 TraceCheckUtils]: 179: Hoare triple {38260#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L290 TraceCheckUtils]: 180: Hoare triple {38260#false} assume !(#t~post8 < 100);havoc #t~post8; {38260#false} is VALID [2022-04-14 16:14:49,449 INFO L290 TraceCheckUtils]: 181: Hoare triple {38260#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38260#false} is VALID [2022-04-14 16:14:49,450 INFO L290 TraceCheckUtils]: 182: Hoare triple {38260#false} assume !(#t~post6 < 100);havoc #t~post6; {38260#false} is VALID [2022-04-14 16:14:49,450 INFO L272 TraceCheckUtils]: 183: Hoare triple {38260#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38260#false} is VALID [2022-04-14 16:14:49,450 INFO L290 TraceCheckUtils]: 184: Hoare triple {38260#false} ~cond := #in~cond; {38260#false} is VALID [2022-04-14 16:14:49,450 INFO L290 TraceCheckUtils]: 185: Hoare triple {38260#false} assume 0 == ~cond; {38260#false} is VALID [2022-04-14 16:14:49,450 INFO L290 TraceCheckUtils]: 186: Hoare triple {38260#false} assume !false; {38260#false} is VALID [2022-04-14 16:14:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 753 trivial. 0 not checked. [2022-04-14 16:14:49,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:14:49,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:14:49,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713486738] [2022-04-14 16:14:49,451 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:14:49,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051406870] [2022-04-14 16:14:49,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051406870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:14:49,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:14:49,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 16:14:49,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253242485] [2022-04-14 16:14:49,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:14:49,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 187 [2022-04-14 16:14:49,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:14:49,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 16:14:49,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:49,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 16:14:49,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:14:49,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 16:14:49,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 16:14:49,482 INFO L87 Difference]: Start difference. First operand 953 states and 1207 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 16:14:50,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:50,094 INFO L93 Difference]: Finished difference Result 973 states and 1226 transitions. [2022-04-14 16:14:50,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 16:14:50,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 187 [2022-04-14 16:14:50,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:50,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 16:14:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-14 16:14:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 16:14:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-14 16:14:50,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-14 16:14:50,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:50,164 INFO L225 Difference]: With dead ends: 973 [2022-04-14 16:14:50,164 INFO L226 Difference]: Without dead ends: 917 [2022-04-14 16:14:50,165 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 16:14:50,165 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:50,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 143 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:14:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2022-04-14 16:14:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 892. [2022-04-14 16:14:50,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:50,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 917 states. Second operand has 892 states, 670 states have (on average 1.155223880597015) internal successors, (774), 678 states have internal predecessors, (774), 179 states have call successors, (179), 44 states have call predecessors, (179), 42 states have return successors, (177), 169 states have call predecessors, (177), 177 states have call successors, (177) [2022-04-14 16:14:50,671 INFO L74 IsIncluded]: Start isIncluded. First operand 917 states. Second operand has 892 states, 670 states have (on average 1.155223880597015) internal successors, (774), 678 states have internal predecessors, (774), 179 states have call successors, (179), 44 states have call predecessors, (179), 42 states have return successors, (177), 169 states have call predecessors, (177), 177 states have call successors, (177) [2022-04-14 16:14:50,671 INFO L87 Difference]: Start difference. First operand 917 states. Second operand has 892 states, 670 states have (on average 1.155223880597015) internal successors, (774), 678 states have internal predecessors, (774), 179 states have call successors, (179), 44 states have call predecessors, (179), 42 states have return successors, (177), 169 states have call predecessors, (177), 177 states have call successors, (177) [2022-04-14 16:14:50,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:50,696 INFO L93 Difference]: Finished difference Result 917 states and 1160 transitions. [2022-04-14 16:14:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1160 transitions. [2022-04-14 16:14:50,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:50,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:50,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 892 states, 670 states have (on average 1.155223880597015) internal successors, (774), 678 states have internal predecessors, (774), 179 states have call successors, (179), 44 states have call predecessors, (179), 42 states have return successors, (177), 169 states have call predecessors, (177), 177 states have call successors, (177) Second operand 917 states. [2022-04-14 16:14:50,699 INFO L87 Difference]: Start difference. First operand has 892 states, 670 states have (on average 1.155223880597015) internal successors, (774), 678 states have internal predecessors, (774), 179 states have call successors, (179), 44 states have call predecessors, (179), 42 states have return successors, (177), 169 states have call predecessors, (177), 177 states have call successors, (177) Second operand 917 states. [2022-04-14 16:14:50,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:50,723 INFO L93 Difference]: Finished difference Result 917 states and 1160 transitions. [2022-04-14 16:14:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1160 transitions. [2022-04-14 16:14:50,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:50,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:50,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:50,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 670 states have (on average 1.155223880597015) internal successors, (774), 678 states have internal predecessors, (774), 179 states have call successors, (179), 44 states have call predecessors, (179), 42 states have return successors, (177), 169 states have call predecessors, (177), 177 states have call successors, (177) [2022-04-14 16:14:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1130 transitions. [2022-04-14 16:14:50,755 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1130 transitions. Word has length 187 [2022-04-14 16:14:50,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:50,756 INFO L478 AbstractCegarLoop]: Abstraction has 892 states and 1130 transitions. [2022-04-14 16:14:50,756 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 16:14:50,756 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1130 transitions. [2022-04-14 16:14:50,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-14 16:14:50,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:50,758 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 9, 8, 8, 8, 8, 7, 7, 7, 6, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:14:50,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-14 16:14:50,962 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-14 16:14:50,963 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:50,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:50,963 INFO L85 PathProgramCache]: Analyzing trace with hash 372440269, now seen corresponding path program 6 times [2022-04-14 16:14:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:50,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762749285] [2022-04-14 16:14:50,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:50,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:50,982 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:50,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [456693166] [2022-04-14 16:14:50,982 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-14 16:14:50,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:50,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:50,983 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:14:50,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-14 16:14:51,139 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-14 16:14:51,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:14:51,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-14 16:14:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:51,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:14:51,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {43235#true} call ULTIMATE.init(); {43235#true} is VALID [2022-04-14 16:14:51,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {43235#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43235#true} is VALID [2022-04-14 16:14:51,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43235#true} {43235#true} #102#return; {43235#true} is VALID [2022-04-14 16:14:51,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {43235#true} call #t~ret9 := main(); {43235#true} is VALID [2022-04-14 16:14:51,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {43235#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {43235#true} is VALID [2022-04-14 16:14:51,500 INFO L272 TraceCheckUtils]: 6: Hoare triple {43235#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43235#true} {43235#true} #90#return; {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L272 TraceCheckUtils]: 11: Hoare triple {43235#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43235#true} {43235#true} #92#return; {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {43235#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {43235#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {43235#true} assume !!(#t~post6 < 100);havoc #t~post6; {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L272 TraceCheckUtils]: 19: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43235#true} {43235#true} #94#return; {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {43235#true} assume !!(0 != ~r~0); {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {43235#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43235#true} is VALID [2022-04-14 16:14:51,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {43235#true} assume !!(#t~post7 < 100);havoc #t~post7; {43235#true} is VALID [2022-04-14 16:14:51,502 INFO L272 TraceCheckUtils]: 27: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,506 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {43235#true} {43235#true} #96#return; {43235#true} is VALID [2022-04-14 16:14:51,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {43235#true} assume !(~r~0 > 0); {43235#true} is VALID [2022-04-14 16:14:51,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {43235#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43235#true} is VALID [2022-04-14 16:14:51,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {43235#true} assume !!(#t~post8 < 100);havoc #t~post8; {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L272 TraceCheckUtils]: 35: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {43235#true} {43235#true} #98#return; {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {43235#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {43235#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {43235#true} assume !!(#t~post8 < 100);havoc #t~post8; {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L272 TraceCheckUtils]: 43: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L290 TraceCheckUtils]: 44: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L290 TraceCheckUtils]: 45: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L290 TraceCheckUtils]: 46: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {43235#true} {43235#true} #98#return; {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {43235#true} assume !(~r~0 < 0); {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L290 TraceCheckUtils]: 49: Hoare triple {43235#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L290 TraceCheckUtils]: 50: Hoare triple {43235#true} assume !!(#t~post6 < 100);havoc #t~post6; {43235#true} is VALID [2022-04-14 16:14:51,507 INFO L272 TraceCheckUtils]: 51: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L290 TraceCheckUtils]: 52: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L290 TraceCheckUtils]: 53: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {43235#true} {43235#true} #94#return; {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L290 TraceCheckUtils]: 56: Hoare triple {43235#true} assume !!(0 != ~r~0); {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L290 TraceCheckUtils]: 57: Hoare triple {43235#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L290 TraceCheckUtils]: 58: Hoare triple {43235#true} assume !!(#t~post7 < 100);havoc #t~post7; {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L272 TraceCheckUtils]: 59: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L290 TraceCheckUtils]: 60: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L290 TraceCheckUtils]: 61: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L290 TraceCheckUtils]: 62: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {43235#true} {43235#true} #96#return; {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L290 TraceCheckUtils]: 64: Hoare triple {43235#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L290 TraceCheckUtils]: 65: Hoare triple {43235#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L290 TraceCheckUtils]: 66: Hoare triple {43235#true} assume !!(#t~post7 < 100);havoc #t~post7; {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L272 TraceCheckUtils]: 67: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,508 INFO L290 TraceCheckUtils]: 68: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L290 TraceCheckUtils]: 69: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L290 TraceCheckUtils]: 70: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {43235#true} {43235#true} #96#return; {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L290 TraceCheckUtils]: 72: Hoare triple {43235#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L290 TraceCheckUtils]: 73: Hoare triple {43235#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L290 TraceCheckUtils]: 74: Hoare triple {43235#true} assume !!(#t~post7 < 100);havoc #t~post7; {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L272 TraceCheckUtils]: 75: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L290 TraceCheckUtils]: 76: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L290 TraceCheckUtils]: 77: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L290 TraceCheckUtils]: 78: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {43235#true} {43235#true} #96#return; {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L290 TraceCheckUtils]: 80: Hoare triple {43235#true} assume !(~r~0 > 0); {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L290 TraceCheckUtils]: 81: Hoare triple {43235#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L290 TraceCheckUtils]: 82: Hoare triple {43235#true} assume !!(#t~post8 < 100);havoc #t~post8; {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L272 TraceCheckUtils]: 83: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L290 TraceCheckUtils]: 84: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,509 INFO L290 TraceCheckUtils]: 85: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L290 TraceCheckUtils]: 86: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {43235#true} {43235#true} #98#return; {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L290 TraceCheckUtils]: 88: Hoare triple {43235#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L290 TraceCheckUtils]: 89: Hoare triple {43235#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L290 TraceCheckUtils]: 90: Hoare triple {43235#true} assume !!(#t~post8 < 100);havoc #t~post8; {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L272 TraceCheckUtils]: 91: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L290 TraceCheckUtils]: 92: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L290 TraceCheckUtils]: 93: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L290 TraceCheckUtils]: 94: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {43235#true} {43235#true} #98#return; {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L290 TraceCheckUtils]: 96: Hoare triple {43235#true} assume !(~r~0 < 0); {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L290 TraceCheckUtils]: 97: Hoare triple {43235#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L290 TraceCheckUtils]: 98: Hoare triple {43235#true} assume !!(#t~post6 < 100);havoc #t~post6; {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L272 TraceCheckUtils]: 99: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L290 TraceCheckUtils]: 100: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L290 TraceCheckUtils]: 101: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L290 TraceCheckUtils]: 102: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,510 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {43235#true} {43235#true} #94#return; {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L290 TraceCheckUtils]: 104: Hoare triple {43235#true} assume !!(0 != ~r~0); {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L290 TraceCheckUtils]: 105: Hoare triple {43235#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L290 TraceCheckUtils]: 106: Hoare triple {43235#true} assume !!(#t~post7 < 100);havoc #t~post7; {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L272 TraceCheckUtils]: 107: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L290 TraceCheckUtils]: 108: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L290 TraceCheckUtils]: 109: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L290 TraceCheckUtils]: 110: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {43235#true} {43235#true} #96#return; {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L290 TraceCheckUtils]: 112: Hoare triple {43235#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L290 TraceCheckUtils]: 113: Hoare triple {43235#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L290 TraceCheckUtils]: 114: Hoare triple {43235#true} assume !!(#t~post7 < 100);havoc #t~post7; {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L272 TraceCheckUtils]: 115: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L290 TraceCheckUtils]: 116: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L290 TraceCheckUtils]: 117: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L290 TraceCheckUtils]: 118: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {43235#true} {43235#true} #96#return; {43235#true} is VALID [2022-04-14 16:14:51,511 INFO L290 TraceCheckUtils]: 120: Hoare triple {43235#true} assume !(~r~0 > 0); {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L290 TraceCheckUtils]: 121: Hoare triple {43235#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L290 TraceCheckUtils]: 122: Hoare triple {43235#true} assume !!(#t~post8 < 100);havoc #t~post8; {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L272 TraceCheckUtils]: 123: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L290 TraceCheckUtils]: 124: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L290 TraceCheckUtils]: 125: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L290 TraceCheckUtils]: 126: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {43235#true} {43235#true} #98#return; {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L290 TraceCheckUtils]: 128: Hoare triple {43235#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L290 TraceCheckUtils]: 129: Hoare triple {43235#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L290 TraceCheckUtils]: 130: Hoare triple {43235#true} assume !!(#t~post8 < 100);havoc #t~post8; {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L272 TraceCheckUtils]: 131: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L290 TraceCheckUtils]: 132: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L290 TraceCheckUtils]: 133: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L290 TraceCheckUtils]: 134: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {43235#true} {43235#true} #98#return; {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L290 TraceCheckUtils]: 136: Hoare triple {43235#true} assume !(~r~0 < 0); {43235#true} is VALID [2022-04-14 16:14:51,512 INFO L290 TraceCheckUtils]: 137: Hoare triple {43235#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L290 TraceCheckUtils]: 138: Hoare triple {43235#true} assume !!(#t~post6 < 100);havoc #t~post6; {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L272 TraceCheckUtils]: 139: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L290 TraceCheckUtils]: 140: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L290 TraceCheckUtils]: 141: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L290 TraceCheckUtils]: 142: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {43235#true} {43235#true} #94#return; {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L290 TraceCheckUtils]: 144: Hoare triple {43235#true} assume !!(0 != ~r~0); {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L290 TraceCheckUtils]: 145: Hoare triple {43235#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L290 TraceCheckUtils]: 146: Hoare triple {43235#true} assume !!(#t~post7 < 100);havoc #t~post7; {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L272 TraceCheckUtils]: 147: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L290 TraceCheckUtils]: 148: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L290 TraceCheckUtils]: 149: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L290 TraceCheckUtils]: 150: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {43235#true} {43235#true} #96#return; {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L290 TraceCheckUtils]: 152: Hoare triple {43235#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L290 TraceCheckUtils]: 153: Hoare triple {43235#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43235#true} is VALID [2022-04-14 16:14:51,513 INFO L290 TraceCheckUtils]: 154: Hoare triple {43235#true} assume !!(#t~post7 < 100);havoc #t~post7; {43235#true} is VALID [2022-04-14 16:14:51,514 INFO L272 TraceCheckUtils]: 155: Hoare triple {43235#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,514 INFO L290 TraceCheckUtils]: 156: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,514 INFO L290 TraceCheckUtils]: 157: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,514 INFO L290 TraceCheckUtils]: 158: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,514 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {43235#true} {43235#true} #96#return; {43235#true} is VALID [2022-04-14 16:14:51,515 INFO L290 TraceCheckUtils]: 160: Hoare triple {43235#true} assume !(~r~0 > 0); {43720#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:14:51,515 INFO L290 TraceCheckUtils]: 161: Hoare triple {43720#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43720#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:14:51,515 INFO L290 TraceCheckUtils]: 162: Hoare triple {43720#(not (< 0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {43720#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:14:51,515 INFO L272 TraceCheckUtils]: 163: Hoare triple {43720#(not (< 0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,515 INFO L290 TraceCheckUtils]: 164: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,515 INFO L290 TraceCheckUtils]: 165: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,515 INFO L290 TraceCheckUtils]: 166: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,516 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {43235#true} {43720#(not (< 0 main_~r~0))} #98#return; {43720#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:14:51,516 INFO L290 TraceCheckUtils]: 168: Hoare triple {43720#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-14 16:14:51,516 INFO L290 TraceCheckUtils]: 169: Hoare triple {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-14 16:14:51,517 INFO L290 TraceCheckUtils]: 170: Hoare triple {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(#t~post6 < 100);havoc #t~post6; {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-14 16:14:51,517 INFO L272 TraceCheckUtils]: 171: Hoare triple {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43235#true} is VALID [2022-04-14 16:14:51,517 INFO L290 TraceCheckUtils]: 172: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-14 16:14:51,517 INFO L290 TraceCheckUtils]: 173: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-14 16:14:51,517 INFO L290 TraceCheckUtils]: 174: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-14 16:14:51,517 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {43235#true} {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #94#return; {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-14 16:14:51,518 INFO L290 TraceCheckUtils]: 176: Hoare triple {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(0 != ~r~0); {43236#false} is VALID [2022-04-14 16:14:51,518 INFO L290 TraceCheckUtils]: 177: Hoare triple {43236#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43236#false} is VALID [2022-04-14 16:14:51,518 INFO L290 TraceCheckUtils]: 178: Hoare triple {43236#false} assume !(#t~post7 < 100);havoc #t~post7; {43236#false} is VALID [2022-04-14 16:14:51,518 INFO L290 TraceCheckUtils]: 179: Hoare triple {43236#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43236#false} is VALID [2022-04-14 16:14:51,518 INFO L290 TraceCheckUtils]: 180: Hoare triple {43236#false} assume !(#t~post8 < 100);havoc #t~post8; {43236#false} is VALID [2022-04-14 16:14:51,518 INFO L290 TraceCheckUtils]: 181: Hoare triple {43236#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43236#false} is VALID [2022-04-14 16:14:51,518 INFO L290 TraceCheckUtils]: 182: Hoare triple {43236#false} assume !(#t~post6 < 100);havoc #t~post6; {43236#false} is VALID [2022-04-14 16:14:51,518 INFO L272 TraceCheckUtils]: 183: Hoare triple {43236#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43236#false} is VALID [2022-04-14 16:14:51,518 INFO L290 TraceCheckUtils]: 184: Hoare triple {43236#false} ~cond := #in~cond; {43236#false} is VALID [2022-04-14 16:14:51,518 INFO L290 TraceCheckUtils]: 185: Hoare triple {43236#false} assume 0 == ~cond; {43236#false} is VALID [2022-04-14 16:14:51,518 INFO L290 TraceCheckUtils]: 186: Hoare triple {43236#false} assume !false; {43236#false} is VALID [2022-04-14 16:14:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2022-04-14 16:14:51,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:14:51,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:14:51,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762749285] [2022-04-14 16:14:51,519 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:14:51,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456693166] [2022-04-14 16:14:51,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456693166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:14:51,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:14:51,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 16:14:51,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361493119] [2022-04-14 16:14:51,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:14:51,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 187 [2022-04-14 16:14:51,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:14:51,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-14 16:14:51,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:51,552 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 16:14:51,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:14:51,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 16:14:51,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-14 16:14:51,552 INFO L87 Difference]: Start difference. First operand 892 states and 1130 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-14 16:14:52,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:52,147 INFO L93 Difference]: Finished difference Result 939 states and 1179 transitions. [2022-04-14 16:14:52,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 16:14:52,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 187 [2022-04-14 16:14:52,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-14 16:14:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-14 16:14:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-14 16:14:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-14 16:14:52,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-14 16:14:52,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:52,241 INFO L225 Difference]: With dead ends: 939 [2022-04-14 16:14:52,241 INFO L226 Difference]: Without dead ends: 868 [2022-04-14 16:14:52,241 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-14 16:14:52,242 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 12 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:52,242 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:14:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-04-14 16:14:52,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 841. [2022-04-14 16:14:52,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:52,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 868 states. Second operand has 841 states, 632 states have (on average 1.1487341772151898) internal successors, (726), 639 states have internal predecessors, (726), 166 states have call successors, (166), 44 states have call predecessors, (166), 42 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-14 16:14:52,761 INFO L74 IsIncluded]: Start isIncluded. First operand 868 states. Second operand has 841 states, 632 states have (on average 1.1487341772151898) internal successors, (726), 639 states have internal predecessors, (726), 166 states have call successors, (166), 44 states have call predecessors, (166), 42 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-14 16:14:52,762 INFO L87 Difference]: Start difference. First operand 868 states. Second operand has 841 states, 632 states have (on average 1.1487341772151898) internal successors, (726), 639 states have internal predecessors, (726), 166 states have call successors, (166), 44 states have call predecessors, (166), 42 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-14 16:14:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:52,784 INFO L93 Difference]: Finished difference Result 868 states and 1088 transitions. [2022-04-14 16:14:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1088 transitions. [2022-04-14 16:14:52,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:52,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:52,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 841 states, 632 states have (on average 1.1487341772151898) internal successors, (726), 639 states have internal predecessors, (726), 166 states have call successors, (166), 44 states have call predecessors, (166), 42 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) Second operand 868 states. [2022-04-14 16:14:52,787 INFO L87 Difference]: Start difference. First operand has 841 states, 632 states have (on average 1.1487341772151898) internal successors, (726), 639 states have internal predecessors, (726), 166 states have call successors, (166), 44 states have call predecessors, (166), 42 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) Second operand 868 states. [2022-04-14 16:14:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:52,809 INFO L93 Difference]: Finished difference Result 868 states and 1088 transitions. [2022-04-14 16:14:52,809 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1088 transitions. [2022-04-14 16:14:52,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:52,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:52,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:52,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 632 states have (on average 1.1487341772151898) internal successors, (726), 639 states have internal predecessors, (726), 166 states have call successors, (166), 44 states have call predecessors, (166), 42 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-14 16:14:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1056 transitions. [2022-04-14 16:14:52,838 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1056 transitions. Word has length 187 [2022-04-14 16:14:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:52,838 INFO L478 AbstractCegarLoop]: Abstraction has 841 states and 1056 transitions. [2022-04-14 16:14:52,838 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-14 16:14:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1056 transitions. [2022-04-14 16:14:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-14 16:14:52,841 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:52,841 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 11, 10, 10, 10, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:14:52,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-14 16:14:53,045 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-14 16:14:53,045 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:53,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:53,045 INFO L85 PathProgramCache]: Analyzing trace with hash -288806385, now seen corresponding path program 7 times [2022-04-14 16:14:53,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:53,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543653412] [2022-04-14 16:14:53,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:53,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:53,061 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:53,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1594025493] [2022-04-14 16:14:53,062 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-14 16:14:53,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:53,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:53,063 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:14:53,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-14 16:14:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:53,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-14 16:14:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:53,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:14:53,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {47996#true} call ULTIMATE.init(); {47996#true} is VALID [2022-04-14 16:14:53,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {47996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {47996#true} is VALID [2022-04-14 16:14:53,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47996#true} {47996#true} #102#return; {47996#true} is VALID [2022-04-14 16:14:53,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {47996#true} call #t~ret9 := main(); {47996#true} is VALID [2022-04-14 16:14:53,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {47996#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {47996#true} is VALID [2022-04-14 16:14:53,733 INFO L272 TraceCheckUtils]: 6: Hoare triple {47996#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,734 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47996#true} {47996#true} #90#return; {47996#true} is VALID [2022-04-14 16:14:53,734 INFO L272 TraceCheckUtils]: 11: Hoare triple {47996#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,734 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47996#true} {47996#true} #92#return; {47996#true} is VALID [2022-04-14 16:14:53,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {47996#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {48049#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,735 INFO L272 TraceCheckUtils]: 19: Hoare triple {48049#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,736 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #94#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {48049#(<= main_~v~0 1)} assume !!(0 != ~r~0); {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {48049#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,736 INFO L272 TraceCheckUtils]: 27: Hoare triple {48049#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,737 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #96#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {48049#(<= main_~v~0 1)} assume !(~r~0 > 0); {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {48049#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,738 INFO L272 TraceCheckUtils]: 35: Hoare triple {48049#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,738 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #98#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,739 INFO L290 TraceCheckUtils]: 40: Hoare triple {48049#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,739 INFO L290 TraceCheckUtils]: 41: Hoare triple {48049#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,739 INFO L272 TraceCheckUtils]: 43: Hoare triple {48049#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,739 INFO L290 TraceCheckUtils]: 46: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,740 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #98#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {48049#(<= main_~v~0 1)} assume !(~r~0 < 0); {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {48049#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,740 INFO L272 TraceCheckUtils]: 51: Hoare triple {48049#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,741 INFO L290 TraceCheckUtils]: 52: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,741 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #94#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,741 INFO L290 TraceCheckUtils]: 56: Hoare triple {48049#(<= main_~v~0 1)} assume !!(0 != ~r~0); {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,742 INFO L290 TraceCheckUtils]: 57: Hoare triple {48049#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,742 INFO L290 TraceCheckUtils]: 58: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,742 INFO L272 TraceCheckUtils]: 59: Hoare triple {48049#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,742 INFO L290 TraceCheckUtils]: 60: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,742 INFO L290 TraceCheckUtils]: 61: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,742 INFO L290 TraceCheckUtils]: 62: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,743 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #96#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:53,743 INFO L290 TraceCheckUtils]: 64: Hoare triple {48049#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48194#(<= main_~v~0 3)} is VALID [2022-04-14 16:14:53,743 INFO L290 TraceCheckUtils]: 65: Hoare triple {48194#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48194#(<= main_~v~0 3)} is VALID [2022-04-14 16:14:53,743 INFO L290 TraceCheckUtils]: 66: Hoare triple {48194#(<= main_~v~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {48194#(<= main_~v~0 3)} is VALID [2022-04-14 16:14:53,744 INFO L272 TraceCheckUtils]: 67: Hoare triple {48194#(<= main_~v~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,744 INFO L290 TraceCheckUtils]: 68: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,744 INFO L290 TraceCheckUtils]: 69: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,744 INFO L290 TraceCheckUtils]: 70: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,744 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47996#true} {48194#(<= main_~v~0 3)} #96#return; {48194#(<= main_~v~0 3)} is VALID [2022-04-14 16:14:53,745 INFO L290 TraceCheckUtils]: 72: Hoare triple {48194#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-14 16:14:53,745 INFO L290 TraceCheckUtils]: 73: Hoare triple {48219#(< 0 (+ main_~r~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-14 16:14:53,745 INFO L290 TraceCheckUtils]: 74: Hoare triple {48219#(< 0 (+ main_~r~0 3))} assume !!(#t~post7 < 100);havoc #t~post7; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-14 16:14:53,745 INFO L272 TraceCheckUtils]: 75: Hoare triple {48219#(< 0 (+ main_~r~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,745 INFO L290 TraceCheckUtils]: 76: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,745 INFO L290 TraceCheckUtils]: 77: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,745 INFO L290 TraceCheckUtils]: 78: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,746 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47996#true} {48219#(< 0 (+ main_~r~0 3))} #96#return; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-14 16:14:53,746 INFO L290 TraceCheckUtils]: 80: Hoare triple {48219#(< 0 (+ main_~r~0 3))} assume !(~r~0 > 0); {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-14 16:14:53,746 INFO L290 TraceCheckUtils]: 81: Hoare triple {48219#(< 0 (+ main_~r~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-14 16:14:53,747 INFO L290 TraceCheckUtils]: 82: Hoare triple {48219#(< 0 (+ main_~r~0 3))} assume !!(#t~post8 < 100);havoc #t~post8; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-14 16:14:53,747 INFO L272 TraceCheckUtils]: 83: Hoare triple {48219#(< 0 (+ main_~r~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,747 INFO L290 TraceCheckUtils]: 84: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,747 INFO L290 TraceCheckUtils]: 85: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,747 INFO L290 TraceCheckUtils]: 86: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,747 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47996#true} {48219#(< 0 (+ main_~r~0 3))} #98#return; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-14 16:14:53,748 INFO L290 TraceCheckUtils]: 88: Hoare triple {48219#(< 0 (+ main_~r~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:53,748 INFO L290 TraceCheckUtils]: 89: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:53,749 INFO L290 TraceCheckUtils]: 90: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:53,749 INFO L272 TraceCheckUtils]: 91: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,749 INFO L290 TraceCheckUtils]: 92: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,749 INFO L290 TraceCheckUtils]: 93: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,749 INFO L290 TraceCheckUtils]: 94: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,749 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47996#true} {48268#(< main_~u~0 (+ 5 main_~r~0))} #98#return; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:53,750 INFO L290 TraceCheckUtils]: 96: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !(~r~0 < 0); {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:53,750 INFO L290 TraceCheckUtils]: 97: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:53,750 INFO L290 TraceCheckUtils]: 98: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:53,750 INFO L272 TraceCheckUtils]: 99: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,750 INFO L290 TraceCheckUtils]: 100: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,750 INFO L290 TraceCheckUtils]: 101: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,750 INFO L290 TraceCheckUtils]: 102: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,751 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {47996#true} {48268#(< main_~u~0 (+ 5 main_~r~0))} #94#return; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:53,751 INFO L290 TraceCheckUtils]: 104: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(0 != ~r~0); {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:53,751 INFO L290 TraceCheckUtils]: 105: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:53,751 INFO L290 TraceCheckUtils]: 106: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:53,751 INFO L272 TraceCheckUtils]: 107: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,752 INFO L290 TraceCheckUtils]: 108: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,752 INFO L290 TraceCheckUtils]: 109: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,752 INFO L290 TraceCheckUtils]: 110: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,752 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {47996#true} {48268#(< main_~u~0 (+ 5 main_~r~0))} #96#return; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:53,753 INFO L290 TraceCheckUtils]: 112: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-14 16:14:53,753 INFO L290 TraceCheckUtils]: 113: Hoare triple {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-14 16:14:53,753 INFO L290 TraceCheckUtils]: 114: Hoare triple {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !!(#t~post7 < 100);havoc #t~post7; {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-14 16:14:53,753 INFO L272 TraceCheckUtils]: 115: Hoare triple {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,753 INFO L290 TraceCheckUtils]: 116: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,753 INFO L290 TraceCheckUtils]: 117: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,753 INFO L290 TraceCheckUtils]: 118: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,754 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {47996#true} {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #96#return; {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-14 16:14:53,754 INFO L290 TraceCheckUtils]: 120: Hoare triple {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !(~r~0 > 0); {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-14 16:14:53,754 INFO L290 TraceCheckUtils]: 121: Hoare triple {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-14 16:14:53,755 INFO L290 TraceCheckUtils]: 122: Hoare triple {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !!(#t~post8 < 100);havoc #t~post8; {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-14 16:14:53,755 INFO L272 TraceCheckUtils]: 123: Hoare triple {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,755 INFO L290 TraceCheckUtils]: 124: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,755 INFO L290 TraceCheckUtils]: 125: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,755 INFO L290 TraceCheckUtils]: 126: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,755 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {47996#true} {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #98#return; {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-14 16:14:53,756 INFO L290 TraceCheckUtils]: 128: Hoare triple {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:53,756 INFO L290 TraceCheckUtils]: 129: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:53,756 INFO L290 TraceCheckUtils]: 130: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:53,756 INFO L272 TraceCheckUtils]: 131: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,756 INFO L290 TraceCheckUtils]: 132: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,757 INFO L290 TraceCheckUtils]: 133: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,757 INFO L290 TraceCheckUtils]: 134: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,757 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {47996#true} {48390#(< main_~r~0 (+ main_~v~0 1))} #98#return; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:53,757 INFO L290 TraceCheckUtils]: 136: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !(~r~0 < 0); {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:53,757 INFO L290 TraceCheckUtils]: 137: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:53,758 INFO L290 TraceCheckUtils]: 138: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:53,758 INFO L272 TraceCheckUtils]: 139: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,758 INFO L290 TraceCheckUtils]: 140: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,758 INFO L290 TraceCheckUtils]: 141: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,758 INFO L290 TraceCheckUtils]: 142: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,763 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {47996#true} {48390#(< main_~r~0 (+ main_~v~0 1))} #94#return; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:53,763 INFO L290 TraceCheckUtils]: 144: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(0 != ~r~0); {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:53,763 INFO L290 TraceCheckUtils]: 145: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:53,763 INFO L290 TraceCheckUtils]: 146: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:53,763 INFO L272 TraceCheckUtils]: 147: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,763 INFO L290 TraceCheckUtils]: 148: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,763 INFO L290 TraceCheckUtils]: 149: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,764 INFO L290 TraceCheckUtils]: 150: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,764 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {47996#true} {48390#(< main_~r~0 (+ main_~v~0 1))} #96#return; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:53,764 INFO L290 TraceCheckUtils]: 152: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48463#(< main_~r~0 1)} is VALID [2022-04-14 16:14:53,765 INFO L290 TraceCheckUtils]: 153: Hoare triple {48463#(< main_~r~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48463#(< main_~r~0 1)} is VALID [2022-04-14 16:14:53,765 INFO L290 TraceCheckUtils]: 154: Hoare triple {48463#(< main_~r~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {48463#(< main_~r~0 1)} is VALID [2022-04-14 16:14:53,765 INFO L272 TraceCheckUtils]: 155: Hoare triple {48463#(< main_~r~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:53,765 INFO L290 TraceCheckUtils]: 156: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:53,765 INFO L290 TraceCheckUtils]: 157: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:53,765 INFO L290 TraceCheckUtils]: 158: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:53,766 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {47996#true} {48463#(< main_~r~0 1)} #96#return; {48463#(< main_~r~0 1)} is VALID [2022-04-14 16:14:53,766 INFO L290 TraceCheckUtils]: 160: Hoare triple {48463#(< main_~r~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47997#false} is VALID [2022-04-14 16:14:53,766 INFO L290 TraceCheckUtils]: 161: Hoare triple {47997#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47997#false} is VALID [2022-04-14 16:14:53,766 INFO L290 TraceCheckUtils]: 162: Hoare triple {47997#false} assume !!(#t~post7 < 100);havoc #t~post7; {47997#false} is VALID [2022-04-14 16:14:53,766 INFO L272 TraceCheckUtils]: 163: Hoare triple {47997#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47997#false} is VALID [2022-04-14 16:14:53,766 INFO L290 TraceCheckUtils]: 164: Hoare triple {47997#false} ~cond := #in~cond; {47997#false} is VALID [2022-04-14 16:14:53,766 INFO L290 TraceCheckUtils]: 165: Hoare triple {47997#false} assume !(0 == ~cond); {47997#false} is VALID [2022-04-14 16:14:53,766 INFO L290 TraceCheckUtils]: 166: Hoare triple {47997#false} assume true; {47997#false} is VALID [2022-04-14 16:14:53,766 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {47997#false} {47997#false} #96#return; {47997#false} is VALID [2022-04-14 16:14:53,766 INFO L290 TraceCheckUtils]: 168: Hoare triple {47997#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L290 TraceCheckUtils]: 169: Hoare triple {47997#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L290 TraceCheckUtils]: 170: Hoare triple {47997#false} assume !!(#t~post7 < 100);havoc #t~post7; {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L272 TraceCheckUtils]: 171: Hoare triple {47997#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L290 TraceCheckUtils]: 172: Hoare triple {47997#false} ~cond := #in~cond; {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L290 TraceCheckUtils]: 173: Hoare triple {47997#false} assume !(0 == ~cond); {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L290 TraceCheckUtils]: 174: Hoare triple {47997#false} assume true; {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {47997#false} {47997#false} #96#return; {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L290 TraceCheckUtils]: 176: Hoare triple {47997#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L290 TraceCheckUtils]: 177: Hoare triple {47997#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L290 TraceCheckUtils]: 178: Hoare triple {47997#false} assume !(#t~post7 < 100);havoc #t~post7; {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L290 TraceCheckUtils]: 179: Hoare triple {47997#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L290 TraceCheckUtils]: 180: Hoare triple {47997#false} assume !(#t~post8 < 100);havoc #t~post8; {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L290 TraceCheckUtils]: 181: Hoare triple {47997#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L290 TraceCheckUtils]: 182: Hoare triple {47997#false} assume !(#t~post6 < 100);havoc #t~post6; {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L272 TraceCheckUtils]: 183: Hoare triple {47997#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L290 TraceCheckUtils]: 184: Hoare triple {47997#false} ~cond := #in~cond; {47997#false} is VALID [2022-04-14 16:14:53,767 INFO L290 TraceCheckUtils]: 185: Hoare triple {47997#false} assume 0 == ~cond; {47997#false} is VALID [2022-04-14 16:14:53,768 INFO L290 TraceCheckUtils]: 186: Hoare triple {47997#false} assume !false; {47997#false} is VALID [2022-04-14 16:14:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 280 proven. 184 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2022-04-14 16:14:53,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:14:54,368 INFO L290 TraceCheckUtils]: 186: Hoare triple {47997#false} assume !false; {47997#false} is VALID [2022-04-14 16:14:54,369 INFO L290 TraceCheckUtils]: 185: Hoare triple {47997#false} assume 0 == ~cond; {47997#false} is VALID [2022-04-14 16:14:54,369 INFO L290 TraceCheckUtils]: 184: Hoare triple {47997#false} ~cond := #in~cond; {47997#false} is VALID [2022-04-14 16:14:54,369 INFO L272 TraceCheckUtils]: 183: Hoare triple {47997#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47997#false} is VALID [2022-04-14 16:14:54,369 INFO L290 TraceCheckUtils]: 182: Hoare triple {47997#false} assume !(#t~post6 < 100);havoc #t~post6; {47997#false} is VALID [2022-04-14 16:14:54,369 INFO L290 TraceCheckUtils]: 181: Hoare triple {47997#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47997#false} is VALID [2022-04-14 16:14:54,369 INFO L290 TraceCheckUtils]: 180: Hoare triple {47997#false} assume !(#t~post8 < 100);havoc #t~post8; {47997#false} is VALID [2022-04-14 16:14:54,369 INFO L290 TraceCheckUtils]: 179: Hoare triple {47997#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47997#false} is VALID [2022-04-14 16:14:54,369 INFO L290 TraceCheckUtils]: 178: Hoare triple {47997#false} assume !(#t~post7 < 100);havoc #t~post7; {47997#false} is VALID [2022-04-14 16:14:54,369 INFO L290 TraceCheckUtils]: 177: Hoare triple {47997#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47997#false} is VALID [2022-04-14 16:14:54,369 INFO L290 TraceCheckUtils]: 176: Hoare triple {47997#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47997#false} is VALID [2022-04-14 16:14:54,369 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {47996#true} {47997#false} #96#return; {47997#false} is VALID [2022-04-14 16:14:54,369 INFO L290 TraceCheckUtils]: 174: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,369 INFO L290 TraceCheckUtils]: 173: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,369 INFO L290 TraceCheckUtils]: 172: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,369 INFO L272 TraceCheckUtils]: 171: Hoare triple {47997#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,369 INFO L290 TraceCheckUtils]: 170: Hoare triple {47997#false} assume !!(#t~post7 < 100);havoc #t~post7; {47997#false} is VALID [2022-04-14 16:14:54,370 INFO L290 TraceCheckUtils]: 169: Hoare triple {47997#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47997#false} is VALID [2022-04-14 16:14:54,370 INFO L290 TraceCheckUtils]: 168: Hoare triple {47997#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47997#false} is VALID [2022-04-14 16:14:54,370 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {47996#true} {47997#false} #96#return; {47997#false} is VALID [2022-04-14 16:14:54,370 INFO L290 TraceCheckUtils]: 166: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,370 INFO L290 TraceCheckUtils]: 165: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,370 INFO L290 TraceCheckUtils]: 164: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,370 INFO L272 TraceCheckUtils]: 163: Hoare triple {47997#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,370 INFO L290 TraceCheckUtils]: 162: Hoare triple {47997#false} assume !!(#t~post7 < 100);havoc #t~post7; {47997#false} is VALID [2022-04-14 16:14:54,370 INFO L290 TraceCheckUtils]: 161: Hoare triple {47997#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47997#false} is VALID [2022-04-14 16:14:54,371 INFO L290 TraceCheckUtils]: 160: Hoare triple {48463#(< main_~r~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47997#false} is VALID [2022-04-14 16:14:54,371 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {47996#true} {48463#(< main_~r~0 1)} #96#return; {48463#(< main_~r~0 1)} is VALID [2022-04-14 16:14:54,371 INFO L290 TraceCheckUtils]: 158: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,371 INFO L290 TraceCheckUtils]: 157: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,371 INFO L290 TraceCheckUtils]: 156: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,371 INFO L272 TraceCheckUtils]: 155: Hoare triple {48463#(< main_~r~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,371 INFO L290 TraceCheckUtils]: 154: Hoare triple {48463#(< main_~r~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {48463#(< main_~r~0 1)} is VALID [2022-04-14 16:14:54,372 INFO L290 TraceCheckUtils]: 153: Hoare triple {48463#(< main_~r~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48463#(< main_~r~0 1)} is VALID [2022-04-14 16:14:54,372 INFO L290 TraceCheckUtils]: 152: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48463#(< main_~r~0 1)} is VALID [2022-04-14 16:14:54,373 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {47996#true} {48390#(< main_~r~0 (+ main_~v~0 1))} #96#return; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:54,373 INFO L290 TraceCheckUtils]: 150: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,373 INFO L290 TraceCheckUtils]: 149: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,373 INFO L290 TraceCheckUtils]: 148: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,373 INFO L272 TraceCheckUtils]: 147: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,373 INFO L290 TraceCheckUtils]: 146: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:54,374 INFO L290 TraceCheckUtils]: 145: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:54,374 INFO L290 TraceCheckUtils]: 144: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(0 != ~r~0); {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:54,374 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {47996#true} {48390#(< main_~r~0 (+ main_~v~0 1))} #94#return; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:54,374 INFO L290 TraceCheckUtils]: 142: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,374 INFO L290 TraceCheckUtils]: 141: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,374 INFO L290 TraceCheckUtils]: 140: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,375 INFO L272 TraceCheckUtils]: 139: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,375 INFO L290 TraceCheckUtils]: 138: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:54,375 INFO L290 TraceCheckUtils]: 137: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:54,375 INFO L290 TraceCheckUtils]: 136: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !(~r~0 < 0); {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:54,376 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {47996#true} {48390#(< main_~r~0 (+ main_~v~0 1))} #98#return; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:54,376 INFO L290 TraceCheckUtils]: 134: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,376 INFO L290 TraceCheckUtils]: 133: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,376 INFO L290 TraceCheckUtils]: 132: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,376 INFO L272 TraceCheckUtils]: 131: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,376 INFO L290 TraceCheckUtils]: 130: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:54,376 INFO L290 TraceCheckUtils]: 129: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:54,377 INFO L290 TraceCheckUtils]: 128: Hoare triple {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-14 16:14:54,377 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {47996#true} {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} #98#return; {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-14 16:14:54,377 INFO L290 TraceCheckUtils]: 126: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,378 INFO L290 TraceCheckUtils]: 125: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,378 INFO L290 TraceCheckUtils]: 124: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,378 INFO L272 TraceCheckUtils]: 123: Hoare triple {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,378 INFO L290 TraceCheckUtils]: 122: Hoare triple {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} assume !!(#t~post8 < 100);havoc #t~post8; {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-14 16:14:54,378 INFO L290 TraceCheckUtils]: 121: Hoare triple {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-14 16:14:54,378 INFO L290 TraceCheckUtils]: 120: Hoare triple {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} assume !(~r~0 > 0); {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-14 16:14:54,379 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {47996#true} {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} #96#return; {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-14 16:14:54,379 INFO L290 TraceCheckUtils]: 118: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,379 INFO L290 TraceCheckUtils]: 117: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,379 INFO L290 TraceCheckUtils]: 116: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,379 INFO L272 TraceCheckUtils]: 115: Hoare triple {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,379 INFO L290 TraceCheckUtils]: 114: Hoare triple {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} assume !!(#t~post7 < 100);havoc #t~post7; {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-14 16:14:54,379 INFO L290 TraceCheckUtils]: 113: Hoare triple {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-14 16:14:54,380 INFO L290 TraceCheckUtils]: 112: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-14 16:14:54,380 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {47996#true} {48268#(< main_~u~0 (+ 5 main_~r~0))} #96#return; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:54,381 INFO L290 TraceCheckUtils]: 110: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,381 INFO L290 TraceCheckUtils]: 109: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,381 INFO L290 TraceCheckUtils]: 108: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,381 INFO L272 TraceCheckUtils]: 107: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,381 INFO L290 TraceCheckUtils]: 106: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:54,381 INFO L290 TraceCheckUtils]: 105: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:54,381 INFO L290 TraceCheckUtils]: 104: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(0 != ~r~0); {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:54,382 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {47996#true} {48268#(< main_~u~0 (+ 5 main_~r~0))} #94#return; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:54,393 INFO L290 TraceCheckUtils]: 102: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,393 INFO L290 TraceCheckUtils]: 101: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,393 INFO L290 TraceCheckUtils]: 100: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,393 INFO L272 TraceCheckUtils]: 99: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,394 INFO L290 TraceCheckUtils]: 98: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:54,394 INFO L290 TraceCheckUtils]: 97: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:54,394 INFO L290 TraceCheckUtils]: 96: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !(~r~0 < 0); {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:54,395 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47996#true} {48268#(< main_~u~0 (+ 5 main_~r~0))} #98#return; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:54,395 INFO L290 TraceCheckUtils]: 94: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,395 INFO L290 TraceCheckUtils]: 93: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,395 INFO L290 TraceCheckUtils]: 92: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,395 INFO L272 TraceCheckUtils]: 91: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,396 INFO L290 TraceCheckUtils]: 90: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:54,397 INFO L290 TraceCheckUtils]: 89: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:54,397 INFO L290 TraceCheckUtils]: 88: Hoare triple {48219#(< 0 (+ main_~r~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-14 16:14:54,398 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47996#true} {48219#(< 0 (+ main_~r~0 3))} #98#return; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-14 16:14:54,398 INFO L290 TraceCheckUtils]: 86: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,398 INFO L290 TraceCheckUtils]: 85: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,398 INFO L290 TraceCheckUtils]: 84: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,398 INFO L272 TraceCheckUtils]: 83: Hoare triple {48219#(< 0 (+ main_~r~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,399 INFO L290 TraceCheckUtils]: 82: Hoare triple {48219#(< 0 (+ main_~r~0 3))} assume !!(#t~post8 < 100);havoc #t~post8; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-14 16:14:54,399 INFO L290 TraceCheckUtils]: 81: Hoare triple {48219#(< 0 (+ main_~r~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-14 16:14:54,399 INFO L290 TraceCheckUtils]: 80: Hoare triple {48219#(< 0 (+ main_~r~0 3))} assume !(~r~0 > 0); {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-14 16:14:54,400 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47996#true} {48219#(< 0 (+ main_~r~0 3))} #96#return; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-14 16:14:54,400 INFO L290 TraceCheckUtils]: 78: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,400 INFO L290 TraceCheckUtils]: 77: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,400 INFO L290 TraceCheckUtils]: 76: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,400 INFO L272 TraceCheckUtils]: 75: Hoare triple {48219#(< 0 (+ main_~r~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,400 INFO L290 TraceCheckUtils]: 74: Hoare triple {48219#(< 0 (+ main_~r~0 3))} assume !!(#t~post7 < 100);havoc #t~post7; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-14 16:14:54,400 INFO L290 TraceCheckUtils]: 73: Hoare triple {48219#(< 0 (+ main_~r~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-14 16:14:54,401 INFO L290 TraceCheckUtils]: 72: Hoare triple {48194#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-14 16:14:54,401 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47996#true} {48194#(<= main_~v~0 3)} #96#return; {48194#(<= main_~v~0 3)} is VALID [2022-04-14 16:14:54,401 INFO L290 TraceCheckUtils]: 70: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,401 INFO L290 TraceCheckUtils]: 69: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,402 INFO L290 TraceCheckUtils]: 68: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,402 INFO L272 TraceCheckUtils]: 67: Hoare triple {48194#(<= main_~v~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,402 INFO L290 TraceCheckUtils]: 66: Hoare triple {48194#(<= main_~v~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {48194#(<= main_~v~0 3)} is VALID [2022-04-14 16:14:54,402 INFO L290 TraceCheckUtils]: 65: Hoare triple {48194#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48194#(<= main_~v~0 3)} is VALID [2022-04-14 16:14:54,402 INFO L290 TraceCheckUtils]: 64: Hoare triple {48049#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48194#(<= main_~v~0 3)} is VALID [2022-04-14 16:14:54,403 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #96#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,403 INFO L290 TraceCheckUtils]: 62: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,403 INFO L290 TraceCheckUtils]: 61: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,403 INFO L290 TraceCheckUtils]: 60: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,403 INFO L272 TraceCheckUtils]: 59: Hoare triple {48049#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,403 INFO L290 TraceCheckUtils]: 58: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,404 INFO L290 TraceCheckUtils]: 57: Hoare triple {48049#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {48049#(<= main_~v~0 1)} assume !!(0 != ~r~0); {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,404 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #94#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,404 INFO L290 TraceCheckUtils]: 54: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,404 INFO L290 TraceCheckUtils]: 53: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,404 INFO L272 TraceCheckUtils]: 51: Hoare triple {48049#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {48049#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {48049#(<= main_~v~0 1)} assume !(~r~0 < 0); {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,406 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #98#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,406 INFO L290 TraceCheckUtils]: 46: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,406 INFO L290 TraceCheckUtils]: 45: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,406 INFO L290 TraceCheckUtils]: 44: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,406 INFO L272 TraceCheckUtils]: 43: Hoare triple {48049#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,406 INFO L290 TraceCheckUtils]: 42: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {48049#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {48049#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,407 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #98#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,407 INFO L290 TraceCheckUtils]: 38: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,407 INFO L272 TraceCheckUtils]: 35: Hoare triple {48049#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {48049#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {48049#(<= main_~v~0 1)} assume !(~r~0 > 0); {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,408 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #96#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,409 INFO L272 TraceCheckUtils]: 27: Hoare triple {48049#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {48049#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {48049#(<= main_~v~0 1)} assume !!(0 != ~r~0); {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,410 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #94#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,410 INFO L272 TraceCheckUtils]: 19: Hoare triple {48049#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {48049#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {47996#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {48049#(<= main_~v~0 1)} is VALID [2022-04-14 16:14:54,411 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47996#true} {47996#true} #92#return; {47996#true} is VALID [2022-04-14 16:14:54,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,411 INFO L272 TraceCheckUtils]: 11: Hoare triple {47996#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,411 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47996#true} {47996#true} #90#return; {47996#true} is VALID [2022-04-14 16:14:54,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-14 16:14:54,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-14 16:14:54,412 INFO L272 TraceCheckUtils]: 6: Hoare triple {47996#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {47996#true} is VALID [2022-04-14 16:14:54,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {47996#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {47996#true} is VALID [2022-04-14 16:14:54,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {47996#true} call #t~ret9 := main(); {47996#true} is VALID [2022-04-14 16:14:54,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47996#true} {47996#true} #102#return; {47996#true} is VALID [2022-04-14 16:14:54,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-14 16:14:54,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {47996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {47996#true} is VALID [2022-04-14 16:14:54,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {47996#true} call ULTIMATE.init(); {47996#true} is VALID [2022-04-14 16:14:54,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 140 proven. 184 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2022-04-14 16:14:54,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:14:54,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543653412] [2022-04-14 16:14:54,413 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:14:54,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594025493] [2022-04-14 16:14:54,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594025493] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:14:54,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:14:54,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2022-04-14 16:14:54,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522872994] [2022-04-14 16:14:54,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:14:54,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 187 [2022-04-14 16:14:54,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:14:54,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-14 16:14:54,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:54,510 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 16:14:54,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:14:54,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 16:14:54,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-14 16:14:54,511 INFO L87 Difference]: Start difference. First operand 841 states and 1056 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-14 16:14:58,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:58,587 INFO L93 Difference]: Finished difference Result 1792 states and 2329 transitions. [2022-04-14 16:14:58,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-14 16:14:58,587 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 187 [2022-04-14 16:14:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:14:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-14 16:14:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 430 transitions. [2022-04-14 16:14:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-14 16:14:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 430 transitions. [2022-04-14 16:14:58,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 430 transitions. [2022-04-14 16:14:58,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:14:59,012 INFO L225 Difference]: With dead ends: 1792 [2022-04-14 16:14:59,012 INFO L226 Difference]: Without dead ends: 1595 [2022-04-14 16:14:59,013 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 363 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2022-04-14 16:14:59,013 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 138 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-14 16:14:59,014 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 905 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-14 16:14:59,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2022-04-14 16:15:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1400. [2022-04-14 16:15:00,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:15:00,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1595 states. Second operand has 1400 states, 1052 states have (on average 1.170152091254753) internal successors, (1231), 1068 states have internal predecessors, (1231), 305 states have call successors, (305), 44 states have call predecessors, (305), 42 states have return successors, (303), 287 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-14 16:15:00,174 INFO L74 IsIncluded]: Start isIncluded. First operand 1595 states. Second operand has 1400 states, 1052 states have (on average 1.170152091254753) internal successors, (1231), 1068 states have internal predecessors, (1231), 305 states have call successors, (305), 44 states have call predecessors, (305), 42 states have return successors, (303), 287 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-14 16:15:00,175 INFO L87 Difference]: Start difference. First operand 1595 states. Second operand has 1400 states, 1052 states have (on average 1.170152091254753) internal successors, (1231), 1068 states have internal predecessors, (1231), 305 states have call successors, (305), 44 states have call predecessors, (305), 42 states have return successors, (303), 287 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-14 16:15:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:00,245 INFO L93 Difference]: Finished difference Result 1595 states and 2066 transitions. [2022-04-14 16:15:00,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2066 transitions. [2022-04-14 16:15:00,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:15:00,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:15:00,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 1400 states, 1052 states have (on average 1.170152091254753) internal successors, (1231), 1068 states have internal predecessors, (1231), 305 states have call successors, (305), 44 states have call predecessors, (305), 42 states have return successors, (303), 287 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1595 states. [2022-04-14 16:15:00,250 INFO L87 Difference]: Start difference. First operand has 1400 states, 1052 states have (on average 1.170152091254753) internal successors, (1231), 1068 states have internal predecessors, (1231), 305 states have call successors, (305), 44 states have call predecessors, (305), 42 states have return successors, (303), 287 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1595 states. [2022-04-14 16:15:00,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:00,321 INFO L93 Difference]: Finished difference Result 1595 states and 2066 transitions. [2022-04-14 16:15:00,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2066 transitions. [2022-04-14 16:15:00,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:15:00,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:15:00,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:15:00,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:15:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1052 states have (on average 1.170152091254753) internal successors, (1231), 1068 states have internal predecessors, (1231), 305 states have call successors, (305), 44 states have call predecessors, (305), 42 states have return successors, (303), 287 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-14 16:15:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1839 transitions. [2022-04-14 16:15:00,400 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1839 transitions. Word has length 187 [2022-04-14 16:15:00,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:15:00,400 INFO L478 AbstractCegarLoop]: Abstraction has 1400 states and 1839 transitions. [2022-04-14 16:15:00,400 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-14 16:15:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1839 transitions. [2022-04-14 16:15:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-14 16:15:00,403 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:15:00,403 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 10, 9, 9, 9, 8, 7, 7, 7, 6, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:15:00,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-14 16:15:00,608 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:15:00,609 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:15:00,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:15:00,609 INFO L85 PathProgramCache]: Analyzing trace with hash -719610275, now seen corresponding path program 8 times [2022-04-14 16:15:00,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:15:00,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879179385] [2022-04-14 16:15:00,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:15:00,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:15:00,625 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:15:00,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2094185023] [2022-04-14 16:15:00,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 16:15:00,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:15:00,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:15:00,626 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:15:00,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-14 16:15:00,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 16:15:00,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:15:00,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 16:15:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:15:00,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:15:01,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {56805#true} call ULTIMATE.init(); {56805#true} is VALID [2022-04-14 16:15:01,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {56805#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {56805#true} is VALID [2022-04-14 16:15:01,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56805#true} {56805#true} #102#return; {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {56805#true} call #t~ret9 := main(); {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {56805#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L272 TraceCheckUtils]: 6: Hoare triple {56805#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {56805#true} {56805#true} #90#return; {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L272 TraceCheckUtils]: 11: Hoare triple {56805#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56805#true} {56805#true} #92#return; {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {56805#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {56805#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {56805#true} assume !!(#t~post6 < 100);havoc #t~post6; {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L272 TraceCheckUtils]: 19: Hoare triple {56805#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,322 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56805#true} {56805#true} #94#return; {56805#true} is VALID [2022-04-14 16:15:01,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {56805#true} assume !!(0 != ~r~0); {56805#true} is VALID [2022-04-14 16:15:01,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {56805#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56805#true} is VALID [2022-04-14 16:15:01,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {56805#true} assume !!(#t~post7 < 100);havoc #t~post7; {56805#true} is VALID [2022-04-14 16:15:01,322 INFO L272 TraceCheckUtils]: 27: Hoare triple {56805#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,322 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56805#true} {56805#true} #96#return; {56805#true} is VALID [2022-04-14 16:15:01,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {56805#true} assume !(~r~0 > 0); {56805#true} is VALID [2022-04-14 16:15:01,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {56805#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56805#true} is VALID [2022-04-14 16:15:01,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {56805#true} assume !!(#t~post8 < 100);havoc #t~post8; {56805#true} is VALID [2022-04-14 16:15:01,322 INFO L272 TraceCheckUtils]: 35: Hoare triple {56805#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,323 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56805#true} {56805#true} #98#return; {56805#true} is VALID [2022-04-14 16:15:01,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {56805#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-14 16:15:01,324 INFO L290 TraceCheckUtils]: 41: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-14 16:15:01,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post8 < 100);havoc #t~post8; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-14 16:15:01,324 INFO L272 TraceCheckUtils]: 43: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,325 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56805#true} {56930#(< (+ main_~r~0 2) main_~u~0)} #98#return; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-14 16:15:01,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} assume !(~r~0 < 0); {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-14 16:15:01,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-14 16:15:01,326 INFO L290 TraceCheckUtils]: 50: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post6 < 100);havoc #t~post6; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-14 16:15:01,326 INFO L272 TraceCheckUtils]: 51: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,326 INFO L290 TraceCheckUtils]: 52: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,326 INFO L290 TraceCheckUtils]: 53: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,326 INFO L290 TraceCheckUtils]: 54: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,326 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56805#true} {56930#(< (+ main_~r~0 2) main_~u~0)} #94#return; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-14 16:15:01,327 INFO L290 TraceCheckUtils]: 56: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} assume !!(0 != ~r~0); {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-14 16:15:01,327 INFO L290 TraceCheckUtils]: 57: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-14 16:15:01,327 INFO L290 TraceCheckUtils]: 58: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-14 16:15:01,327 INFO L272 TraceCheckUtils]: 59: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,327 INFO L290 TraceCheckUtils]: 60: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,327 INFO L290 TraceCheckUtils]: 61: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,327 INFO L290 TraceCheckUtils]: 62: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,328 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56805#true} {56930#(< (+ main_~r~0 2) main_~u~0)} #96#return; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-14 16:15:01,328 INFO L290 TraceCheckUtils]: 64: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-14 16:15:01,329 INFO L290 TraceCheckUtils]: 65: Hoare triple {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-14 16:15:01,329 INFO L290 TraceCheckUtils]: 66: Hoare triple {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-14 16:15:01,329 INFO L272 TraceCheckUtils]: 67: Hoare triple {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,329 INFO L290 TraceCheckUtils]: 68: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,329 INFO L290 TraceCheckUtils]: 69: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,329 INFO L290 TraceCheckUtils]: 70: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,330 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56805#true} {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} #96#return; {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-14 16:15:01,330 INFO L290 TraceCheckUtils]: 72: Hoare triple {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-14 16:15:01,330 INFO L290 TraceCheckUtils]: 73: Hoare triple {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-14 16:15:01,331 INFO L290 TraceCheckUtils]: 74: Hoare triple {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} assume !!(#t~post7 < 100);havoc #t~post7; {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-14 16:15:01,331 INFO L272 TraceCheckUtils]: 75: Hoare triple {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,331 INFO L290 TraceCheckUtils]: 76: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,331 INFO L290 TraceCheckUtils]: 77: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,331 INFO L290 TraceCheckUtils]: 78: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,331 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56805#true} {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} #96#return; {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-14 16:15:01,332 INFO L290 TraceCheckUtils]: 80: Hoare triple {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} assume !(~r~0 > 0); {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-14 16:15:01,332 INFO L290 TraceCheckUtils]: 81: Hoare triple {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-14 16:15:01,332 INFO L290 TraceCheckUtils]: 82: Hoare triple {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} assume !!(#t~post8 < 100);havoc #t~post8; {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-14 16:15:01,332 INFO L272 TraceCheckUtils]: 83: Hoare triple {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,332 INFO L290 TraceCheckUtils]: 84: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,333 INFO L290 TraceCheckUtils]: 85: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,333 INFO L290 TraceCheckUtils]: 86: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,333 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56805#true} {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} #98#return; {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-14 16:15:01,334 INFO L290 TraceCheckUtils]: 88: Hoare triple {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-14 16:15:01,334 INFO L290 TraceCheckUtils]: 89: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-14 16:15:01,334 INFO L290 TraceCheckUtils]: 90: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(#t~post8 < 100);havoc #t~post8; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-14 16:15:01,334 INFO L272 TraceCheckUtils]: 91: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,334 INFO L290 TraceCheckUtils]: 92: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,334 INFO L290 TraceCheckUtils]: 93: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,334 INFO L290 TraceCheckUtils]: 94: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,335 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56805#true} {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #98#return; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-14 16:15:01,335 INFO L290 TraceCheckUtils]: 96: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !(~r~0 < 0); {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-14 16:15:01,336 INFO L290 TraceCheckUtils]: 97: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-14 16:15:01,336 INFO L290 TraceCheckUtils]: 98: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(#t~post6 < 100);havoc #t~post6; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-14 16:15:01,336 INFO L272 TraceCheckUtils]: 99: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,336 INFO L290 TraceCheckUtils]: 100: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,336 INFO L290 TraceCheckUtils]: 101: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,336 INFO L290 TraceCheckUtils]: 102: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,336 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {56805#true} {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #94#return; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-14 16:15:01,337 INFO L290 TraceCheckUtils]: 104: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(0 != ~r~0); {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-14 16:15:01,337 INFO L290 TraceCheckUtils]: 105: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-14 16:15:01,337 INFO L290 TraceCheckUtils]: 106: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(#t~post7 < 100);havoc #t~post7; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-14 16:15:01,337 INFO L272 TraceCheckUtils]: 107: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,338 INFO L290 TraceCheckUtils]: 108: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,338 INFO L290 TraceCheckUtils]: 109: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,338 INFO L290 TraceCheckUtils]: 110: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,338 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {56805#true} {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #96#return; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-14 16:15:01,339 INFO L290 TraceCheckUtils]: 112: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {57150#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,339 INFO L290 TraceCheckUtils]: 113: Hoare triple {57150#(< 4 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57150#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,339 INFO L290 TraceCheckUtils]: 114: Hoare triple {57150#(< 4 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {57150#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,339 INFO L272 TraceCheckUtils]: 115: Hoare triple {57150#(< 4 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,339 INFO L290 TraceCheckUtils]: 116: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,339 INFO L290 TraceCheckUtils]: 117: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,339 INFO L290 TraceCheckUtils]: 118: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,341 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {56805#true} {57150#(< 4 (+ main_~u~0 main_~r~0))} #96#return; {57150#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,342 INFO L290 TraceCheckUtils]: 120: Hoare triple {57150#(< 4 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {57150#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,342 INFO L290 TraceCheckUtils]: 121: Hoare triple {57150#(< 4 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57150#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,342 INFO L290 TraceCheckUtils]: 122: Hoare triple {57150#(< 4 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {57150#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,342 INFO L272 TraceCheckUtils]: 123: Hoare triple {57150#(< 4 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,342 INFO L290 TraceCheckUtils]: 124: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,342 INFO L290 TraceCheckUtils]: 125: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,342 INFO L290 TraceCheckUtils]: 126: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,343 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {56805#true} {57150#(< 4 (+ main_~u~0 main_~r~0))} #98#return; {57150#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,355 INFO L290 TraceCheckUtils]: 128: Hoare triple {57150#(< 4 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {57199#(< 4 main_~r~0)} is VALID [2022-04-14 16:15:01,356 INFO L290 TraceCheckUtils]: 129: Hoare triple {57199#(< 4 main_~r~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57199#(< 4 main_~r~0)} is VALID [2022-04-14 16:15:01,356 INFO L290 TraceCheckUtils]: 130: Hoare triple {57199#(< 4 main_~r~0)} assume !!(#t~post8 < 100);havoc #t~post8; {57199#(< 4 main_~r~0)} is VALID [2022-04-14 16:15:01,356 INFO L272 TraceCheckUtils]: 131: Hoare triple {57199#(< 4 main_~r~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,356 INFO L290 TraceCheckUtils]: 132: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,357 INFO L290 TraceCheckUtils]: 133: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,357 INFO L290 TraceCheckUtils]: 134: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,357 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {56805#true} {57199#(< 4 main_~r~0)} #98#return; {57199#(< 4 main_~r~0)} is VALID [2022-04-14 16:15:01,358 INFO L290 TraceCheckUtils]: 136: Hoare triple {57199#(< 4 main_~r~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56806#false} is VALID [2022-04-14 16:15:01,358 INFO L290 TraceCheckUtils]: 137: Hoare triple {56806#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56806#false} is VALID [2022-04-14 16:15:01,358 INFO L290 TraceCheckUtils]: 138: Hoare triple {56806#false} assume !!(#t~post8 < 100);havoc #t~post8; {56806#false} is VALID [2022-04-14 16:15:01,358 INFO L272 TraceCheckUtils]: 139: Hoare triple {56806#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L290 TraceCheckUtils]: 140: Hoare triple {56806#false} ~cond := #in~cond; {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L290 TraceCheckUtils]: 141: Hoare triple {56806#false} assume !(0 == ~cond); {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L290 TraceCheckUtils]: 142: Hoare triple {56806#false} assume true; {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {56806#false} {56806#false} #98#return; {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L290 TraceCheckUtils]: 144: Hoare triple {56806#false} assume !(~r~0 < 0); {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L290 TraceCheckUtils]: 145: Hoare triple {56806#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L290 TraceCheckUtils]: 146: Hoare triple {56806#false} assume !!(#t~post6 < 100);havoc #t~post6; {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L272 TraceCheckUtils]: 147: Hoare triple {56806#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L290 TraceCheckUtils]: 148: Hoare triple {56806#false} ~cond := #in~cond; {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L290 TraceCheckUtils]: 149: Hoare triple {56806#false} assume !(0 == ~cond); {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L290 TraceCheckUtils]: 150: Hoare triple {56806#false} assume true; {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {56806#false} {56806#false} #94#return; {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L290 TraceCheckUtils]: 152: Hoare triple {56806#false} assume !!(0 != ~r~0); {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L290 TraceCheckUtils]: 153: Hoare triple {56806#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L290 TraceCheckUtils]: 154: Hoare triple {56806#false} assume !!(#t~post7 < 100);havoc #t~post7; {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L272 TraceCheckUtils]: 155: Hoare triple {56806#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56806#false} is VALID [2022-04-14 16:15:01,359 INFO L290 TraceCheckUtils]: 156: Hoare triple {56806#false} ~cond := #in~cond; {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L290 TraceCheckUtils]: 157: Hoare triple {56806#false} assume !(0 == ~cond); {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L290 TraceCheckUtils]: 158: Hoare triple {56806#false} assume true; {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {56806#false} {56806#false} #96#return; {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L290 TraceCheckUtils]: 160: Hoare triple {56806#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L290 TraceCheckUtils]: 161: Hoare triple {56806#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L290 TraceCheckUtils]: 162: Hoare triple {56806#false} assume !!(#t~post7 < 100);havoc #t~post7; {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L272 TraceCheckUtils]: 163: Hoare triple {56806#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L290 TraceCheckUtils]: 164: Hoare triple {56806#false} ~cond := #in~cond; {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L290 TraceCheckUtils]: 165: Hoare triple {56806#false} assume !(0 == ~cond); {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L290 TraceCheckUtils]: 166: Hoare triple {56806#false} assume true; {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {56806#false} {56806#false} #96#return; {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L290 TraceCheckUtils]: 168: Hoare triple {56806#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L290 TraceCheckUtils]: 169: Hoare triple {56806#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L290 TraceCheckUtils]: 170: Hoare triple {56806#false} assume !!(#t~post7 < 100);havoc #t~post7; {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L272 TraceCheckUtils]: 171: Hoare triple {56806#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L290 TraceCheckUtils]: 172: Hoare triple {56806#false} ~cond := #in~cond; {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L290 TraceCheckUtils]: 173: Hoare triple {56806#false} assume !(0 == ~cond); {56806#false} is VALID [2022-04-14 16:15:01,360 INFO L290 TraceCheckUtils]: 174: Hoare triple {56806#false} assume true; {56806#false} is VALID [2022-04-14 16:15:01,361 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {56806#false} {56806#false} #96#return; {56806#false} is VALID [2022-04-14 16:15:01,361 INFO L290 TraceCheckUtils]: 176: Hoare triple {56806#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56806#false} is VALID [2022-04-14 16:15:01,361 INFO L290 TraceCheckUtils]: 177: Hoare triple {56806#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56806#false} is VALID [2022-04-14 16:15:01,361 INFO L290 TraceCheckUtils]: 178: Hoare triple {56806#false} assume !(#t~post7 < 100);havoc #t~post7; {56806#false} is VALID [2022-04-14 16:15:01,361 INFO L290 TraceCheckUtils]: 179: Hoare triple {56806#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56806#false} is VALID [2022-04-14 16:15:01,361 INFO L290 TraceCheckUtils]: 180: Hoare triple {56806#false} assume !(#t~post8 < 100);havoc #t~post8; {56806#false} is VALID [2022-04-14 16:15:01,361 INFO L290 TraceCheckUtils]: 181: Hoare triple {56806#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56806#false} is VALID [2022-04-14 16:15:01,361 INFO L290 TraceCheckUtils]: 182: Hoare triple {56806#false} assume !(#t~post6 < 100);havoc #t~post6; {56806#false} is VALID [2022-04-14 16:15:01,361 INFO L272 TraceCheckUtils]: 183: Hoare triple {56806#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56806#false} is VALID [2022-04-14 16:15:01,361 INFO L290 TraceCheckUtils]: 184: Hoare triple {56806#false} ~cond := #in~cond; {56806#false} is VALID [2022-04-14 16:15:01,361 INFO L290 TraceCheckUtils]: 185: Hoare triple {56806#false} assume 0 == ~cond; {56806#false} is VALID [2022-04-14 16:15:01,361 INFO L290 TraceCheckUtils]: 186: Hoare triple {56806#false} assume !false; {56806#false} is VALID [2022-04-14 16:15:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 516 proven. 84 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-14 16:15:01,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:15:01,929 INFO L290 TraceCheckUtils]: 186: Hoare triple {56806#false} assume !false; {56806#false} is VALID [2022-04-14 16:15:01,929 INFO L290 TraceCheckUtils]: 185: Hoare triple {56806#false} assume 0 == ~cond; {56806#false} is VALID [2022-04-14 16:15:01,929 INFO L290 TraceCheckUtils]: 184: Hoare triple {56806#false} ~cond := #in~cond; {56806#false} is VALID [2022-04-14 16:15:01,930 INFO L272 TraceCheckUtils]: 183: Hoare triple {56806#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56806#false} is VALID [2022-04-14 16:15:01,930 INFO L290 TraceCheckUtils]: 182: Hoare triple {56806#false} assume !(#t~post6 < 100);havoc #t~post6; {56806#false} is VALID [2022-04-14 16:15:01,930 INFO L290 TraceCheckUtils]: 181: Hoare triple {56806#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56806#false} is VALID [2022-04-14 16:15:01,930 INFO L290 TraceCheckUtils]: 180: Hoare triple {56806#false} assume !(#t~post8 < 100);havoc #t~post8; {56806#false} is VALID [2022-04-14 16:15:01,930 INFO L290 TraceCheckUtils]: 179: Hoare triple {56806#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56806#false} is VALID [2022-04-14 16:15:01,930 INFO L290 TraceCheckUtils]: 178: Hoare triple {56806#false} assume !(#t~post7 < 100);havoc #t~post7; {56806#false} is VALID [2022-04-14 16:15:01,930 INFO L290 TraceCheckUtils]: 177: Hoare triple {56806#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56806#false} is VALID [2022-04-14 16:15:01,930 INFO L290 TraceCheckUtils]: 176: Hoare triple {56806#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56806#false} is VALID [2022-04-14 16:15:01,930 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {56805#true} {56806#false} #96#return; {56806#false} is VALID [2022-04-14 16:15:01,930 INFO L290 TraceCheckUtils]: 174: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,930 INFO L290 TraceCheckUtils]: 173: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,930 INFO L290 TraceCheckUtils]: 172: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,930 INFO L272 TraceCheckUtils]: 171: Hoare triple {56806#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,930 INFO L290 TraceCheckUtils]: 170: Hoare triple {56806#false} assume !!(#t~post7 < 100);havoc #t~post7; {56806#false} is VALID [2022-04-14 16:15:01,930 INFO L290 TraceCheckUtils]: 169: Hoare triple {56806#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56806#false} is VALID [2022-04-14 16:15:01,930 INFO L290 TraceCheckUtils]: 168: Hoare triple {56806#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56806#false} is VALID [2022-04-14 16:15:01,930 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {56805#true} {56806#false} #96#return; {56806#false} is VALID [2022-04-14 16:15:01,931 INFO L290 TraceCheckUtils]: 166: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,931 INFO L290 TraceCheckUtils]: 165: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,931 INFO L290 TraceCheckUtils]: 164: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,931 INFO L272 TraceCheckUtils]: 163: Hoare triple {56806#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,931 INFO L290 TraceCheckUtils]: 162: Hoare triple {56806#false} assume !!(#t~post7 < 100);havoc #t~post7; {56806#false} is VALID [2022-04-14 16:15:01,931 INFO L290 TraceCheckUtils]: 161: Hoare triple {56806#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56806#false} is VALID [2022-04-14 16:15:01,931 INFO L290 TraceCheckUtils]: 160: Hoare triple {56806#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56806#false} is VALID [2022-04-14 16:15:01,931 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {56805#true} {56806#false} #96#return; {56806#false} is VALID [2022-04-14 16:15:01,931 INFO L290 TraceCheckUtils]: 158: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,931 INFO L290 TraceCheckUtils]: 157: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,931 INFO L290 TraceCheckUtils]: 156: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,931 INFO L272 TraceCheckUtils]: 155: Hoare triple {56806#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,931 INFO L290 TraceCheckUtils]: 154: Hoare triple {56806#false} assume !!(#t~post7 < 100);havoc #t~post7; {56806#false} is VALID [2022-04-14 16:15:01,931 INFO L290 TraceCheckUtils]: 153: Hoare triple {56806#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56806#false} is VALID [2022-04-14 16:15:01,931 INFO L290 TraceCheckUtils]: 152: Hoare triple {56806#false} assume !!(0 != ~r~0); {56806#false} is VALID [2022-04-14 16:15:01,931 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {56805#true} {56806#false} #94#return; {56806#false} is VALID [2022-04-14 16:15:01,931 INFO L290 TraceCheckUtils]: 150: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,931 INFO L290 TraceCheckUtils]: 149: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,932 INFO L290 TraceCheckUtils]: 148: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,932 INFO L272 TraceCheckUtils]: 147: Hoare triple {56806#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,932 INFO L290 TraceCheckUtils]: 146: Hoare triple {56806#false} assume !!(#t~post6 < 100);havoc #t~post6; {56806#false} is VALID [2022-04-14 16:15:01,932 INFO L290 TraceCheckUtils]: 145: Hoare triple {56806#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56806#false} is VALID [2022-04-14 16:15:01,932 INFO L290 TraceCheckUtils]: 144: Hoare triple {56806#false} assume !(~r~0 < 0); {56806#false} is VALID [2022-04-14 16:15:01,932 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {56805#true} {56806#false} #98#return; {56806#false} is VALID [2022-04-14 16:15:01,932 INFO L290 TraceCheckUtils]: 142: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,932 INFO L290 TraceCheckUtils]: 141: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,932 INFO L290 TraceCheckUtils]: 140: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,932 INFO L272 TraceCheckUtils]: 139: Hoare triple {56806#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,932 INFO L290 TraceCheckUtils]: 138: Hoare triple {56806#false} assume !!(#t~post8 < 100);havoc #t~post8; {56806#false} is VALID [2022-04-14 16:15:01,932 INFO L290 TraceCheckUtils]: 137: Hoare triple {56806#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56806#false} is VALID [2022-04-14 16:15:01,932 INFO L290 TraceCheckUtils]: 136: Hoare triple {57524#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56806#false} is VALID [2022-04-14 16:15:01,933 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {56805#true} {57524#(not (< main_~r~0 0))} #98#return; {57524#(not (< main_~r~0 0))} is VALID [2022-04-14 16:15:01,933 INFO L290 TraceCheckUtils]: 134: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,933 INFO L290 TraceCheckUtils]: 133: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,933 INFO L290 TraceCheckUtils]: 132: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,933 INFO L272 TraceCheckUtils]: 131: Hoare triple {57524#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,933 INFO L290 TraceCheckUtils]: 130: Hoare triple {57524#(not (< main_~r~0 0))} assume !!(#t~post8 < 100);havoc #t~post8; {57524#(not (< main_~r~0 0))} is VALID [2022-04-14 16:15:01,934 INFO L290 TraceCheckUtils]: 129: Hoare triple {57524#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57524#(not (< main_~r~0 0))} is VALID [2022-04-14 16:15:01,934 INFO L290 TraceCheckUtils]: 128: Hoare triple {57549#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {57524#(not (< main_~r~0 0))} is VALID [2022-04-14 16:15:01,935 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {56805#true} {57549#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {57549#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,935 INFO L290 TraceCheckUtils]: 126: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,935 INFO L290 TraceCheckUtils]: 125: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,935 INFO L290 TraceCheckUtils]: 124: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,935 INFO L272 TraceCheckUtils]: 123: Hoare triple {57549#(<= 0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,935 INFO L290 TraceCheckUtils]: 122: Hoare triple {57549#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {57549#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,935 INFO L290 TraceCheckUtils]: 121: Hoare triple {57549#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57549#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,936 INFO L290 TraceCheckUtils]: 120: Hoare triple {57549#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {57549#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,936 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {56805#true} {57549#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {57549#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,936 INFO L290 TraceCheckUtils]: 118: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,936 INFO L290 TraceCheckUtils]: 117: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,936 INFO L290 TraceCheckUtils]: 116: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,936 INFO L272 TraceCheckUtils]: 115: Hoare triple {57549#(<= 0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,936 INFO L290 TraceCheckUtils]: 114: Hoare triple {57549#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {57549#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,937 INFO L290 TraceCheckUtils]: 113: Hoare triple {57549#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57549#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,937 INFO L290 TraceCheckUtils]: 112: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {57549#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,938 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {56805#true} {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #96#return; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,938 INFO L290 TraceCheckUtils]: 110: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,938 INFO L290 TraceCheckUtils]: 109: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,938 INFO L290 TraceCheckUtils]: 108: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,938 INFO L272 TraceCheckUtils]: 107: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,938 INFO L290 TraceCheckUtils]: 106: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,938 INFO L290 TraceCheckUtils]: 105: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,939 INFO L290 TraceCheckUtils]: 104: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(0 != ~r~0); {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,939 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {56805#true} {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #94#return; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,939 INFO L290 TraceCheckUtils]: 102: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,939 INFO L290 TraceCheckUtils]: 101: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,939 INFO L290 TraceCheckUtils]: 100: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,939 INFO L272 TraceCheckUtils]: 99: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,944 INFO L290 TraceCheckUtils]: 98: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,944 INFO L290 TraceCheckUtils]: 97: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,944 INFO L290 TraceCheckUtils]: 96: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !(~r~0 < 0); {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,946 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56805#true} {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #98#return; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,946 INFO L290 TraceCheckUtils]: 94: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,946 INFO L290 TraceCheckUtils]: 93: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,946 INFO L290 TraceCheckUtils]: 92: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,946 INFO L272 TraceCheckUtils]: 91: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,946 INFO L290 TraceCheckUtils]: 90: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,947 INFO L290 TraceCheckUtils]: 89: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,948 INFO L290 TraceCheckUtils]: 88: Hoare triple {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-14 16:15:01,948 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56805#true} {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} #98#return; {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-14 16:15:01,948 INFO L290 TraceCheckUtils]: 86: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,948 INFO L290 TraceCheckUtils]: 85: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,948 INFO L290 TraceCheckUtils]: 84: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,949 INFO L272 TraceCheckUtils]: 83: Hoare triple {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,949 INFO L290 TraceCheckUtils]: 82: Hoare triple {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} assume !!(#t~post8 < 100);havoc #t~post8; {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-14 16:15:01,949 INFO L290 TraceCheckUtils]: 81: Hoare triple {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-14 16:15:01,949 INFO L290 TraceCheckUtils]: 80: Hoare triple {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} assume !(~r~0 > 0); {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-14 16:15:01,950 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56805#true} {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} #96#return; {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-14 16:15:01,950 INFO L290 TraceCheckUtils]: 78: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,950 INFO L290 TraceCheckUtils]: 77: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,950 INFO L290 TraceCheckUtils]: 76: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,950 INFO L272 TraceCheckUtils]: 75: Hoare triple {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,950 INFO L290 TraceCheckUtils]: 74: Hoare triple {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} assume !!(#t~post7 < 100);havoc #t~post7; {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-14 16:15:01,951 INFO L290 TraceCheckUtils]: 73: Hoare triple {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-14 16:15:01,951 INFO L290 TraceCheckUtils]: 72: Hoare triple {57720#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-14 16:15:01,952 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56805#true} {57720#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} #96#return; {57720#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} is VALID [2022-04-14 16:15:01,952 INFO L290 TraceCheckUtils]: 70: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,952 INFO L290 TraceCheckUtils]: 69: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,952 INFO L290 TraceCheckUtils]: 68: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,952 INFO L272 TraceCheckUtils]: 67: Hoare triple {57720#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,954 INFO L290 TraceCheckUtils]: 66: Hoare triple {57720#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} assume !!(#t~post7 < 100);havoc #t~post7; {57720#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} is VALID [2022-04-14 16:15:01,954 INFO L290 TraceCheckUtils]: 65: Hoare triple {57720#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57720#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} is VALID [2022-04-14 16:15:01,955 INFO L290 TraceCheckUtils]: 64: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {57720#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} is VALID [2022-04-14 16:15:01,955 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56805#true} {57745#(<= (+ main_~r~0 1) main_~u~0)} #96#return; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-14 16:15:01,955 INFO L290 TraceCheckUtils]: 62: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,955 INFO L290 TraceCheckUtils]: 61: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,955 INFO L290 TraceCheckUtils]: 60: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,955 INFO L272 TraceCheckUtils]: 59: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,956 INFO L290 TraceCheckUtils]: 58: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-14 16:15:01,956 INFO L290 TraceCheckUtils]: 57: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-14 16:15:01,956 INFO L290 TraceCheckUtils]: 56: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} assume !!(0 != ~r~0); {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-14 16:15:01,957 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56805#true} {57745#(<= (+ main_~r~0 1) main_~u~0)} #94#return; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-14 16:15:01,957 INFO L290 TraceCheckUtils]: 54: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,957 INFO L290 TraceCheckUtils]: 53: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,957 INFO L290 TraceCheckUtils]: 52: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,957 INFO L272 TraceCheckUtils]: 51: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,957 INFO L290 TraceCheckUtils]: 50: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} assume !!(#t~post6 < 100);havoc #t~post6; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-14 16:15:01,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-14 16:15:01,958 INFO L290 TraceCheckUtils]: 48: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} assume !(~r~0 < 0); {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-14 16:15:01,958 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56805#true} {57745#(<= (+ main_~r~0 1) main_~u~0)} #98#return; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-14 16:15:01,958 INFO L290 TraceCheckUtils]: 46: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,958 INFO L290 TraceCheckUtils]: 45: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,958 INFO L290 TraceCheckUtils]: 44: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,958 INFO L272 TraceCheckUtils]: 43: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,958 INFO L290 TraceCheckUtils]: 42: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} assume !!(#t~post8 < 100);havoc #t~post8; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-14 16:15:01,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-14 16:15:01,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {56805#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-14 16:15:01,959 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56805#true} {56805#true} #98#return; {56805#true} is VALID [2022-04-14 16:15:01,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L290 TraceCheckUtils]: 36: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L272 TraceCheckUtils]: 35: Hoare triple {56805#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {56805#true} assume !!(#t~post8 < 100);havoc #t~post8; {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {56805#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L290 TraceCheckUtils]: 32: Hoare triple {56805#true} assume !(~r~0 > 0); {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56805#true} {56805#true} #96#return; {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L272 TraceCheckUtils]: 27: Hoare triple {56805#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {56805#true} assume !!(#t~post7 < 100);havoc #t~post7; {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {56805#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {56805#true} assume !!(0 != ~r~0); {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56805#true} {56805#true} #94#return; {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L272 TraceCheckUtils]: 19: Hoare triple {56805#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {56805#true} assume !!(#t~post6 < 100);havoc #t~post6; {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {56805#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {56805#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56805#true} {56805#true} #92#return; {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L272 TraceCheckUtils]: 11: Hoare triple {56805#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {56805#true} {56805#true} #90#return; {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L272 TraceCheckUtils]: 6: Hoare triple {56805#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {56805#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {56805#true} call #t~ret9 := main(); {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56805#true} {56805#true} #102#return; {56805#true} is VALID [2022-04-14 16:15:01,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-14 16:15:01,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {56805#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {56805#true} is VALID [2022-04-14 16:15:01,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {56805#true} call ULTIMATE.init(); {56805#true} is VALID [2022-04-14 16:15:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 226 proven. 84 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2022-04-14 16:15:01,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:15:01,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879179385] [2022-04-14 16:15:01,962 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:15:01,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094185023] [2022-04-14 16:15:01,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094185023] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:15:01,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:15:01,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-14 16:15:01,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264051264] [2022-04-14 16:15:01,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:15:01,963 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) Word has length 187 [2022-04-14 16:15:01,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:15:01,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2022-04-14 16:15:02,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:15:02,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-14 16:15:02,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:15:02,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-14 16:15:02,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-14 16:15:02,103 INFO L87 Difference]: Start difference. First operand 1400 states and 1839 transitions. Second operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2022-04-14 16:15:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:08,151 INFO L93 Difference]: Finished difference Result 2810 states and 3761 transitions. [2022-04-14 16:15:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-14 16:15:08,151 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) Word has length 187 [2022-04-14 16:15:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:15:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2022-04-14 16:15:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 442 transitions. [2022-04-14 16:15:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2022-04-14 16:15:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 442 transitions. [2022-04-14 16:15:08,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 442 transitions. [2022-04-14 16:15:08,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:15:08,741 INFO L225 Difference]: With dead ends: 2810 [2022-04-14 16:15:08,741 INFO L226 Difference]: Without dead ends: 2513 [2022-04-14 16:15:08,742 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=385, Invalid=1097, Unknown=0, NotChecked=0, Total=1482 [2022-04-14 16:15:08,743 INFO L913 BasicCegarLoop]: 158 mSDtfsCounter, 208 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-14 16:15:08,743 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 804 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-14 16:15:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2022-04-14 16:15:11,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2054. [2022-04-14 16:15:11,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:15:11,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2513 states. Second operand has 2054 states, 1541 states have (on average 1.1570408825438028) internal successors, (1783), 1569 states have internal predecessors, (1783), 470 states have call successors, (470), 44 states have call predecessors, (470), 42 states have return successors, (468), 440 states have call predecessors, (468), 468 states have call successors, (468) [2022-04-14 16:15:11,087 INFO L74 IsIncluded]: Start isIncluded. First operand 2513 states. Second operand has 2054 states, 1541 states have (on average 1.1570408825438028) internal successors, (1783), 1569 states have internal predecessors, (1783), 470 states have call successors, (470), 44 states have call predecessors, (470), 42 states have return successors, (468), 440 states have call predecessors, (468), 468 states have call successors, (468) [2022-04-14 16:15:11,088 INFO L87 Difference]: Start difference. First operand 2513 states. Second operand has 2054 states, 1541 states have (on average 1.1570408825438028) internal successors, (1783), 1569 states have internal predecessors, (1783), 470 states have call successors, (470), 44 states have call predecessors, (470), 42 states have return successors, (468), 440 states have call predecessors, (468), 468 states have call successors, (468) [2022-04-14 16:15:11,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:11,253 INFO L93 Difference]: Finished difference Result 2513 states and 3307 transitions. [2022-04-14 16:15:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3307 transitions. [2022-04-14 16:15:11,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:15:11,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:15:11,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 2054 states, 1541 states have (on average 1.1570408825438028) internal successors, (1783), 1569 states have internal predecessors, (1783), 470 states have call successors, (470), 44 states have call predecessors, (470), 42 states have return successors, (468), 440 states have call predecessors, (468), 468 states have call successors, (468) Second operand 2513 states. [2022-04-14 16:15:11,260 INFO L87 Difference]: Start difference. First operand has 2054 states, 1541 states have (on average 1.1570408825438028) internal successors, (1783), 1569 states have internal predecessors, (1783), 470 states have call successors, (470), 44 states have call predecessors, (470), 42 states have return successors, (468), 440 states have call predecessors, (468), 468 states have call successors, (468) Second operand 2513 states. [2022-04-14 16:15:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:11,429 INFO L93 Difference]: Finished difference Result 2513 states and 3307 transitions. [2022-04-14 16:15:11,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3307 transitions. [2022-04-14 16:15:11,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:15:11,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:15:11,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:15:11,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:15:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 1541 states have (on average 1.1570408825438028) internal successors, (1783), 1569 states have internal predecessors, (1783), 470 states have call successors, (470), 44 states have call predecessors, (470), 42 states have return successors, (468), 440 states have call predecessors, (468), 468 states have call successors, (468) [2022-04-14 16:15:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2721 transitions. [2022-04-14 16:15:11,587 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2721 transitions. Word has length 187 [2022-04-14 16:15:11,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:15:11,587 INFO L478 AbstractCegarLoop]: Abstraction has 2054 states and 2721 transitions. [2022-04-14 16:15:11,587 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2022-04-14 16:15:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2721 transitions. [2022-04-14 16:15:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-14 16:15:11,591 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:15:11,591 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 11, 10, 10, 10, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:15:11,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-14 16:15:11,792 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:15:11,792 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:15:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:15:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1188230671, now seen corresponding path program 9 times [2022-04-14 16:15:11,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:15:11,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264286598] [2022-04-14 16:15:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:15:11,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:15:11,815 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:15:11,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1675189127] [2022-04-14 16:15:11,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 16:15:11,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:15:11,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:15:11,816 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:15:11,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-14 16:15:12,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-04-14 16:15:12,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:15:12,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-14 16:15:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:15:12,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:15:13,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {69859#true} call ULTIMATE.init(); {69859#true} is VALID [2022-04-14 16:15:13,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {69859#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {69859#true} is VALID [2022-04-14 16:15:13,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69859#true} {69859#true} #102#return; {69859#true} is VALID [2022-04-14 16:15:13,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {69859#true} call #t~ret9 := main(); {69859#true} is VALID [2022-04-14 16:15:13,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {69859#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {69859#true} is VALID [2022-04-14 16:15:13,290 INFO L272 TraceCheckUtils]: 6: Hoare triple {69859#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,290 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69859#true} {69859#true} #90#return; {69859#true} is VALID [2022-04-14 16:15:13,290 INFO L272 TraceCheckUtils]: 11: Hoare triple {69859#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,291 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69859#true} {69859#true} #92#return; {69859#true} is VALID [2022-04-14 16:15:13,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {69859#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {69912#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,291 INFO L272 TraceCheckUtils]: 19: Hoare triple {69912#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,292 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #94#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {69912#(<= main_~v~0 1)} assume !!(0 != ~r~0); {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {69912#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,293 INFO L272 TraceCheckUtils]: 27: Hoare triple {69912#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,293 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #96#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {69912#(<= main_~v~0 1)} assume !(~r~0 > 0); {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {69912#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,294 INFO L272 TraceCheckUtils]: 35: Hoare triple {69912#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,294 INFO L290 TraceCheckUtils]: 38: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,295 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #98#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,295 INFO L290 TraceCheckUtils]: 40: Hoare triple {69912#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {69912#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,296 INFO L272 TraceCheckUtils]: 43: Hoare triple {69912#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,296 INFO L290 TraceCheckUtils]: 44: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,296 INFO L290 TraceCheckUtils]: 45: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,296 INFO L290 TraceCheckUtils]: 46: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,296 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #98#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,296 INFO L290 TraceCheckUtils]: 48: Hoare triple {69912#(<= main_~v~0 1)} assume !(~r~0 < 0); {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,297 INFO L290 TraceCheckUtils]: 49: Hoare triple {69912#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,297 INFO L290 TraceCheckUtils]: 50: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,297 INFO L272 TraceCheckUtils]: 51: Hoare triple {69912#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,297 INFO L290 TraceCheckUtils]: 52: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,297 INFO L290 TraceCheckUtils]: 53: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,297 INFO L290 TraceCheckUtils]: 54: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,297 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #94#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,298 INFO L290 TraceCheckUtils]: 56: Hoare triple {69912#(<= main_~v~0 1)} assume !!(0 != ~r~0); {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,298 INFO L290 TraceCheckUtils]: 57: Hoare triple {69912#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,298 INFO L290 TraceCheckUtils]: 58: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,298 INFO L272 TraceCheckUtils]: 59: Hoare triple {69912#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,298 INFO L290 TraceCheckUtils]: 60: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,298 INFO L290 TraceCheckUtils]: 61: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,298 INFO L290 TraceCheckUtils]: 62: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,299 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #96#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:13,299 INFO L290 TraceCheckUtils]: 64: Hoare triple {69912#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70057#(<= main_~v~0 3)} is VALID [2022-04-14 16:15:13,300 INFO L290 TraceCheckUtils]: 65: Hoare triple {70057#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70057#(<= main_~v~0 3)} is VALID [2022-04-14 16:15:13,300 INFO L290 TraceCheckUtils]: 66: Hoare triple {70057#(<= main_~v~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {70057#(<= main_~v~0 3)} is VALID [2022-04-14 16:15:13,300 INFO L272 TraceCheckUtils]: 67: Hoare triple {70057#(<= main_~v~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,300 INFO L290 TraceCheckUtils]: 68: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,300 INFO L290 TraceCheckUtils]: 69: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,300 INFO L290 TraceCheckUtils]: 70: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,300 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69859#true} {70057#(<= main_~v~0 3)} #96#return; {70057#(<= main_~v~0 3)} is VALID [2022-04-14 16:15:13,301 INFO L290 TraceCheckUtils]: 72: Hoare triple {70057#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-14 16:15:13,301 INFO L290 TraceCheckUtils]: 73: Hoare triple {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-14 16:15:13,302 INFO L290 TraceCheckUtils]: 74: Hoare triple {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(#t~post7 < 100);havoc #t~post7; {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-14 16:15:13,302 INFO L272 TraceCheckUtils]: 75: Hoare triple {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,302 INFO L290 TraceCheckUtils]: 76: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,302 INFO L290 TraceCheckUtils]: 77: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,302 INFO L290 TraceCheckUtils]: 78: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,302 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69859#true} {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #96#return; {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-14 16:15:13,303 INFO L290 TraceCheckUtils]: 80: Hoare triple {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !(~r~0 > 0); {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-14 16:15:13,303 INFO L290 TraceCheckUtils]: 81: Hoare triple {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-14 16:15:13,303 INFO L290 TraceCheckUtils]: 82: Hoare triple {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(#t~post8 < 100);havoc #t~post8; {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-14 16:15:13,303 INFO L272 TraceCheckUtils]: 83: Hoare triple {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,304 INFO L290 TraceCheckUtils]: 84: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,304 INFO L290 TraceCheckUtils]: 85: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,304 INFO L290 TraceCheckUtils]: 86: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,304 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {69859#true} {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #98#return; {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-14 16:15:13,305 INFO L290 TraceCheckUtils]: 88: Hoare triple {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-14 16:15:13,305 INFO L290 TraceCheckUtils]: 89: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-14 16:15:13,306 INFO L290 TraceCheckUtils]: 90: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-14 16:15:13,306 INFO L272 TraceCheckUtils]: 91: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,306 INFO L290 TraceCheckUtils]: 92: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,306 INFO L290 TraceCheckUtils]: 93: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,306 INFO L290 TraceCheckUtils]: 94: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,306 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {69859#true} {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #98#return; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-14 16:15:13,307 INFO L290 TraceCheckUtils]: 96: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !(~r~0 < 0); {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-14 16:15:13,307 INFO L290 TraceCheckUtils]: 97: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-14 16:15:13,307 INFO L290 TraceCheckUtils]: 98: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-14 16:15:13,307 INFO L272 TraceCheckUtils]: 99: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,307 INFO L290 TraceCheckUtils]: 100: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,308 INFO L290 TraceCheckUtils]: 101: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,308 INFO L290 TraceCheckUtils]: 102: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,308 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {69859#true} {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #94#return; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-14 16:15:13,308 INFO L290 TraceCheckUtils]: 104: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(0 != ~r~0); {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-14 16:15:13,309 INFO L290 TraceCheckUtils]: 105: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-14 16:15:13,309 INFO L290 TraceCheckUtils]: 106: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-14 16:15:13,309 INFO L272 TraceCheckUtils]: 107: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,309 INFO L290 TraceCheckUtils]: 108: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,309 INFO L290 TraceCheckUtils]: 109: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,309 INFO L290 TraceCheckUtils]: 110: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,310 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {69859#true} {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #96#return; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-14 16:15:13,310 INFO L290 TraceCheckUtils]: 112: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70204#(< main_~u~0 (+ main_~r~0 10))} is VALID [2022-04-14 16:15:13,311 INFO L290 TraceCheckUtils]: 113: Hoare triple {70204#(< main_~u~0 (+ main_~r~0 10))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70204#(< main_~u~0 (+ main_~r~0 10))} is VALID [2022-04-14 16:15:13,311 INFO L290 TraceCheckUtils]: 114: Hoare triple {70204#(< main_~u~0 (+ main_~r~0 10))} assume !!(#t~post7 < 100);havoc #t~post7; {70204#(< main_~u~0 (+ main_~r~0 10))} is VALID [2022-04-14 16:15:13,311 INFO L272 TraceCheckUtils]: 115: Hoare triple {70204#(< main_~u~0 (+ main_~r~0 10))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,311 INFO L290 TraceCheckUtils]: 116: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,311 INFO L290 TraceCheckUtils]: 117: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,311 INFO L290 TraceCheckUtils]: 118: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,311 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {69859#true} {70204#(< main_~u~0 (+ main_~r~0 10))} #96#return; {70204#(< main_~u~0 (+ main_~r~0 10))} is VALID [2022-04-14 16:15:13,312 INFO L290 TraceCheckUtils]: 120: Hoare triple {70204#(< main_~u~0 (+ main_~r~0 10))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-14 16:15:13,312 INFO L290 TraceCheckUtils]: 121: Hoare triple {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-14 16:15:13,313 INFO L290 TraceCheckUtils]: 122: Hoare triple {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} assume !!(#t~post7 < 100);havoc #t~post7; {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-14 16:15:13,313 INFO L272 TraceCheckUtils]: 123: Hoare triple {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,313 INFO L290 TraceCheckUtils]: 124: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,313 INFO L290 TraceCheckUtils]: 125: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,313 INFO L290 TraceCheckUtils]: 126: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,313 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {69859#true} {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} #96#return; {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-14 16:15:13,314 INFO L290 TraceCheckUtils]: 128: Hoare triple {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} assume !(~r~0 > 0); {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-14 16:15:13,314 INFO L290 TraceCheckUtils]: 129: Hoare triple {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-14 16:15:13,314 INFO L290 TraceCheckUtils]: 130: Hoare triple {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} assume !!(#t~post8 < 100);havoc #t~post8; {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-14 16:15:13,314 INFO L272 TraceCheckUtils]: 131: Hoare triple {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,314 INFO L290 TraceCheckUtils]: 132: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,315 INFO L290 TraceCheckUtils]: 133: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,315 INFO L290 TraceCheckUtils]: 134: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,315 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {69859#true} {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} #98#return; {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-14 16:15:13,316 INFO L290 TraceCheckUtils]: 136: Hoare triple {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-14 16:15:13,316 INFO L290 TraceCheckUtils]: 137: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-14 16:15:13,316 INFO L290 TraceCheckUtils]: 138: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(#t~post8 < 100);havoc #t~post8; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-14 16:15:13,316 INFO L272 TraceCheckUtils]: 139: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,316 INFO L290 TraceCheckUtils]: 140: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,317 INFO L290 TraceCheckUtils]: 141: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,317 INFO L290 TraceCheckUtils]: 142: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,317 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {69859#true} {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #98#return; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-14 16:15:13,317 INFO L290 TraceCheckUtils]: 144: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !(~r~0 < 0); {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-14 16:15:13,318 INFO L290 TraceCheckUtils]: 145: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-14 16:15:13,318 INFO L290 TraceCheckUtils]: 146: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(#t~post6 < 100);havoc #t~post6; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-14 16:15:13,318 INFO L272 TraceCheckUtils]: 147: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,318 INFO L290 TraceCheckUtils]: 148: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,318 INFO L290 TraceCheckUtils]: 149: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,318 INFO L290 TraceCheckUtils]: 150: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,319 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {69859#true} {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #94#return; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-14 16:15:13,319 INFO L290 TraceCheckUtils]: 152: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(0 != ~r~0); {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-14 16:15:13,319 INFO L290 TraceCheckUtils]: 153: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-14 16:15:13,320 INFO L290 TraceCheckUtils]: 154: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(#t~post7 < 100);havoc #t~post7; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-14 16:15:13,320 INFO L272 TraceCheckUtils]: 155: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,320 INFO L290 TraceCheckUtils]: 156: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,320 INFO L290 TraceCheckUtils]: 157: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,320 INFO L290 TraceCheckUtils]: 158: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,320 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {69859#true} {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #96#return; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-14 16:15:13,321 INFO L290 TraceCheckUtils]: 160: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} is VALID [2022-04-14 16:15:13,321 INFO L290 TraceCheckUtils]: 161: Hoare triple {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} is VALID [2022-04-14 16:15:13,321 INFO L290 TraceCheckUtils]: 162: Hoare triple {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} assume !!(#t~post7 < 100);havoc #t~post7; {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} is VALID [2022-04-14 16:15:13,321 INFO L272 TraceCheckUtils]: 163: Hoare triple {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,322 INFO L290 TraceCheckUtils]: 164: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,322 INFO L290 TraceCheckUtils]: 165: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,322 INFO L290 TraceCheckUtils]: 166: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,322 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {69859#true} {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} #96#return; {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} is VALID [2022-04-14 16:15:13,322 INFO L290 TraceCheckUtils]: 168: Hoare triple {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70376#(< main_~r~0 0)} is VALID [2022-04-14 16:15:13,323 INFO L290 TraceCheckUtils]: 169: Hoare triple {70376#(< main_~r~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70376#(< main_~r~0 0)} is VALID [2022-04-14 16:15:13,323 INFO L290 TraceCheckUtils]: 170: Hoare triple {70376#(< main_~r~0 0)} assume !!(#t~post7 < 100);havoc #t~post7; {70376#(< main_~r~0 0)} is VALID [2022-04-14 16:15:13,323 INFO L272 TraceCheckUtils]: 171: Hoare triple {70376#(< main_~r~0 0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:13,323 INFO L290 TraceCheckUtils]: 172: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:13,323 INFO L290 TraceCheckUtils]: 173: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:13,323 INFO L290 TraceCheckUtils]: 174: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:13,324 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {69859#true} {70376#(< main_~r~0 0)} #96#return; {70376#(< main_~r~0 0)} is VALID [2022-04-14 16:15:13,324 INFO L290 TraceCheckUtils]: 176: Hoare triple {70376#(< main_~r~0 0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69860#false} is VALID [2022-04-14 16:15:13,324 INFO L290 TraceCheckUtils]: 177: Hoare triple {69860#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69860#false} is VALID [2022-04-14 16:15:13,324 INFO L290 TraceCheckUtils]: 178: Hoare triple {69860#false} assume !(#t~post7 < 100);havoc #t~post7; {69860#false} is VALID [2022-04-14 16:15:13,324 INFO L290 TraceCheckUtils]: 179: Hoare triple {69860#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69860#false} is VALID [2022-04-14 16:15:13,324 INFO L290 TraceCheckUtils]: 180: Hoare triple {69860#false} assume !(#t~post8 < 100);havoc #t~post8; {69860#false} is VALID [2022-04-14 16:15:13,324 INFO L290 TraceCheckUtils]: 181: Hoare triple {69860#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69860#false} is VALID [2022-04-14 16:15:13,324 INFO L290 TraceCheckUtils]: 182: Hoare triple {69860#false} assume !(#t~post6 < 100);havoc #t~post6; {69860#false} is VALID [2022-04-14 16:15:13,325 INFO L272 TraceCheckUtils]: 183: Hoare triple {69860#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69860#false} is VALID [2022-04-14 16:15:13,325 INFO L290 TraceCheckUtils]: 184: Hoare triple {69860#false} ~cond := #in~cond; {69860#false} is VALID [2022-04-14 16:15:13,325 INFO L290 TraceCheckUtils]: 185: Hoare triple {69860#false} assume 0 == ~cond; {69860#false} is VALID [2022-04-14 16:15:13,325 INFO L290 TraceCheckUtils]: 186: Hoare triple {69860#false} assume !false; {69860#false} is VALID [2022-04-14 16:15:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 84 proven. 248 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2022-04-14 16:15:13,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:15:14,357 INFO L290 TraceCheckUtils]: 186: Hoare triple {69860#false} assume !false; {69860#false} is VALID [2022-04-14 16:15:14,358 INFO L290 TraceCheckUtils]: 185: Hoare triple {69860#false} assume 0 == ~cond; {69860#false} is VALID [2022-04-14 16:15:14,358 INFO L290 TraceCheckUtils]: 184: Hoare triple {69860#false} ~cond := #in~cond; {69860#false} is VALID [2022-04-14 16:15:14,358 INFO L272 TraceCheckUtils]: 183: Hoare triple {69860#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69860#false} is VALID [2022-04-14 16:15:14,358 INFO L290 TraceCheckUtils]: 182: Hoare triple {69860#false} assume !(#t~post6 < 100);havoc #t~post6; {69860#false} is VALID [2022-04-14 16:15:14,358 INFO L290 TraceCheckUtils]: 181: Hoare triple {69860#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69860#false} is VALID [2022-04-14 16:15:14,358 INFO L290 TraceCheckUtils]: 180: Hoare triple {69860#false} assume !(#t~post8 < 100);havoc #t~post8; {69860#false} is VALID [2022-04-14 16:15:14,358 INFO L290 TraceCheckUtils]: 179: Hoare triple {69860#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69860#false} is VALID [2022-04-14 16:15:14,358 INFO L290 TraceCheckUtils]: 178: Hoare triple {69860#false} assume !(#t~post7 < 100);havoc #t~post7; {69860#false} is VALID [2022-04-14 16:15:14,358 INFO L290 TraceCheckUtils]: 177: Hoare triple {69860#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69860#false} is VALID [2022-04-14 16:15:14,358 INFO L290 TraceCheckUtils]: 176: Hoare triple {70461#(not (< 0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69860#false} is VALID [2022-04-14 16:15:14,359 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {69859#true} {70461#(not (< 0 main_~r~0))} #96#return; {70461#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:15:14,359 INFO L290 TraceCheckUtils]: 174: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,359 INFO L290 TraceCheckUtils]: 173: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,359 INFO L290 TraceCheckUtils]: 172: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,359 INFO L272 TraceCheckUtils]: 171: Hoare triple {70461#(not (< 0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,359 INFO L290 TraceCheckUtils]: 170: Hoare triple {70461#(not (< 0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {70461#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:15:14,359 INFO L290 TraceCheckUtils]: 169: Hoare triple {70461#(not (< 0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70461#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:15:14,360 INFO L290 TraceCheckUtils]: 168: Hoare triple {70486#(<= main_~r~0 main_~v~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70461#(not (< 0 main_~r~0))} is VALID [2022-04-14 16:15:14,361 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {69859#true} {70486#(<= main_~r~0 main_~v~0)} #96#return; {70486#(<= main_~r~0 main_~v~0)} is VALID [2022-04-14 16:15:14,361 INFO L290 TraceCheckUtils]: 166: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,361 INFO L290 TraceCheckUtils]: 165: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,361 INFO L290 TraceCheckUtils]: 164: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,361 INFO L272 TraceCheckUtils]: 163: Hoare triple {70486#(<= main_~r~0 main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,361 INFO L290 TraceCheckUtils]: 162: Hoare triple {70486#(<= main_~r~0 main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {70486#(<= main_~r~0 main_~v~0)} is VALID [2022-04-14 16:15:14,361 INFO L290 TraceCheckUtils]: 161: Hoare triple {70486#(<= main_~r~0 main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70486#(<= main_~r~0 main_~v~0)} is VALID [2022-04-14 16:15:14,362 INFO L290 TraceCheckUtils]: 160: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70486#(<= main_~r~0 main_~v~0)} is VALID [2022-04-14 16:15:14,362 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {69859#true} {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #96#return; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-14 16:15:14,362 INFO L290 TraceCheckUtils]: 158: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,363 INFO L290 TraceCheckUtils]: 157: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,363 INFO L290 TraceCheckUtils]: 156: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,363 INFO L272 TraceCheckUtils]: 155: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,363 INFO L290 TraceCheckUtils]: 154: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(#t~post7 < 100);havoc #t~post7; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-14 16:15:14,363 INFO L290 TraceCheckUtils]: 153: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-14 16:15:14,364 INFO L290 TraceCheckUtils]: 152: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(0 != ~r~0); {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-14 16:15:14,364 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {69859#true} {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #94#return; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-14 16:15:14,364 INFO L290 TraceCheckUtils]: 150: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,364 INFO L290 TraceCheckUtils]: 149: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,364 INFO L290 TraceCheckUtils]: 148: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,364 INFO L272 TraceCheckUtils]: 147: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,364 INFO L290 TraceCheckUtils]: 146: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(#t~post6 < 100);havoc #t~post6; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-14 16:15:14,365 INFO L290 TraceCheckUtils]: 145: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-14 16:15:14,365 INFO L290 TraceCheckUtils]: 144: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !(~r~0 < 0); {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-14 16:15:14,365 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {69859#true} {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #98#return; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-14 16:15:14,366 INFO L290 TraceCheckUtils]: 142: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,366 INFO L290 TraceCheckUtils]: 141: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,366 INFO L290 TraceCheckUtils]: 140: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,366 INFO L272 TraceCheckUtils]: 139: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,366 INFO L290 TraceCheckUtils]: 138: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-14 16:15:14,366 INFO L290 TraceCheckUtils]: 137: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-14 16:15:14,368 INFO L290 TraceCheckUtils]: 136: Hoare triple {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-14 16:15:14,368 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {69859#true} {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #98#return; {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-14 16:15:14,368 INFO L290 TraceCheckUtils]: 134: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,368 INFO L290 TraceCheckUtils]: 133: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,368 INFO L290 TraceCheckUtils]: 132: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,368 INFO L272 TraceCheckUtils]: 131: Hoare triple {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,369 INFO L290 TraceCheckUtils]: 130: Hoare triple {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !!(#t~post8 < 100);havoc #t~post8; {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-14 16:15:14,369 INFO L290 TraceCheckUtils]: 129: Hoare triple {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-14 16:15:14,369 INFO L290 TraceCheckUtils]: 128: Hoare triple {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !(~r~0 > 0); {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-14 16:15:14,370 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {69859#true} {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #96#return; {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-14 16:15:14,370 INFO L290 TraceCheckUtils]: 126: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,370 INFO L290 TraceCheckUtils]: 125: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,370 INFO L290 TraceCheckUtils]: 124: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,370 INFO L272 TraceCheckUtils]: 123: Hoare triple {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,370 INFO L290 TraceCheckUtils]: 122: Hoare triple {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 100);havoc #t~post7; {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-14 16:15:14,370 INFO L290 TraceCheckUtils]: 121: Hoare triple {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-14 16:15:14,371 INFO L290 TraceCheckUtils]: 120: Hoare triple {70633#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-14 16:15:14,372 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {69859#true} {70633#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} #96#return; {70633#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} is VALID [2022-04-14 16:15:14,372 INFO L290 TraceCheckUtils]: 118: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,372 INFO L290 TraceCheckUtils]: 117: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,372 INFO L290 TraceCheckUtils]: 116: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,372 INFO L272 TraceCheckUtils]: 115: Hoare triple {70633#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,372 INFO L290 TraceCheckUtils]: 114: Hoare triple {70633#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} assume !!(#t~post7 < 100);havoc #t~post7; {70633#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} is VALID [2022-04-14 16:15:14,372 INFO L290 TraceCheckUtils]: 113: Hoare triple {70633#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70633#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} is VALID [2022-04-14 16:15:14,373 INFO L290 TraceCheckUtils]: 112: Hoare triple {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70633#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} is VALID [2022-04-14 16:15:14,373 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {69859#true} {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #96#return; {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-14 16:15:14,374 INFO L290 TraceCheckUtils]: 110: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,374 INFO L290 TraceCheckUtils]: 109: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,374 INFO L290 TraceCheckUtils]: 108: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,374 INFO L272 TraceCheckUtils]: 107: Hoare triple {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,374 INFO L290 TraceCheckUtils]: 106: Hoare triple {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !!(#t~post7 < 100);havoc #t~post7; {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-14 16:15:14,374 INFO L290 TraceCheckUtils]: 105: Hoare triple {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-14 16:15:14,375 INFO L290 TraceCheckUtils]: 104: Hoare triple {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !!(0 != ~r~0); {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-14 16:15:14,375 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {69859#true} {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #94#return; {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-14 16:15:14,375 INFO L290 TraceCheckUtils]: 102: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,375 INFO L290 TraceCheckUtils]: 101: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,375 INFO L290 TraceCheckUtils]: 100: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,375 INFO L272 TraceCheckUtils]: 99: Hoare triple {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,376 INFO L290 TraceCheckUtils]: 98: Hoare triple {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !!(#t~post6 < 100);havoc #t~post6; {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-14 16:15:14,376 INFO L290 TraceCheckUtils]: 97: Hoare triple {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-14 16:15:14,376 INFO L290 TraceCheckUtils]: 96: Hoare triple {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !(~r~0 < 0); {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-14 16:15:14,377 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {69859#true} {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #98#return; {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-14 16:15:14,377 INFO L290 TraceCheckUtils]: 94: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,377 INFO L290 TraceCheckUtils]: 93: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,377 INFO L290 TraceCheckUtils]: 92: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,377 INFO L272 TraceCheckUtils]: 91: Hoare triple {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,377 INFO L290 TraceCheckUtils]: 90: Hoare triple {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !!(#t~post8 < 100);havoc #t~post8; {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-14 16:15:14,378 INFO L290 TraceCheckUtils]: 89: Hoare triple {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-14 16:15:14,379 INFO L290 TraceCheckUtils]: 88: Hoare triple {70731#(<= main_~v~0 (+ main_~r~0 8))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70658#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-14 16:15:14,379 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {69859#true} {70731#(<= main_~v~0 (+ main_~r~0 8))} #98#return; {70731#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-14 16:15:14,379 INFO L290 TraceCheckUtils]: 86: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,379 INFO L290 TraceCheckUtils]: 85: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,379 INFO L290 TraceCheckUtils]: 84: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,379 INFO L272 TraceCheckUtils]: 83: Hoare triple {70731#(<= main_~v~0 (+ main_~r~0 8))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,379 INFO L290 TraceCheckUtils]: 82: Hoare triple {70731#(<= main_~v~0 (+ main_~r~0 8))} assume !!(#t~post8 < 100);havoc #t~post8; {70731#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-14 16:15:14,380 INFO L290 TraceCheckUtils]: 81: Hoare triple {70731#(<= main_~v~0 (+ main_~r~0 8))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70731#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-14 16:15:14,380 INFO L290 TraceCheckUtils]: 80: Hoare triple {70731#(<= main_~v~0 (+ main_~r~0 8))} assume !(~r~0 > 0); {70731#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-14 16:15:14,380 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69859#true} {70731#(<= main_~v~0 (+ main_~r~0 8))} #96#return; {70731#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-14 16:15:14,380 INFO L290 TraceCheckUtils]: 78: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,381 INFO L290 TraceCheckUtils]: 77: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,381 INFO L290 TraceCheckUtils]: 76: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,381 INFO L272 TraceCheckUtils]: 75: Hoare triple {70731#(<= main_~v~0 (+ main_~r~0 8))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,381 INFO L290 TraceCheckUtils]: 74: Hoare triple {70731#(<= main_~v~0 (+ main_~r~0 8))} assume !!(#t~post7 < 100);havoc #t~post7; {70731#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-14 16:15:14,381 INFO L290 TraceCheckUtils]: 73: Hoare triple {70731#(<= main_~v~0 (+ main_~r~0 8))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70731#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-14 16:15:14,382 INFO L290 TraceCheckUtils]: 72: Hoare triple {70057#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70731#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-14 16:15:14,382 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69859#true} {70057#(<= main_~v~0 3)} #96#return; {70057#(<= main_~v~0 3)} is VALID [2022-04-14 16:15:14,382 INFO L290 TraceCheckUtils]: 70: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,382 INFO L290 TraceCheckUtils]: 69: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,382 INFO L290 TraceCheckUtils]: 68: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,382 INFO L272 TraceCheckUtils]: 67: Hoare triple {70057#(<= main_~v~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,383 INFO L290 TraceCheckUtils]: 66: Hoare triple {70057#(<= main_~v~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {70057#(<= main_~v~0 3)} is VALID [2022-04-14 16:15:14,383 INFO L290 TraceCheckUtils]: 65: Hoare triple {70057#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70057#(<= main_~v~0 3)} is VALID [2022-04-14 16:15:14,383 INFO L290 TraceCheckUtils]: 64: Hoare triple {69912#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70057#(<= main_~v~0 3)} is VALID [2022-04-14 16:15:14,384 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #96#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,384 INFO L290 TraceCheckUtils]: 62: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,384 INFO L290 TraceCheckUtils]: 61: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,384 INFO L290 TraceCheckUtils]: 60: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,384 INFO L272 TraceCheckUtils]: 59: Hoare triple {69912#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,384 INFO L290 TraceCheckUtils]: 58: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,384 INFO L290 TraceCheckUtils]: 57: Hoare triple {69912#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,385 INFO L290 TraceCheckUtils]: 56: Hoare triple {69912#(<= main_~v~0 1)} assume !!(0 != ~r~0); {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,385 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #94#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,385 INFO L290 TraceCheckUtils]: 54: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,385 INFO L290 TraceCheckUtils]: 53: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,385 INFO L290 TraceCheckUtils]: 52: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,385 INFO L272 TraceCheckUtils]: 51: Hoare triple {69912#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,386 INFO L290 TraceCheckUtils]: 50: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,386 INFO L290 TraceCheckUtils]: 49: Hoare triple {69912#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,386 INFO L290 TraceCheckUtils]: 48: Hoare triple {69912#(<= main_~v~0 1)} assume !(~r~0 < 0); {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,386 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #98#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,387 INFO L290 TraceCheckUtils]: 46: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,387 INFO L290 TraceCheckUtils]: 45: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,387 INFO L290 TraceCheckUtils]: 44: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,387 INFO L272 TraceCheckUtils]: 43: Hoare triple {69912#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,387 INFO L290 TraceCheckUtils]: 41: Hoare triple {69912#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,387 INFO L290 TraceCheckUtils]: 40: Hoare triple {69912#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,388 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #98#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,388 INFO L272 TraceCheckUtils]: 35: Hoare triple {69912#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {69912#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {69912#(<= main_~v~0 1)} assume !(~r~0 > 0); {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,389 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #96#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,389 INFO L272 TraceCheckUtils]: 27: Hoare triple {69912#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {69912#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {69912#(<= main_~v~0 1)} assume !!(0 != ~r~0); {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,391 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #94#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,391 INFO L272 TraceCheckUtils]: 19: Hoare triple {69912#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {69912#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {69859#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {69912#(<= main_~v~0 1)} is VALID [2022-04-14 16:15:14,392 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69859#true} {69859#true} #92#return; {69859#true} is VALID [2022-04-14 16:15:14,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,392 INFO L272 TraceCheckUtils]: 11: Hoare triple {69859#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,392 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69859#true} {69859#true} #90#return; {69859#true} is VALID [2022-04-14 16:15:14,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-14 16:15:14,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-14 16:15:14,392 INFO L272 TraceCheckUtils]: 6: Hoare triple {69859#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {69859#true} is VALID [2022-04-14 16:15:14,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {69859#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {69859#true} is VALID [2022-04-14 16:15:14,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {69859#true} call #t~ret9 := main(); {69859#true} is VALID [2022-04-14 16:15:14,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69859#true} {69859#true} #102#return; {69859#true} is VALID [2022-04-14 16:15:14,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-14 16:15:14,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {69859#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {69859#true} is VALID [2022-04-14 16:15:14,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {69859#true} call ULTIMATE.init(); {69859#true} is VALID [2022-04-14 16:15:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 84 proven. 248 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2022-04-14 16:15:14,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:15:14,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264286598] [2022-04-14 16:15:14,393 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:15:14,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675189127] [2022-04-14 16:15:14,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675189127] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:15:14,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:15:14,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-04-14 16:15:14,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765560787] [2022-04-14 16:15:14,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:15:14,394 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) Word has length 187 [2022-04-14 16:15:14,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:15:14,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2022-04-14 16:15:14,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:15:14,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-14 16:15:14,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:15:14,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-14 16:15:14,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-14 16:15:14,542 INFO L87 Difference]: Start difference. First operand 2054 states and 2721 transitions. Second operand has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2022-04-14 16:15:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:26,509 INFO L93 Difference]: Finished difference Result 3324 states and 4449 transitions. [2022-04-14 16:15:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-14 16:15:26,509 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) Word has length 187 [2022-04-14 16:15:26,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:15:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2022-04-14 16:15:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 746 transitions. [2022-04-14 16:15:26,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2022-04-14 16:15:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 746 transitions. [2022-04-14 16:15:26,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 746 transitions. [2022-04-14 16:15:27,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 746 edges. 746 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:15:27,483 INFO L225 Difference]: With dead ends: 3324 [2022-04-14 16:15:27,483 INFO L226 Difference]: Without dead ends: 3065 [2022-04-14 16:15:27,485 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=507, Invalid=2573, Unknown=0, NotChecked=0, Total=3080 [2022-04-14 16:15:27,485 INFO L913 BasicCegarLoop]: 311 mSDtfsCounter, 319 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:15:27,486 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 1756 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-14 16:15:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2022-04-14 16:15:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 2548. [2022-04-14 16:15:30,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:15:30,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3065 states. Second operand has 2548 states, 1911 states have (on average 1.1669283097854526) internal successors, (2230), 1953 states have internal predecessors, (2230), 594 states have call successors, (594), 44 states have call predecessors, (594), 42 states have return successors, (592), 550 states have call predecessors, (592), 592 states have call successors, (592) [2022-04-14 16:15:30,918 INFO L74 IsIncluded]: Start isIncluded. First operand 3065 states. Second operand has 2548 states, 1911 states have (on average 1.1669283097854526) internal successors, (2230), 1953 states have internal predecessors, (2230), 594 states have call successors, (594), 44 states have call predecessors, (594), 42 states have return successors, (592), 550 states have call predecessors, (592), 592 states have call successors, (592) [2022-04-14 16:15:30,920 INFO L87 Difference]: Start difference. First operand 3065 states. Second operand has 2548 states, 1911 states have (on average 1.1669283097854526) internal successors, (2230), 1953 states have internal predecessors, (2230), 594 states have call successors, (594), 44 states have call predecessors, (594), 42 states have return successors, (592), 550 states have call predecessors, (592), 592 states have call successors, (592) [2022-04-14 16:15:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:31,171 INFO L93 Difference]: Finished difference Result 3065 states and 4071 transitions. [2022-04-14 16:15:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4071 transitions. [2022-04-14 16:15:31,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:15:31,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:15:31,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 2548 states, 1911 states have (on average 1.1669283097854526) internal successors, (2230), 1953 states have internal predecessors, (2230), 594 states have call successors, (594), 44 states have call predecessors, (594), 42 states have return successors, (592), 550 states have call predecessors, (592), 592 states have call successors, (592) Second operand 3065 states. [2022-04-14 16:15:31,179 INFO L87 Difference]: Start difference. First operand has 2548 states, 1911 states have (on average 1.1669283097854526) internal successors, (2230), 1953 states have internal predecessors, (2230), 594 states have call successors, (594), 44 states have call predecessors, (594), 42 states have return successors, (592), 550 states have call predecessors, (592), 592 states have call successors, (592) Second operand 3065 states. [2022-04-14 16:15:31,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:31,426 INFO L93 Difference]: Finished difference Result 3065 states and 4071 transitions. [2022-04-14 16:15:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4071 transitions. [2022-04-14 16:15:31,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:15:31,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:15:31,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:15:31,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:15:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 1911 states have (on average 1.1669283097854526) internal successors, (2230), 1953 states have internal predecessors, (2230), 594 states have call successors, (594), 44 states have call predecessors, (594), 42 states have return successors, (592), 550 states have call predecessors, (592), 592 states have call successors, (592) [2022-04-14 16:15:31,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 3416 transitions. [2022-04-14 16:15:31,676 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 3416 transitions. Word has length 187 [2022-04-14 16:15:31,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:15:31,676 INFO L478 AbstractCegarLoop]: Abstraction has 2548 states and 3416 transitions. [2022-04-14 16:15:31,676 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2022-04-14 16:15:31,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3416 transitions. [2022-04-14 16:15:31,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-14 16:15:31,680 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:15:31,680 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 11, 10, 10, 10, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:15:31,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-14 16:15:31,880 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:15:31,880 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:15:31,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:15:31,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2070462991, now seen corresponding path program 10 times [2022-04-14 16:15:31,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:15:31,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771385639] [2022-04-14 16:15:31,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:15:31,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:15:31,896 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:15:31,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201883108] [2022-04-14 16:15:31,897 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 16:15:31,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:15:31,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:15:31,897 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:15:31,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-14 16:15:32,072 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 16:15:32,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:15:32,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-14 16:15:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:15:32,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:15:33,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {85456#true} call ULTIMATE.init(); {85456#true} is VALID [2022-04-14 16:15:33,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {85456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {85464#(<= ~counter~0 0)} is VALID [2022-04-14 16:15:33,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {85464#(<= ~counter~0 0)} assume true; {85464#(<= ~counter~0 0)} is VALID [2022-04-14 16:15:33,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85464#(<= ~counter~0 0)} {85456#true} #102#return; {85464#(<= ~counter~0 0)} is VALID [2022-04-14 16:15:33,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {85464#(<= ~counter~0 0)} call #t~ret9 := main(); {85464#(<= ~counter~0 0)} is VALID [2022-04-14 16:15:33,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {85464#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {85464#(<= ~counter~0 0)} is VALID [2022-04-14 16:15:33,034 INFO L272 TraceCheckUtils]: 6: Hoare triple {85464#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {85464#(<= ~counter~0 0)} is VALID [2022-04-14 16:15:33,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {85464#(<= ~counter~0 0)} ~cond := #in~cond; {85464#(<= ~counter~0 0)} is VALID [2022-04-14 16:15:33,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {85464#(<= ~counter~0 0)} assume !(0 == ~cond); {85464#(<= ~counter~0 0)} is VALID [2022-04-14 16:15:33,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {85464#(<= ~counter~0 0)} assume true; {85464#(<= ~counter~0 0)} is VALID [2022-04-14 16:15:33,035 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {85464#(<= ~counter~0 0)} {85464#(<= ~counter~0 0)} #90#return; {85464#(<= ~counter~0 0)} is VALID [2022-04-14 16:15:33,035 INFO L272 TraceCheckUtils]: 11: Hoare triple {85464#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {85464#(<= ~counter~0 0)} is VALID [2022-04-14 16:15:33,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {85464#(<= ~counter~0 0)} ~cond := #in~cond; {85464#(<= ~counter~0 0)} is VALID [2022-04-14 16:15:33,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {85464#(<= ~counter~0 0)} assume !(0 == ~cond); {85464#(<= ~counter~0 0)} is VALID [2022-04-14 16:15:33,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {85464#(<= ~counter~0 0)} assume true; {85464#(<= ~counter~0 0)} is VALID [2022-04-14 16:15:33,036 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {85464#(<= ~counter~0 0)} {85464#(<= ~counter~0 0)} #92#return; {85464#(<= ~counter~0 0)} is VALID [2022-04-14 16:15:33,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {85464#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {85464#(<= ~counter~0 0)} is VALID [2022-04-14 16:15:33,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {85464#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85513#(<= ~counter~0 1)} is VALID [2022-04-14 16:15:33,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {85513#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {85513#(<= ~counter~0 1)} is VALID [2022-04-14 16:15:33,039 INFO L272 TraceCheckUtils]: 19: Hoare triple {85513#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85513#(<= ~counter~0 1)} is VALID [2022-04-14 16:15:33,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {85513#(<= ~counter~0 1)} ~cond := #in~cond; {85513#(<= ~counter~0 1)} is VALID [2022-04-14 16:15:33,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {85513#(<= ~counter~0 1)} assume !(0 == ~cond); {85513#(<= ~counter~0 1)} is VALID [2022-04-14 16:15:33,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {85513#(<= ~counter~0 1)} assume true; {85513#(<= ~counter~0 1)} is VALID [2022-04-14 16:15:33,043 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {85513#(<= ~counter~0 1)} {85513#(<= ~counter~0 1)} #94#return; {85513#(<= ~counter~0 1)} is VALID [2022-04-14 16:15:33,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {85513#(<= ~counter~0 1)} assume !!(0 != ~r~0); {85513#(<= ~counter~0 1)} is VALID [2022-04-14 16:15:33,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {85513#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85538#(<= ~counter~0 2)} is VALID [2022-04-14 16:15:33,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {85538#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {85538#(<= ~counter~0 2)} is VALID [2022-04-14 16:15:33,044 INFO L272 TraceCheckUtils]: 27: Hoare triple {85538#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85538#(<= ~counter~0 2)} is VALID [2022-04-14 16:15:33,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {85538#(<= ~counter~0 2)} ~cond := #in~cond; {85538#(<= ~counter~0 2)} is VALID [2022-04-14 16:15:33,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {85538#(<= ~counter~0 2)} assume !(0 == ~cond); {85538#(<= ~counter~0 2)} is VALID [2022-04-14 16:15:33,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {85538#(<= ~counter~0 2)} assume true; {85538#(<= ~counter~0 2)} is VALID [2022-04-14 16:15:33,045 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {85538#(<= ~counter~0 2)} {85538#(<= ~counter~0 2)} #96#return; {85538#(<= ~counter~0 2)} is VALID [2022-04-14 16:15:33,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {85538#(<= ~counter~0 2)} assume !(~r~0 > 0); {85538#(<= ~counter~0 2)} is VALID [2022-04-14 16:15:33,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {85538#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85563#(<= ~counter~0 3)} is VALID [2022-04-14 16:15:33,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {85563#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {85563#(<= ~counter~0 3)} is VALID [2022-04-14 16:15:33,047 INFO L272 TraceCheckUtils]: 35: Hoare triple {85563#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85563#(<= ~counter~0 3)} is VALID [2022-04-14 16:15:33,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {85563#(<= ~counter~0 3)} ~cond := #in~cond; {85563#(<= ~counter~0 3)} is VALID [2022-04-14 16:15:33,048 INFO L290 TraceCheckUtils]: 37: Hoare triple {85563#(<= ~counter~0 3)} assume !(0 == ~cond); {85563#(<= ~counter~0 3)} is VALID [2022-04-14 16:15:33,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {85563#(<= ~counter~0 3)} assume true; {85563#(<= ~counter~0 3)} is VALID [2022-04-14 16:15:33,049 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {85563#(<= ~counter~0 3)} {85563#(<= ~counter~0 3)} #98#return; {85563#(<= ~counter~0 3)} is VALID [2022-04-14 16:15:33,050 INFO L290 TraceCheckUtils]: 40: Hoare triple {85563#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85563#(<= ~counter~0 3)} is VALID [2022-04-14 16:15:33,050 INFO L290 TraceCheckUtils]: 41: Hoare triple {85563#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85588#(<= ~counter~0 4)} is VALID [2022-04-14 16:15:33,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {85588#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {85588#(<= ~counter~0 4)} is VALID [2022-04-14 16:15:33,051 INFO L272 TraceCheckUtils]: 43: Hoare triple {85588#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85588#(<= ~counter~0 4)} is VALID [2022-04-14 16:15:33,051 INFO L290 TraceCheckUtils]: 44: Hoare triple {85588#(<= ~counter~0 4)} ~cond := #in~cond; {85588#(<= ~counter~0 4)} is VALID [2022-04-14 16:15:33,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {85588#(<= ~counter~0 4)} assume !(0 == ~cond); {85588#(<= ~counter~0 4)} is VALID [2022-04-14 16:15:33,052 INFO L290 TraceCheckUtils]: 46: Hoare triple {85588#(<= ~counter~0 4)} assume true; {85588#(<= ~counter~0 4)} is VALID [2022-04-14 16:15:33,052 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {85588#(<= ~counter~0 4)} {85588#(<= ~counter~0 4)} #98#return; {85588#(<= ~counter~0 4)} is VALID [2022-04-14 16:15:33,052 INFO L290 TraceCheckUtils]: 48: Hoare triple {85588#(<= ~counter~0 4)} assume !(~r~0 < 0); {85588#(<= ~counter~0 4)} is VALID [2022-04-14 16:15:33,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {85588#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85613#(<= ~counter~0 5)} is VALID [2022-04-14 16:15:33,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {85613#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {85613#(<= ~counter~0 5)} is VALID [2022-04-14 16:15:33,054 INFO L272 TraceCheckUtils]: 51: Hoare triple {85613#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85613#(<= ~counter~0 5)} is VALID [2022-04-14 16:15:33,054 INFO L290 TraceCheckUtils]: 52: Hoare triple {85613#(<= ~counter~0 5)} ~cond := #in~cond; {85613#(<= ~counter~0 5)} is VALID [2022-04-14 16:15:33,054 INFO L290 TraceCheckUtils]: 53: Hoare triple {85613#(<= ~counter~0 5)} assume !(0 == ~cond); {85613#(<= ~counter~0 5)} is VALID [2022-04-14 16:15:33,055 INFO L290 TraceCheckUtils]: 54: Hoare triple {85613#(<= ~counter~0 5)} assume true; {85613#(<= ~counter~0 5)} is VALID [2022-04-14 16:15:33,055 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {85613#(<= ~counter~0 5)} {85613#(<= ~counter~0 5)} #94#return; {85613#(<= ~counter~0 5)} is VALID [2022-04-14 16:15:33,055 INFO L290 TraceCheckUtils]: 56: Hoare triple {85613#(<= ~counter~0 5)} assume !!(0 != ~r~0); {85613#(<= ~counter~0 5)} is VALID [2022-04-14 16:15:33,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {85613#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85638#(<= ~counter~0 6)} is VALID [2022-04-14 16:15:33,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {85638#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {85638#(<= ~counter~0 6)} is VALID [2022-04-14 16:15:33,083 INFO L272 TraceCheckUtils]: 59: Hoare triple {85638#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85638#(<= ~counter~0 6)} is VALID [2022-04-14 16:15:33,084 INFO L290 TraceCheckUtils]: 60: Hoare triple {85638#(<= ~counter~0 6)} ~cond := #in~cond; {85638#(<= ~counter~0 6)} is VALID [2022-04-14 16:15:33,084 INFO L290 TraceCheckUtils]: 61: Hoare triple {85638#(<= ~counter~0 6)} assume !(0 == ~cond); {85638#(<= ~counter~0 6)} is VALID [2022-04-14 16:15:33,084 INFO L290 TraceCheckUtils]: 62: Hoare triple {85638#(<= ~counter~0 6)} assume true; {85638#(<= ~counter~0 6)} is VALID [2022-04-14 16:15:33,085 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {85638#(<= ~counter~0 6)} {85638#(<= ~counter~0 6)} #96#return; {85638#(<= ~counter~0 6)} is VALID [2022-04-14 16:15:33,085 INFO L290 TraceCheckUtils]: 64: Hoare triple {85638#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85638#(<= ~counter~0 6)} is VALID [2022-04-14 16:15:33,087 INFO L290 TraceCheckUtils]: 65: Hoare triple {85638#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85663#(<= ~counter~0 7)} is VALID [2022-04-14 16:15:33,087 INFO L290 TraceCheckUtils]: 66: Hoare triple {85663#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {85663#(<= ~counter~0 7)} is VALID [2022-04-14 16:15:33,087 INFO L272 TraceCheckUtils]: 67: Hoare triple {85663#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85663#(<= ~counter~0 7)} is VALID [2022-04-14 16:15:33,088 INFO L290 TraceCheckUtils]: 68: Hoare triple {85663#(<= ~counter~0 7)} ~cond := #in~cond; {85663#(<= ~counter~0 7)} is VALID [2022-04-14 16:15:33,088 INFO L290 TraceCheckUtils]: 69: Hoare triple {85663#(<= ~counter~0 7)} assume !(0 == ~cond); {85663#(<= ~counter~0 7)} is VALID [2022-04-14 16:15:33,088 INFO L290 TraceCheckUtils]: 70: Hoare triple {85663#(<= ~counter~0 7)} assume true; {85663#(<= ~counter~0 7)} is VALID [2022-04-14 16:15:33,089 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {85663#(<= ~counter~0 7)} {85663#(<= ~counter~0 7)} #96#return; {85663#(<= ~counter~0 7)} is VALID [2022-04-14 16:15:33,089 INFO L290 TraceCheckUtils]: 72: Hoare triple {85663#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85663#(<= ~counter~0 7)} is VALID [2022-04-14 16:15:33,090 INFO L290 TraceCheckUtils]: 73: Hoare triple {85663#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85688#(<= ~counter~0 8)} is VALID [2022-04-14 16:15:33,090 INFO L290 TraceCheckUtils]: 74: Hoare triple {85688#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {85688#(<= ~counter~0 8)} is VALID [2022-04-14 16:15:33,090 INFO L272 TraceCheckUtils]: 75: Hoare triple {85688#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85688#(<= ~counter~0 8)} is VALID [2022-04-14 16:15:33,091 INFO L290 TraceCheckUtils]: 76: Hoare triple {85688#(<= ~counter~0 8)} ~cond := #in~cond; {85688#(<= ~counter~0 8)} is VALID [2022-04-14 16:15:33,091 INFO L290 TraceCheckUtils]: 77: Hoare triple {85688#(<= ~counter~0 8)} assume !(0 == ~cond); {85688#(<= ~counter~0 8)} is VALID [2022-04-14 16:15:33,091 INFO L290 TraceCheckUtils]: 78: Hoare triple {85688#(<= ~counter~0 8)} assume true; {85688#(<= ~counter~0 8)} is VALID [2022-04-14 16:15:33,092 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {85688#(<= ~counter~0 8)} {85688#(<= ~counter~0 8)} #96#return; {85688#(<= ~counter~0 8)} is VALID [2022-04-14 16:15:33,092 INFO L290 TraceCheckUtils]: 80: Hoare triple {85688#(<= ~counter~0 8)} assume !(~r~0 > 0); {85688#(<= ~counter~0 8)} is VALID [2022-04-14 16:15:33,093 INFO L290 TraceCheckUtils]: 81: Hoare triple {85688#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85713#(<= ~counter~0 9)} is VALID [2022-04-14 16:15:33,093 INFO L290 TraceCheckUtils]: 82: Hoare triple {85713#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {85713#(<= ~counter~0 9)} is VALID [2022-04-14 16:15:33,093 INFO L272 TraceCheckUtils]: 83: Hoare triple {85713#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85713#(<= ~counter~0 9)} is VALID [2022-04-14 16:15:33,094 INFO L290 TraceCheckUtils]: 84: Hoare triple {85713#(<= ~counter~0 9)} ~cond := #in~cond; {85713#(<= ~counter~0 9)} is VALID [2022-04-14 16:15:33,094 INFO L290 TraceCheckUtils]: 85: Hoare triple {85713#(<= ~counter~0 9)} assume !(0 == ~cond); {85713#(<= ~counter~0 9)} is VALID [2022-04-14 16:15:33,094 INFO L290 TraceCheckUtils]: 86: Hoare triple {85713#(<= ~counter~0 9)} assume true; {85713#(<= ~counter~0 9)} is VALID [2022-04-14 16:15:33,095 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {85713#(<= ~counter~0 9)} {85713#(<= ~counter~0 9)} #98#return; {85713#(<= ~counter~0 9)} is VALID [2022-04-14 16:15:33,095 INFO L290 TraceCheckUtils]: 88: Hoare triple {85713#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85713#(<= ~counter~0 9)} is VALID [2022-04-14 16:15:33,096 INFO L290 TraceCheckUtils]: 89: Hoare triple {85713#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85738#(<= ~counter~0 10)} is VALID [2022-04-14 16:15:33,096 INFO L290 TraceCheckUtils]: 90: Hoare triple {85738#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {85738#(<= ~counter~0 10)} is VALID [2022-04-14 16:15:33,096 INFO L272 TraceCheckUtils]: 91: Hoare triple {85738#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85738#(<= ~counter~0 10)} is VALID [2022-04-14 16:15:33,097 INFO L290 TraceCheckUtils]: 92: Hoare triple {85738#(<= ~counter~0 10)} ~cond := #in~cond; {85738#(<= ~counter~0 10)} is VALID [2022-04-14 16:15:33,097 INFO L290 TraceCheckUtils]: 93: Hoare triple {85738#(<= ~counter~0 10)} assume !(0 == ~cond); {85738#(<= ~counter~0 10)} is VALID [2022-04-14 16:15:33,097 INFO L290 TraceCheckUtils]: 94: Hoare triple {85738#(<= ~counter~0 10)} assume true; {85738#(<= ~counter~0 10)} is VALID [2022-04-14 16:15:33,098 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {85738#(<= ~counter~0 10)} {85738#(<= ~counter~0 10)} #98#return; {85738#(<= ~counter~0 10)} is VALID [2022-04-14 16:15:33,098 INFO L290 TraceCheckUtils]: 96: Hoare triple {85738#(<= ~counter~0 10)} assume !(~r~0 < 0); {85738#(<= ~counter~0 10)} is VALID [2022-04-14 16:15:33,099 INFO L290 TraceCheckUtils]: 97: Hoare triple {85738#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85763#(<= ~counter~0 11)} is VALID [2022-04-14 16:15:33,099 INFO L290 TraceCheckUtils]: 98: Hoare triple {85763#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {85763#(<= ~counter~0 11)} is VALID [2022-04-14 16:15:33,099 INFO L272 TraceCheckUtils]: 99: Hoare triple {85763#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85763#(<= ~counter~0 11)} is VALID [2022-04-14 16:15:33,100 INFO L290 TraceCheckUtils]: 100: Hoare triple {85763#(<= ~counter~0 11)} ~cond := #in~cond; {85763#(<= ~counter~0 11)} is VALID [2022-04-14 16:15:33,100 INFO L290 TraceCheckUtils]: 101: Hoare triple {85763#(<= ~counter~0 11)} assume !(0 == ~cond); {85763#(<= ~counter~0 11)} is VALID [2022-04-14 16:15:33,100 INFO L290 TraceCheckUtils]: 102: Hoare triple {85763#(<= ~counter~0 11)} assume true; {85763#(<= ~counter~0 11)} is VALID [2022-04-14 16:15:33,101 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {85763#(<= ~counter~0 11)} {85763#(<= ~counter~0 11)} #94#return; {85763#(<= ~counter~0 11)} is VALID [2022-04-14 16:15:33,101 INFO L290 TraceCheckUtils]: 104: Hoare triple {85763#(<= ~counter~0 11)} assume !!(0 != ~r~0); {85763#(<= ~counter~0 11)} is VALID [2022-04-14 16:15:33,102 INFO L290 TraceCheckUtils]: 105: Hoare triple {85763#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85788#(<= ~counter~0 12)} is VALID [2022-04-14 16:15:33,102 INFO L290 TraceCheckUtils]: 106: Hoare triple {85788#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {85788#(<= ~counter~0 12)} is VALID [2022-04-14 16:15:33,102 INFO L272 TraceCheckUtils]: 107: Hoare triple {85788#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85788#(<= ~counter~0 12)} is VALID [2022-04-14 16:15:33,103 INFO L290 TraceCheckUtils]: 108: Hoare triple {85788#(<= ~counter~0 12)} ~cond := #in~cond; {85788#(<= ~counter~0 12)} is VALID [2022-04-14 16:15:33,103 INFO L290 TraceCheckUtils]: 109: Hoare triple {85788#(<= ~counter~0 12)} assume !(0 == ~cond); {85788#(<= ~counter~0 12)} is VALID [2022-04-14 16:15:33,103 INFO L290 TraceCheckUtils]: 110: Hoare triple {85788#(<= ~counter~0 12)} assume true; {85788#(<= ~counter~0 12)} is VALID [2022-04-14 16:15:33,103 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {85788#(<= ~counter~0 12)} {85788#(<= ~counter~0 12)} #96#return; {85788#(<= ~counter~0 12)} is VALID [2022-04-14 16:15:33,104 INFO L290 TraceCheckUtils]: 112: Hoare triple {85788#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85788#(<= ~counter~0 12)} is VALID [2022-04-14 16:15:33,104 INFO L290 TraceCheckUtils]: 113: Hoare triple {85788#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85813#(<= ~counter~0 13)} is VALID [2022-04-14 16:15:33,105 INFO L290 TraceCheckUtils]: 114: Hoare triple {85813#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {85813#(<= ~counter~0 13)} is VALID [2022-04-14 16:15:33,105 INFO L272 TraceCheckUtils]: 115: Hoare triple {85813#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85813#(<= ~counter~0 13)} is VALID [2022-04-14 16:15:33,105 INFO L290 TraceCheckUtils]: 116: Hoare triple {85813#(<= ~counter~0 13)} ~cond := #in~cond; {85813#(<= ~counter~0 13)} is VALID [2022-04-14 16:15:33,106 INFO L290 TraceCheckUtils]: 117: Hoare triple {85813#(<= ~counter~0 13)} assume !(0 == ~cond); {85813#(<= ~counter~0 13)} is VALID [2022-04-14 16:15:33,106 INFO L290 TraceCheckUtils]: 118: Hoare triple {85813#(<= ~counter~0 13)} assume true; {85813#(<= ~counter~0 13)} is VALID [2022-04-14 16:15:33,106 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {85813#(<= ~counter~0 13)} {85813#(<= ~counter~0 13)} #96#return; {85813#(<= ~counter~0 13)} is VALID [2022-04-14 16:15:33,107 INFO L290 TraceCheckUtils]: 120: Hoare triple {85813#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85813#(<= ~counter~0 13)} is VALID [2022-04-14 16:15:33,107 INFO L290 TraceCheckUtils]: 121: Hoare triple {85813#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85838#(<= ~counter~0 14)} is VALID [2022-04-14 16:15:33,108 INFO L290 TraceCheckUtils]: 122: Hoare triple {85838#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {85838#(<= ~counter~0 14)} is VALID [2022-04-14 16:15:33,108 INFO L272 TraceCheckUtils]: 123: Hoare triple {85838#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85838#(<= ~counter~0 14)} is VALID [2022-04-14 16:15:33,108 INFO L290 TraceCheckUtils]: 124: Hoare triple {85838#(<= ~counter~0 14)} ~cond := #in~cond; {85838#(<= ~counter~0 14)} is VALID [2022-04-14 16:15:33,109 INFO L290 TraceCheckUtils]: 125: Hoare triple {85838#(<= ~counter~0 14)} assume !(0 == ~cond); {85838#(<= ~counter~0 14)} is VALID [2022-04-14 16:15:33,109 INFO L290 TraceCheckUtils]: 126: Hoare triple {85838#(<= ~counter~0 14)} assume true; {85838#(<= ~counter~0 14)} is VALID [2022-04-14 16:15:33,109 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {85838#(<= ~counter~0 14)} {85838#(<= ~counter~0 14)} #96#return; {85838#(<= ~counter~0 14)} is VALID [2022-04-14 16:15:33,110 INFO L290 TraceCheckUtils]: 128: Hoare triple {85838#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85838#(<= ~counter~0 14)} is VALID [2022-04-14 16:15:33,111 INFO L290 TraceCheckUtils]: 129: Hoare triple {85838#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85863#(<= ~counter~0 15)} is VALID [2022-04-14 16:15:33,111 INFO L290 TraceCheckUtils]: 130: Hoare triple {85863#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {85863#(<= ~counter~0 15)} is VALID [2022-04-14 16:15:33,111 INFO L272 TraceCheckUtils]: 131: Hoare triple {85863#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85863#(<= ~counter~0 15)} is VALID [2022-04-14 16:15:33,112 INFO L290 TraceCheckUtils]: 132: Hoare triple {85863#(<= ~counter~0 15)} ~cond := #in~cond; {85863#(<= ~counter~0 15)} is VALID [2022-04-14 16:15:33,112 INFO L290 TraceCheckUtils]: 133: Hoare triple {85863#(<= ~counter~0 15)} assume !(0 == ~cond); {85863#(<= ~counter~0 15)} is VALID [2022-04-14 16:15:33,112 INFO L290 TraceCheckUtils]: 134: Hoare triple {85863#(<= ~counter~0 15)} assume true; {85863#(<= ~counter~0 15)} is VALID [2022-04-14 16:15:33,113 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {85863#(<= ~counter~0 15)} {85863#(<= ~counter~0 15)} #96#return; {85863#(<= ~counter~0 15)} is VALID [2022-04-14 16:15:33,113 INFO L290 TraceCheckUtils]: 136: Hoare triple {85863#(<= ~counter~0 15)} assume !(~r~0 > 0); {85863#(<= ~counter~0 15)} is VALID [2022-04-14 16:15:33,114 INFO L290 TraceCheckUtils]: 137: Hoare triple {85863#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85888#(<= ~counter~0 16)} is VALID [2022-04-14 16:15:33,114 INFO L290 TraceCheckUtils]: 138: Hoare triple {85888#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {85888#(<= ~counter~0 16)} is VALID [2022-04-14 16:15:33,114 INFO L272 TraceCheckUtils]: 139: Hoare triple {85888#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85888#(<= ~counter~0 16)} is VALID [2022-04-14 16:15:33,115 INFO L290 TraceCheckUtils]: 140: Hoare triple {85888#(<= ~counter~0 16)} ~cond := #in~cond; {85888#(<= ~counter~0 16)} is VALID [2022-04-14 16:15:33,115 INFO L290 TraceCheckUtils]: 141: Hoare triple {85888#(<= ~counter~0 16)} assume !(0 == ~cond); {85888#(<= ~counter~0 16)} is VALID [2022-04-14 16:15:33,115 INFO L290 TraceCheckUtils]: 142: Hoare triple {85888#(<= ~counter~0 16)} assume true; {85888#(<= ~counter~0 16)} is VALID [2022-04-14 16:15:33,116 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {85888#(<= ~counter~0 16)} {85888#(<= ~counter~0 16)} #98#return; {85888#(<= ~counter~0 16)} is VALID [2022-04-14 16:15:33,116 INFO L290 TraceCheckUtils]: 144: Hoare triple {85888#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85888#(<= ~counter~0 16)} is VALID [2022-04-14 16:15:33,117 INFO L290 TraceCheckUtils]: 145: Hoare triple {85888#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85913#(<= ~counter~0 17)} is VALID [2022-04-14 16:15:33,117 INFO L290 TraceCheckUtils]: 146: Hoare triple {85913#(<= ~counter~0 17)} assume !!(#t~post8 < 100);havoc #t~post8; {85913#(<= ~counter~0 17)} is VALID [2022-04-14 16:15:33,117 INFO L272 TraceCheckUtils]: 147: Hoare triple {85913#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85913#(<= ~counter~0 17)} is VALID [2022-04-14 16:15:33,118 INFO L290 TraceCheckUtils]: 148: Hoare triple {85913#(<= ~counter~0 17)} ~cond := #in~cond; {85913#(<= ~counter~0 17)} is VALID [2022-04-14 16:15:33,118 INFO L290 TraceCheckUtils]: 149: Hoare triple {85913#(<= ~counter~0 17)} assume !(0 == ~cond); {85913#(<= ~counter~0 17)} is VALID [2022-04-14 16:15:33,118 INFO L290 TraceCheckUtils]: 150: Hoare triple {85913#(<= ~counter~0 17)} assume true; {85913#(<= ~counter~0 17)} is VALID [2022-04-14 16:15:33,118 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {85913#(<= ~counter~0 17)} {85913#(<= ~counter~0 17)} #98#return; {85913#(<= ~counter~0 17)} is VALID [2022-04-14 16:15:33,119 INFO L290 TraceCheckUtils]: 152: Hoare triple {85913#(<= ~counter~0 17)} assume !(~r~0 < 0); {85913#(<= ~counter~0 17)} is VALID [2022-04-14 16:15:33,119 INFO L290 TraceCheckUtils]: 153: Hoare triple {85913#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85938#(<= ~counter~0 18)} is VALID [2022-04-14 16:15:33,120 INFO L290 TraceCheckUtils]: 154: Hoare triple {85938#(<= ~counter~0 18)} assume !!(#t~post6 < 100);havoc #t~post6; {85938#(<= ~counter~0 18)} is VALID [2022-04-14 16:15:33,120 INFO L272 TraceCheckUtils]: 155: Hoare triple {85938#(<= ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85938#(<= ~counter~0 18)} is VALID [2022-04-14 16:15:33,120 INFO L290 TraceCheckUtils]: 156: Hoare triple {85938#(<= ~counter~0 18)} ~cond := #in~cond; {85938#(<= ~counter~0 18)} is VALID [2022-04-14 16:15:33,121 INFO L290 TraceCheckUtils]: 157: Hoare triple {85938#(<= ~counter~0 18)} assume !(0 == ~cond); {85938#(<= ~counter~0 18)} is VALID [2022-04-14 16:15:33,121 INFO L290 TraceCheckUtils]: 158: Hoare triple {85938#(<= ~counter~0 18)} assume true; {85938#(<= ~counter~0 18)} is VALID [2022-04-14 16:15:33,121 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {85938#(<= ~counter~0 18)} {85938#(<= ~counter~0 18)} #94#return; {85938#(<= ~counter~0 18)} is VALID [2022-04-14 16:15:33,122 INFO L290 TraceCheckUtils]: 160: Hoare triple {85938#(<= ~counter~0 18)} assume !!(0 != ~r~0); {85938#(<= ~counter~0 18)} is VALID [2022-04-14 16:15:33,122 INFO L290 TraceCheckUtils]: 161: Hoare triple {85938#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85963#(<= ~counter~0 19)} is VALID [2022-04-14 16:15:33,123 INFO L290 TraceCheckUtils]: 162: Hoare triple {85963#(<= ~counter~0 19)} assume !!(#t~post7 < 100);havoc #t~post7; {85963#(<= ~counter~0 19)} is VALID [2022-04-14 16:15:33,123 INFO L272 TraceCheckUtils]: 163: Hoare triple {85963#(<= ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85963#(<= ~counter~0 19)} is VALID [2022-04-14 16:15:33,123 INFO L290 TraceCheckUtils]: 164: Hoare triple {85963#(<= ~counter~0 19)} ~cond := #in~cond; {85963#(<= ~counter~0 19)} is VALID [2022-04-14 16:15:33,124 INFO L290 TraceCheckUtils]: 165: Hoare triple {85963#(<= ~counter~0 19)} assume !(0 == ~cond); {85963#(<= ~counter~0 19)} is VALID [2022-04-14 16:15:33,124 INFO L290 TraceCheckUtils]: 166: Hoare triple {85963#(<= ~counter~0 19)} assume true; {85963#(<= ~counter~0 19)} is VALID [2022-04-14 16:15:33,124 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {85963#(<= ~counter~0 19)} {85963#(<= ~counter~0 19)} #96#return; {85963#(<= ~counter~0 19)} is VALID [2022-04-14 16:15:33,125 INFO L290 TraceCheckUtils]: 168: Hoare triple {85963#(<= ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85963#(<= ~counter~0 19)} is VALID [2022-04-14 16:15:33,125 INFO L290 TraceCheckUtils]: 169: Hoare triple {85963#(<= ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85988#(<= ~counter~0 20)} is VALID [2022-04-14 16:15:33,126 INFO L290 TraceCheckUtils]: 170: Hoare triple {85988#(<= ~counter~0 20)} assume !!(#t~post7 < 100);havoc #t~post7; {85988#(<= ~counter~0 20)} is VALID [2022-04-14 16:15:33,126 INFO L272 TraceCheckUtils]: 171: Hoare triple {85988#(<= ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85988#(<= ~counter~0 20)} is VALID [2022-04-14 16:15:33,126 INFO L290 TraceCheckUtils]: 172: Hoare triple {85988#(<= ~counter~0 20)} ~cond := #in~cond; {85988#(<= ~counter~0 20)} is VALID [2022-04-14 16:15:33,127 INFO L290 TraceCheckUtils]: 173: Hoare triple {85988#(<= ~counter~0 20)} assume !(0 == ~cond); {85988#(<= ~counter~0 20)} is VALID [2022-04-14 16:15:33,127 INFO L290 TraceCheckUtils]: 174: Hoare triple {85988#(<= ~counter~0 20)} assume true; {85988#(<= ~counter~0 20)} is VALID [2022-04-14 16:15:33,127 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {85988#(<= ~counter~0 20)} {85988#(<= ~counter~0 20)} #96#return; {85988#(<= ~counter~0 20)} is VALID [2022-04-14 16:15:33,128 INFO L290 TraceCheckUtils]: 176: Hoare triple {85988#(<= ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85988#(<= ~counter~0 20)} is VALID [2022-04-14 16:15:33,128 INFO L290 TraceCheckUtils]: 177: Hoare triple {85988#(<= ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86013#(<= |main_#t~post7| 20)} is VALID [2022-04-14 16:15:33,128 INFO L290 TraceCheckUtils]: 178: Hoare triple {86013#(<= |main_#t~post7| 20)} assume !(#t~post7 < 100);havoc #t~post7; {85457#false} is VALID [2022-04-14 16:15:33,128 INFO L290 TraceCheckUtils]: 179: Hoare triple {85457#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85457#false} is VALID [2022-04-14 16:15:33,128 INFO L290 TraceCheckUtils]: 180: Hoare triple {85457#false} assume !(#t~post8 < 100);havoc #t~post8; {85457#false} is VALID [2022-04-14 16:15:33,129 INFO L290 TraceCheckUtils]: 181: Hoare triple {85457#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85457#false} is VALID [2022-04-14 16:15:33,129 INFO L290 TraceCheckUtils]: 182: Hoare triple {85457#false} assume !(#t~post6 < 100);havoc #t~post6; {85457#false} is VALID [2022-04-14 16:15:33,129 INFO L272 TraceCheckUtils]: 183: Hoare triple {85457#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85457#false} is VALID [2022-04-14 16:15:33,129 INFO L290 TraceCheckUtils]: 184: Hoare triple {85457#false} ~cond := #in~cond; {85457#false} is VALID [2022-04-14 16:15:33,129 INFO L290 TraceCheckUtils]: 185: Hoare triple {85457#false} assume 0 == ~cond; {85457#false} is VALID [2022-04-14 16:15:33,129 INFO L290 TraceCheckUtils]: 186: Hoare triple {85457#false} assume !false; {85457#false} is VALID [2022-04-14 16:15:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 60 proven. 1044 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:15:33,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:15:34,326 INFO L290 TraceCheckUtils]: 186: Hoare triple {85457#false} assume !false; {85457#false} is VALID [2022-04-14 16:15:34,326 INFO L290 TraceCheckUtils]: 185: Hoare triple {85457#false} assume 0 == ~cond; {85457#false} is VALID [2022-04-14 16:15:34,326 INFO L290 TraceCheckUtils]: 184: Hoare triple {85457#false} ~cond := #in~cond; {85457#false} is VALID [2022-04-14 16:15:34,326 INFO L272 TraceCheckUtils]: 183: Hoare triple {85457#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85457#false} is VALID [2022-04-14 16:15:34,326 INFO L290 TraceCheckUtils]: 182: Hoare triple {85457#false} assume !(#t~post6 < 100);havoc #t~post6; {85457#false} is VALID [2022-04-14 16:15:34,326 INFO L290 TraceCheckUtils]: 181: Hoare triple {85457#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85457#false} is VALID [2022-04-14 16:15:34,326 INFO L290 TraceCheckUtils]: 180: Hoare triple {85457#false} assume !(#t~post8 < 100);havoc #t~post8; {85457#false} is VALID [2022-04-14 16:15:34,326 INFO L290 TraceCheckUtils]: 179: Hoare triple {85457#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85457#false} is VALID [2022-04-14 16:15:34,327 INFO L290 TraceCheckUtils]: 178: Hoare triple {86065#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {85457#false} is VALID [2022-04-14 16:15:34,327 INFO L290 TraceCheckUtils]: 177: Hoare triple {86069#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86065#(< |main_#t~post7| 100)} is VALID [2022-04-14 16:15:34,327 INFO L290 TraceCheckUtils]: 176: Hoare triple {86069#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {86069#(< ~counter~0 100)} is VALID [2022-04-14 16:15:34,328 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {85456#true} {86069#(< ~counter~0 100)} #96#return; {86069#(< ~counter~0 100)} is VALID [2022-04-14 16:15:34,328 INFO L290 TraceCheckUtils]: 174: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,328 INFO L290 TraceCheckUtils]: 173: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,328 INFO L290 TraceCheckUtils]: 172: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,328 INFO L272 TraceCheckUtils]: 171: Hoare triple {86069#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,328 INFO L290 TraceCheckUtils]: 170: Hoare triple {86069#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {86069#(< ~counter~0 100)} is VALID [2022-04-14 16:15:34,329 INFO L290 TraceCheckUtils]: 169: Hoare triple {86094#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86069#(< ~counter~0 100)} is VALID [2022-04-14 16:15:34,330 INFO L290 TraceCheckUtils]: 168: Hoare triple {86094#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {86094#(< ~counter~0 99)} is VALID [2022-04-14 16:15:34,330 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {85456#true} {86094#(< ~counter~0 99)} #96#return; {86094#(< ~counter~0 99)} is VALID [2022-04-14 16:15:34,330 INFO L290 TraceCheckUtils]: 166: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,330 INFO L290 TraceCheckUtils]: 165: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,330 INFO L290 TraceCheckUtils]: 164: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,330 INFO L272 TraceCheckUtils]: 163: Hoare triple {86094#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,331 INFO L290 TraceCheckUtils]: 162: Hoare triple {86094#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {86094#(< ~counter~0 99)} is VALID [2022-04-14 16:15:34,331 INFO L290 TraceCheckUtils]: 161: Hoare triple {86119#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86094#(< ~counter~0 99)} is VALID [2022-04-14 16:15:34,332 INFO L290 TraceCheckUtils]: 160: Hoare triple {86119#(< ~counter~0 98)} assume !!(0 != ~r~0); {86119#(< ~counter~0 98)} is VALID [2022-04-14 16:15:34,332 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {85456#true} {86119#(< ~counter~0 98)} #94#return; {86119#(< ~counter~0 98)} is VALID [2022-04-14 16:15:34,332 INFO L290 TraceCheckUtils]: 158: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,332 INFO L290 TraceCheckUtils]: 157: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,332 INFO L290 TraceCheckUtils]: 156: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,332 INFO L272 TraceCheckUtils]: 155: Hoare triple {86119#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,333 INFO L290 TraceCheckUtils]: 154: Hoare triple {86119#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {86119#(< ~counter~0 98)} is VALID [2022-04-14 16:15:34,333 INFO L290 TraceCheckUtils]: 153: Hoare triple {86144#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {86119#(< ~counter~0 98)} is VALID [2022-04-14 16:15:34,333 INFO L290 TraceCheckUtils]: 152: Hoare triple {86144#(< ~counter~0 97)} assume !(~r~0 < 0); {86144#(< ~counter~0 97)} is VALID [2022-04-14 16:15:34,334 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {85456#true} {86144#(< ~counter~0 97)} #98#return; {86144#(< ~counter~0 97)} is VALID [2022-04-14 16:15:34,334 INFO L290 TraceCheckUtils]: 150: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,334 INFO L290 TraceCheckUtils]: 149: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,334 INFO L290 TraceCheckUtils]: 148: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,334 INFO L272 TraceCheckUtils]: 147: Hoare triple {86144#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,334 INFO L290 TraceCheckUtils]: 146: Hoare triple {86144#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {86144#(< ~counter~0 97)} is VALID [2022-04-14 16:15:34,335 INFO L290 TraceCheckUtils]: 145: Hoare triple {86169#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {86144#(< ~counter~0 97)} is VALID [2022-04-14 16:15:34,335 INFO L290 TraceCheckUtils]: 144: Hoare triple {86169#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {86169#(< ~counter~0 96)} is VALID [2022-04-14 16:15:34,336 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {85456#true} {86169#(< ~counter~0 96)} #98#return; {86169#(< ~counter~0 96)} is VALID [2022-04-14 16:15:34,336 INFO L290 TraceCheckUtils]: 142: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,336 INFO L290 TraceCheckUtils]: 141: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,336 INFO L290 TraceCheckUtils]: 140: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,336 INFO L272 TraceCheckUtils]: 139: Hoare triple {86169#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,336 INFO L290 TraceCheckUtils]: 138: Hoare triple {86169#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {86169#(< ~counter~0 96)} is VALID [2022-04-14 16:15:34,337 INFO L290 TraceCheckUtils]: 137: Hoare triple {86194#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {86169#(< ~counter~0 96)} is VALID [2022-04-14 16:15:34,337 INFO L290 TraceCheckUtils]: 136: Hoare triple {86194#(< ~counter~0 95)} assume !(~r~0 > 0); {86194#(< ~counter~0 95)} is VALID [2022-04-14 16:15:34,338 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {85456#true} {86194#(< ~counter~0 95)} #96#return; {86194#(< ~counter~0 95)} is VALID [2022-04-14 16:15:34,338 INFO L290 TraceCheckUtils]: 134: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,338 INFO L290 TraceCheckUtils]: 133: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,338 INFO L290 TraceCheckUtils]: 132: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,338 INFO L272 TraceCheckUtils]: 131: Hoare triple {86194#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,338 INFO L290 TraceCheckUtils]: 130: Hoare triple {86194#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {86194#(< ~counter~0 95)} is VALID [2022-04-14 16:15:34,339 INFO L290 TraceCheckUtils]: 129: Hoare triple {86219#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86194#(< ~counter~0 95)} is VALID [2022-04-14 16:15:34,339 INFO L290 TraceCheckUtils]: 128: Hoare triple {86219#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {86219#(< ~counter~0 94)} is VALID [2022-04-14 16:15:34,339 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {85456#true} {86219#(< ~counter~0 94)} #96#return; {86219#(< ~counter~0 94)} is VALID [2022-04-14 16:15:34,339 INFO L290 TraceCheckUtils]: 126: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,340 INFO L290 TraceCheckUtils]: 125: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,340 INFO L290 TraceCheckUtils]: 124: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,340 INFO L272 TraceCheckUtils]: 123: Hoare triple {86219#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,340 INFO L290 TraceCheckUtils]: 122: Hoare triple {86219#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {86219#(< ~counter~0 94)} is VALID [2022-04-14 16:15:34,341 INFO L290 TraceCheckUtils]: 121: Hoare triple {86244#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86219#(< ~counter~0 94)} is VALID [2022-04-14 16:15:34,341 INFO L290 TraceCheckUtils]: 120: Hoare triple {86244#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {86244#(< ~counter~0 93)} is VALID [2022-04-14 16:15:34,341 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {85456#true} {86244#(< ~counter~0 93)} #96#return; {86244#(< ~counter~0 93)} is VALID [2022-04-14 16:15:34,341 INFO L290 TraceCheckUtils]: 118: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,341 INFO L290 TraceCheckUtils]: 117: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,341 INFO L290 TraceCheckUtils]: 116: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,341 INFO L272 TraceCheckUtils]: 115: Hoare triple {86244#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,342 INFO L290 TraceCheckUtils]: 114: Hoare triple {86244#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {86244#(< ~counter~0 93)} is VALID [2022-04-14 16:15:34,342 INFO L290 TraceCheckUtils]: 113: Hoare triple {86269#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86244#(< ~counter~0 93)} is VALID [2022-04-14 16:15:34,343 INFO L290 TraceCheckUtils]: 112: Hoare triple {86269#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {86269#(< ~counter~0 92)} is VALID [2022-04-14 16:15:34,343 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {85456#true} {86269#(< ~counter~0 92)} #96#return; {86269#(< ~counter~0 92)} is VALID [2022-04-14 16:15:34,343 INFO L290 TraceCheckUtils]: 110: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,343 INFO L290 TraceCheckUtils]: 109: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,343 INFO L290 TraceCheckUtils]: 108: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,343 INFO L272 TraceCheckUtils]: 107: Hoare triple {86269#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,344 INFO L290 TraceCheckUtils]: 106: Hoare triple {86269#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {86269#(< ~counter~0 92)} is VALID [2022-04-14 16:15:34,344 INFO L290 TraceCheckUtils]: 105: Hoare triple {86294#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86269#(< ~counter~0 92)} is VALID [2022-04-14 16:15:34,344 INFO L290 TraceCheckUtils]: 104: Hoare triple {86294#(< ~counter~0 91)} assume !!(0 != ~r~0); {86294#(< ~counter~0 91)} is VALID [2022-04-14 16:15:34,345 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {85456#true} {86294#(< ~counter~0 91)} #94#return; {86294#(< ~counter~0 91)} is VALID [2022-04-14 16:15:34,345 INFO L290 TraceCheckUtils]: 102: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,345 INFO L290 TraceCheckUtils]: 101: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,345 INFO L290 TraceCheckUtils]: 100: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,345 INFO L272 TraceCheckUtils]: 99: Hoare triple {86294#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,345 INFO L290 TraceCheckUtils]: 98: Hoare triple {86294#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {86294#(< ~counter~0 91)} is VALID [2022-04-14 16:15:34,346 INFO L290 TraceCheckUtils]: 97: Hoare triple {86319#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {86294#(< ~counter~0 91)} is VALID [2022-04-14 16:15:34,346 INFO L290 TraceCheckUtils]: 96: Hoare triple {86319#(< ~counter~0 90)} assume !(~r~0 < 0); {86319#(< ~counter~0 90)} is VALID [2022-04-14 16:15:34,347 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {85456#true} {86319#(< ~counter~0 90)} #98#return; {86319#(< ~counter~0 90)} is VALID [2022-04-14 16:15:34,347 INFO L290 TraceCheckUtils]: 94: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,347 INFO L290 TraceCheckUtils]: 93: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,347 INFO L290 TraceCheckUtils]: 92: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,347 INFO L272 TraceCheckUtils]: 91: Hoare triple {86319#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,347 INFO L290 TraceCheckUtils]: 90: Hoare triple {86319#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {86319#(< ~counter~0 90)} is VALID [2022-04-14 16:15:34,348 INFO L290 TraceCheckUtils]: 89: Hoare triple {86344#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {86319#(< ~counter~0 90)} is VALID [2022-04-14 16:15:34,348 INFO L290 TraceCheckUtils]: 88: Hoare triple {86344#(< ~counter~0 89)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {86344#(< ~counter~0 89)} is VALID [2022-04-14 16:15:34,349 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {85456#true} {86344#(< ~counter~0 89)} #98#return; {86344#(< ~counter~0 89)} is VALID [2022-04-14 16:15:34,349 INFO L290 TraceCheckUtils]: 86: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,349 INFO L290 TraceCheckUtils]: 85: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,349 INFO L290 TraceCheckUtils]: 84: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,349 INFO L272 TraceCheckUtils]: 83: Hoare triple {86344#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,349 INFO L290 TraceCheckUtils]: 82: Hoare triple {86344#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {86344#(< ~counter~0 89)} is VALID [2022-04-14 16:15:34,350 INFO L290 TraceCheckUtils]: 81: Hoare triple {86369#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {86344#(< ~counter~0 89)} is VALID [2022-04-14 16:15:34,350 INFO L290 TraceCheckUtils]: 80: Hoare triple {86369#(< ~counter~0 88)} assume !(~r~0 > 0); {86369#(< ~counter~0 88)} is VALID [2022-04-14 16:15:34,350 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {85456#true} {86369#(< ~counter~0 88)} #96#return; {86369#(< ~counter~0 88)} is VALID [2022-04-14 16:15:34,350 INFO L290 TraceCheckUtils]: 78: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,351 INFO L290 TraceCheckUtils]: 77: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,351 INFO L290 TraceCheckUtils]: 76: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,351 INFO L272 TraceCheckUtils]: 75: Hoare triple {86369#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,351 INFO L290 TraceCheckUtils]: 74: Hoare triple {86369#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {86369#(< ~counter~0 88)} is VALID [2022-04-14 16:15:34,352 INFO L290 TraceCheckUtils]: 73: Hoare triple {86394#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86369#(< ~counter~0 88)} is VALID [2022-04-14 16:15:34,352 INFO L290 TraceCheckUtils]: 72: Hoare triple {86394#(< ~counter~0 87)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {86394#(< ~counter~0 87)} is VALID [2022-04-14 16:15:34,352 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {85456#true} {86394#(< ~counter~0 87)} #96#return; {86394#(< ~counter~0 87)} is VALID [2022-04-14 16:15:34,352 INFO L290 TraceCheckUtils]: 70: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,352 INFO L290 TraceCheckUtils]: 69: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,352 INFO L290 TraceCheckUtils]: 68: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,352 INFO L272 TraceCheckUtils]: 67: Hoare triple {86394#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,353 INFO L290 TraceCheckUtils]: 66: Hoare triple {86394#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {86394#(< ~counter~0 87)} is VALID [2022-04-14 16:15:34,353 INFO L290 TraceCheckUtils]: 65: Hoare triple {86419#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86394#(< ~counter~0 87)} is VALID [2022-04-14 16:15:34,354 INFO L290 TraceCheckUtils]: 64: Hoare triple {86419#(< ~counter~0 86)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {86419#(< ~counter~0 86)} is VALID [2022-04-14 16:15:34,354 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {85456#true} {86419#(< ~counter~0 86)} #96#return; {86419#(< ~counter~0 86)} is VALID [2022-04-14 16:15:34,354 INFO L290 TraceCheckUtils]: 62: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,354 INFO L290 TraceCheckUtils]: 61: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,354 INFO L290 TraceCheckUtils]: 60: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,354 INFO L272 TraceCheckUtils]: 59: Hoare triple {86419#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,355 INFO L290 TraceCheckUtils]: 58: Hoare triple {86419#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {86419#(< ~counter~0 86)} is VALID [2022-04-14 16:15:34,355 INFO L290 TraceCheckUtils]: 57: Hoare triple {86444#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86419#(< ~counter~0 86)} is VALID [2022-04-14 16:15:34,355 INFO L290 TraceCheckUtils]: 56: Hoare triple {86444#(< ~counter~0 85)} assume !!(0 != ~r~0); {86444#(< ~counter~0 85)} is VALID [2022-04-14 16:15:34,356 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {85456#true} {86444#(< ~counter~0 85)} #94#return; {86444#(< ~counter~0 85)} is VALID [2022-04-14 16:15:34,356 INFO L290 TraceCheckUtils]: 54: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,356 INFO L290 TraceCheckUtils]: 53: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,356 INFO L290 TraceCheckUtils]: 52: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,356 INFO L272 TraceCheckUtils]: 51: Hoare triple {86444#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,356 INFO L290 TraceCheckUtils]: 50: Hoare triple {86444#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {86444#(< ~counter~0 85)} is VALID [2022-04-14 16:15:34,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {86469#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {86444#(< ~counter~0 85)} is VALID [2022-04-14 16:15:34,358 INFO L290 TraceCheckUtils]: 48: Hoare triple {86469#(< ~counter~0 84)} assume !(~r~0 < 0); {86469#(< ~counter~0 84)} is VALID [2022-04-14 16:15:34,358 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {85456#true} {86469#(< ~counter~0 84)} #98#return; {86469#(< ~counter~0 84)} is VALID [2022-04-14 16:15:34,359 INFO L290 TraceCheckUtils]: 46: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,359 INFO L290 TraceCheckUtils]: 45: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,359 INFO L290 TraceCheckUtils]: 44: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,359 INFO L272 TraceCheckUtils]: 43: Hoare triple {86469#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {86469#(< ~counter~0 84)} assume !!(#t~post8 < 100);havoc #t~post8; {86469#(< ~counter~0 84)} is VALID [2022-04-14 16:15:34,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {86494#(< ~counter~0 83)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {86469#(< ~counter~0 84)} is VALID [2022-04-14 16:15:34,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {86494#(< ~counter~0 83)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {86494#(< ~counter~0 83)} is VALID [2022-04-14 16:15:34,360 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {85456#true} {86494#(< ~counter~0 83)} #98#return; {86494#(< ~counter~0 83)} is VALID [2022-04-14 16:15:34,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,361 INFO L272 TraceCheckUtils]: 35: Hoare triple {86494#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {86494#(< ~counter~0 83)} assume !!(#t~post8 < 100);havoc #t~post8; {86494#(< ~counter~0 83)} is VALID [2022-04-14 16:15:34,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {86519#(< ~counter~0 82)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {86494#(< ~counter~0 83)} is VALID [2022-04-14 16:15:34,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {86519#(< ~counter~0 82)} assume !(~r~0 > 0); {86519#(< ~counter~0 82)} is VALID [2022-04-14 16:15:34,362 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {85456#true} {86519#(< ~counter~0 82)} #96#return; {86519#(< ~counter~0 82)} is VALID [2022-04-14 16:15:34,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,362 INFO L272 TraceCheckUtils]: 27: Hoare triple {86519#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {86519#(< ~counter~0 82)} assume !!(#t~post7 < 100);havoc #t~post7; {86519#(< ~counter~0 82)} is VALID [2022-04-14 16:15:34,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {86544#(< ~counter~0 81)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86519#(< ~counter~0 82)} is VALID [2022-04-14 16:15:34,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {86544#(< ~counter~0 81)} assume !!(0 != ~r~0); {86544#(< ~counter~0 81)} is VALID [2022-04-14 16:15:34,364 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {85456#true} {86544#(< ~counter~0 81)} #94#return; {86544#(< ~counter~0 81)} is VALID [2022-04-14 16:15:34,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,364 INFO L272 TraceCheckUtils]: 19: Hoare triple {86544#(< ~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)); {85456#true} is VALID [2022-04-14 16:15:34,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {86544#(< ~counter~0 81)} assume !!(#t~post6 < 100);havoc #t~post6; {86544#(< ~counter~0 81)} is VALID [2022-04-14 16:15:34,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {86569#(< ~counter~0 80)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {86544#(< ~counter~0 81)} is VALID [2022-04-14 16:15:34,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {86569#(< ~counter~0 80)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {86569#(< ~counter~0 80)} is VALID [2022-04-14 16:15:34,366 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {85456#true} {86569#(< ~counter~0 80)} #92#return; {86569#(< ~counter~0 80)} is VALID [2022-04-14 16:15:34,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,366 INFO L272 TraceCheckUtils]: 11: Hoare triple {86569#(< ~counter~0 80)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {85456#true} is VALID [2022-04-14 16:15:34,366 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {85456#true} {86569#(< ~counter~0 80)} #90#return; {86569#(< ~counter~0 80)} is VALID [2022-04-14 16:15:34,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-14 16:15:34,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-14 16:15:34,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-14 16:15:34,367 INFO L272 TraceCheckUtils]: 6: Hoare triple {86569#(< ~counter~0 80)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {85456#true} is VALID [2022-04-14 16:15:34,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {86569#(< ~counter~0 80)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {86569#(< ~counter~0 80)} is VALID [2022-04-14 16:15:34,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {86569#(< ~counter~0 80)} call #t~ret9 := main(); {86569#(< ~counter~0 80)} is VALID [2022-04-14 16:15:34,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86569#(< ~counter~0 80)} {85456#true} #102#return; {86569#(< ~counter~0 80)} is VALID [2022-04-14 16:15:34,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {86569#(< ~counter~0 80)} assume true; {86569#(< ~counter~0 80)} is VALID [2022-04-14 16:15:34,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {85456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {86569#(< ~counter~0 80)} is VALID [2022-04-14 16:15:34,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {85456#true} call ULTIMATE.init(); {85456#true} is VALID [2022-04-14 16:15:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 60 proven. 284 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2022-04-14 16:15:34,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:15:34,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771385639] [2022-04-14 16:15:34,369 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:15:34,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201883108] [2022-04-14 16:15:34,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201883108] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:15:34,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:15:34,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-04-14 16:15:34,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952610675] [2022-04-14 16:15:34,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:15:34,370 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) Word has length 187 [2022-04-14 16:15:34,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:15:34,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) [2022-04-14 16:15:34,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 302 edges. 302 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:15:34,587 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-14 16:15:34,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:15:34,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-14 16:15:34,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2022-04-14 16:15:34,588 INFO L87 Difference]: Start difference. First operand 2548 states and 3416 transitions. Second operand has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) [2022-04-14 16:15:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:59,133 INFO L93 Difference]: Finished difference Result 10270 states and 15333 transitions. [2022-04-14 16:15:59,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-04-14 16:15:59,133 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) Word has length 187 [2022-04-14 16:15:59,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:15:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) [2022-04-14 16:15:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 956 transitions. [2022-04-14 16:15:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) [2022-04-14 16:15:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 956 transitions. [2022-04-14 16:15:59,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 956 transitions. [2022-04-14 16:15:59,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 956 edges. 956 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:03,605 INFO L225 Difference]: With dead ends: 10270 [2022-04-14 16:16:03,605 INFO L226 Difference]: Without dead ends: 10261 [2022-04-14 16:16:03,610 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2691, Invalid=4619, Unknown=0, NotChecked=0, Total=7310 [2022-04-14 16:16:03,611 INFO L913 BasicCegarLoop]: 153 mSDtfsCounter, 1666 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 1122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1666 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1122 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-14 16:16:03,611 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1666 Valid, 1002 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1122 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-14 16:16:03,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10261 states. [2022-04-14 16:16:18,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10261 to 10003. [2022-04-14 16:16:18,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:16:18,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10261 states. Second operand has 10003 states, 7524 states have (on average 1.257177033492823) internal successors, (9459), 7589 states have internal predecessors, (9459), 2396 states have call successors, (2396), 84 states have call predecessors, (2396), 82 states have return successors, (2394), 2329 states have call predecessors, (2394), 2394 states have call successors, (2394) [2022-04-14 16:16:18,572 INFO L74 IsIncluded]: Start isIncluded. First operand 10261 states. Second operand has 10003 states, 7524 states have (on average 1.257177033492823) internal successors, (9459), 7589 states have internal predecessors, (9459), 2396 states have call successors, (2396), 84 states have call predecessors, (2396), 82 states have return successors, (2394), 2329 states have call predecessors, (2394), 2394 states have call successors, (2394) [2022-04-14 16:16:18,581 INFO L87 Difference]: Start difference. First operand 10261 states. Second operand has 10003 states, 7524 states have (on average 1.257177033492823) internal successors, (9459), 7589 states have internal predecessors, (9459), 2396 states have call successors, (2396), 84 states have call predecessors, (2396), 82 states have return successors, (2394), 2329 states have call predecessors, (2394), 2394 states have call successors, (2394) [2022-04-14 16:16:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:21,067 INFO L93 Difference]: Finished difference Result 10261 states and 14499 transitions. [2022-04-14 16:16:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 10261 states and 14499 transitions. [2022-04-14 16:16:21,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:21,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:21,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 10003 states, 7524 states have (on average 1.257177033492823) internal successors, (9459), 7589 states have internal predecessors, (9459), 2396 states have call successors, (2396), 84 states have call predecessors, (2396), 82 states have return successors, (2394), 2329 states have call predecessors, (2394), 2394 states have call successors, (2394) Second operand 10261 states. [2022-04-14 16:16:21,094 INFO L87 Difference]: Start difference. First operand has 10003 states, 7524 states have (on average 1.257177033492823) internal successors, (9459), 7589 states have internal predecessors, (9459), 2396 states have call successors, (2396), 84 states have call predecessors, (2396), 82 states have return successors, (2394), 2329 states have call predecessors, (2394), 2394 states have call successors, (2394) Second operand 10261 states. [2022-04-14 16:16:23,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:23,765 INFO L93 Difference]: Finished difference Result 10261 states and 14499 transitions. [2022-04-14 16:16:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand 10261 states and 14499 transitions. [2022-04-14 16:16:23,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:23,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:23,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:16:23,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:16:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10003 states, 7524 states have (on average 1.257177033492823) internal successors, (9459), 7589 states have internal predecessors, (9459), 2396 states have call successors, (2396), 84 states have call predecessors, (2396), 82 states have return successors, (2394), 2329 states have call predecessors, (2394), 2394 states have call successors, (2394) [2022-04-14 16:16:27,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10003 states to 10003 states and 14249 transitions. [2022-04-14 16:16:27,385 INFO L78 Accepts]: Start accepts. Automaton has 10003 states and 14249 transitions. Word has length 187 [2022-04-14 16:16:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:16:27,385 INFO L478 AbstractCegarLoop]: Abstraction has 10003 states and 14249 transitions. [2022-04-14 16:16:27,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) [2022-04-14 16:16:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 10003 states and 14249 transitions. [2022-04-14 16:16:27,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-14 16:16:27,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:27,389 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 10, 10, 10, 10, 8, 7, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:16:27,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-14 16:16:27,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:27,590 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:27,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:27,590 INFO L85 PathProgramCache]: Analyzing trace with hash 179284923, now seen corresponding path program 2 times [2022-04-14 16:16:27,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:27,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355288847] [2022-04-14 16:16:27,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:27,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:27,613 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:27,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1050612971] [2022-04-14 16:16:27,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 16:16:27,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:27,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:27,614 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:16:27,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-14 16:16:27,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 16:16:27,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:16:27,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-14 16:16:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:27,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:28,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {135802#true} call ULTIMATE.init(); {135802#true} is VALID [2022-04-14 16:16:28,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {135802#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {135810#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:28,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {135810#(<= ~counter~0 0)} assume true; {135810#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:28,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135810#(<= ~counter~0 0)} {135802#true} #102#return; {135810#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:28,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {135810#(<= ~counter~0 0)} call #t~ret9 := main(); {135810#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:28,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {135810#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {135810#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:28,704 INFO L272 TraceCheckUtils]: 6: Hoare triple {135810#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {135810#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:28,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {135810#(<= ~counter~0 0)} ~cond := #in~cond; {135810#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:28,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {135810#(<= ~counter~0 0)} assume !(0 == ~cond); {135810#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:28,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {135810#(<= ~counter~0 0)} assume true; {135810#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:28,705 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {135810#(<= ~counter~0 0)} {135810#(<= ~counter~0 0)} #90#return; {135810#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:28,705 INFO L272 TraceCheckUtils]: 11: Hoare triple {135810#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {135810#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:28,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {135810#(<= ~counter~0 0)} ~cond := #in~cond; {135810#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:28,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {135810#(<= ~counter~0 0)} assume !(0 == ~cond); {135810#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:28,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {135810#(<= ~counter~0 0)} assume true; {135810#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:28,706 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {135810#(<= ~counter~0 0)} {135810#(<= ~counter~0 0)} #92#return; {135810#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:28,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {135810#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {135810#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:28,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {135810#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {135859#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:28,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {135859#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {135859#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:28,709 INFO L272 TraceCheckUtils]: 19: Hoare triple {135859#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {135859#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:28,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {135859#(<= ~counter~0 1)} ~cond := #in~cond; {135859#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:28,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {135859#(<= ~counter~0 1)} assume !(0 == ~cond); {135859#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:28,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {135859#(<= ~counter~0 1)} assume true; {135859#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:28,710 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {135859#(<= ~counter~0 1)} {135859#(<= ~counter~0 1)} #94#return; {135859#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:28,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {135859#(<= ~counter~0 1)} assume !!(0 != ~r~0); {135859#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:28,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {135859#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {135884#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:28,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {135884#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {135884#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:28,712 INFO L272 TraceCheckUtils]: 27: Hoare triple {135884#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {135884#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:28,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {135884#(<= ~counter~0 2)} ~cond := #in~cond; {135884#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:28,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {135884#(<= ~counter~0 2)} assume !(0 == ~cond); {135884#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:28,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {135884#(<= ~counter~0 2)} assume true; {135884#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:28,713 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {135884#(<= ~counter~0 2)} {135884#(<= ~counter~0 2)} #96#return; {135884#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:28,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {135884#(<= ~counter~0 2)} assume !(~r~0 > 0); {135884#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:28,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {135884#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {135909#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:28,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {135909#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {135909#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:28,714 INFO L272 TraceCheckUtils]: 35: Hoare triple {135909#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {135909#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:28,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {135909#(<= ~counter~0 3)} ~cond := #in~cond; {135909#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:28,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {135909#(<= ~counter~0 3)} assume !(0 == ~cond); {135909#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:28,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {135909#(<= ~counter~0 3)} assume true; {135909#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:28,716 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {135909#(<= ~counter~0 3)} {135909#(<= ~counter~0 3)} #98#return; {135909#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:28,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {135909#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {135909#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:28,717 INFO L290 TraceCheckUtils]: 41: Hoare triple {135909#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {135934#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:28,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {135934#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {135934#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:28,717 INFO L272 TraceCheckUtils]: 43: Hoare triple {135934#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {135934#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:28,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {135934#(<= ~counter~0 4)} ~cond := #in~cond; {135934#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:28,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {135934#(<= ~counter~0 4)} assume !(0 == ~cond); {135934#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:28,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {135934#(<= ~counter~0 4)} assume true; {135934#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:28,718 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {135934#(<= ~counter~0 4)} {135934#(<= ~counter~0 4)} #98#return; {135934#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:28,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {135934#(<= ~counter~0 4)} assume !(~r~0 < 0); {135934#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:28,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {135934#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {135959#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:28,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {135959#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {135959#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:28,720 INFO L272 TraceCheckUtils]: 51: Hoare triple {135959#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {135959#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:28,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {135959#(<= ~counter~0 5)} ~cond := #in~cond; {135959#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:28,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {135959#(<= ~counter~0 5)} assume !(0 == ~cond); {135959#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:28,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {135959#(<= ~counter~0 5)} assume true; {135959#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:28,721 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {135959#(<= ~counter~0 5)} {135959#(<= ~counter~0 5)} #94#return; {135959#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:28,721 INFO L290 TraceCheckUtils]: 56: Hoare triple {135959#(<= ~counter~0 5)} assume !!(0 != ~r~0); {135959#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:28,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {135959#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {135984#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:28,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {135984#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {135984#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:28,723 INFO L272 TraceCheckUtils]: 59: Hoare triple {135984#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {135984#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:28,723 INFO L290 TraceCheckUtils]: 60: Hoare triple {135984#(<= ~counter~0 6)} ~cond := #in~cond; {135984#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:28,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {135984#(<= ~counter~0 6)} assume !(0 == ~cond); {135984#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:28,724 INFO L290 TraceCheckUtils]: 62: Hoare triple {135984#(<= ~counter~0 6)} assume true; {135984#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:28,724 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {135984#(<= ~counter~0 6)} {135984#(<= ~counter~0 6)} #96#return; {135984#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:28,724 INFO L290 TraceCheckUtils]: 64: Hoare triple {135984#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {135984#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:28,725 INFO L290 TraceCheckUtils]: 65: Hoare triple {135984#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136009#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:28,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {136009#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {136009#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:28,726 INFO L272 TraceCheckUtils]: 67: Hoare triple {136009#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {136009#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:28,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {136009#(<= ~counter~0 7)} ~cond := #in~cond; {136009#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:28,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {136009#(<= ~counter~0 7)} assume !(0 == ~cond); {136009#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:28,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {136009#(<= ~counter~0 7)} assume true; {136009#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:28,727 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {136009#(<= ~counter~0 7)} {136009#(<= ~counter~0 7)} #96#return; {136009#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:28,727 INFO L290 TraceCheckUtils]: 72: Hoare triple {136009#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136009#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:28,728 INFO L290 TraceCheckUtils]: 73: Hoare triple {136009#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136034#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:28,728 INFO L290 TraceCheckUtils]: 74: Hoare triple {136034#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {136034#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:28,728 INFO L272 TraceCheckUtils]: 75: Hoare triple {136034#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {136034#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:28,729 INFO L290 TraceCheckUtils]: 76: Hoare triple {136034#(<= ~counter~0 8)} ~cond := #in~cond; {136034#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:28,729 INFO L290 TraceCheckUtils]: 77: Hoare triple {136034#(<= ~counter~0 8)} assume !(0 == ~cond); {136034#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:28,729 INFO L290 TraceCheckUtils]: 78: Hoare triple {136034#(<= ~counter~0 8)} assume true; {136034#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:28,730 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {136034#(<= ~counter~0 8)} {136034#(<= ~counter~0 8)} #96#return; {136034#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:28,730 INFO L290 TraceCheckUtils]: 80: Hoare triple {136034#(<= ~counter~0 8)} assume !(~r~0 > 0); {136034#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:28,731 INFO L290 TraceCheckUtils]: 81: Hoare triple {136034#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136059#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:28,731 INFO L290 TraceCheckUtils]: 82: Hoare triple {136059#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {136059#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:28,731 INFO L272 TraceCheckUtils]: 83: Hoare triple {136059#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {136059#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:28,732 INFO L290 TraceCheckUtils]: 84: Hoare triple {136059#(<= ~counter~0 9)} ~cond := #in~cond; {136059#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:28,732 INFO L290 TraceCheckUtils]: 85: Hoare triple {136059#(<= ~counter~0 9)} assume !(0 == ~cond); {136059#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:28,732 INFO L290 TraceCheckUtils]: 86: Hoare triple {136059#(<= ~counter~0 9)} assume true; {136059#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:28,733 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {136059#(<= ~counter~0 9)} {136059#(<= ~counter~0 9)} #98#return; {136059#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:28,733 INFO L290 TraceCheckUtils]: 88: Hoare triple {136059#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {136059#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:28,734 INFO L290 TraceCheckUtils]: 89: Hoare triple {136059#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136084#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:28,734 INFO L290 TraceCheckUtils]: 90: Hoare triple {136084#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {136084#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:28,735 INFO L272 TraceCheckUtils]: 91: Hoare triple {136084#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {136084#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:28,735 INFO L290 TraceCheckUtils]: 92: Hoare triple {136084#(<= ~counter~0 10)} ~cond := #in~cond; {136084#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:28,735 INFO L290 TraceCheckUtils]: 93: Hoare triple {136084#(<= ~counter~0 10)} assume !(0 == ~cond); {136084#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:28,735 INFO L290 TraceCheckUtils]: 94: Hoare triple {136084#(<= ~counter~0 10)} assume true; {136084#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:28,736 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {136084#(<= ~counter~0 10)} {136084#(<= ~counter~0 10)} #98#return; {136084#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:28,736 INFO L290 TraceCheckUtils]: 96: Hoare triple {136084#(<= ~counter~0 10)} assume !(~r~0 < 0); {136084#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:28,737 INFO L290 TraceCheckUtils]: 97: Hoare triple {136084#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {136109#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:28,737 INFO L290 TraceCheckUtils]: 98: Hoare triple {136109#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {136109#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:28,737 INFO L272 TraceCheckUtils]: 99: Hoare triple {136109#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {136109#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:28,738 INFO L290 TraceCheckUtils]: 100: Hoare triple {136109#(<= ~counter~0 11)} ~cond := #in~cond; {136109#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:28,738 INFO L290 TraceCheckUtils]: 101: Hoare triple {136109#(<= ~counter~0 11)} assume !(0 == ~cond); {136109#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:28,738 INFO L290 TraceCheckUtils]: 102: Hoare triple {136109#(<= ~counter~0 11)} assume true; {136109#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:28,739 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {136109#(<= ~counter~0 11)} {136109#(<= ~counter~0 11)} #94#return; {136109#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:28,739 INFO L290 TraceCheckUtils]: 104: Hoare triple {136109#(<= ~counter~0 11)} assume !!(0 != ~r~0); {136109#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:28,740 INFO L290 TraceCheckUtils]: 105: Hoare triple {136109#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136134#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:28,740 INFO L290 TraceCheckUtils]: 106: Hoare triple {136134#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {136134#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:28,753 INFO L272 TraceCheckUtils]: 107: Hoare triple {136134#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {136134#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:28,753 INFO L290 TraceCheckUtils]: 108: Hoare triple {136134#(<= ~counter~0 12)} ~cond := #in~cond; {136134#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:28,753 INFO L290 TraceCheckUtils]: 109: Hoare triple {136134#(<= ~counter~0 12)} assume !(0 == ~cond); {136134#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:28,753 INFO L290 TraceCheckUtils]: 110: Hoare triple {136134#(<= ~counter~0 12)} assume true; {136134#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:28,754 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {136134#(<= ~counter~0 12)} {136134#(<= ~counter~0 12)} #96#return; {136134#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:28,754 INFO L290 TraceCheckUtils]: 112: Hoare triple {136134#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136134#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:28,756 INFO L290 TraceCheckUtils]: 113: Hoare triple {136134#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136159#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:28,756 INFO L290 TraceCheckUtils]: 114: Hoare triple {136159#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {136159#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:28,756 INFO L272 TraceCheckUtils]: 115: Hoare triple {136159#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {136159#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:28,757 INFO L290 TraceCheckUtils]: 116: Hoare triple {136159#(<= ~counter~0 13)} ~cond := #in~cond; {136159#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:28,757 INFO L290 TraceCheckUtils]: 117: Hoare triple {136159#(<= ~counter~0 13)} assume !(0 == ~cond); {136159#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:28,757 INFO L290 TraceCheckUtils]: 118: Hoare triple {136159#(<= ~counter~0 13)} assume true; {136159#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:28,758 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {136159#(<= ~counter~0 13)} {136159#(<= ~counter~0 13)} #96#return; {136159#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:28,758 INFO L290 TraceCheckUtils]: 120: Hoare triple {136159#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136159#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:28,759 INFO L290 TraceCheckUtils]: 121: Hoare triple {136159#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136184#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:28,759 INFO L290 TraceCheckUtils]: 122: Hoare triple {136184#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {136184#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:28,759 INFO L272 TraceCheckUtils]: 123: Hoare triple {136184#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {136184#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:28,760 INFO L290 TraceCheckUtils]: 124: Hoare triple {136184#(<= ~counter~0 14)} ~cond := #in~cond; {136184#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:28,760 INFO L290 TraceCheckUtils]: 125: Hoare triple {136184#(<= ~counter~0 14)} assume !(0 == ~cond); {136184#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:28,760 INFO L290 TraceCheckUtils]: 126: Hoare triple {136184#(<= ~counter~0 14)} assume true; {136184#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:28,761 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {136184#(<= ~counter~0 14)} {136184#(<= ~counter~0 14)} #96#return; {136184#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:28,761 INFO L290 TraceCheckUtils]: 128: Hoare triple {136184#(<= ~counter~0 14)} assume !(~r~0 > 0); {136184#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:28,762 INFO L290 TraceCheckUtils]: 129: Hoare triple {136184#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136209#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:28,762 INFO L290 TraceCheckUtils]: 130: Hoare triple {136209#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {136209#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:28,763 INFO L272 TraceCheckUtils]: 131: Hoare triple {136209#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {136209#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:28,763 INFO L290 TraceCheckUtils]: 132: Hoare triple {136209#(<= ~counter~0 15)} ~cond := #in~cond; {136209#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:28,763 INFO L290 TraceCheckUtils]: 133: Hoare triple {136209#(<= ~counter~0 15)} assume !(0 == ~cond); {136209#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:28,763 INFO L290 TraceCheckUtils]: 134: Hoare triple {136209#(<= ~counter~0 15)} assume true; {136209#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:28,764 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {136209#(<= ~counter~0 15)} {136209#(<= ~counter~0 15)} #98#return; {136209#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:28,764 INFO L290 TraceCheckUtils]: 136: Hoare triple {136209#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {136209#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:28,765 INFO L290 TraceCheckUtils]: 137: Hoare triple {136209#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136234#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:28,765 INFO L290 TraceCheckUtils]: 138: Hoare triple {136234#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {136234#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:28,766 INFO L272 TraceCheckUtils]: 139: Hoare triple {136234#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {136234#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:28,766 INFO L290 TraceCheckUtils]: 140: Hoare triple {136234#(<= ~counter~0 16)} ~cond := #in~cond; {136234#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:28,766 INFO L290 TraceCheckUtils]: 141: Hoare triple {136234#(<= ~counter~0 16)} assume !(0 == ~cond); {136234#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:28,766 INFO L290 TraceCheckUtils]: 142: Hoare triple {136234#(<= ~counter~0 16)} assume true; {136234#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:28,767 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {136234#(<= ~counter~0 16)} {136234#(<= ~counter~0 16)} #98#return; {136234#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:28,767 INFO L290 TraceCheckUtils]: 144: Hoare triple {136234#(<= ~counter~0 16)} assume !(~r~0 < 0); {136234#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:28,768 INFO L290 TraceCheckUtils]: 145: Hoare triple {136234#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {136259#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:28,768 INFO L290 TraceCheckUtils]: 146: Hoare triple {136259#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {136259#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:28,768 INFO L272 TraceCheckUtils]: 147: Hoare triple {136259#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {136259#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:28,769 INFO L290 TraceCheckUtils]: 148: Hoare triple {136259#(<= ~counter~0 17)} ~cond := #in~cond; {136259#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:28,769 INFO L290 TraceCheckUtils]: 149: Hoare triple {136259#(<= ~counter~0 17)} assume !(0 == ~cond); {136259#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:28,769 INFO L290 TraceCheckUtils]: 150: Hoare triple {136259#(<= ~counter~0 17)} assume true; {136259#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:28,769 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {136259#(<= ~counter~0 17)} {136259#(<= ~counter~0 17)} #94#return; {136259#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:28,770 INFO L290 TraceCheckUtils]: 152: Hoare triple {136259#(<= ~counter~0 17)} assume !!(0 != ~r~0); {136259#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:28,770 INFO L290 TraceCheckUtils]: 153: Hoare triple {136259#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136284#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:28,771 INFO L290 TraceCheckUtils]: 154: Hoare triple {136284#(<= ~counter~0 18)} assume !!(#t~post7 < 100);havoc #t~post7; {136284#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:28,771 INFO L272 TraceCheckUtils]: 155: Hoare triple {136284#(<= ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {136284#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:28,771 INFO L290 TraceCheckUtils]: 156: Hoare triple {136284#(<= ~counter~0 18)} ~cond := #in~cond; {136284#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:28,772 INFO L290 TraceCheckUtils]: 157: Hoare triple {136284#(<= ~counter~0 18)} assume !(0 == ~cond); {136284#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:28,772 INFO L290 TraceCheckUtils]: 158: Hoare triple {136284#(<= ~counter~0 18)} assume true; {136284#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:28,772 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {136284#(<= ~counter~0 18)} {136284#(<= ~counter~0 18)} #96#return; {136284#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:28,773 INFO L290 TraceCheckUtils]: 160: Hoare triple {136284#(<= ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136284#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:28,773 INFO L290 TraceCheckUtils]: 161: Hoare triple {136284#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136309#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:28,774 INFO L290 TraceCheckUtils]: 162: Hoare triple {136309#(<= ~counter~0 19)} assume !!(#t~post7 < 100);havoc #t~post7; {136309#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:28,774 INFO L272 TraceCheckUtils]: 163: Hoare triple {136309#(<= ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {136309#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:28,774 INFO L290 TraceCheckUtils]: 164: Hoare triple {136309#(<= ~counter~0 19)} ~cond := #in~cond; {136309#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:28,774 INFO L290 TraceCheckUtils]: 165: Hoare triple {136309#(<= ~counter~0 19)} assume !(0 == ~cond); {136309#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:28,775 INFO L290 TraceCheckUtils]: 166: Hoare triple {136309#(<= ~counter~0 19)} assume true; {136309#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:28,775 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {136309#(<= ~counter~0 19)} {136309#(<= ~counter~0 19)} #96#return; {136309#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:28,775 INFO L290 TraceCheckUtils]: 168: Hoare triple {136309#(<= ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136309#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:28,776 INFO L290 TraceCheckUtils]: 169: Hoare triple {136309#(<= ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136334#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:28,777 INFO L290 TraceCheckUtils]: 170: Hoare triple {136334#(<= ~counter~0 20)} assume !!(#t~post7 < 100);havoc #t~post7; {136334#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:28,777 INFO L272 TraceCheckUtils]: 171: Hoare triple {136334#(<= ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {136334#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:28,777 INFO L290 TraceCheckUtils]: 172: Hoare triple {136334#(<= ~counter~0 20)} ~cond := #in~cond; {136334#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:28,778 INFO L290 TraceCheckUtils]: 173: Hoare triple {136334#(<= ~counter~0 20)} assume !(0 == ~cond); {136334#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:28,778 INFO L290 TraceCheckUtils]: 174: Hoare triple {136334#(<= ~counter~0 20)} assume true; {136334#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:28,778 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {136334#(<= ~counter~0 20)} {136334#(<= ~counter~0 20)} #96#return; {136334#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:28,778 INFO L290 TraceCheckUtils]: 176: Hoare triple {136334#(<= ~counter~0 20)} assume !(~r~0 > 0); {136334#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:28,779 INFO L290 TraceCheckUtils]: 177: Hoare triple {136334#(<= ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136359#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:28,779 INFO L290 TraceCheckUtils]: 178: Hoare triple {136359#(<= ~counter~0 21)} assume !!(#t~post8 < 100);havoc #t~post8; {136359#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:28,780 INFO L272 TraceCheckUtils]: 179: Hoare triple {136359#(<= ~counter~0 21)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {136359#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:28,780 INFO L290 TraceCheckUtils]: 180: Hoare triple {136359#(<= ~counter~0 21)} ~cond := #in~cond; {136359#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:28,780 INFO L290 TraceCheckUtils]: 181: Hoare triple {136359#(<= ~counter~0 21)} assume !(0 == ~cond); {136359#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:28,781 INFO L290 TraceCheckUtils]: 182: Hoare triple {136359#(<= ~counter~0 21)} assume true; {136359#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:28,781 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {136359#(<= ~counter~0 21)} {136359#(<= ~counter~0 21)} #98#return; {136359#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:28,781 INFO L290 TraceCheckUtils]: 184: Hoare triple {136359#(<= ~counter~0 21)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {136359#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:28,782 INFO L290 TraceCheckUtils]: 185: Hoare triple {136359#(<= ~counter~0 21)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136384#(<= |main_#t~post8| 21)} is VALID [2022-04-14 16:16:28,782 INFO L290 TraceCheckUtils]: 186: Hoare triple {136384#(<= |main_#t~post8| 21)} assume !(#t~post8 < 100);havoc #t~post8; {135803#false} is VALID [2022-04-14 16:16:28,782 INFO L290 TraceCheckUtils]: 187: Hoare triple {135803#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {135803#false} is VALID [2022-04-14 16:16:28,782 INFO L290 TraceCheckUtils]: 188: Hoare triple {135803#false} assume !(#t~post6 < 100);havoc #t~post6; {135803#false} is VALID [2022-04-14 16:16:28,782 INFO L272 TraceCheckUtils]: 189: Hoare triple {135803#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {135803#false} is VALID [2022-04-14 16:16:28,782 INFO L290 TraceCheckUtils]: 190: Hoare triple {135803#false} ~cond := #in~cond; {135803#false} is VALID [2022-04-14 16:16:28,782 INFO L290 TraceCheckUtils]: 191: Hoare triple {135803#false} assume 0 == ~cond; {135803#false} is VALID [2022-04-14 16:16:28,782 INFO L290 TraceCheckUtils]: 192: Hoare triple {135803#false} assume !false; {135803#false} is VALID [2022-04-14 16:16:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1196 backedges. 50 proven. 1142 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:16:28,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:16:30,005 INFO L290 TraceCheckUtils]: 192: Hoare triple {135803#false} assume !false; {135803#false} is VALID [2022-04-14 16:16:30,005 INFO L290 TraceCheckUtils]: 191: Hoare triple {135803#false} assume 0 == ~cond; {135803#false} is VALID [2022-04-14 16:16:30,005 INFO L290 TraceCheckUtils]: 190: Hoare triple {135803#false} ~cond := #in~cond; {135803#false} is VALID [2022-04-14 16:16:30,005 INFO L272 TraceCheckUtils]: 189: Hoare triple {135803#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {135803#false} is VALID [2022-04-14 16:16:30,006 INFO L290 TraceCheckUtils]: 188: Hoare triple {135803#false} assume !(#t~post6 < 100);havoc #t~post6; {135803#false} is VALID [2022-04-14 16:16:30,006 INFO L290 TraceCheckUtils]: 187: Hoare triple {135803#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {135803#false} is VALID [2022-04-14 16:16:30,006 INFO L290 TraceCheckUtils]: 186: Hoare triple {136424#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {135803#false} is VALID [2022-04-14 16:16:30,006 INFO L290 TraceCheckUtils]: 185: Hoare triple {136428#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136424#(< |main_#t~post8| 100)} is VALID [2022-04-14 16:16:30,006 INFO L290 TraceCheckUtils]: 184: Hoare triple {136428#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {136428#(< ~counter~0 100)} is VALID [2022-04-14 16:16:30,007 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {135802#true} {136428#(< ~counter~0 100)} #98#return; {136428#(< ~counter~0 100)} is VALID [2022-04-14 16:16:30,007 INFO L290 TraceCheckUtils]: 182: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,007 INFO L290 TraceCheckUtils]: 181: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,007 INFO L290 TraceCheckUtils]: 180: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,007 INFO L272 TraceCheckUtils]: 179: Hoare triple {136428#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,007 INFO L290 TraceCheckUtils]: 178: Hoare triple {136428#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {136428#(< ~counter~0 100)} is VALID [2022-04-14 16:16:30,009 INFO L290 TraceCheckUtils]: 177: Hoare triple {136453#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136428#(< ~counter~0 100)} is VALID [2022-04-14 16:16:30,009 INFO L290 TraceCheckUtils]: 176: Hoare triple {136453#(< ~counter~0 99)} assume !(~r~0 > 0); {136453#(< ~counter~0 99)} is VALID [2022-04-14 16:16:30,010 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {135802#true} {136453#(< ~counter~0 99)} #96#return; {136453#(< ~counter~0 99)} is VALID [2022-04-14 16:16:30,010 INFO L290 TraceCheckUtils]: 174: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,010 INFO L290 TraceCheckUtils]: 173: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,010 INFO L290 TraceCheckUtils]: 172: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,010 INFO L272 TraceCheckUtils]: 171: Hoare triple {136453#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,010 INFO L290 TraceCheckUtils]: 170: Hoare triple {136453#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {136453#(< ~counter~0 99)} is VALID [2022-04-14 16:16:30,011 INFO L290 TraceCheckUtils]: 169: Hoare triple {136478#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136453#(< ~counter~0 99)} is VALID [2022-04-14 16:16:30,011 INFO L290 TraceCheckUtils]: 168: Hoare triple {136478#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136478#(< ~counter~0 98)} is VALID [2022-04-14 16:16:30,012 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {135802#true} {136478#(< ~counter~0 98)} #96#return; {136478#(< ~counter~0 98)} is VALID [2022-04-14 16:16:30,012 INFO L290 TraceCheckUtils]: 166: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,012 INFO L290 TraceCheckUtils]: 165: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,012 INFO L290 TraceCheckUtils]: 164: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,012 INFO L272 TraceCheckUtils]: 163: Hoare triple {136478#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,012 INFO L290 TraceCheckUtils]: 162: Hoare triple {136478#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {136478#(< ~counter~0 98)} is VALID [2022-04-14 16:16:30,013 INFO L290 TraceCheckUtils]: 161: Hoare triple {136503#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136478#(< ~counter~0 98)} is VALID [2022-04-14 16:16:30,013 INFO L290 TraceCheckUtils]: 160: Hoare triple {136503#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136503#(< ~counter~0 97)} is VALID [2022-04-14 16:16:30,014 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {135802#true} {136503#(< ~counter~0 97)} #96#return; {136503#(< ~counter~0 97)} is VALID [2022-04-14 16:16:30,014 INFO L290 TraceCheckUtils]: 158: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,014 INFO L290 TraceCheckUtils]: 157: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,014 INFO L290 TraceCheckUtils]: 156: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,014 INFO L272 TraceCheckUtils]: 155: Hoare triple {136503#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,014 INFO L290 TraceCheckUtils]: 154: Hoare triple {136503#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {136503#(< ~counter~0 97)} is VALID [2022-04-14 16:16:30,015 INFO L290 TraceCheckUtils]: 153: Hoare triple {136528#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136503#(< ~counter~0 97)} is VALID [2022-04-14 16:16:30,015 INFO L290 TraceCheckUtils]: 152: Hoare triple {136528#(< ~counter~0 96)} assume !!(0 != ~r~0); {136528#(< ~counter~0 96)} is VALID [2022-04-14 16:16:30,016 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {135802#true} {136528#(< ~counter~0 96)} #94#return; {136528#(< ~counter~0 96)} is VALID [2022-04-14 16:16:30,016 INFO L290 TraceCheckUtils]: 150: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,016 INFO L290 TraceCheckUtils]: 149: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,016 INFO L290 TraceCheckUtils]: 148: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,016 INFO L272 TraceCheckUtils]: 147: Hoare triple {136528#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,016 INFO L290 TraceCheckUtils]: 146: Hoare triple {136528#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {136528#(< ~counter~0 96)} is VALID [2022-04-14 16:16:30,017 INFO L290 TraceCheckUtils]: 145: Hoare triple {136553#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {136528#(< ~counter~0 96)} is VALID [2022-04-14 16:16:30,017 INFO L290 TraceCheckUtils]: 144: Hoare triple {136553#(< ~counter~0 95)} assume !(~r~0 < 0); {136553#(< ~counter~0 95)} is VALID [2022-04-14 16:16:30,018 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {135802#true} {136553#(< ~counter~0 95)} #98#return; {136553#(< ~counter~0 95)} is VALID [2022-04-14 16:16:30,018 INFO L290 TraceCheckUtils]: 142: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,018 INFO L290 TraceCheckUtils]: 141: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,018 INFO L290 TraceCheckUtils]: 140: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,018 INFO L272 TraceCheckUtils]: 139: Hoare triple {136553#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,018 INFO L290 TraceCheckUtils]: 138: Hoare triple {136553#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {136553#(< ~counter~0 95)} is VALID [2022-04-14 16:16:30,019 INFO L290 TraceCheckUtils]: 137: Hoare triple {136578#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136553#(< ~counter~0 95)} is VALID [2022-04-14 16:16:30,019 INFO L290 TraceCheckUtils]: 136: Hoare triple {136578#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {136578#(< ~counter~0 94)} is VALID [2022-04-14 16:16:30,020 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {135802#true} {136578#(< ~counter~0 94)} #98#return; {136578#(< ~counter~0 94)} is VALID [2022-04-14 16:16:30,020 INFO L290 TraceCheckUtils]: 134: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,020 INFO L290 TraceCheckUtils]: 133: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,020 INFO L290 TraceCheckUtils]: 132: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,020 INFO L272 TraceCheckUtils]: 131: Hoare triple {136578#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,020 INFO L290 TraceCheckUtils]: 130: Hoare triple {136578#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {136578#(< ~counter~0 94)} is VALID [2022-04-14 16:16:30,021 INFO L290 TraceCheckUtils]: 129: Hoare triple {136603#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136578#(< ~counter~0 94)} is VALID [2022-04-14 16:16:30,021 INFO L290 TraceCheckUtils]: 128: Hoare triple {136603#(< ~counter~0 93)} assume !(~r~0 > 0); {136603#(< ~counter~0 93)} is VALID [2022-04-14 16:16:30,022 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {135802#true} {136603#(< ~counter~0 93)} #96#return; {136603#(< ~counter~0 93)} is VALID [2022-04-14 16:16:30,022 INFO L290 TraceCheckUtils]: 126: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,022 INFO L290 TraceCheckUtils]: 125: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,022 INFO L290 TraceCheckUtils]: 124: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,022 INFO L272 TraceCheckUtils]: 123: Hoare triple {136603#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,022 INFO L290 TraceCheckUtils]: 122: Hoare triple {136603#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {136603#(< ~counter~0 93)} is VALID [2022-04-14 16:16:30,023 INFO L290 TraceCheckUtils]: 121: Hoare triple {136628#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136603#(< ~counter~0 93)} is VALID [2022-04-14 16:16:30,023 INFO L290 TraceCheckUtils]: 120: Hoare triple {136628#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136628#(< ~counter~0 92)} is VALID [2022-04-14 16:16:30,023 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {135802#true} {136628#(< ~counter~0 92)} #96#return; {136628#(< ~counter~0 92)} is VALID [2022-04-14 16:16:30,024 INFO L290 TraceCheckUtils]: 118: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,024 INFO L290 TraceCheckUtils]: 117: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,024 INFO L290 TraceCheckUtils]: 116: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,024 INFO L272 TraceCheckUtils]: 115: Hoare triple {136628#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,024 INFO L290 TraceCheckUtils]: 114: Hoare triple {136628#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {136628#(< ~counter~0 92)} is VALID [2022-04-14 16:16:30,025 INFO L290 TraceCheckUtils]: 113: Hoare triple {136653#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136628#(< ~counter~0 92)} is VALID [2022-04-14 16:16:30,025 INFO L290 TraceCheckUtils]: 112: Hoare triple {136653#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136653#(< ~counter~0 91)} is VALID [2022-04-14 16:16:30,025 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {135802#true} {136653#(< ~counter~0 91)} #96#return; {136653#(< ~counter~0 91)} is VALID [2022-04-14 16:16:30,026 INFO L290 TraceCheckUtils]: 110: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,026 INFO L290 TraceCheckUtils]: 109: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,026 INFO L290 TraceCheckUtils]: 108: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,026 INFO L272 TraceCheckUtils]: 107: Hoare triple {136653#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,026 INFO L290 TraceCheckUtils]: 106: Hoare triple {136653#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {136653#(< ~counter~0 91)} is VALID [2022-04-14 16:16:30,027 INFO L290 TraceCheckUtils]: 105: Hoare triple {136678#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136653#(< ~counter~0 91)} is VALID [2022-04-14 16:16:30,027 INFO L290 TraceCheckUtils]: 104: Hoare triple {136678#(< ~counter~0 90)} assume !!(0 != ~r~0); {136678#(< ~counter~0 90)} is VALID [2022-04-14 16:16:30,027 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {135802#true} {136678#(< ~counter~0 90)} #94#return; {136678#(< ~counter~0 90)} is VALID [2022-04-14 16:16:30,027 INFO L290 TraceCheckUtils]: 102: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,027 INFO L290 TraceCheckUtils]: 101: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,028 INFO L290 TraceCheckUtils]: 100: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,028 INFO L272 TraceCheckUtils]: 99: Hoare triple {136678#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,028 INFO L290 TraceCheckUtils]: 98: Hoare triple {136678#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {136678#(< ~counter~0 90)} is VALID [2022-04-14 16:16:30,029 INFO L290 TraceCheckUtils]: 97: Hoare triple {136703#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {136678#(< ~counter~0 90)} is VALID [2022-04-14 16:16:30,029 INFO L290 TraceCheckUtils]: 96: Hoare triple {136703#(< ~counter~0 89)} assume !(~r~0 < 0); {136703#(< ~counter~0 89)} is VALID [2022-04-14 16:16:30,043 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {135802#true} {136703#(< ~counter~0 89)} #98#return; {136703#(< ~counter~0 89)} is VALID [2022-04-14 16:16:30,044 INFO L290 TraceCheckUtils]: 94: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,044 INFO L290 TraceCheckUtils]: 93: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,044 INFO L290 TraceCheckUtils]: 92: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,044 INFO L272 TraceCheckUtils]: 91: Hoare triple {136703#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,044 INFO L290 TraceCheckUtils]: 90: Hoare triple {136703#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {136703#(< ~counter~0 89)} is VALID [2022-04-14 16:16:30,046 INFO L290 TraceCheckUtils]: 89: Hoare triple {136728#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136703#(< ~counter~0 89)} is VALID [2022-04-14 16:16:30,046 INFO L290 TraceCheckUtils]: 88: Hoare triple {136728#(< ~counter~0 88)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {136728#(< ~counter~0 88)} is VALID [2022-04-14 16:16:30,047 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {135802#true} {136728#(< ~counter~0 88)} #98#return; {136728#(< ~counter~0 88)} is VALID [2022-04-14 16:16:30,047 INFO L290 TraceCheckUtils]: 86: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,047 INFO L290 TraceCheckUtils]: 85: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,047 INFO L290 TraceCheckUtils]: 84: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,047 INFO L272 TraceCheckUtils]: 83: Hoare triple {136728#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,047 INFO L290 TraceCheckUtils]: 82: Hoare triple {136728#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {136728#(< ~counter~0 88)} is VALID [2022-04-14 16:16:30,048 INFO L290 TraceCheckUtils]: 81: Hoare triple {136753#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136728#(< ~counter~0 88)} is VALID [2022-04-14 16:16:30,048 INFO L290 TraceCheckUtils]: 80: Hoare triple {136753#(< ~counter~0 87)} assume !(~r~0 > 0); {136753#(< ~counter~0 87)} is VALID [2022-04-14 16:16:30,049 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {135802#true} {136753#(< ~counter~0 87)} #96#return; {136753#(< ~counter~0 87)} is VALID [2022-04-14 16:16:30,049 INFO L290 TraceCheckUtils]: 78: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,049 INFO L290 TraceCheckUtils]: 77: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,049 INFO L290 TraceCheckUtils]: 76: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,049 INFO L272 TraceCheckUtils]: 75: Hoare triple {136753#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,049 INFO L290 TraceCheckUtils]: 74: Hoare triple {136753#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {136753#(< ~counter~0 87)} is VALID [2022-04-14 16:16:30,050 INFO L290 TraceCheckUtils]: 73: Hoare triple {136778#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136753#(< ~counter~0 87)} is VALID [2022-04-14 16:16:30,051 INFO L290 TraceCheckUtils]: 72: Hoare triple {136778#(< ~counter~0 86)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136778#(< ~counter~0 86)} is VALID [2022-04-14 16:16:30,051 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {135802#true} {136778#(< ~counter~0 86)} #96#return; {136778#(< ~counter~0 86)} is VALID [2022-04-14 16:16:30,051 INFO L290 TraceCheckUtils]: 70: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,051 INFO L290 TraceCheckUtils]: 69: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,051 INFO L290 TraceCheckUtils]: 68: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,051 INFO L272 TraceCheckUtils]: 67: Hoare triple {136778#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,052 INFO L290 TraceCheckUtils]: 66: Hoare triple {136778#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {136778#(< ~counter~0 86)} is VALID [2022-04-14 16:16:30,053 INFO L290 TraceCheckUtils]: 65: Hoare triple {136803#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136778#(< ~counter~0 86)} is VALID [2022-04-14 16:16:30,053 INFO L290 TraceCheckUtils]: 64: Hoare triple {136803#(< ~counter~0 85)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136803#(< ~counter~0 85)} is VALID [2022-04-14 16:16:30,053 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {135802#true} {136803#(< ~counter~0 85)} #96#return; {136803#(< ~counter~0 85)} is VALID [2022-04-14 16:16:30,053 INFO L290 TraceCheckUtils]: 62: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,053 INFO L290 TraceCheckUtils]: 61: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,054 INFO L290 TraceCheckUtils]: 60: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,054 INFO L272 TraceCheckUtils]: 59: Hoare triple {136803#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,054 INFO L290 TraceCheckUtils]: 58: Hoare triple {136803#(< ~counter~0 85)} assume !!(#t~post7 < 100);havoc #t~post7; {136803#(< ~counter~0 85)} is VALID [2022-04-14 16:16:30,055 INFO L290 TraceCheckUtils]: 57: Hoare triple {136828#(< ~counter~0 84)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136803#(< ~counter~0 85)} is VALID [2022-04-14 16:16:30,055 INFO L290 TraceCheckUtils]: 56: Hoare triple {136828#(< ~counter~0 84)} assume !!(0 != ~r~0); {136828#(< ~counter~0 84)} is VALID [2022-04-14 16:16:30,056 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {135802#true} {136828#(< ~counter~0 84)} #94#return; {136828#(< ~counter~0 84)} is VALID [2022-04-14 16:16:30,056 INFO L290 TraceCheckUtils]: 54: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,056 INFO L290 TraceCheckUtils]: 53: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,056 INFO L272 TraceCheckUtils]: 51: Hoare triple {136828#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {136828#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {136828#(< ~counter~0 84)} is VALID [2022-04-14 16:16:30,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {136853#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {136828#(< ~counter~0 84)} is VALID [2022-04-14 16:16:30,057 INFO L290 TraceCheckUtils]: 48: Hoare triple {136853#(< ~counter~0 83)} assume !(~r~0 < 0); {136853#(< ~counter~0 83)} is VALID [2022-04-14 16:16:30,058 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {135802#true} {136853#(< ~counter~0 83)} #98#return; {136853#(< ~counter~0 83)} is VALID [2022-04-14 16:16:30,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,058 INFO L290 TraceCheckUtils]: 45: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,058 INFO L272 TraceCheckUtils]: 43: Hoare triple {136853#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {136853#(< ~counter~0 83)} assume !!(#t~post8 < 100);havoc #t~post8; {136853#(< ~counter~0 83)} is VALID [2022-04-14 16:16:30,059 INFO L290 TraceCheckUtils]: 41: Hoare triple {136878#(< ~counter~0 82)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136853#(< ~counter~0 83)} is VALID [2022-04-14 16:16:30,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {136878#(< ~counter~0 82)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {136878#(< ~counter~0 82)} is VALID [2022-04-14 16:16:30,060 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {135802#true} {136878#(< ~counter~0 82)} #98#return; {136878#(< ~counter~0 82)} is VALID [2022-04-14 16:16:30,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,060 INFO L272 TraceCheckUtils]: 35: Hoare triple {136878#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {136878#(< ~counter~0 82)} assume !!(#t~post8 < 100);havoc #t~post8; {136878#(< ~counter~0 82)} is VALID [2022-04-14 16:16:30,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {136903#(< ~counter~0 81)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136878#(< ~counter~0 82)} is VALID [2022-04-14 16:16:30,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {136903#(< ~counter~0 81)} assume !(~r~0 > 0); {136903#(< ~counter~0 81)} is VALID [2022-04-14 16:16:30,062 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {135802#true} {136903#(< ~counter~0 81)} #96#return; {136903#(< ~counter~0 81)} is VALID [2022-04-14 16:16:30,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,062 INFO L272 TraceCheckUtils]: 27: Hoare triple {136903#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {136903#(< ~counter~0 81)} assume !!(#t~post7 < 100);havoc #t~post7; {136903#(< ~counter~0 81)} is VALID [2022-04-14 16:16:30,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {136928#(< ~counter~0 80)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136903#(< ~counter~0 81)} is VALID [2022-04-14 16:16:30,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {136928#(< ~counter~0 80)} assume !!(0 != ~r~0); {136928#(< ~counter~0 80)} is VALID [2022-04-14 16:16:30,065 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {135802#true} {136928#(< ~counter~0 80)} #94#return; {136928#(< ~counter~0 80)} is VALID [2022-04-14 16:16:30,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,065 INFO L272 TraceCheckUtils]: 19: Hoare triple {136928#(< ~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)); {135802#true} is VALID [2022-04-14 16:16:30,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {136928#(< ~counter~0 80)} assume !!(#t~post6 < 100);havoc #t~post6; {136928#(< ~counter~0 80)} is VALID [2022-04-14 16:16:30,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {136953#(< ~counter~0 79)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {136928#(< ~counter~0 80)} is VALID [2022-04-14 16:16:30,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {136953#(< ~counter~0 79)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {136953#(< ~counter~0 79)} is VALID [2022-04-14 16:16:30,067 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {135802#true} {136953#(< ~counter~0 79)} #92#return; {136953#(< ~counter~0 79)} is VALID [2022-04-14 16:16:30,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,067 INFO L272 TraceCheckUtils]: 11: Hoare triple {136953#(< ~counter~0 79)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {135802#true} is VALID [2022-04-14 16:16:30,067 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {135802#true} {136953#(< ~counter~0 79)} #90#return; {136953#(< ~counter~0 79)} is VALID [2022-04-14 16:16:30,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-14 16:16:30,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-14 16:16:30,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-14 16:16:30,068 INFO L272 TraceCheckUtils]: 6: Hoare triple {136953#(< ~counter~0 79)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {135802#true} is VALID [2022-04-14 16:16:30,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {136953#(< ~counter~0 79)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {136953#(< ~counter~0 79)} is VALID [2022-04-14 16:16:30,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {136953#(< ~counter~0 79)} call #t~ret9 := main(); {136953#(< ~counter~0 79)} is VALID [2022-04-14 16:16:30,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136953#(< ~counter~0 79)} {135802#true} #102#return; {136953#(< ~counter~0 79)} is VALID [2022-04-14 16:16:30,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {136953#(< ~counter~0 79)} assume true; {136953#(< ~counter~0 79)} is VALID [2022-04-14 16:16:30,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {135802#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {136953#(< ~counter~0 79)} is VALID [2022-04-14 16:16:30,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {135802#true} call ULTIMATE.init(); {135802#true} is VALID [2022-04-14 16:16:30,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1196 backedges. 50 proven. 302 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2022-04-14 16:16:30,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:30,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355288847] [2022-04-14 16:16:30,070 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:30,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050612971] [2022-04-14 16:16:30,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050612971] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:16:30,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:16:30,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2022-04-14 16:16:30,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415426805] [2022-04-14 16:16:30,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:16:30,071 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) Word has length 193 [2022-04-14 16:16:30,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:30,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) [2022-04-14 16:16:30,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:30,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-14 16:16:30,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:30,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-14 16:16:30,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=1216, Unknown=0, NotChecked=0, Total=2256 [2022-04-14 16:16:30,359 INFO L87 Difference]: Start difference. First operand 10003 states and 14249 transitions. Second operand has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) [2022-04-14 16:16:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:56,080 INFO L93 Difference]: Finished difference Result 15294 states and 21970 transitions. [2022-04-14 16:16:56,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-04-14 16:16:56,081 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) Word has length 193 [2022-04-14 16:16:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:16:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) [2022-04-14 16:16:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 1004 transitions. [2022-04-14 16:16:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) [2022-04-14 16:16:56,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 1004 transitions. [2022-04-14 16:16:56,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 1004 transitions. [2022-04-14 16:16:56,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1004 edges. 1004 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:59,248 INFO L225 Difference]: With dead ends: 15294 [2022-04-14 16:16:59,248 INFO L226 Difference]: Without dead ends: 7867 [2022-04-14 16:16:59,261 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2864, Invalid=4968, Unknown=0, NotChecked=0, Total=7832 [2022-04-14 16:16:59,261 INFO L913 BasicCegarLoop]: 159 mSDtfsCounter, 1682 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 982 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1682 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 982 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-14 16:16:59,262 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1682 Valid, 850 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [982 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-14 16:16:59,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7867 states. [2022-04-14 16:17:10,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7867 to 7640. [2022-04-14 16:17:10,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:17:10,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7867 states. Second operand has 7640 states, 5728 states have (on average 1.1784217877094971) internal successors, (6750), 5772 states have internal predecessors, (6750), 1825 states have call successors, (1825), 88 states have call predecessors, (1825), 86 states have return successors, (1823), 1779 states have call predecessors, (1823), 1823 states have call successors, (1823) [2022-04-14 16:17:10,623 INFO L74 IsIncluded]: Start isIncluded. First operand 7867 states. Second operand has 7640 states, 5728 states have (on average 1.1784217877094971) internal successors, (6750), 5772 states have internal predecessors, (6750), 1825 states have call successors, (1825), 88 states have call predecessors, (1825), 86 states have return successors, (1823), 1779 states have call predecessors, (1823), 1823 states have call successors, (1823) [2022-04-14 16:17:10,627 INFO L87 Difference]: Start difference. First operand 7867 states. Second operand has 7640 states, 5728 states have (on average 1.1784217877094971) internal successors, (6750), 5772 states have internal predecessors, (6750), 1825 states have call successors, (1825), 88 states have call predecessors, (1825), 86 states have return successors, (1823), 1779 states have call predecessors, (1823), 1823 states have call successors, (1823) [2022-04-14 16:17:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:12,336 INFO L93 Difference]: Finished difference Result 7867 states and 10604 transitions. [2022-04-14 16:17:12,336 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 10604 transitions. [2022-04-14 16:17:12,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:12,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:12,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 7640 states, 5728 states have (on average 1.1784217877094971) internal successors, (6750), 5772 states have internal predecessors, (6750), 1825 states have call successors, (1825), 88 states have call predecessors, (1825), 86 states have return successors, (1823), 1779 states have call predecessors, (1823), 1823 states have call successors, (1823) Second operand 7867 states. [2022-04-14 16:17:12,362 INFO L87 Difference]: Start difference. First operand has 7640 states, 5728 states have (on average 1.1784217877094971) internal successors, (6750), 5772 states have internal predecessors, (6750), 1825 states have call successors, (1825), 88 states have call predecessors, (1825), 86 states have return successors, (1823), 1779 states have call predecessors, (1823), 1823 states have call successors, (1823) Second operand 7867 states. [2022-04-14 16:17:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:14,117 INFO L93 Difference]: Finished difference Result 7867 states and 10604 transitions. [2022-04-14 16:17:14,117 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 10604 transitions. [2022-04-14 16:17:14,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:14,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:14,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:17:14,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:17:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7640 states, 5728 states have (on average 1.1784217877094971) internal successors, (6750), 5772 states have internal predecessors, (6750), 1825 states have call successors, (1825), 88 states have call predecessors, (1825), 86 states have return successors, (1823), 1779 states have call predecessors, (1823), 1823 states have call successors, (1823) [2022-04-14 16:17:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7640 states to 7640 states and 10398 transitions. [2022-04-14 16:17:16,269 INFO L78 Accepts]: Start accepts. Automaton has 7640 states and 10398 transitions. Word has length 193 [2022-04-14 16:17:16,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:17:16,269 INFO L478 AbstractCegarLoop]: Abstraction has 7640 states and 10398 transitions. [2022-04-14 16:17:16,269 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) [2022-04-14 16:17:16,269 INFO L276 IsEmpty]: Start isEmpty. Operand 7640 states and 10398 transitions. [2022-04-14 16:17:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-04-14 16:17:16,275 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:17:16,275 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 10, 10, 10, 10, 8, 8, 8, 8, 6, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:17:16,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-14 16:17:16,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:17:16,475 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:17:16,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:17:16,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1172412185, now seen corresponding path program 2 times [2022-04-14 16:17:16,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:17:16,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460594140] [2022-04-14 16:17:16,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:17:16,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:17:16,505 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:17:16,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1673721024] [2022-04-14 16:17:16,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 16:17:16,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:17:16,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:17:16,506 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:17:16,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-14 16:17:16,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 16:17:16,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:17:16,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-14 16:17:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:17:16,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:17:17,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {185034#true} call ULTIMATE.init(); {185034#true} is VALID [2022-04-14 16:17:17,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {185034#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {185042#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:17,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {185042#(<= ~counter~0 0)} assume true; {185042#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:17,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185042#(<= ~counter~0 0)} {185034#true} #102#return; {185042#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:17,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {185042#(<= ~counter~0 0)} call #t~ret9 := main(); {185042#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:17,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {185042#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {185042#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:17,645 INFO L272 TraceCheckUtils]: 6: Hoare triple {185042#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {185042#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:17,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {185042#(<= ~counter~0 0)} ~cond := #in~cond; {185042#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:17,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {185042#(<= ~counter~0 0)} assume !(0 == ~cond); {185042#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:17,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {185042#(<= ~counter~0 0)} assume true; {185042#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:17,646 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {185042#(<= ~counter~0 0)} {185042#(<= ~counter~0 0)} #90#return; {185042#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:17,647 INFO L272 TraceCheckUtils]: 11: Hoare triple {185042#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {185042#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:17,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {185042#(<= ~counter~0 0)} ~cond := #in~cond; {185042#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:17,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {185042#(<= ~counter~0 0)} assume !(0 == ~cond); {185042#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:17,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {185042#(<= ~counter~0 0)} assume true; {185042#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:17,648 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {185042#(<= ~counter~0 0)} {185042#(<= ~counter~0 0)} #92#return; {185042#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:17,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {185042#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {185042#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:17,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {185042#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185091#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:17,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {185091#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {185091#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:17,651 INFO L272 TraceCheckUtils]: 19: Hoare triple {185091#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185091#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:17,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {185091#(<= ~counter~0 1)} ~cond := #in~cond; {185091#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:17,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {185091#(<= ~counter~0 1)} assume !(0 == ~cond); {185091#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:17,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {185091#(<= ~counter~0 1)} assume true; {185091#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:17,652 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {185091#(<= ~counter~0 1)} {185091#(<= ~counter~0 1)} #94#return; {185091#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:17,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {185091#(<= ~counter~0 1)} assume !!(0 != ~r~0); {185091#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:17,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {185091#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185116#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:17,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {185116#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {185116#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:17,654 INFO L272 TraceCheckUtils]: 27: Hoare triple {185116#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185116#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:17,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {185116#(<= ~counter~0 2)} ~cond := #in~cond; {185116#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:17,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {185116#(<= ~counter~0 2)} assume !(0 == ~cond); {185116#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:17,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {185116#(<= ~counter~0 2)} assume true; {185116#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:17,655 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {185116#(<= ~counter~0 2)} {185116#(<= ~counter~0 2)} #96#return; {185116#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:17,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {185116#(<= ~counter~0 2)} assume !(~r~0 > 0); {185116#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:17,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {185116#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185141#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:17,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {185141#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {185141#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:17,657 INFO L272 TraceCheckUtils]: 35: Hoare triple {185141#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185141#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:17,657 INFO L290 TraceCheckUtils]: 36: Hoare triple {185141#(<= ~counter~0 3)} ~cond := #in~cond; {185141#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:17,657 INFO L290 TraceCheckUtils]: 37: Hoare triple {185141#(<= ~counter~0 3)} assume !(0 == ~cond); {185141#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:17,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {185141#(<= ~counter~0 3)} assume true; {185141#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:17,658 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {185141#(<= ~counter~0 3)} {185141#(<= ~counter~0 3)} #98#return; {185141#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:17,658 INFO L290 TraceCheckUtils]: 40: Hoare triple {185141#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185141#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:17,659 INFO L290 TraceCheckUtils]: 41: Hoare triple {185141#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185166#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:17,659 INFO L290 TraceCheckUtils]: 42: Hoare triple {185166#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {185166#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:17,660 INFO L272 TraceCheckUtils]: 43: Hoare triple {185166#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185166#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:17,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {185166#(<= ~counter~0 4)} ~cond := #in~cond; {185166#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:17,660 INFO L290 TraceCheckUtils]: 45: Hoare triple {185166#(<= ~counter~0 4)} assume !(0 == ~cond); {185166#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:17,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {185166#(<= ~counter~0 4)} assume true; {185166#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:17,661 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {185166#(<= ~counter~0 4)} {185166#(<= ~counter~0 4)} #98#return; {185166#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:17,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {185166#(<= ~counter~0 4)} assume !(~r~0 < 0); {185166#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:17,662 INFO L290 TraceCheckUtils]: 49: Hoare triple {185166#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185191#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:17,662 INFO L290 TraceCheckUtils]: 50: Hoare triple {185191#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {185191#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:17,663 INFO L272 TraceCheckUtils]: 51: Hoare triple {185191#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185191#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:17,663 INFO L290 TraceCheckUtils]: 52: Hoare triple {185191#(<= ~counter~0 5)} ~cond := #in~cond; {185191#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:17,663 INFO L290 TraceCheckUtils]: 53: Hoare triple {185191#(<= ~counter~0 5)} assume !(0 == ~cond); {185191#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:17,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {185191#(<= ~counter~0 5)} assume true; {185191#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:17,664 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {185191#(<= ~counter~0 5)} {185191#(<= ~counter~0 5)} #94#return; {185191#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:17,664 INFO L290 TraceCheckUtils]: 56: Hoare triple {185191#(<= ~counter~0 5)} assume !!(0 != ~r~0); {185191#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:17,665 INFO L290 TraceCheckUtils]: 57: Hoare triple {185191#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185216#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:17,665 INFO L290 TraceCheckUtils]: 58: Hoare triple {185216#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {185216#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:17,666 INFO L272 TraceCheckUtils]: 59: Hoare triple {185216#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185216#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:17,666 INFO L290 TraceCheckUtils]: 60: Hoare triple {185216#(<= ~counter~0 6)} ~cond := #in~cond; {185216#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:17,666 INFO L290 TraceCheckUtils]: 61: Hoare triple {185216#(<= ~counter~0 6)} assume !(0 == ~cond); {185216#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:17,666 INFO L290 TraceCheckUtils]: 62: Hoare triple {185216#(<= ~counter~0 6)} assume true; {185216#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:17,667 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {185216#(<= ~counter~0 6)} {185216#(<= ~counter~0 6)} #96#return; {185216#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:17,667 INFO L290 TraceCheckUtils]: 64: Hoare triple {185216#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185216#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:17,668 INFO L290 TraceCheckUtils]: 65: Hoare triple {185216#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185241#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:17,668 INFO L290 TraceCheckUtils]: 66: Hoare triple {185241#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {185241#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:17,669 INFO L272 TraceCheckUtils]: 67: Hoare triple {185241#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185241#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:17,669 INFO L290 TraceCheckUtils]: 68: Hoare triple {185241#(<= ~counter~0 7)} ~cond := #in~cond; {185241#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:17,669 INFO L290 TraceCheckUtils]: 69: Hoare triple {185241#(<= ~counter~0 7)} assume !(0 == ~cond); {185241#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:17,669 INFO L290 TraceCheckUtils]: 70: Hoare triple {185241#(<= ~counter~0 7)} assume true; {185241#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:17,670 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {185241#(<= ~counter~0 7)} {185241#(<= ~counter~0 7)} #96#return; {185241#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:17,670 INFO L290 TraceCheckUtils]: 72: Hoare triple {185241#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185241#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:17,671 INFO L290 TraceCheckUtils]: 73: Hoare triple {185241#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185266#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:17,671 INFO L290 TraceCheckUtils]: 74: Hoare triple {185266#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {185266#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:17,672 INFO L272 TraceCheckUtils]: 75: Hoare triple {185266#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185266#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:17,672 INFO L290 TraceCheckUtils]: 76: Hoare triple {185266#(<= ~counter~0 8)} ~cond := #in~cond; {185266#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:17,672 INFO L290 TraceCheckUtils]: 77: Hoare triple {185266#(<= ~counter~0 8)} assume !(0 == ~cond); {185266#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:17,672 INFO L290 TraceCheckUtils]: 78: Hoare triple {185266#(<= ~counter~0 8)} assume true; {185266#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:17,673 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {185266#(<= ~counter~0 8)} {185266#(<= ~counter~0 8)} #96#return; {185266#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:17,673 INFO L290 TraceCheckUtils]: 80: Hoare triple {185266#(<= ~counter~0 8)} assume !(~r~0 > 0); {185266#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:17,674 INFO L290 TraceCheckUtils]: 81: Hoare triple {185266#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185291#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:17,674 INFO L290 TraceCheckUtils]: 82: Hoare triple {185291#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {185291#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:17,675 INFO L272 TraceCheckUtils]: 83: Hoare triple {185291#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185291#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:17,675 INFO L290 TraceCheckUtils]: 84: Hoare triple {185291#(<= ~counter~0 9)} ~cond := #in~cond; {185291#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:17,675 INFO L290 TraceCheckUtils]: 85: Hoare triple {185291#(<= ~counter~0 9)} assume !(0 == ~cond); {185291#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:17,676 INFO L290 TraceCheckUtils]: 86: Hoare triple {185291#(<= ~counter~0 9)} assume true; {185291#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:17,676 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {185291#(<= ~counter~0 9)} {185291#(<= ~counter~0 9)} #98#return; {185291#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:17,676 INFO L290 TraceCheckUtils]: 88: Hoare triple {185291#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185291#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:17,677 INFO L290 TraceCheckUtils]: 89: Hoare triple {185291#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185316#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:17,677 INFO L290 TraceCheckUtils]: 90: Hoare triple {185316#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {185316#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:17,678 INFO L272 TraceCheckUtils]: 91: Hoare triple {185316#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185316#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:17,678 INFO L290 TraceCheckUtils]: 92: Hoare triple {185316#(<= ~counter~0 10)} ~cond := #in~cond; {185316#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:17,678 INFO L290 TraceCheckUtils]: 93: Hoare triple {185316#(<= ~counter~0 10)} assume !(0 == ~cond); {185316#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:17,679 INFO L290 TraceCheckUtils]: 94: Hoare triple {185316#(<= ~counter~0 10)} assume true; {185316#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:17,679 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {185316#(<= ~counter~0 10)} {185316#(<= ~counter~0 10)} #98#return; {185316#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:17,679 INFO L290 TraceCheckUtils]: 96: Hoare triple {185316#(<= ~counter~0 10)} assume !(~r~0 < 0); {185316#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:17,680 INFO L290 TraceCheckUtils]: 97: Hoare triple {185316#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185341#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:17,680 INFO L290 TraceCheckUtils]: 98: Hoare triple {185341#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {185341#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:17,681 INFO L272 TraceCheckUtils]: 99: Hoare triple {185341#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185341#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:17,681 INFO L290 TraceCheckUtils]: 100: Hoare triple {185341#(<= ~counter~0 11)} ~cond := #in~cond; {185341#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:17,681 INFO L290 TraceCheckUtils]: 101: Hoare triple {185341#(<= ~counter~0 11)} assume !(0 == ~cond); {185341#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:17,682 INFO L290 TraceCheckUtils]: 102: Hoare triple {185341#(<= ~counter~0 11)} assume true; {185341#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:17,682 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {185341#(<= ~counter~0 11)} {185341#(<= ~counter~0 11)} #94#return; {185341#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:17,682 INFO L290 TraceCheckUtils]: 104: Hoare triple {185341#(<= ~counter~0 11)} assume !!(0 != ~r~0); {185341#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:17,683 INFO L290 TraceCheckUtils]: 105: Hoare triple {185341#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185366#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:17,683 INFO L290 TraceCheckUtils]: 106: Hoare triple {185366#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {185366#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:17,684 INFO L272 TraceCheckUtils]: 107: Hoare triple {185366#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185366#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:17,695 INFO L290 TraceCheckUtils]: 108: Hoare triple {185366#(<= ~counter~0 12)} ~cond := #in~cond; {185366#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:17,695 INFO L290 TraceCheckUtils]: 109: Hoare triple {185366#(<= ~counter~0 12)} assume !(0 == ~cond); {185366#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:17,696 INFO L290 TraceCheckUtils]: 110: Hoare triple {185366#(<= ~counter~0 12)} assume true; {185366#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:17,696 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {185366#(<= ~counter~0 12)} {185366#(<= ~counter~0 12)} #96#return; {185366#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:17,696 INFO L290 TraceCheckUtils]: 112: Hoare triple {185366#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185366#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:17,698 INFO L290 TraceCheckUtils]: 113: Hoare triple {185366#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185391#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:17,699 INFO L290 TraceCheckUtils]: 114: Hoare triple {185391#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {185391#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:17,699 INFO L272 TraceCheckUtils]: 115: Hoare triple {185391#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185391#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:17,699 INFO L290 TraceCheckUtils]: 116: Hoare triple {185391#(<= ~counter~0 13)} ~cond := #in~cond; {185391#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:17,700 INFO L290 TraceCheckUtils]: 117: Hoare triple {185391#(<= ~counter~0 13)} assume !(0 == ~cond); {185391#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:17,700 INFO L290 TraceCheckUtils]: 118: Hoare triple {185391#(<= ~counter~0 13)} assume true; {185391#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:17,700 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {185391#(<= ~counter~0 13)} {185391#(<= ~counter~0 13)} #96#return; {185391#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:17,701 INFO L290 TraceCheckUtils]: 120: Hoare triple {185391#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185391#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:17,702 INFO L290 TraceCheckUtils]: 121: Hoare triple {185391#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185416#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:17,702 INFO L290 TraceCheckUtils]: 122: Hoare triple {185416#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {185416#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:17,703 INFO L272 TraceCheckUtils]: 123: Hoare triple {185416#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185416#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:17,703 INFO L290 TraceCheckUtils]: 124: Hoare triple {185416#(<= ~counter~0 14)} ~cond := #in~cond; {185416#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:17,703 INFO L290 TraceCheckUtils]: 125: Hoare triple {185416#(<= ~counter~0 14)} assume !(0 == ~cond); {185416#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:17,703 INFO L290 TraceCheckUtils]: 126: Hoare triple {185416#(<= ~counter~0 14)} assume true; {185416#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:17,704 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {185416#(<= ~counter~0 14)} {185416#(<= ~counter~0 14)} #96#return; {185416#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:17,704 INFO L290 TraceCheckUtils]: 128: Hoare triple {185416#(<= ~counter~0 14)} assume !(~r~0 > 0); {185416#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:17,705 INFO L290 TraceCheckUtils]: 129: Hoare triple {185416#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185441#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:17,706 INFO L290 TraceCheckUtils]: 130: Hoare triple {185441#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {185441#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:17,706 INFO L272 TraceCheckUtils]: 131: Hoare triple {185441#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185441#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:17,706 INFO L290 TraceCheckUtils]: 132: Hoare triple {185441#(<= ~counter~0 15)} ~cond := #in~cond; {185441#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:17,707 INFO L290 TraceCheckUtils]: 133: Hoare triple {185441#(<= ~counter~0 15)} assume !(0 == ~cond); {185441#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:17,707 INFO L290 TraceCheckUtils]: 134: Hoare triple {185441#(<= ~counter~0 15)} assume true; {185441#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:17,707 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {185441#(<= ~counter~0 15)} {185441#(<= ~counter~0 15)} #98#return; {185441#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:17,708 INFO L290 TraceCheckUtils]: 136: Hoare triple {185441#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185441#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:17,709 INFO L290 TraceCheckUtils]: 137: Hoare triple {185441#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185466#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:17,709 INFO L290 TraceCheckUtils]: 138: Hoare triple {185466#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {185466#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:17,710 INFO L272 TraceCheckUtils]: 139: Hoare triple {185466#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185466#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:17,710 INFO L290 TraceCheckUtils]: 140: Hoare triple {185466#(<= ~counter~0 16)} ~cond := #in~cond; {185466#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:17,710 INFO L290 TraceCheckUtils]: 141: Hoare triple {185466#(<= ~counter~0 16)} assume !(0 == ~cond); {185466#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:17,710 INFO L290 TraceCheckUtils]: 142: Hoare triple {185466#(<= ~counter~0 16)} assume true; {185466#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:17,711 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {185466#(<= ~counter~0 16)} {185466#(<= ~counter~0 16)} #98#return; {185466#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:17,711 INFO L290 TraceCheckUtils]: 144: Hoare triple {185466#(<= ~counter~0 16)} assume !(~r~0 < 0); {185466#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:17,712 INFO L290 TraceCheckUtils]: 145: Hoare triple {185466#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185491#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:17,712 INFO L290 TraceCheckUtils]: 146: Hoare triple {185491#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {185491#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:17,713 INFO L272 TraceCheckUtils]: 147: Hoare triple {185491#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185491#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:17,713 INFO L290 TraceCheckUtils]: 148: Hoare triple {185491#(<= ~counter~0 17)} ~cond := #in~cond; {185491#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:17,713 INFO L290 TraceCheckUtils]: 149: Hoare triple {185491#(<= ~counter~0 17)} assume !(0 == ~cond); {185491#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:17,713 INFO L290 TraceCheckUtils]: 150: Hoare triple {185491#(<= ~counter~0 17)} assume true; {185491#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:17,714 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {185491#(<= ~counter~0 17)} {185491#(<= ~counter~0 17)} #94#return; {185491#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:17,714 INFO L290 TraceCheckUtils]: 152: Hoare triple {185491#(<= ~counter~0 17)} assume !!(0 != ~r~0); {185491#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:17,715 INFO L290 TraceCheckUtils]: 153: Hoare triple {185491#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185516#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:17,715 INFO L290 TraceCheckUtils]: 154: Hoare triple {185516#(<= ~counter~0 18)} assume !!(#t~post7 < 100);havoc #t~post7; {185516#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:17,716 INFO L272 TraceCheckUtils]: 155: Hoare triple {185516#(<= ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185516#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:17,716 INFO L290 TraceCheckUtils]: 156: Hoare triple {185516#(<= ~counter~0 18)} ~cond := #in~cond; {185516#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:17,716 INFO L290 TraceCheckUtils]: 157: Hoare triple {185516#(<= ~counter~0 18)} assume !(0 == ~cond); {185516#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:17,717 INFO L290 TraceCheckUtils]: 158: Hoare triple {185516#(<= ~counter~0 18)} assume true; {185516#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:17,717 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {185516#(<= ~counter~0 18)} {185516#(<= ~counter~0 18)} #96#return; {185516#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:17,717 INFO L290 TraceCheckUtils]: 160: Hoare triple {185516#(<= ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185516#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:17,718 INFO L290 TraceCheckUtils]: 161: Hoare triple {185516#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185541#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:17,719 INFO L290 TraceCheckUtils]: 162: Hoare triple {185541#(<= ~counter~0 19)} assume !!(#t~post7 < 100);havoc #t~post7; {185541#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:17,719 INFO L272 TraceCheckUtils]: 163: Hoare triple {185541#(<= ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185541#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:17,719 INFO L290 TraceCheckUtils]: 164: Hoare triple {185541#(<= ~counter~0 19)} ~cond := #in~cond; {185541#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:17,719 INFO L290 TraceCheckUtils]: 165: Hoare triple {185541#(<= ~counter~0 19)} assume !(0 == ~cond); {185541#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:17,720 INFO L290 TraceCheckUtils]: 166: Hoare triple {185541#(<= ~counter~0 19)} assume true; {185541#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:17,720 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {185541#(<= ~counter~0 19)} {185541#(<= ~counter~0 19)} #96#return; {185541#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:17,720 INFO L290 TraceCheckUtils]: 168: Hoare triple {185541#(<= ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185541#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:17,721 INFO L290 TraceCheckUtils]: 169: Hoare triple {185541#(<= ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185566#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:17,721 INFO L290 TraceCheckUtils]: 170: Hoare triple {185566#(<= ~counter~0 20)} assume !!(#t~post7 < 100);havoc #t~post7; {185566#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:17,722 INFO L272 TraceCheckUtils]: 171: Hoare triple {185566#(<= ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185566#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:17,722 INFO L290 TraceCheckUtils]: 172: Hoare triple {185566#(<= ~counter~0 20)} ~cond := #in~cond; {185566#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:17,722 INFO L290 TraceCheckUtils]: 173: Hoare triple {185566#(<= ~counter~0 20)} assume !(0 == ~cond); {185566#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:17,723 INFO L290 TraceCheckUtils]: 174: Hoare triple {185566#(<= ~counter~0 20)} assume true; {185566#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:17,723 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {185566#(<= ~counter~0 20)} {185566#(<= ~counter~0 20)} #96#return; {185566#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:17,723 INFO L290 TraceCheckUtils]: 176: Hoare triple {185566#(<= ~counter~0 20)} assume !(~r~0 > 0); {185566#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:17,724 INFO L290 TraceCheckUtils]: 177: Hoare triple {185566#(<= ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185591#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:17,724 INFO L290 TraceCheckUtils]: 178: Hoare triple {185591#(<= ~counter~0 21)} assume !!(#t~post8 < 100);havoc #t~post8; {185591#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:17,725 INFO L272 TraceCheckUtils]: 179: Hoare triple {185591#(<= ~counter~0 21)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185591#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:17,725 INFO L290 TraceCheckUtils]: 180: Hoare triple {185591#(<= ~counter~0 21)} ~cond := #in~cond; {185591#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:17,725 INFO L290 TraceCheckUtils]: 181: Hoare triple {185591#(<= ~counter~0 21)} assume !(0 == ~cond); {185591#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:17,726 INFO L290 TraceCheckUtils]: 182: Hoare triple {185591#(<= ~counter~0 21)} assume true; {185591#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:17,726 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {185591#(<= ~counter~0 21)} {185591#(<= ~counter~0 21)} #98#return; {185591#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:17,726 INFO L290 TraceCheckUtils]: 184: Hoare triple {185591#(<= ~counter~0 21)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185591#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:17,727 INFO L290 TraceCheckUtils]: 185: Hoare triple {185591#(<= ~counter~0 21)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185616#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:17,727 INFO L290 TraceCheckUtils]: 186: Hoare triple {185616#(<= ~counter~0 22)} assume !!(#t~post8 < 100);havoc #t~post8; {185616#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:17,728 INFO L272 TraceCheckUtils]: 187: Hoare triple {185616#(<= ~counter~0 22)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185616#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:17,728 INFO L290 TraceCheckUtils]: 188: Hoare triple {185616#(<= ~counter~0 22)} ~cond := #in~cond; {185616#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:17,728 INFO L290 TraceCheckUtils]: 189: Hoare triple {185616#(<= ~counter~0 22)} assume !(0 == ~cond); {185616#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:17,728 INFO L290 TraceCheckUtils]: 190: Hoare triple {185616#(<= ~counter~0 22)} assume true; {185616#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:17,729 INFO L284 TraceCheckUtils]: 191: Hoare quadruple {185616#(<= ~counter~0 22)} {185616#(<= ~counter~0 22)} #98#return; {185616#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:17,729 INFO L290 TraceCheckUtils]: 192: Hoare triple {185616#(<= ~counter~0 22)} assume !(~r~0 < 0); {185616#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:17,729 INFO L290 TraceCheckUtils]: 193: Hoare triple {185616#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185641#(<= |main_#t~post6| 22)} is VALID [2022-04-14 16:17:17,730 INFO L290 TraceCheckUtils]: 194: Hoare triple {185641#(<= |main_#t~post6| 22)} assume !(#t~post6 < 100);havoc #t~post6; {185035#false} is VALID [2022-04-14 16:17:17,730 INFO L272 TraceCheckUtils]: 195: Hoare triple {185035#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185035#false} is VALID [2022-04-14 16:17:17,730 INFO L290 TraceCheckUtils]: 196: Hoare triple {185035#false} ~cond := #in~cond; {185035#false} is VALID [2022-04-14 16:17:17,730 INFO L290 TraceCheckUtils]: 197: Hoare triple {185035#false} assume 0 == ~cond; {185035#false} is VALID [2022-04-14 16:17:17,730 INFO L290 TraceCheckUtils]: 198: Hoare triple {185035#false} assume !false; {185035#false} is VALID [2022-04-14 16:17:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 44 proven. 1248 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:17:17,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:17:19,028 INFO L290 TraceCheckUtils]: 198: Hoare triple {185035#false} assume !false; {185035#false} is VALID [2022-04-14 16:17:19,028 INFO L290 TraceCheckUtils]: 197: Hoare triple {185035#false} assume 0 == ~cond; {185035#false} is VALID [2022-04-14 16:17:19,028 INFO L290 TraceCheckUtils]: 196: Hoare triple {185035#false} ~cond := #in~cond; {185035#false} is VALID [2022-04-14 16:17:19,028 INFO L272 TraceCheckUtils]: 195: Hoare triple {185035#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185035#false} is VALID [2022-04-14 16:17:19,028 INFO L290 TraceCheckUtils]: 194: Hoare triple {185669#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {185035#false} is VALID [2022-04-14 16:17:19,029 INFO L290 TraceCheckUtils]: 193: Hoare triple {185673#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185669#(< |main_#t~post6| 100)} is VALID [2022-04-14 16:17:19,029 INFO L290 TraceCheckUtils]: 192: Hoare triple {185673#(< ~counter~0 100)} assume !(~r~0 < 0); {185673#(< ~counter~0 100)} is VALID [2022-04-14 16:17:19,029 INFO L284 TraceCheckUtils]: 191: Hoare quadruple {185034#true} {185673#(< ~counter~0 100)} #98#return; {185673#(< ~counter~0 100)} is VALID [2022-04-14 16:17:19,029 INFO L290 TraceCheckUtils]: 190: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,029 INFO L290 TraceCheckUtils]: 189: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,029 INFO L290 TraceCheckUtils]: 188: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,030 INFO L272 TraceCheckUtils]: 187: Hoare triple {185673#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,030 INFO L290 TraceCheckUtils]: 186: Hoare triple {185673#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {185673#(< ~counter~0 100)} is VALID [2022-04-14 16:17:19,032 INFO L290 TraceCheckUtils]: 185: Hoare triple {185698#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185673#(< ~counter~0 100)} is VALID [2022-04-14 16:17:19,032 INFO L290 TraceCheckUtils]: 184: Hoare triple {185698#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185698#(< ~counter~0 99)} is VALID [2022-04-14 16:17:19,032 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {185034#true} {185698#(< ~counter~0 99)} #98#return; {185698#(< ~counter~0 99)} is VALID [2022-04-14 16:17:19,032 INFO L290 TraceCheckUtils]: 182: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,032 INFO L290 TraceCheckUtils]: 181: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,032 INFO L290 TraceCheckUtils]: 180: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,032 INFO L272 TraceCheckUtils]: 179: Hoare triple {185698#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,033 INFO L290 TraceCheckUtils]: 178: Hoare triple {185698#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {185698#(< ~counter~0 99)} is VALID [2022-04-14 16:17:19,033 INFO L290 TraceCheckUtils]: 177: Hoare triple {185723#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185698#(< ~counter~0 99)} is VALID [2022-04-14 16:17:19,034 INFO L290 TraceCheckUtils]: 176: Hoare triple {185723#(< ~counter~0 98)} assume !(~r~0 > 0); {185723#(< ~counter~0 98)} is VALID [2022-04-14 16:17:19,034 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {185034#true} {185723#(< ~counter~0 98)} #96#return; {185723#(< ~counter~0 98)} is VALID [2022-04-14 16:17:19,034 INFO L290 TraceCheckUtils]: 174: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,034 INFO L290 TraceCheckUtils]: 173: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,034 INFO L290 TraceCheckUtils]: 172: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,034 INFO L272 TraceCheckUtils]: 171: Hoare triple {185723#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,035 INFO L290 TraceCheckUtils]: 170: Hoare triple {185723#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {185723#(< ~counter~0 98)} is VALID [2022-04-14 16:17:19,035 INFO L290 TraceCheckUtils]: 169: Hoare triple {185748#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185723#(< ~counter~0 98)} is VALID [2022-04-14 16:17:19,036 INFO L290 TraceCheckUtils]: 168: Hoare triple {185748#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185748#(< ~counter~0 97)} is VALID [2022-04-14 16:17:19,036 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {185034#true} {185748#(< ~counter~0 97)} #96#return; {185748#(< ~counter~0 97)} is VALID [2022-04-14 16:17:19,036 INFO L290 TraceCheckUtils]: 166: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,036 INFO L290 TraceCheckUtils]: 165: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,036 INFO L290 TraceCheckUtils]: 164: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,036 INFO L272 TraceCheckUtils]: 163: Hoare triple {185748#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,037 INFO L290 TraceCheckUtils]: 162: Hoare triple {185748#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {185748#(< ~counter~0 97)} is VALID [2022-04-14 16:17:19,037 INFO L290 TraceCheckUtils]: 161: Hoare triple {185773#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185748#(< ~counter~0 97)} is VALID [2022-04-14 16:17:19,038 INFO L290 TraceCheckUtils]: 160: Hoare triple {185773#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185773#(< ~counter~0 96)} is VALID [2022-04-14 16:17:19,038 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {185034#true} {185773#(< ~counter~0 96)} #96#return; {185773#(< ~counter~0 96)} is VALID [2022-04-14 16:17:19,038 INFO L290 TraceCheckUtils]: 158: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,038 INFO L290 TraceCheckUtils]: 157: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,038 INFO L290 TraceCheckUtils]: 156: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,038 INFO L272 TraceCheckUtils]: 155: Hoare triple {185773#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,039 INFO L290 TraceCheckUtils]: 154: Hoare triple {185773#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {185773#(< ~counter~0 96)} is VALID [2022-04-14 16:17:19,039 INFO L290 TraceCheckUtils]: 153: Hoare triple {185798#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185773#(< ~counter~0 96)} is VALID [2022-04-14 16:17:19,040 INFO L290 TraceCheckUtils]: 152: Hoare triple {185798#(< ~counter~0 95)} assume !!(0 != ~r~0); {185798#(< ~counter~0 95)} is VALID [2022-04-14 16:17:19,040 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {185034#true} {185798#(< ~counter~0 95)} #94#return; {185798#(< ~counter~0 95)} is VALID [2022-04-14 16:17:19,040 INFO L290 TraceCheckUtils]: 150: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,040 INFO L290 TraceCheckUtils]: 149: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,040 INFO L290 TraceCheckUtils]: 148: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,040 INFO L272 TraceCheckUtils]: 147: Hoare triple {185798#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,040 INFO L290 TraceCheckUtils]: 146: Hoare triple {185798#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {185798#(< ~counter~0 95)} is VALID [2022-04-14 16:17:19,041 INFO L290 TraceCheckUtils]: 145: Hoare triple {185823#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185798#(< ~counter~0 95)} is VALID [2022-04-14 16:17:19,042 INFO L290 TraceCheckUtils]: 144: Hoare triple {185823#(< ~counter~0 94)} assume !(~r~0 < 0); {185823#(< ~counter~0 94)} is VALID [2022-04-14 16:17:19,042 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {185034#true} {185823#(< ~counter~0 94)} #98#return; {185823#(< ~counter~0 94)} is VALID [2022-04-14 16:17:19,042 INFO L290 TraceCheckUtils]: 142: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,042 INFO L290 TraceCheckUtils]: 141: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,042 INFO L290 TraceCheckUtils]: 140: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,042 INFO L272 TraceCheckUtils]: 139: Hoare triple {185823#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,042 INFO L290 TraceCheckUtils]: 138: Hoare triple {185823#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {185823#(< ~counter~0 94)} is VALID [2022-04-14 16:17:19,043 INFO L290 TraceCheckUtils]: 137: Hoare triple {185848#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185823#(< ~counter~0 94)} is VALID [2022-04-14 16:17:19,043 INFO L290 TraceCheckUtils]: 136: Hoare triple {185848#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185848#(< ~counter~0 93)} is VALID [2022-04-14 16:17:19,044 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {185034#true} {185848#(< ~counter~0 93)} #98#return; {185848#(< ~counter~0 93)} is VALID [2022-04-14 16:17:19,044 INFO L290 TraceCheckUtils]: 134: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,044 INFO L290 TraceCheckUtils]: 133: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,044 INFO L290 TraceCheckUtils]: 132: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,044 INFO L272 TraceCheckUtils]: 131: Hoare triple {185848#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,044 INFO L290 TraceCheckUtils]: 130: Hoare triple {185848#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {185848#(< ~counter~0 93)} is VALID [2022-04-14 16:17:19,045 INFO L290 TraceCheckUtils]: 129: Hoare triple {185873#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185848#(< ~counter~0 93)} is VALID [2022-04-14 16:17:19,045 INFO L290 TraceCheckUtils]: 128: Hoare triple {185873#(< ~counter~0 92)} assume !(~r~0 > 0); {185873#(< ~counter~0 92)} is VALID [2022-04-14 16:17:19,046 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {185034#true} {185873#(< ~counter~0 92)} #96#return; {185873#(< ~counter~0 92)} is VALID [2022-04-14 16:17:19,046 INFO L290 TraceCheckUtils]: 126: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,046 INFO L290 TraceCheckUtils]: 125: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,046 INFO L290 TraceCheckUtils]: 124: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,046 INFO L272 TraceCheckUtils]: 123: Hoare triple {185873#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,046 INFO L290 TraceCheckUtils]: 122: Hoare triple {185873#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {185873#(< ~counter~0 92)} is VALID [2022-04-14 16:17:19,047 INFO L290 TraceCheckUtils]: 121: Hoare triple {185898#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185873#(< ~counter~0 92)} is VALID [2022-04-14 16:17:19,047 INFO L290 TraceCheckUtils]: 120: Hoare triple {185898#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185898#(< ~counter~0 91)} is VALID [2022-04-14 16:17:19,048 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {185034#true} {185898#(< ~counter~0 91)} #96#return; {185898#(< ~counter~0 91)} is VALID [2022-04-14 16:17:19,048 INFO L290 TraceCheckUtils]: 118: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,048 INFO L290 TraceCheckUtils]: 117: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,048 INFO L290 TraceCheckUtils]: 116: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,048 INFO L272 TraceCheckUtils]: 115: Hoare triple {185898#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,048 INFO L290 TraceCheckUtils]: 114: Hoare triple {185898#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {185898#(< ~counter~0 91)} is VALID [2022-04-14 16:17:19,049 INFO L290 TraceCheckUtils]: 113: Hoare triple {185923#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185898#(< ~counter~0 91)} is VALID [2022-04-14 16:17:19,049 INFO L290 TraceCheckUtils]: 112: Hoare triple {185923#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185923#(< ~counter~0 90)} is VALID [2022-04-14 16:17:19,050 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {185034#true} {185923#(< ~counter~0 90)} #96#return; {185923#(< ~counter~0 90)} is VALID [2022-04-14 16:17:19,050 INFO L290 TraceCheckUtils]: 110: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,050 INFO L290 TraceCheckUtils]: 109: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,050 INFO L290 TraceCheckUtils]: 108: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,050 INFO L272 TraceCheckUtils]: 107: Hoare triple {185923#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,050 INFO L290 TraceCheckUtils]: 106: Hoare triple {185923#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {185923#(< ~counter~0 90)} is VALID [2022-04-14 16:17:19,051 INFO L290 TraceCheckUtils]: 105: Hoare triple {185948#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185923#(< ~counter~0 90)} is VALID [2022-04-14 16:17:19,052 INFO L290 TraceCheckUtils]: 104: Hoare triple {185948#(< ~counter~0 89)} assume !!(0 != ~r~0); {185948#(< ~counter~0 89)} is VALID [2022-04-14 16:17:19,052 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {185034#true} {185948#(< ~counter~0 89)} #94#return; {185948#(< ~counter~0 89)} is VALID [2022-04-14 16:17:19,052 INFO L290 TraceCheckUtils]: 102: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,052 INFO L290 TraceCheckUtils]: 101: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,052 INFO L290 TraceCheckUtils]: 100: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,052 INFO L272 TraceCheckUtils]: 99: Hoare triple {185948#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,053 INFO L290 TraceCheckUtils]: 98: Hoare triple {185948#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {185948#(< ~counter~0 89)} is VALID [2022-04-14 16:17:19,053 INFO L290 TraceCheckUtils]: 97: Hoare triple {185973#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185948#(< ~counter~0 89)} is VALID [2022-04-14 16:17:19,054 INFO L290 TraceCheckUtils]: 96: Hoare triple {185973#(< ~counter~0 88)} assume !(~r~0 < 0); {185973#(< ~counter~0 88)} is VALID [2022-04-14 16:17:19,054 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {185034#true} {185973#(< ~counter~0 88)} #98#return; {185973#(< ~counter~0 88)} is VALID [2022-04-14 16:17:19,054 INFO L290 TraceCheckUtils]: 94: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,054 INFO L290 TraceCheckUtils]: 93: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,054 INFO L290 TraceCheckUtils]: 92: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,054 INFO L272 TraceCheckUtils]: 91: Hoare triple {185973#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,055 INFO L290 TraceCheckUtils]: 90: Hoare triple {185973#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {185973#(< ~counter~0 88)} is VALID [2022-04-14 16:17:19,055 INFO L290 TraceCheckUtils]: 89: Hoare triple {185998#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185973#(< ~counter~0 88)} is VALID [2022-04-14 16:17:19,056 INFO L290 TraceCheckUtils]: 88: Hoare triple {185998#(< ~counter~0 87)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185998#(< ~counter~0 87)} is VALID [2022-04-14 16:17:19,056 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {185034#true} {185998#(< ~counter~0 87)} #98#return; {185998#(< ~counter~0 87)} is VALID [2022-04-14 16:17:19,056 INFO L290 TraceCheckUtils]: 86: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,056 INFO L290 TraceCheckUtils]: 85: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,056 INFO L290 TraceCheckUtils]: 84: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,056 INFO L272 TraceCheckUtils]: 83: Hoare triple {185998#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,057 INFO L290 TraceCheckUtils]: 82: Hoare triple {185998#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {185998#(< ~counter~0 87)} is VALID [2022-04-14 16:17:19,057 INFO L290 TraceCheckUtils]: 81: Hoare triple {186023#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185998#(< ~counter~0 87)} is VALID [2022-04-14 16:17:19,058 INFO L290 TraceCheckUtils]: 80: Hoare triple {186023#(< ~counter~0 86)} assume !(~r~0 > 0); {186023#(< ~counter~0 86)} is VALID [2022-04-14 16:17:19,058 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {185034#true} {186023#(< ~counter~0 86)} #96#return; {186023#(< ~counter~0 86)} is VALID [2022-04-14 16:17:19,058 INFO L290 TraceCheckUtils]: 78: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,058 INFO L290 TraceCheckUtils]: 77: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,058 INFO L290 TraceCheckUtils]: 76: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,058 INFO L272 TraceCheckUtils]: 75: Hoare triple {186023#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,059 INFO L290 TraceCheckUtils]: 74: Hoare triple {186023#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {186023#(< ~counter~0 86)} is VALID [2022-04-14 16:17:19,059 INFO L290 TraceCheckUtils]: 73: Hoare triple {186048#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {186023#(< ~counter~0 86)} is VALID [2022-04-14 16:17:19,060 INFO L290 TraceCheckUtils]: 72: Hoare triple {186048#(< ~counter~0 85)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {186048#(< ~counter~0 85)} is VALID [2022-04-14 16:17:19,060 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {185034#true} {186048#(< ~counter~0 85)} #96#return; {186048#(< ~counter~0 85)} is VALID [2022-04-14 16:17:19,060 INFO L290 TraceCheckUtils]: 70: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,060 INFO L290 TraceCheckUtils]: 69: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,060 INFO L290 TraceCheckUtils]: 68: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,060 INFO L272 TraceCheckUtils]: 67: Hoare triple {186048#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,061 INFO L290 TraceCheckUtils]: 66: Hoare triple {186048#(< ~counter~0 85)} assume !!(#t~post7 < 100);havoc #t~post7; {186048#(< ~counter~0 85)} is VALID [2022-04-14 16:17:19,061 INFO L290 TraceCheckUtils]: 65: Hoare triple {186073#(< ~counter~0 84)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {186048#(< ~counter~0 85)} is VALID [2022-04-14 16:17:19,062 INFO L290 TraceCheckUtils]: 64: Hoare triple {186073#(< ~counter~0 84)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {186073#(< ~counter~0 84)} is VALID [2022-04-14 16:17:19,062 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {185034#true} {186073#(< ~counter~0 84)} #96#return; {186073#(< ~counter~0 84)} is VALID [2022-04-14 16:17:19,062 INFO L290 TraceCheckUtils]: 62: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,062 INFO L290 TraceCheckUtils]: 60: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,062 INFO L272 TraceCheckUtils]: 59: Hoare triple {186073#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,063 INFO L290 TraceCheckUtils]: 58: Hoare triple {186073#(< ~counter~0 84)} assume !!(#t~post7 < 100);havoc #t~post7; {186073#(< ~counter~0 84)} is VALID [2022-04-14 16:17:19,064 INFO L290 TraceCheckUtils]: 57: Hoare triple {186098#(< ~counter~0 83)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {186073#(< ~counter~0 84)} is VALID [2022-04-14 16:17:19,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {186098#(< ~counter~0 83)} assume !!(0 != ~r~0); {186098#(< ~counter~0 83)} is VALID [2022-04-14 16:17:19,064 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {185034#true} {186098#(< ~counter~0 83)} #94#return; {186098#(< ~counter~0 83)} is VALID [2022-04-14 16:17:19,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,065 INFO L290 TraceCheckUtils]: 52: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,065 INFO L272 TraceCheckUtils]: 51: Hoare triple {186098#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {186098#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {186098#(< ~counter~0 83)} is VALID [2022-04-14 16:17:19,066 INFO L290 TraceCheckUtils]: 49: Hoare triple {186123#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {186098#(< ~counter~0 83)} is VALID [2022-04-14 16:17:19,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {186123#(< ~counter~0 82)} assume !(~r~0 < 0); {186123#(< ~counter~0 82)} is VALID [2022-04-14 16:17:19,066 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {185034#true} {186123#(< ~counter~0 82)} #98#return; {186123#(< ~counter~0 82)} is VALID [2022-04-14 16:17:19,066 INFO L290 TraceCheckUtils]: 46: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,067 INFO L272 TraceCheckUtils]: 43: Hoare triple {186123#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {186123#(< ~counter~0 82)} assume !!(#t~post8 < 100);havoc #t~post8; {186123#(< ~counter~0 82)} is VALID [2022-04-14 16:17:19,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {186148#(< ~counter~0 81)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {186123#(< ~counter~0 82)} is VALID [2022-04-14 16:17:19,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {186148#(< ~counter~0 81)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {186148#(< ~counter~0 81)} is VALID [2022-04-14 16:17:19,068 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {185034#true} {186148#(< ~counter~0 81)} #98#return; {186148#(< ~counter~0 81)} is VALID [2022-04-14 16:17:19,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,069 INFO L290 TraceCheckUtils]: 37: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,069 INFO L272 TraceCheckUtils]: 35: Hoare triple {186148#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,069 INFO L290 TraceCheckUtils]: 34: Hoare triple {186148#(< ~counter~0 81)} assume !!(#t~post8 < 100);havoc #t~post8; {186148#(< ~counter~0 81)} is VALID [2022-04-14 16:17:19,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {186173#(< ~counter~0 80)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {186148#(< ~counter~0 81)} is VALID [2022-04-14 16:17:19,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {186173#(< ~counter~0 80)} assume !(~r~0 > 0); {186173#(< ~counter~0 80)} is VALID [2022-04-14 16:17:19,070 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {185034#true} {186173#(< ~counter~0 80)} #96#return; {186173#(< ~counter~0 80)} is VALID [2022-04-14 16:17:19,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,071 INFO L272 TraceCheckUtils]: 27: Hoare triple {186173#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {186173#(< ~counter~0 80)} assume !!(#t~post7 < 100);havoc #t~post7; {186173#(< ~counter~0 80)} is VALID [2022-04-14 16:17:19,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {186198#(< ~counter~0 79)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {186173#(< ~counter~0 80)} is VALID [2022-04-14 16:17:19,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {186198#(< ~counter~0 79)} assume !!(0 != ~r~0); {186198#(< ~counter~0 79)} is VALID [2022-04-14 16:17:19,072 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {185034#true} {186198#(< ~counter~0 79)} #94#return; {186198#(< ~counter~0 79)} is VALID [2022-04-14 16:17:19,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,073 INFO L272 TraceCheckUtils]: 19: Hoare triple {186198#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {186198#(< ~counter~0 79)} assume !!(#t~post6 < 100);havoc #t~post6; {186198#(< ~counter~0 79)} is VALID [2022-04-14 16:17:19,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {186223#(< ~counter~0 78)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {186198#(< ~counter~0 79)} is VALID [2022-04-14 16:17:19,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {186223#(< ~counter~0 78)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {186223#(< ~counter~0 78)} is VALID [2022-04-14 16:17:19,074 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {185034#true} {186223#(< ~counter~0 78)} #92#return; {186223#(< ~counter~0 78)} is VALID [2022-04-14 16:17:19,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,075 INFO L272 TraceCheckUtils]: 11: Hoare triple {186223#(< ~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)); {185034#true} is VALID [2022-04-14 16:17:19,075 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {185034#true} {186223#(< ~counter~0 78)} #90#return; {186223#(< ~counter~0 78)} is VALID [2022-04-14 16:17:19,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-14 16:17:19,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-14 16:17:19,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-14 16:17:19,075 INFO L272 TraceCheckUtils]: 6: Hoare triple {186223#(< ~counter~0 78)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {185034#true} is VALID [2022-04-14 16:17:19,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {186223#(< ~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; {186223#(< ~counter~0 78)} is VALID [2022-04-14 16:17:19,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {186223#(< ~counter~0 78)} call #t~ret9 := main(); {186223#(< ~counter~0 78)} is VALID [2022-04-14 16:17:19,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186223#(< ~counter~0 78)} {185034#true} #102#return; {186223#(< ~counter~0 78)} is VALID [2022-04-14 16:17:19,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {186223#(< ~counter~0 78)} assume true; {186223#(< ~counter~0 78)} is VALID [2022-04-14 16:17:19,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {185034#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {186223#(< ~counter~0 78)} is VALID [2022-04-14 16:17:19,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {185034#true} call ULTIMATE.init(); {185034#true} is VALID [2022-04-14 16:17:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 44 proven. 324 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2022-04-14 16:17:19,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:17:19,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460594140] [2022-04-14 16:17:19,078 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:17:19,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673721024] [2022-04-14 16:17:19,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673721024] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:17:19,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:17:19,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-14 16:17:19,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551180175] [2022-04-14 16:17:19,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:17:19,079 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) Word has length 199 [2022-04-14 16:17:19,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:17:19,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-14 16:17:19,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 324 edges. 324 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:17:19,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-14 16:17:19,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:17:19,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-14 16:17:19,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-14 16:17:19,343 INFO L87 Difference]: Start difference. First operand 7640 states and 10398 transitions. Second operand has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-14 16:17:40,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:40,842 INFO L93 Difference]: Finished difference Result 8259 states and 11295 transitions. [2022-04-14 16:17:40,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-04-14 16:17:40,842 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) Word has length 199 [2022-04-14 16:17:40,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:17:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-14 16:17:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 940 transitions. [2022-04-14 16:17:40,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-14 16:17:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 940 transitions. [2022-04-14 16:17:40,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 940 transitions. [2022-04-14 16:17:41,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 940 edges. 940 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:17:44,058 INFO L225 Difference]: With dead ends: 8259 [2022-04-14 16:17:44,058 INFO L226 Difference]: Without dead ends: 8110 [2022-04-14 16:17:44,061 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3046, Invalid=5326, Unknown=0, NotChecked=0, Total=8372 [2022-04-14 16:17:44,062 INFO L913 BasicCegarLoop]: 165 mSDtfsCounter, 1515 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 1145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1145 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-14 16:17:44,062 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1515 Valid, 986 Invalid, 1856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1145 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-14 16:17:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8110 states. [2022-04-14 16:17:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8110 to 7402. [2022-04-14 16:17:55,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:17:55,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8110 states. Second operand has 7402 states, 5551 states have (on average 1.1185372005044136) internal successors, (6209), 5595 states have internal predecessors, (6209), 1760 states have call successors, (1760), 92 states have call predecessors, (1760), 90 states have return successors, (1758), 1714 states have call predecessors, (1758), 1758 states have call successors, (1758) [2022-04-14 16:17:55,782 INFO L74 IsIncluded]: Start isIncluded. First operand 8110 states. Second operand has 7402 states, 5551 states have (on average 1.1185372005044136) internal successors, (6209), 5595 states have internal predecessors, (6209), 1760 states have call successors, (1760), 92 states have call predecessors, (1760), 90 states have return successors, (1758), 1714 states have call predecessors, (1758), 1758 states have call successors, (1758) [2022-04-14 16:17:55,788 INFO L87 Difference]: Start difference. First operand 8110 states. Second operand has 7402 states, 5551 states have (on average 1.1185372005044136) internal successors, (6209), 5595 states have internal predecessors, (6209), 1760 states have call successors, (1760), 92 states have call predecessors, (1760), 90 states have return successors, (1758), 1714 states have call predecessors, (1758), 1758 states have call successors, (1758) [2022-04-14 16:17:57,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:57,388 INFO L93 Difference]: Finished difference Result 8110 states and 10628 transitions. [2022-04-14 16:17:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 8110 states and 10628 transitions. [2022-04-14 16:17:57,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:57,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:57,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 7402 states, 5551 states have (on average 1.1185372005044136) internal successors, (6209), 5595 states have internal predecessors, (6209), 1760 states have call successors, (1760), 92 states have call predecessors, (1760), 90 states have return successors, (1758), 1714 states have call predecessors, (1758), 1758 states have call successors, (1758) Second operand 8110 states. [2022-04-14 16:17:57,408 INFO L87 Difference]: Start difference. First operand has 7402 states, 5551 states have (on average 1.1185372005044136) internal successors, (6209), 5595 states have internal predecessors, (6209), 1760 states have call successors, (1760), 92 states have call predecessors, (1760), 90 states have return successors, (1758), 1714 states have call predecessors, (1758), 1758 states have call successors, (1758) Second operand 8110 states. [2022-04-14 16:17:59,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:59,227 INFO L93 Difference]: Finished difference Result 8110 states and 10628 transitions. [2022-04-14 16:17:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 8110 states and 10628 transitions. [2022-04-14 16:17:59,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:59,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:59,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:17:59,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:17:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7402 states, 5551 states have (on average 1.1185372005044136) internal successors, (6209), 5595 states have internal predecessors, (6209), 1760 states have call successors, (1760), 92 states have call predecessors, (1760), 90 states have return successors, (1758), 1714 states have call predecessors, (1758), 1758 states have call successors, (1758) [2022-04-14 16:18:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7402 states to 7402 states and 9727 transitions. [2022-04-14 16:18:01,267 INFO L78 Accepts]: Start accepts. Automaton has 7402 states and 9727 transitions. Word has length 199 [2022-04-14 16:18:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:18:01,267 INFO L478 AbstractCegarLoop]: Abstraction has 7402 states and 9727 transitions. [2022-04-14 16:18:01,267 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-14 16:18:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 7402 states and 9727 transitions. [2022-04-14 16:18:01,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2022-04-14 16:18:01,296 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:18:01,296 INFO L499 BasicCegarLoop]: trace histogram [45, 44, 44, 20, 19, 19, 19, 17, 16, 16, 16, 11, 10, 9, 9, 9, 9, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:18:01,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-14 16:18:01,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:18:01,505 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:18:01,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:18:01,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2044709741, now seen corresponding path program 11 times [2022-04-14 16:18:01,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:18:01,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598961829] [2022-04-14 16:18:01,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:18:01,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:18:01,535 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:18:01,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1839496784] [2022-04-14 16:18:01,535 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-14 16:18:01,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:18:01,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:18:01,536 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:18:01,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-14 16:18:01,937 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-04-14 16:18:01,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:18:01,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-14 16:18:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:18:01,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:18:39,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {224552#true} call ULTIMATE.init(); {224552#true} is VALID [2022-04-14 16:18:39,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {224552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {224552#true} is VALID [2022-04-14 16:18:39,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224552#true} {224552#true} #102#return; {224552#true} is VALID [2022-04-14 16:18:39,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {224552#true} call #t~ret9 := main(); {224552#true} is VALID [2022-04-14 16:18:39,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {224552#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L272 TraceCheckUtils]: 6: Hoare triple {224552#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {224552#true} {224552#true} #90#return; {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L272 TraceCheckUtils]: 11: Hoare triple {224552#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {224552#true} {224552#true} #92#return; {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {224552#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {224552#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {224552#true} assume !!(#t~post6 < 100);havoc #t~post6; {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L272 TraceCheckUtils]: 19: Hoare triple {224552#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {224552#true} {224552#true} #94#return; {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {224552#true} assume !!(0 != ~r~0); {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {224552#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {224552#true} assume !!(#t~post7 < 100);havoc #t~post7; {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L272 TraceCheckUtils]: 27: Hoare triple {224552#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {224552#true} {224552#true} #96#return; {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {224552#true} assume !(~r~0 > 0); {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {224552#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {224552#true} assume !!(#t~post8 < 100);havoc #t~post8; {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L272 TraceCheckUtils]: 35: Hoare triple {224552#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {224552#true} {224552#true} #98#return; {224552#true} is VALID [2022-04-14 16:18:39,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {224552#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {224552#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {224552#true} assume !!(#t~post8 < 100);havoc #t~post8; {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L272 TraceCheckUtils]: 43: Hoare triple {224552#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L290 TraceCheckUtils]: 44: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L290 TraceCheckUtils]: 45: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L290 TraceCheckUtils]: 46: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {224552#true} {224552#true} #98#return; {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L290 TraceCheckUtils]: 48: Hoare triple {224552#true} assume !(~r~0 < 0); {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L290 TraceCheckUtils]: 49: Hoare triple {224552#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L290 TraceCheckUtils]: 50: Hoare triple {224552#true} assume !!(#t~post6 < 100);havoc #t~post6; {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L272 TraceCheckUtils]: 51: Hoare triple {224552#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L290 TraceCheckUtils]: 52: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L290 TraceCheckUtils]: 53: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {224552#true} {224552#true} #94#return; {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L290 TraceCheckUtils]: 56: Hoare triple {224552#true} assume !!(0 != ~r~0); {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L290 TraceCheckUtils]: 57: Hoare triple {224552#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {224552#true} is VALID [2022-04-14 16:18:39,952 INFO L290 TraceCheckUtils]: 58: Hoare triple {224552#true} assume !!(#t~post7 < 100);havoc #t~post7; {224552#true} is VALID [2022-04-14 16:18:39,953 INFO L272 TraceCheckUtils]: 59: Hoare triple {224552#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,953 INFO L290 TraceCheckUtils]: 60: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,953 INFO L290 TraceCheckUtils]: 61: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,953 INFO L290 TraceCheckUtils]: 62: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,953 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {224552#true} {224552#true} #96#return; {224552#true} is VALID [2022-04-14 16:18:39,960 INFO L290 TraceCheckUtils]: 64: Hoare triple {224552#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {224749#(< 2 (+ main_~v~0 main_~r~0))} is VALID [2022-04-14 16:18:39,960 INFO L290 TraceCheckUtils]: 65: Hoare triple {224749#(< 2 (+ main_~v~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {224749#(< 2 (+ main_~v~0 main_~r~0))} is VALID [2022-04-14 16:18:39,960 INFO L290 TraceCheckUtils]: 66: Hoare triple {224749#(< 2 (+ main_~v~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {224749#(< 2 (+ main_~v~0 main_~r~0))} is VALID [2022-04-14 16:18:39,961 INFO L272 TraceCheckUtils]: 67: Hoare triple {224749#(< 2 (+ main_~v~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,961 INFO L290 TraceCheckUtils]: 68: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,961 INFO L290 TraceCheckUtils]: 69: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,961 INFO L290 TraceCheckUtils]: 70: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,961 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {224552#true} {224749#(< 2 (+ main_~v~0 main_~r~0))} #96#return; {224749#(< 2 (+ main_~v~0 main_~r~0))} is VALID [2022-04-14 16:18:39,962 INFO L290 TraceCheckUtils]: 72: Hoare triple {224749#(< 2 (+ main_~v~0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,963 INFO L290 TraceCheckUtils]: 73: Hoare triple {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,963 INFO L290 TraceCheckUtils]: 74: Hoare triple {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,963 INFO L272 TraceCheckUtils]: 75: Hoare triple {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,963 INFO L290 TraceCheckUtils]: 76: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,963 INFO L290 TraceCheckUtils]: 77: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,963 INFO L290 TraceCheckUtils]: 78: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,964 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {224552#true} {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} #96#return; {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,964 INFO L290 TraceCheckUtils]: 80: Hoare triple {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} assume !(~r~0 > 0); {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,964 INFO L290 TraceCheckUtils]: 81: Hoare triple {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,965 INFO L290 TraceCheckUtils]: 82: Hoare triple {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,965 INFO L272 TraceCheckUtils]: 83: Hoare triple {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,965 INFO L290 TraceCheckUtils]: 84: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,965 INFO L290 TraceCheckUtils]: 85: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,965 INFO L290 TraceCheckUtils]: 86: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,965 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {224552#true} {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} #98#return; {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,968 INFO L290 TraceCheckUtils]: 88: Hoare triple {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,968 INFO L290 TraceCheckUtils]: 89: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,968 INFO L290 TraceCheckUtils]: 90: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,968 INFO L272 TraceCheckUtils]: 91: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,968 INFO L290 TraceCheckUtils]: 92: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,969 INFO L290 TraceCheckUtils]: 93: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,969 INFO L290 TraceCheckUtils]: 94: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,969 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {224552#true} {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #98#return; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,969 INFO L290 TraceCheckUtils]: 96: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !(~r~0 < 0); {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,970 INFO L290 TraceCheckUtils]: 97: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,970 INFO L290 TraceCheckUtils]: 98: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,970 INFO L272 TraceCheckUtils]: 99: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,970 INFO L290 TraceCheckUtils]: 100: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,970 INFO L290 TraceCheckUtils]: 101: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,970 INFO L290 TraceCheckUtils]: 102: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,971 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {224552#true} {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #94#return; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,971 INFO L290 TraceCheckUtils]: 104: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(0 != ~r~0); {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,971 INFO L290 TraceCheckUtils]: 105: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,972 INFO L290 TraceCheckUtils]: 106: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,972 INFO L272 TraceCheckUtils]: 107: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,972 INFO L290 TraceCheckUtils]: 108: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,972 INFO L290 TraceCheckUtils]: 109: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,972 INFO L290 TraceCheckUtils]: 110: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,972 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {224552#true} {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #96#return; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-14 16:18:39,973 INFO L290 TraceCheckUtils]: 112: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,974 INFO L290 TraceCheckUtils]: 113: Hoare triple {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,974 INFO L290 TraceCheckUtils]: 114: Hoare triple {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,974 INFO L272 TraceCheckUtils]: 115: Hoare triple {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,974 INFO L290 TraceCheckUtils]: 116: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,974 INFO L290 TraceCheckUtils]: 117: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,974 INFO L290 TraceCheckUtils]: 118: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,975 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {224552#true} {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} #96#return; {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,975 INFO L290 TraceCheckUtils]: 120: Hoare triple {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} assume !(~r~0 > 0); {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,975 INFO L290 TraceCheckUtils]: 121: Hoare triple {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,976 INFO L290 TraceCheckUtils]: 122: Hoare triple {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} assume !!(#t~post8 < 100);havoc #t~post8; {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,976 INFO L272 TraceCheckUtils]: 123: Hoare triple {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,976 INFO L290 TraceCheckUtils]: 124: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,976 INFO L290 TraceCheckUtils]: 125: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,976 INFO L290 TraceCheckUtils]: 126: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,976 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {224552#true} {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} #98#return; {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,979 INFO L290 TraceCheckUtils]: 128: Hoare triple {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,979 INFO L290 TraceCheckUtils]: 129: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,979 INFO L290 TraceCheckUtils]: 130: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !!(#t~post8 < 100);havoc #t~post8; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,980 INFO L272 TraceCheckUtils]: 131: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,980 INFO L290 TraceCheckUtils]: 132: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,980 INFO L290 TraceCheckUtils]: 133: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,980 INFO L290 TraceCheckUtils]: 134: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,980 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {224552#true} {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #98#return; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,980 INFO L290 TraceCheckUtils]: 136: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !(~r~0 < 0); {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,981 INFO L290 TraceCheckUtils]: 137: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,981 INFO L290 TraceCheckUtils]: 138: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !!(#t~post6 < 100);havoc #t~post6; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,981 INFO L272 TraceCheckUtils]: 139: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,981 INFO L290 TraceCheckUtils]: 140: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,981 INFO L290 TraceCheckUtils]: 141: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,981 INFO L290 TraceCheckUtils]: 142: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,982 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {224552#true} {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #94#return; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,982 INFO L290 TraceCheckUtils]: 144: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !!(0 != ~r~0); {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,983 INFO L290 TraceCheckUtils]: 145: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,983 INFO L290 TraceCheckUtils]: 146: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,983 INFO L272 TraceCheckUtils]: 147: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,983 INFO L290 TraceCheckUtils]: 148: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,983 INFO L290 TraceCheckUtils]: 149: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,983 INFO L290 TraceCheckUtils]: 150: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,984 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {224552#true} {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #96#return; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-14 16:18:39,985 INFO L290 TraceCheckUtils]: 152: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,985 INFO L290 TraceCheckUtils]: 153: Hoare triple {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,985 INFO L290 TraceCheckUtils]: 154: Hoare triple {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,985 INFO L272 TraceCheckUtils]: 155: Hoare triple {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,985 INFO L290 TraceCheckUtils]: 156: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,985 INFO L290 TraceCheckUtils]: 157: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,985 INFO L290 TraceCheckUtils]: 158: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,986 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {224552#true} {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} #96#return; {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,986 INFO L290 TraceCheckUtils]: 160: Hoare triple {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} assume !(~r~0 > 0); {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,987 INFO L290 TraceCheckUtils]: 161: Hoare triple {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,987 INFO L290 TraceCheckUtils]: 162: Hoare triple {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} assume !!(#t~post8 < 100);havoc #t~post8; {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,987 INFO L272 TraceCheckUtils]: 163: Hoare triple {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,987 INFO L290 TraceCheckUtils]: 164: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,987 INFO L290 TraceCheckUtils]: 165: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,987 INFO L290 TraceCheckUtils]: 166: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,988 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {224552#true} {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} #98#return; {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,990 INFO L290 TraceCheckUtils]: 168: Hoare triple {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,990 INFO L290 TraceCheckUtils]: 169: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,991 INFO L290 TraceCheckUtils]: 170: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !!(#t~post8 < 100);havoc #t~post8; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,991 INFO L272 TraceCheckUtils]: 171: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,991 INFO L290 TraceCheckUtils]: 172: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,991 INFO L290 TraceCheckUtils]: 173: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,991 INFO L290 TraceCheckUtils]: 174: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,991 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {224552#true} {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #98#return; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,992 INFO L290 TraceCheckUtils]: 176: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !(~r~0 < 0); {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,992 INFO L290 TraceCheckUtils]: 177: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,992 INFO L290 TraceCheckUtils]: 178: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !!(#t~post6 < 100);havoc #t~post6; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,992 INFO L272 TraceCheckUtils]: 179: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,992 INFO L290 TraceCheckUtils]: 180: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,993 INFO L290 TraceCheckUtils]: 181: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,993 INFO L290 TraceCheckUtils]: 182: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,993 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {224552#true} {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #94#return; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,993 INFO L290 TraceCheckUtils]: 184: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !!(0 != ~r~0); {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,994 INFO L290 TraceCheckUtils]: 185: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,994 INFO L290 TraceCheckUtils]: 186: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,994 INFO L272 TraceCheckUtils]: 187: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,994 INFO L290 TraceCheckUtils]: 188: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,994 INFO L290 TraceCheckUtils]: 189: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,994 INFO L290 TraceCheckUtils]: 190: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,995 INFO L284 TraceCheckUtils]: 191: Hoare quadruple {224552#true} {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #96#return; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-14 16:18:39,995 INFO L290 TraceCheckUtils]: 192: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-14 16:18:39,996 INFO L290 TraceCheckUtils]: 193: Hoare triple {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-14 16:18:39,996 INFO L290 TraceCheckUtils]: 194: Hoare triple {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-14 16:18:39,996 INFO L272 TraceCheckUtils]: 195: Hoare triple {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,996 INFO L290 TraceCheckUtils]: 196: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,996 INFO L290 TraceCheckUtils]: 197: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,996 INFO L290 TraceCheckUtils]: 198: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,997 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {224552#true} {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} #96#return; {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-14 16:18:39,997 INFO L290 TraceCheckUtils]: 200: Hoare triple {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} assume !(~r~0 > 0); {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-14 16:18:39,998 INFO L290 TraceCheckUtils]: 201: Hoare triple {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-14 16:18:39,998 INFO L290 TraceCheckUtils]: 202: Hoare triple {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} assume !!(#t~post8 < 100);havoc #t~post8; {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-14 16:18:39,998 INFO L272 TraceCheckUtils]: 203: Hoare triple {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:39,998 INFO L290 TraceCheckUtils]: 204: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:39,998 INFO L290 TraceCheckUtils]: 205: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:39,998 INFO L290 TraceCheckUtils]: 206: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:39,999 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {224552#true} {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} #98#return; {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-14 16:18:40,001 INFO L290 TraceCheckUtils]: 208: Hoare triple {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-14 16:18:40,002 INFO L290 TraceCheckUtils]: 209: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-14 16:18:40,002 INFO L290 TraceCheckUtils]: 210: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !!(#t~post8 < 100);havoc #t~post8; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-14 16:18:40,002 INFO L272 TraceCheckUtils]: 211: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:40,002 INFO L290 TraceCheckUtils]: 212: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:40,002 INFO L290 TraceCheckUtils]: 213: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:40,002 INFO L290 TraceCheckUtils]: 214: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:40,003 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {224552#true} {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #98#return; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-14 16:18:40,003 INFO L290 TraceCheckUtils]: 216: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !(~r~0 < 0); {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-14 16:18:40,003 INFO L290 TraceCheckUtils]: 217: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-14 16:18:40,004 INFO L290 TraceCheckUtils]: 218: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !!(#t~post6 < 100);havoc #t~post6; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-14 16:18:40,004 INFO L272 TraceCheckUtils]: 219: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:40,004 INFO L290 TraceCheckUtils]: 220: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:40,004 INFO L290 TraceCheckUtils]: 221: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:40,004 INFO L290 TraceCheckUtils]: 222: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:40,004 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {224552#true} {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #94#return; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-14 16:18:40,005 INFO L290 TraceCheckUtils]: 224: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !!(0 != ~r~0); {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-14 16:18:40,005 INFO L290 TraceCheckUtils]: 225: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-14 16:18:40,005 INFO L290 TraceCheckUtils]: 226: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-14 16:18:40,005 INFO L272 TraceCheckUtils]: 227: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:40,006 INFO L290 TraceCheckUtils]: 228: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:40,006 INFO L290 TraceCheckUtils]: 229: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:40,006 INFO L290 TraceCheckUtils]: 230: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:40,006 INFO L284 TraceCheckUtils]: 231: Hoare quadruple {224552#true} {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #96#return; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-14 16:18:40,007 INFO L290 TraceCheckUtils]: 232: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,007 INFO L290 TraceCheckUtils]: 233: Hoare triple {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,008 INFO L290 TraceCheckUtils]: 234: Hoare triple {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} assume !!(#t~post7 < 100);havoc #t~post7; {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,008 INFO L272 TraceCheckUtils]: 235: Hoare triple {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:40,008 INFO L290 TraceCheckUtils]: 236: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:40,008 INFO L290 TraceCheckUtils]: 237: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:40,008 INFO L290 TraceCheckUtils]: 238: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:40,009 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {224552#true} {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} #96#return; {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,009 INFO L290 TraceCheckUtils]: 240: Hoare triple {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} assume !(~r~0 > 0); {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,009 INFO L290 TraceCheckUtils]: 241: Hoare triple {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,010 INFO L290 TraceCheckUtils]: 242: Hoare triple {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} assume !!(#t~post8 < 100);havoc #t~post8; {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,010 INFO L272 TraceCheckUtils]: 243: Hoare triple {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:40,010 INFO L290 TraceCheckUtils]: 244: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:40,010 INFO L290 TraceCheckUtils]: 245: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:40,010 INFO L290 TraceCheckUtils]: 246: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:40,010 INFO L284 TraceCheckUtils]: 247: Hoare quadruple {224552#true} {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} #98#return; {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,013 INFO L290 TraceCheckUtils]: 248: Hoare triple {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,013 INFO L290 TraceCheckUtils]: 249: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,014 INFO L290 TraceCheckUtils]: 250: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !!(#t~post8 < 100);havoc #t~post8; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,014 INFO L272 TraceCheckUtils]: 251: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:40,014 INFO L290 TraceCheckUtils]: 252: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:40,014 INFO L290 TraceCheckUtils]: 253: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:40,014 INFO L290 TraceCheckUtils]: 254: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:40,014 INFO L284 TraceCheckUtils]: 255: Hoare quadruple {224552#true} {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #98#return; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,015 INFO L290 TraceCheckUtils]: 256: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !(~r~0 < 0); {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,015 INFO L290 TraceCheckUtils]: 257: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,016 INFO L290 TraceCheckUtils]: 258: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !!(#t~post6 < 100);havoc #t~post6; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,016 INFO L272 TraceCheckUtils]: 259: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:40,016 INFO L290 TraceCheckUtils]: 260: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:40,016 INFO L290 TraceCheckUtils]: 261: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:40,016 INFO L290 TraceCheckUtils]: 262: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:40,017 INFO L284 TraceCheckUtils]: 263: Hoare quadruple {224552#true} {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #94#return; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,017 INFO L290 TraceCheckUtils]: 264: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !!(0 != ~r~0); {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,017 INFO L290 TraceCheckUtils]: 265: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,018 INFO L290 TraceCheckUtils]: 266: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !!(#t~post7 < 100);havoc #t~post7; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,018 INFO L272 TraceCheckUtils]: 267: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:40,018 INFO L290 TraceCheckUtils]: 268: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:40,018 INFO L290 TraceCheckUtils]: 269: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:40,018 INFO L290 TraceCheckUtils]: 270: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:40,018 INFO L284 TraceCheckUtils]: 271: Hoare quadruple {224552#true} {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #96#return; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-14 16:18:40,020 INFO L290 TraceCheckUtils]: 272: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-14 16:18:40,021 INFO L290 TraceCheckUtils]: 273: Hoare triple {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-14 16:18:40,022 INFO L290 TraceCheckUtils]: 274: Hoare triple {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-14 16:18:40,022 INFO L272 TraceCheckUtils]: 275: Hoare triple {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:40,022 INFO L290 TraceCheckUtils]: 276: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:40,022 INFO L290 TraceCheckUtils]: 277: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:40,022 INFO L290 TraceCheckUtils]: 278: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:40,023 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {224552#true} {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} #96#return; {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-14 16:18:40,024 INFO L290 TraceCheckUtils]: 280: Hoare triple {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} assume !(~r~0 > 0); {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-14 16:18:40,025 INFO L290 TraceCheckUtils]: 281: Hoare triple {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-14 16:18:40,026 INFO L290 TraceCheckUtils]: 282: Hoare triple {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-14 16:18:40,026 INFO L272 TraceCheckUtils]: 283: Hoare triple {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:40,026 INFO L290 TraceCheckUtils]: 284: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:40,026 INFO L290 TraceCheckUtils]: 285: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:40,026 INFO L290 TraceCheckUtils]: 286: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:40,026 INFO L284 TraceCheckUtils]: 287: Hoare quadruple {224552#true} {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} #98#return; {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-14 16:18:42,033 WARN L290 TraceCheckUtils]: 288: Hoare triple {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is UNKNOWN [2022-04-14 16:18:42,036 INFO L290 TraceCheckUtils]: 289: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-14 16:18:42,037 INFO L290 TraceCheckUtils]: 290: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !!(#t~post8 < 100);havoc #t~post8; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-14 16:18:42,037 INFO L272 TraceCheckUtils]: 291: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:42,037 INFO L290 TraceCheckUtils]: 292: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:42,037 INFO L290 TraceCheckUtils]: 293: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:42,037 INFO L290 TraceCheckUtils]: 294: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:42,038 INFO L284 TraceCheckUtils]: 295: Hoare quadruple {224552#true} {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #98#return; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-14 16:18:42,039 INFO L290 TraceCheckUtils]: 296: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !(~r~0 < 0); {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-14 16:18:42,040 INFO L290 TraceCheckUtils]: 297: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-14 16:18:42,041 INFO L290 TraceCheckUtils]: 298: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !!(#t~post6 < 100);havoc #t~post6; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-14 16:18:42,041 INFO L272 TraceCheckUtils]: 299: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:42,042 INFO L290 TraceCheckUtils]: 300: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:42,042 INFO L290 TraceCheckUtils]: 301: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:42,042 INFO L290 TraceCheckUtils]: 302: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:42,042 INFO L284 TraceCheckUtils]: 303: Hoare quadruple {224552#true} {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #94#return; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-14 16:18:42,043 INFO L290 TraceCheckUtils]: 304: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !!(0 != ~r~0); {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-14 16:18:42,044 INFO L290 TraceCheckUtils]: 305: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-14 16:18:42,045 INFO L290 TraceCheckUtils]: 306: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !!(#t~post7 < 100);havoc #t~post7; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-14 16:18:42,045 INFO L272 TraceCheckUtils]: 307: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:42,046 INFO L290 TraceCheckUtils]: 308: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:42,046 INFO L290 TraceCheckUtils]: 309: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:42,046 INFO L290 TraceCheckUtils]: 310: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:42,046 INFO L284 TraceCheckUtils]: 311: Hoare quadruple {224552#true} {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #96#return; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-14 16:18:42,047 INFO L290 TraceCheckUtils]: 312: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-14 16:18:42,047 INFO L290 TraceCheckUtils]: 313: Hoare triple {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-14 16:18:42,048 INFO L290 TraceCheckUtils]: 314: Hoare triple {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} assume !!(#t~post7 < 100);havoc #t~post7; {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-14 16:18:42,048 INFO L272 TraceCheckUtils]: 315: Hoare triple {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:42,048 INFO L290 TraceCheckUtils]: 316: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:42,048 INFO L290 TraceCheckUtils]: 317: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:42,048 INFO L290 TraceCheckUtils]: 318: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:42,048 INFO L284 TraceCheckUtils]: 319: Hoare quadruple {224552#true} {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} #96#return; {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-14 16:18:42,049 INFO L290 TraceCheckUtils]: 320: Hoare triple {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} assume !(~r~0 > 0); {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-14 16:18:42,049 INFO L290 TraceCheckUtils]: 321: Hoare triple {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-14 16:18:42,049 INFO L290 TraceCheckUtils]: 322: Hoare triple {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} assume !!(#t~post8 < 100);havoc #t~post8; {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-14 16:18:42,050 INFO L272 TraceCheckUtils]: 323: Hoare triple {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:42,050 INFO L290 TraceCheckUtils]: 324: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:42,050 INFO L290 TraceCheckUtils]: 325: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:42,050 INFO L290 TraceCheckUtils]: 326: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:42,050 INFO L284 TraceCheckUtils]: 327: Hoare quadruple {224552#true} {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} #98#return; {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-14 16:18:42,053 INFO L290 TraceCheckUtils]: 328: Hoare triple {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-14 16:18:42,054 INFO L290 TraceCheckUtils]: 329: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-14 16:18:42,054 INFO L290 TraceCheckUtils]: 330: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !!(#t~post8 < 100);havoc #t~post8; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-14 16:18:42,054 INFO L272 TraceCheckUtils]: 331: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:42,054 INFO L290 TraceCheckUtils]: 332: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:42,054 INFO L290 TraceCheckUtils]: 333: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:42,054 INFO L290 TraceCheckUtils]: 334: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:42,055 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {224552#true} {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #98#return; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-14 16:18:42,055 INFO L290 TraceCheckUtils]: 336: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !(~r~0 < 0); {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-14 16:18:42,056 INFO L290 TraceCheckUtils]: 337: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-14 16:18:42,056 INFO L290 TraceCheckUtils]: 338: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !!(#t~post6 < 100);havoc #t~post6; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-14 16:18:42,056 INFO L272 TraceCheckUtils]: 339: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:42,056 INFO L290 TraceCheckUtils]: 340: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:42,056 INFO L290 TraceCheckUtils]: 341: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:42,056 INFO L290 TraceCheckUtils]: 342: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:42,057 INFO L284 TraceCheckUtils]: 343: Hoare quadruple {224552#true} {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #94#return; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-14 16:18:42,057 INFO L290 TraceCheckUtils]: 344: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !!(0 != ~r~0); {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-14 16:18:42,058 INFO L290 TraceCheckUtils]: 345: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-14 16:18:42,058 INFO L290 TraceCheckUtils]: 346: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !!(#t~post7 < 100);havoc #t~post7; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-14 16:18:42,058 INFO L272 TraceCheckUtils]: 347: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:42,058 INFO L290 TraceCheckUtils]: 348: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:42,058 INFO L290 TraceCheckUtils]: 349: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:42,059 INFO L290 TraceCheckUtils]: 350: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:42,059 INFO L284 TraceCheckUtils]: 351: Hoare quadruple {224552#true} {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #96#return; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-14 16:18:44,065 WARN L290 TraceCheckUtils]: 352: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} is UNKNOWN [2022-04-14 16:18:44,091 INFO L290 TraceCheckUtils]: 353: Hoare triple {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} is VALID [2022-04-14 16:18:46,097 WARN L290 TraceCheckUtils]: 354: Hoare triple {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} assume !!(#t~post7 < 100);havoc #t~post7; {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} is UNKNOWN [2022-04-14 16:18:46,097 INFO L272 TraceCheckUtils]: 355: Hoare triple {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:46,097 INFO L290 TraceCheckUtils]: 356: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:46,097 INFO L290 TraceCheckUtils]: 357: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:46,097 INFO L290 TraceCheckUtils]: 358: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:46,098 INFO L284 TraceCheckUtils]: 359: Hoare quadruple {224552#true} {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} #96#return; {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} is VALID [2022-04-14 16:18:47,119 INFO L290 TraceCheckUtils]: 360: Hoare triple {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} is VALID [2022-04-14 16:18:47,146 INFO L290 TraceCheckUtils]: 361: Hoare triple {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} is VALID [2022-04-14 16:18:47,190 INFO L290 TraceCheckUtils]: 362: Hoare triple {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} assume !!(#t~post7 < 100);havoc #t~post7; {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} is VALID [2022-04-14 16:18:47,191 INFO L272 TraceCheckUtils]: 363: Hoare triple {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-14 16:18:47,191 INFO L290 TraceCheckUtils]: 364: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-14 16:18:47,191 INFO L290 TraceCheckUtils]: 365: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-14 16:18:47,191 INFO L290 TraceCheckUtils]: 366: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-14 16:18:47,191 INFO L284 TraceCheckUtils]: 367: Hoare quadruple {224552#true} {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} #96#return; {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} is VALID [2022-04-14 16:18:47,192 INFO L290 TraceCheckUtils]: 368: Hoare triple {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {224553#false} is VALID [2022-04-14 16:18:47,193 INFO L290 TraceCheckUtils]: 369: Hoare triple {224553#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {224553#false} is VALID [2022-04-14 16:18:47,193 INFO L290 TraceCheckUtils]: 370: Hoare triple {224553#false} assume !(#t~post7 < 100);havoc #t~post7; {224553#false} is VALID [2022-04-14 16:18:47,193 INFO L290 TraceCheckUtils]: 371: Hoare triple {224553#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {224553#false} is VALID [2022-04-14 16:18:47,193 INFO L290 TraceCheckUtils]: 372: Hoare triple {224553#false} assume !(#t~post8 < 100);havoc #t~post8; {224553#false} is VALID [2022-04-14 16:18:47,193 INFO L290 TraceCheckUtils]: 373: Hoare triple {224553#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {224553#false} is VALID [2022-04-14 16:18:47,193 INFO L290 TraceCheckUtils]: 374: Hoare triple {224553#false} assume !(#t~post6 < 100);havoc #t~post6; {224553#false} is VALID [2022-04-14 16:18:47,193 INFO L272 TraceCheckUtils]: 375: Hoare triple {224553#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224553#false} is VALID [2022-04-14 16:18:47,193 INFO L290 TraceCheckUtils]: 376: Hoare triple {224553#false} ~cond := #in~cond; {224553#false} is VALID [2022-04-14 16:18:47,193 INFO L290 TraceCheckUtils]: 377: Hoare triple {224553#false} assume 0 == ~cond; {224553#false} is VALID [2022-04-14 16:18:47,193 INFO L290 TraceCheckUtils]: 378: Hoare triple {224553#false} assume !false; {224553#false} is VALID [2022-04-14 16:18:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5272 backedges. 480 proven. 992 refuted. 0 times theorem prover too weak. 3800 trivial. 0 not checked. [2022-04-14 16:18:47,195 INFO L328 TraceCheckSpWp]: Computing backward predicates...