/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/cohencu-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 15:11:28,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 15:11:28,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 15:11:28,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 15:11:28,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 15:11:28,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 15:11:28,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 15:11:28,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 15:11:28,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 15:11:28,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 15:11:28,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 15:11:28,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 15:11:28,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 15:11:28,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 15:11:28,185 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 15:11:28,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 15:11:28,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 15:11:28,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 15:11:28,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 15:11:28,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 15:11:28,193 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 15:11:28,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 15:11:28,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 15:11:28,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 15:11:28,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 15:11:28,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 15:11:28,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 15:11:28,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 15:11:28,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 15:11:28,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 15:11:28,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 15:11:28,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 15:11:28,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 15:11:28,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 15:11:28,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 15:11:28,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 15:11:28,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 15:11:28,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 15:11:28,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 15:11:28,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 15:11:28,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 15:11:28,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 15:11:28,218 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 15:11:28,247 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 15:11:28,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 15:11:28,247 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 15:11:28,248 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 15:11:28,248 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 15:11:28,248 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 15:11:28,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 15:11:28,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 15:11:28,249 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 15:11:28,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 15:11:28,250 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 15:11:28,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 15:11:28,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 15:11:28,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 15:11:28,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 15:11:28,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 15:11:28,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 15:11:28,250 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 15:11:28,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 15:11:28,252 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 15:11:28,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 15:11:28,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 15:11:28,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 15:11:28,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 15:11:28,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:11:28,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 15:11:28,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 15:11:28,253 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 15:11:28,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 15:11:28,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 15:11:28,253 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 15:11:28,253 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 15:11:28,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 15:11:28,253 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 15:11:28,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 15:11:28,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 15:11:28,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 15:11:28,493 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 15:11:28,493 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 15:11:28,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-04-14 15:11:28,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d1f10143/ae32cf6cc88d46afb69d077d67a90a11/FLAG2a3c075b1 [2022-04-14 15:11:28,927 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 15:11:28,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-04-14 15:11:28,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d1f10143/ae32cf6cc88d46afb69d077d67a90a11/FLAG2a3c075b1 [2022-04-14 15:11:28,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d1f10143/ae32cf6cc88d46afb69d077d67a90a11 [2022-04-14 15:11:28,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 15:11:28,945 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 15:11:28,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 15:11:28,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 15:11:28,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 15:11:28,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:11:28" (1/1) ... [2022-04-14 15:11:28,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db1b0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:28, skipping insertion in model container [2022-04-14 15:11:28,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:11:28" (1/1) ... [2022-04-14 15:11:28,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 15:11:28,982 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 15:11:29,101 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/cohencu-ll_unwindbound50.c[588,601] [2022-04-14 15:11:29,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:11:29,128 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 15:11:29,138 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/cohencu-ll_unwindbound50.c[588,601] [2022-04-14 15:11:29,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:11:29,165 INFO L208 MainTranslator]: Completed translation [2022-04-14 15:11:29,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:29 WrapperNode [2022-04-14 15:11:29,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 15:11:29,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 15:11:29,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 15:11:29,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 15:11:29,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:29" (1/1) ... [2022-04-14 15:11:29,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:29" (1/1) ... [2022-04-14 15:11:29,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:29" (1/1) ... [2022-04-14 15:11:29,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:29" (1/1) ... [2022-04-14 15:11:29,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:29" (1/1) ... [2022-04-14 15:11:29,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:29" (1/1) ... [2022-04-14 15:11:29,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:29" (1/1) ... [2022-04-14 15:11:29,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 15:11:29,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 15:11:29,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 15:11:29,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 15:11:29,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:29" (1/1) ... [2022-04-14 15:11:29,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:11:29,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:29,226 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 15:11:29,228 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 15:11:29,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 15:11:29,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 15:11:29,256 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 15:11:29,257 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 15:11:29,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 15:11:29,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 15:11:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 15:11:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 15:11:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 15:11:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 15:11:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-14 15:11:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 15:11:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 15:11:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 15:11:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 15:11:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 15:11:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 15:11:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 15:11:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 15:11:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 15:11:29,307 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 15:11:29,308 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 15:11:29,519 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 15:11:29,525 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 15:11:29,525 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 15:11:29,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:11:29 BoogieIcfgContainer [2022-04-14 15:11:29,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 15:11:29,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 15:11:29,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 15:11:29,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 15:11:29,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:11:28" (1/3) ... [2022-04-14 15:11:29,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc5f85d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:11:29, skipping insertion in model container [2022-04-14 15:11:29,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:11:29" (2/3) ... [2022-04-14 15:11:29,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc5f85d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:11:29, skipping insertion in model container [2022-04-14 15:11:29,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:11:29" (3/3) ... [2022-04-14 15:11:29,560 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound50.c [2022-04-14 15:11:29,564 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 15:11:29,565 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 15:11:29,626 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 15:11:29,633 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 15:11:29,633 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 15:11:29,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 15:11:29,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 15:11:29,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:29,673 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:29,674 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:29,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-14 15:11:29,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:29,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213283985] [2022-04-14 15:11:29,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:29,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:29,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:11:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:29,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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; {34#true} is VALID [2022-04-14 15:11:29,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-14 15:11:29,907 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-14 15:11:29,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:11:29,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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; {34#true} is VALID [2022-04-14 15:11:29,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-14 15:11:29,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-14 15:11:29,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-14 15:11:29,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {34#true} is VALID [2022-04-14 15:11:29,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-14 15:11:29,912 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35#false} is VALID [2022-04-14 15:11:29,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-14 15:11:29,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-14 15:11:29,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-14 15:11:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:11:29,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:29,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213283985] [2022-04-14 15:11:29,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213283985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:11:29,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:11:29,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 15:11:29,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213061282] [2022-04-14 15:11:29,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:11:29,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 15:11:29,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:29,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:29,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:29,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 15:11:29,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:29,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 15:11:29,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:11:29,972 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:30,203 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-14 15:11:30,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 15:11:30,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 15:11:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-14 15:11:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-14 15:11:30,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-14 15:11:30,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:30,359 INFO L225 Difference]: With dead ends: 57 [2022-04-14 15:11:30,360 INFO L226 Difference]: Without dead ends: 27 [2022-04-14 15:11:30,362 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 15:11:30,365 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:30,366 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:11:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-14 15:11:30,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-14 15:11:30,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:30,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:30,392 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:30,392 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:30,396 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-14 15:11:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-14 15:11:30,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:30,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:30,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-14 15:11:30,398 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-14 15:11:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:30,401 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-14 15:11:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-14 15:11:30,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:30,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:30,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:30,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:30,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-14 15:11:30,406 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-14 15:11:30,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:30,406 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-14 15:11:30,406 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-14 15:11:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 15:11:30,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:30,407 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:30,408 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 15:11:30,408 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:30,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:30,409 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-14 15:11:30,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:30,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487412628] [2022-04-14 15:11:30,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:30,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:30,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:11:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:30,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:11:30,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:11:30,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:11:30,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:11:30,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:11:30,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:11:30,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:11:30,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#(= ~counter~0 0)} call #t~ret6 := main(); {232#(= ~counter~0 0)} is VALID [2022-04-14 15:11:30,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#(= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:11:30,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {233#(= |main_#t~post5| 0)} is VALID [2022-04-14 15:11:30,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {228#false} is VALID [2022-04-14 15:11:30,483 INFO L272 TraceCheckUtils]: 8: Hoare triple {228#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {228#false} is VALID [2022-04-14 15:11:30,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-14 15:11:30,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-14 15:11:30,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-14 15:11:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:11:30,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:30,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487412628] [2022-04-14 15:11:30,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487412628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:11:30,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:11:30,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 15:11:30,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511135003] [2022-04-14 15:11:30,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:11:30,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 15:11:30,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:30,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:30,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:30,498 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:11:30,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:30,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:11:30,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:11:30,509 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:30,807 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-14 15:11:30,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 15:11:30,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 15:11:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-14 15:11:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-14 15:11:30,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-14 15:11:30,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:30,873 INFO L225 Difference]: With dead ends: 40 [2022-04-14 15:11:30,873 INFO L226 Difference]: Without dead ends: 28 [2022-04-14 15:11:30,877 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 15:11:30,879 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:30,880 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:11:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-14 15:11:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-14 15:11:30,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:30,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:30,889 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:30,891 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:30,896 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-14 15:11:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-14 15:11:30,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:30,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:30,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-14 15:11:30,898 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-14 15:11:30,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:30,900 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-14 15:11:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-14 15:11:30,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:30,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:30,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:30,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-14 15:11:30,904 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-14 15:11:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:30,904 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-14 15:11:30,904 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:30,904 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-14 15:11:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 15:11:30,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:30,905 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:30,905 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 15:11:30,905 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:30,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:30,906 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-14 15:11:30,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:30,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193271907] [2022-04-14 15:11:30,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:30,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:30,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:11:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:31,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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; {406#true} is VALID [2022-04-14 15:11:31,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-14 15:11:31,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-14 15:11:31,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {406#true} call ULTIMATE.init(); {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:11:31,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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; {406#true} is VALID [2022-04-14 15:11:31,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-14 15:11:31,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-14 15:11:31,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {406#true} call #t~ret6 := main(); {406#true} is VALID [2022-04-14 15:11:31,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {406#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-14 15:11:31,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-14 15:11:31,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 50);havoc #t~post5; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-14 15:11:31,009 INFO L272 TraceCheckUtils]: 8: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:11:31,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {412#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {413#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:11:31,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {413#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {407#false} is VALID [2022-04-14 15:11:31,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#false} assume !false; {407#false} is VALID [2022-04-14 15:11:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:11:31,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:31,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193271907] [2022-04-14 15:11:31,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193271907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:11:31,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:11:31,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 15:11:31,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498363814] [2022-04-14 15:11:31,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:11:31,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 15:11:31,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:31,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:31,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:31,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 15:11:31,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:31,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 15:11:31,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 15:11:31,026 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:31,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:31,417 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-14 15:11:31,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 15:11:31,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 15:11:31,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-14 15:11:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-14 15:11:31,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-14 15:11:31,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:31,472 INFO L225 Difference]: With dead ends: 34 [2022-04-14 15:11:31,472 INFO L226 Difference]: Without dead ends: 32 [2022-04-14 15:11:31,472 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:11:31,473 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:31,473 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:11:31,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-14 15:11:31,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-14 15:11:31,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:31,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:31,479 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:31,480 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:31,482 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-14 15:11:31,482 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 15:11:31,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:31,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:31,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-14 15:11:31,483 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-14 15:11:31,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:31,485 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-14 15:11:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 15:11:31,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:31,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:31,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:31,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:11:31,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-14 15:11:31,488 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-14 15:11:31,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:31,488 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-14 15:11:31,488 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:11:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 15:11:31,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 15:11:31,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:31,489 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:31,489 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 15:11:31,490 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:31,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:31,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-14 15:11:31,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:31,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387704839] [2022-04-14 15:11:31,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:31,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:31,510 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:31,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1590873409] [2022-04-14 15:11:31,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:31,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:31,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:31,512 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 15:11:31,513 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 15:11:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:31,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:11:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:31,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:31,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-14 15:11:31,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#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; {593#true} is VALID [2022-04-14 15:11:31,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-14 15:11:31,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} #81#return; {593#true} is VALID [2022-04-14 15:11:31,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} call #t~ret6 := main(); {593#true} is VALID [2022-04-14 15:11:31,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:31,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:31,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:31,735 INFO L272 TraceCheckUtils]: 8: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {593#true} is VALID [2022-04-14 15:11:31,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {593#true} ~cond := #in~cond; {593#true} is VALID [2022-04-14 15:11:31,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {593#true} assume !(0 == ~cond); {593#true} is VALID [2022-04-14 15:11:31,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-14 15:11:31,737 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {593#true} {613#(and (= main_~n~0 0) (= main_~y~0 1))} #59#return; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:31,738 INFO L272 TraceCheckUtils]: 13: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:31,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:31,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {594#false} is VALID [2022-04-14 15:11:31,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-14 15:11:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:11:31,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:11:31,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:31,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387704839] [2022-04-14 15:11:31,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:31,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590873409] [2022-04-14 15:11:31,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590873409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:11:31,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:11:31,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:11:31,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887473555] [2022-04-14 15:11:31,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:11:31,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-14 15:11:31,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:31,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:11:31,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:31,754 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:11:31,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:31,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:11:31,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:11:31,755 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:11:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:32,012 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-14 15:11:32,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:11:32,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-14 15:11:32,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:11:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:11:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:11:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:11:32,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-14 15:11:32,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:32,114 INFO L225 Difference]: With dead ends: 50 [2022-04-14 15:11:32,114 INFO L226 Difference]: Without dead ends: 48 [2022-04-14 15:11:32,114 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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 15:11:32,115 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:32,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 139 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:11:32,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-14 15:11:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-14 15:11:32,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:32,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 15:11:32,125 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 15:11:32,125 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 15:11:32,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:32,129 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-14 15:11:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-14 15:11:32,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:32,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:32,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-14 15:11:32,130 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-14 15:11:32,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:32,133 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-14 15:11:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-14 15:11:32,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:32,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:32,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:32,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 15:11:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-14 15:11:32,136 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-14 15:11:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:32,136 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-14 15:11:32,136 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:11:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-14 15:11:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 15:11:32,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:32,137 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:32,162 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 15:11:32,351 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:32,352 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:32,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:32,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-14 15:11:32,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:32,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645511388] [2022-04-14 15:11:32,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:32,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:32,364 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:32,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1280520390] [2022-04-14 15:11:32,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:32,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:32,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:32,366 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 15:11:32,372 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 15:11:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:32,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:11:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:32,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:32,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {887#true} is VALID [2022-04-14 15:11:32,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {887#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; {887#true} is VALID [2022-04-14 15:11:32,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-14 15:11:32,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} #81#return; {887#true} is VALID [2022-04-14 15:11:32,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {887#true} call #t~ret6 := main(); {887#true} is VALID [2022-04-14 15:11:32,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {887#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 15:11:32,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 15:11:32,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 15:11:32,536 INFO L272 TraceCheckUtils]: 8: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {887#true} is VALID [2022-04-14 15:11:32,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-14 15:11:32,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-14 15:11:32,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-14 15:11:32,537 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} #59#return; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 15:11:32,537 INFO L272 TraceCheckUtils]: 13: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {887#true} is VALID [2022-04-14 15:11:32,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-14 15:11:32,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-14 15:11:32,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-14 15:11:32,538 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} #61#return; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 15:11:32,539 INFO L272 TraceCheckUtils]: 18: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {947#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:32,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {947#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {951#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:32,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {951#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {888#false} is VALID [2022-04-14 15:11:32,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {888#false} assume !false; {888#false} is VALID [2022-04-14 15:11:32,540 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 15:11:32,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:11:32,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:32,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645511388] [2022-04-14 15:11:32,540 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:32,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280520390] [2022-04-14 15:11:32,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280520390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:11:32,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:11:32,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:11:32,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67706286] [2022-04-14 15:11:32,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:11:32,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 15:11:32,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:32,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:11:32,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:32,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:11:32,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:32,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:11:32,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:11:32,558 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:11:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:32,814 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-14 15:11:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:11:32,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 15:11:32,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:11:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:11:32,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:11:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:11:32,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-14 15:11:32,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:32,919 INFO L225 Difference]: With dead ends: 54 [2022-04-14 15:11:32,919 INFO L226 Difference]: Without dead ends: 52 [2022-04-14 15:11:32,919 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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 15:11:32,920 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:32,921 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:11:32,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-14 15:11:32,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-14 15:11:32,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:32,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 15:11:32,934 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 15:11:32,934 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 15:11:32,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:32,937 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-14 15:11:32,937 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-14 15:11:32,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:32,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:32,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-14 15:11:32,938 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-14 15:11:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:32,941 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-14 15:11:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-14 15:11:32,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:32,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:32,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:32,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 15:11:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-14 15:11:32,948 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-14 15:11:32,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:32,949 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-14 15:11:32,949 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:11:32,950 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-14 15:11:32,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 15:11:32,951 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:32,951 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:32,976 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 15:11:33,167 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:33,168 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:33,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:33,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-14 15:11:33,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:33,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026652483] [2022-04-14 15:11:33,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:33,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:33,182 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:33,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1507066461] [2022-04-14 15:11:33,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:33,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:33,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:33,183 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 15:11:33,191 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 15:11:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:33,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:11:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:33,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:33,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {1225#true} call ULTIMATE.init(); {1225#true} is VALID [2022-04-14 15:11:33,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {1225#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; {1225#true} is VALID [2022-04-14 15:11:33,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-14 15:11:33,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1225#true} {1225#true} #81#return; {1225#true} is VALID [2022-04-14 15:11:33,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#true} call #t~ret6 := main(); {1225#true} is VALID [2022-04-14 15:11:33,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {1225#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:33,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:33,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:33,396 INFO L272 TraceCheckUtils]: 8: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1225#true} is VALID [2022-04-14 15:11:33,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-14 15:11:33,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-14 15:11:33,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-14 15:11:33,397 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:33,397 INFO L272 TraceCheckUtils]: 13: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1225#true} is VALID [2022-04-14 15:11:33,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-14 15:11:33,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-14 15:11:33,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-14 15:11:33,398 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:33,401 INFO L272 TraceCheckUtils]: 18: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1225#true} is VALID [2022-04-14 15:11:33,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-14 15:11:33,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-14 15:11:33,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-14 15:11:33,402 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:33,403 INFO L272 TraceCheckUtils]: 23: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:33,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:33,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {1304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1226#false} is VALID [2022-04-14 15:11:33,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2022-04-14 15:11:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 15:11:33,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:11:33,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:33,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026652483] [2022-04-14 15:11:33,405 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:33,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507066461] [2022-04-14 15:11:33,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507066461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:11:33,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:11:33,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:11:33,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404708841] [2022-04-14 15:11:33,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:11:33,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-14 15:11:33,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:33,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:11:33,430 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 15:11:33,430 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:11:33,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:33,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:11:33,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:11:33,431 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:11:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:33,744 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-14 15:11:33,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:11:33,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-14 15:11:33,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:33,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:11:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:11:33,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:11:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:11:33,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-14 15:11:33,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:33,823 INFO L225 Difference]: With dead ends: 62 [2022-04-14 15:11:33,823 INFO L226 Difference]: Without dead ends: 50 [2022-04-14 15:11:33,823 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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 15:11:33,824 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:33,824 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:11:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-14 15:11:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-14 15:11:33,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:33,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:11:33,840 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:11:33,841 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:11:33,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:33,846 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-14 15:11:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-14 15:11:33,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:33,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:33,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-14 15:11:33,848 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-14 15:11:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:33,850 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-14 15:11:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-14 15:11:33,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:33,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:33,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:33,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:11:33,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-14 15:11:33,854 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-14 15:11:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:33,854 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-14 15:11:33,854 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:11:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-14 15:11:33,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-14 15:11:33,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:33,855 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 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] [2022-04-14 15:11:33,874 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 15:11:34,064 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:34,064 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:34,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:34,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-14 15:11:34,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:34,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234799856] [2022-04-14 15:11:34,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:34,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:34,078 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:34,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1262216454] [2022-04-14 15:11:34,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:34,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:34,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:34,080 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 15:11:34,107 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 15:11:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:34,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:11:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:34,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:34,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-14 15:11:34,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {1585#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; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:11:34,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {1593#(<= ~counter~0 0)} assume true; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:11:34,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1593#(<= ~counter~0 0)} {1585#true} #81#return; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:11:34,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {1593#(<= ~counter~0 0)} call #t~ret6 := main(); {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:11:34,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {1593#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:11:34,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {1593#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {1609#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,347 INFO L272 TraceCheckUtils]: 8: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,349 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #59#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,350 INFO L272 TraceCheckUtils]: 13: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,351 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #61#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,352 INFO L272 TraceCheckUtils]: 18: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,353 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #63#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,354 INFO L272 TraceCheckUtils]: 23: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,355 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #65#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,356 INFO L272 TraceCheckUtils]: 28: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,358 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #67#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {1609#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:11:34,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {1609#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1694#(<= |main_#t~post5| 1)} is VALID [2022-04-14 15:11:34,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {1694#(<= |main_#t~post5| 1)} assume !(#t~post5 < 50);havoc #t~post5; {1586#false} is VALID [2022-04-14 15:11:34,359 INFO L272 TraceCheckUtils]: 36: Hoare triple {1586#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1586#false} is VALID [2022-04-14 15:11:34,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-14 15:11:34,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {1586#false} assume !(0 == ~cond); {1586#false} is VALID [2022-04-14 15:11:34,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {1586#false} assume true; {1586#false} is VALID [2022-04-14 15:11:34,360 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1586#false} {1586#false} #69#return; {1586#false} is VALID [2022-04-14 15:11:34,360 INFO L272 TraceCheckUtils]: 41: Hoare triple {1586#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1586#false} is VALID [2022-04-14 15:11:34,360 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-14 15:11:34,360 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-14 15:11:34,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-14 15:11:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-14 15:11:34,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:11:34,564 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-14 15:11:34,564 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-14 15:11:34,564 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-14 15:11:34,565 INFO L272 TraceCheckUtils]: 41: Hoare triple {1586#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1586#false} is VALID [2022-04-14 15:11:34,565 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1585#true} {1586#false} #69#return; {1586#false} is VALID [2022-04-14 15:11:34,565 INFO L290 TraceCheckUtils]: 39: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:11:34,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:11:34,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:11:34,565 INFO L272 TraceCheckUtils]: 36: Hoare triple {1586#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-14 15:11:34,566 INFO L290 TraceCheckUtils]: 35: Hoare triple {1752#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {1586#false} is VALID [2022-04-14 15:11:34,566 INFO L290 TraceCheckUtils]: 34: Hoare triple {1756#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1752#(< |main_#t~post5| 50)} is VALID [2022-04-14 15:11:34,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {1756#(< ~counter~0 50)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1756#(< ~counter~0 50)} is VALID [2022-04-14 15:11:34,567 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1585#true} {1756#(< ~counter~0 50)} #67#return; {1756#(< ~counter~0 50)} is VALID [2022-04-14 15:11:34,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:11:34,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:11:34,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:11:34,568 INFO L272 TraceCheckUtils]: 28: Hoare triple {1756#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1585#true} is VALID [2022-04-14 15:11:34,568 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1585#true} {1756#(< ~counter~0 50)} #65#return; {1756#(< ~counter~0 50)} is VALID [2022-04-14 15:11:34,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:11:34,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:11:34,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:11:34,569 INFO L272 TraceCheckUtils]: 23: Hoare triple {1756#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1585#true} is VALID [2022-04-14 15:11:34,571 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1585#true} {1756#(< ~counter~0 50)} #63#return; {1756#(< ~counter~0 50)} is VALID [2022-04-14 15:11:34,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:11:34,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:11:34,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:11:34,572 INFO L272 TraceCheckUtils]: 18: Hoare triple {1756#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-14 15:11:34,573 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1585#true} {1756#(< ~counter~0 50)} #61#return; {1756#(< ~counter~0 50)} is VALID [2022-04-14 15:11:34,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:11:34,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:11:34,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:11:34,573 INFO L272 TraceCheckUtils]: 13: Hoare triple {1756#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1585#true} is VALID [2022-04-14 15:11:34,574 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1585#true} {1756#(< ~counter~0 50)} #59#return; {1756#(< ~counter~0 50)} is VALID [2022-04-14 15:11:34,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:11:34,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:11:34,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:11:34,575 INFO L272 TraceCheckUtils]: 8: Hoare triple {1756#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-14 15:11:34,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {1756#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {1756#(< ~counter~0 50)} is VALID [2022-04-14 15:11:34,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {1841#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1756#(< ~counter~0 50)} is VALID [2022-04-14 15:11:34,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {1841#(< ~counter~0 49)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1841#(< ~counter~0 49)} is VALID [2022-04-14 15:11:34,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {1841#(< ~counter~0 49)} call #t~ret6 := main(); {1841#(< ~counter~0 49)} is VALID [2022-04-14 15:11:34,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1841#(< ~counter~0 49)} {1585#true} #81#return; {1841#(< ~counter~0 49)} is VALID [2022-04-14 15:11:34,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {1841#(< ~counter~0 49)} assume true; {1841#(< ~counter~0 49)} is VALID [2022-04-14 15:11:34,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {1585#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; {1841#(< ~counter~0 49)} is VALID [2022-04-14 15:11:34,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-14 15:11:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-14 15:11:34,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:34,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234799856] [2022-04-14 15:11:34,584 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:34,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262216454] [2022-04-14 15:11:34,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262216454] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:11:34,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:11:34,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-14 15:11:34,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891993555] [2022-04-14 15:11:34,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:11:34,585 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-04-14 15:11:34,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:34,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-14 15:11:34,648 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 15:11:34,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:11:34,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:34,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:11:34,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:11:34,650 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-14 15:11:35,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:35,531 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2022-04-14 15:11:35,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 15:11:35,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-04-14 15:11:35,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-14 15:11:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-14 15:11:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-14 15:11:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-14 15:11:35,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 134 transitions. [2022-04-14 15:11:35,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:35,677 INFO L225 Difference]: With dead ends: 120 [2022-04-14 15:11:35,677 INFO L226 Difference]: Without dead ends: 104 [2022-04-14 15:11:35,680 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:11:35,681 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 65 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:35,681 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 194 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:11:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-14 15:11:35,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-04-14 15:11:35,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:35,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:35,723 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:35,724 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:35,728 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-14 15:11:35,728 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-14 15:11:35,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:35,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:35,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 104 states. [2022-04-14 15:11:35,730 INFO L87 Difference]: Start difference. First operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 104 states. [2022-04-14 15:11:35,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:35,734 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-14 15:11:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-14 15:11:35,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:35,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:35,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:35,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:35,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-04-14 15:11:35,739 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-04-14 15:11:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:35,739 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-04-14 15:11:35,740 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-14 15:11:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-04-14 15:11:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-14 15:11:35,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:35,741 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:35,766 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 15:11:35,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:35,956 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:35,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:35,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-14 15:11:35,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:35,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324037906] [2022-04-14 15:11:35,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:35,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:35,977 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:35,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [402464132] [2022-04-14 15:11:35,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:35,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:35,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:35,978 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 15:11:35,984 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 15:11:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:36,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:11:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:36,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:36,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-14 15:11:36,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {2418#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#true} is VALID [2022-04-14 15:11:36,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:36,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-14 15:11:36,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-14 15:11:36,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:36,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:36,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:36,291 INFO L272 TraceCheckUtils]: 8: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:36,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:36,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:36,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:36,292 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:36,292 INFO L272 TraceCheckUtils]: 13: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:36,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:36,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:36,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:36,293 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:36,293 INFO L272 TraceCheckUtils]: 18: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:36,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:36,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:36,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:36,294 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:36,294 INFO L272 TraceCheckUtils]: 23: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:36,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:36,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:36,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:36,295 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:36,295 INFO L272 TraceCheckUtils]: 28: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:36,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:36,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:36,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:36,296 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:36,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:11:36,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:11:36,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:11:36,298 INFO L272 TraceCheckUtils]: 36: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:36,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:36,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:36,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:36,304 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2418#true} {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #59#return; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:11:36,305 INFO L272 TraceCheckUtils]: 41: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:36,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:36,306 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-14 15:11:36,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-14 15:11:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-14 15:11:36,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:11:36,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-14 15:11:36,530 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-14 15:11:36,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:36,531 INFO L272 TraceCheckUtils]: 41: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:36,532 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2418#true} {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #59#return; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 15:11:36,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:36,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:36,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:36,532 INFO L272 TraceCheckUtils]: 36: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:36,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !!(#t~post5 < 50);havoc #t~post5; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 15:11:36,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 15:11:36,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 15:11:36,542 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #67#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:11:36,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:36,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:36,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:36,542 INFO L272 TraceCheckUtils]: 28: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:36,543 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #65#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:11:36,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:36,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:36,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:36,543 INFO L272 TraceCheckUtils]: 23: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:36,544 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #63#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:11:36,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:36,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:36,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:36,544 INFO L272 TraceCheckUtils]: 18: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:36,545 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #61#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:11:36,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:36,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:36,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:36,545 INFO L272 TraceCheckUtils]: 13: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:36,546 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #59#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:11:36,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:36,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-14 15:11:36,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-14 15:11:36,546 INFO L272 TraceCheckUtils]: 8: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-14 15:11:36,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !!(#t~post5 < 50);havoc #t~post5; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:11:36,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:11:36,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:11:36,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-14 15:11:36,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-14 15:11:36,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-14 15:11:36,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {2418#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#true} is VALID [2022-04-14 15:11:36,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-14 15:11:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-14 15:11:36,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:36,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324037906] [2022-04-14 15:11:36,549 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:36,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402464132] [2022-04-14 15:11:36,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402464132] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:11:36,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:11:36,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 15:11:36,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815019825] [2022-04-14 15:11:36,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:11:36,550 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-14 15:11:36,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:36,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 15:11:36,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:36,603 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:11:36,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:36,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:11:36,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:11:36,604 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 15:11:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:37,438 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-14 15:11:37,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:11:37,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-14 15:11:37,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 15:11:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-14 15:11:37,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 15:11:37,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-14 15:11:37,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-14 15:11:37,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:37,568 INFO L225 Difference]: With dead ends: 118 [2022-04-14 15:11:37,568 INFO L226 Difference]: Without dead ends: 116 [2022-04-14 15:11:37,568 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:11:37,569 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:37,569 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 124 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 15:11:37,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-14 15:11:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-14 15:11:37,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:37,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:37,636 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:37,637 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:37,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:37,641 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-14 15:11:37,642 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-14 15:11:37,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:37,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:37,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 116 states. [2022-04-14 15:11:37,643 INFO L87 Difference]: Start difference. First operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 116 states. [2022-04-14 15:11:37,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:37,648 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-14 15:11:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-14 15:11:37,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:37,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:37,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:37,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:37,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-04-14 15:11:37,654 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-04-14 15:11:37,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:37,654 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-04-14 15:11:37,654 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 15:11:37,654 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-14 15:11:37,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-14 15:11:37,655 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:37,655 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:37,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-14 15:11:37,871 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:37,872 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:37,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:37,872 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 2 times [2022-04-14 15:11:37,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:37,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399031556] [2022-04-14 15:11:37,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:37,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:37,895 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:37,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409551986] [2022-04-14 15:11:37,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:11:37,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:37,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:37,904 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 15:11:37,908 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 15:11:37,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:11:37,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:11:37,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:11:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:37,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:38,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-14 15:11:38,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {3289#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; {3289#true} is VALID [2022-04-14 15:11:38,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:38,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-14 15:11:38,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-14 15:11:38,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {3289#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:38,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:38,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:38,217 INFO L272 TraceCheckUtils]: 8: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:38,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:38,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:38,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:38,218 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #59#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:38,218 INFO L272 TraceCheckUtils]: 13: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:38,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:38,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:38,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:38,219 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #61#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:38,220 INFO L272 TraceCheckUtils]: 18: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:38,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:38,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:38,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:38,220 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #63#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:38,221 INFO L272 TraceCheckUtils]: 23: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:38,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:38,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:38,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:38,222 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #65#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:38,222 INFO L272 TraceCheckUtils]: 28: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:38,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:38,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:38,222 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:38,223 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #67#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:11:38,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 15:11:38,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 15:11:38,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 15:11:38,224 INFO L272 TraceCheckUtils]: 36: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:38,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:38,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:38,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:38,225 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3289#true} {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #59#return; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 15:11:38,225 INFO L272 TraceCheckUtils]: 41: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:38,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:38,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:38,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:38,226 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3289#true} {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #61#return; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 15:11:38,226 INFO L272 TraceCheckUtils]: 46: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:38,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3438#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:38,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-14 15:11:38,227 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-14 15:11:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-14 15:11:38,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:11:38,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-14 15:11:38,448 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-14 15:11:38,448 INFO L290 TraceCheckUtils]: 47: Hoare triple {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3438#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:38,449 INFO L272 TraceCheckUtils]: 46: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:38,450 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3289#true} {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #61#return; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:11:38,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:38,450 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:38,450 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:38,450 INFO L272 TraceCheckUtils]: 41: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:38,451 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3289#true} {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #59#return; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:11:38,451 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:38,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:38,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:38,451 INFO L272 TraceCheckUtils]: 36: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:38,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !!(#t~post5 < 50);havoc #t~post5; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:11:38,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:11:38,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:11:38,456 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #67#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:11:38,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:38,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:38,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:38,456 INFO L272 TraceCheckUtils]: 28: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:38,457 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #65#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:11:38,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:38,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:38,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:38,457 INFO L272 TraceCheckUtils]: 23: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:38,459 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #63#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:11:38,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:38,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:38,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:38,462 INFO L272 TraceCheckUtils]: 18: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:38,464 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #61#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:11:38,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:38,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:38,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:38,465 INFO L272 TraceCheckUtils]: 13: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:38,465 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #59#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:11:38,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:38,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-14 15:11:38,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-14 15:11:38,467 INFO L272 TraceCheckUtils]: 8: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-14 15:11:38,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(#t~post5 < 50);havoc #t~post5; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:11:38,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:11:38,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {3289#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:11:38,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-14 15:11:38,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-14 15:11:38,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-14 15:11:38,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {3289#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; {3289#true} is VALID [2022-04-14 15:11:38,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-14 15:11:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-14 15:11:38,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:38,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399031556] [2022-04-14 15:11:38,471 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:38,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409551986] [2022-04-14 15:11:38,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409551986] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:11:38,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:11:38,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 15:11:38,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289878533] [2022-04-14 15:11:38,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:11:38,472 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-14 15:11:38,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:38,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 15:11:38,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:38,529 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:11:38,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:38,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:11:38,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:11:38,530 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 15:11:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:39,091 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2022-04-14 15:11:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 15:11:39,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-14 15:11:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 15:11:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-14 15:11:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 15:11:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-14 15:11:39,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-14 15:11:39,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:39,175 INFO L225 Difference]: With dead ends: 122 [2022-04-14 15:11:39,175 INFO L226 Difference]: Without dead ends: 120 [2022-04-14 15:11:39,175 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-14 15:11:39,176 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:39,176 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 232 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 15:11:39,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-14 15:11:39,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-14 15:11:39,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:39,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:39,219 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:39,219 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:39,223 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-14 15:11:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-14 15:11:39,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:39,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:39,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 120 states. [2022-04-14 15:11:39,225 INFO L87 Difference]: Start difference. First operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 120 states. [2022-04-14 15:11:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:39,228 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-14 15:11:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-14 15:11:39,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:39,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:39,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:39,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:11:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-04-14 15:11:39,233 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-04-14 15:11:39,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:39,233 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-04-14 15:11:39,233 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 15:11:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-14 15:11:39,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-14 15:11:39,234 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:39,234 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:39,259 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 15:11:39,456 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:39,457 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:39,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:39,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1909341660, now seen corresponding path program 3 times [2022-04-14 15:11:39,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:39,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510820271] [2022-04-14 15:11:39,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:39,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:39,469 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:39,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [681123823] [2022-04-14 15:11:39,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:11:39,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:39,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:39,470 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 15:11:39,494 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 15:11:39,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-14 15:11:39,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:11:39,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-14 15:11:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:39,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:39,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-14 15:11:39,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {4204#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; {4204#true} is VALID [2022-04-14 15:11:39,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:39,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-14 15:11:39,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-14 15:11:39,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {4204#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:39,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:39,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:39,836 INFO L272 TraceCheckUtils]: 8: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:39,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:39,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:39,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:39,838 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:39,838 INFO L272 TraceCheckUtils]: 13: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:39,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:39,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:39,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:39,839 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:39,839 INFO L272 TraceCheckUtils]: 18: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:39,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:39,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:39,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:39,840 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:39,840 INFO L272 TraceCheckUtils]: 23: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:39,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:39,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:39,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:39,843 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:39,844 INFO L272 TraceCheckUtils]: 28: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:39,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:39,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:39,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:39,845 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:11:39,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:11:39,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:11:39,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} assume !!(#t~post5 < 50);havoc #t~post5; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:11:39,846 INFO L272 TraceCheckUtils]: 36: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:39,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:39,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:39,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:39,847 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #59#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:11:39,848 INFO L272 TraceCheckUtils]: 41: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:39,848 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:39,848 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:39,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:39,849 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #61#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:11:39,849 INFO L272 TraceCheckUtils]: 46: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:39,849 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:39,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:39,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:39,850 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #63#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:11:39,851 INFO L272 TraceCheckUtils]: 51: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:39,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:39,852 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-14 15:11:39,852 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-14 15:11:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-14 15:11:39,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:11:40,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-14 15:11:40,132 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-14 15:11:40,132 INFO L290 TraceCheckUtils]: 52: Hoare triple {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:40,133 INFO L272 TraceCheckUtils]: 51: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:40,133 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #63#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:11:40,134 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:40,134 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:40,134 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:40,134 INFO L272 TraceCheckUtils]: 46: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:40,134 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #61#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:11:40,134 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:40,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:40,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:40,135 INFO L272 TraceCheckUtils]: 41: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:40,135 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #59#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:11:40,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:40,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:40,136 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:40,136 INFO L272 TraceCheckUtils]: 36: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:40,136 INFO L290 TraceCheckUtils]: 35: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:11:40,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:11:40,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:11:40,141 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #67#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:11:40,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:40,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:40,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:40,142 INFO L272 TraceCheckUtils]: 28: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:40,142 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #65#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:11:40,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:40,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:40,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:40,143 INFO L272 TraceCheckUtils]: 23: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:40,143 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #63#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:11:40,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:40,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:40,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:40,144 INFO L272 TraceCheckUtils]: 18: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:40,144 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #61#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:11:40,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:40,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:40,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:40,145 INFO L272 TraceCheckUtils]: 13: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:40,145 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #59#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:11:40,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:40,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-14 15:11:40,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-14 15:11:40,146 INFO L272 TraceCheckUtils]: 8: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-14 15:11:40,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(#t~post5 < 50);havoc #t~post5; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:11:40,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:11:40,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {4204#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:11:40,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-14 15:11:40,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-14 15:11:40,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-14 15:11:40,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {4204#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; {4204#true} is VALID [2022-04-14 15:11:40,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-14 15:11:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-14 15:11:40,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:40,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510820271] [2022-04-14 15:11:40,149 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:40,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681123823] [2022-04-14 15:11:40,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681123823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:11:40,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:11:40,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 15:11:40,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481350041] [2022-04-14 15:11:40,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:11:40,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-14 15:11:40,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:40,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 15:11:40,211 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 15:11:40,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:11:40,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:40,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:11:40,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:11:40,212 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 15:11:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:41,194 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2022-04-14 15:11:41,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:11:41,194 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-14 15:11:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 15:11:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-14 15:11:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 15:11:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-14 15:11:41,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-14 15:11:41,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:41,311 INFO L225 Difference]: With dead ends: 146 [2022-04-14 15:11:41,311 INFO L226 Difference]: Without dead ends: 135 [2022-04-14 15:11:41,311 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:11:41,312 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:41,312 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 120 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-14 15:11:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-14 15:11:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-04-14 15:11:41,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:41,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-14 15:11:41,356 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-14 15:11:41,357 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-14 15:11:41,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:41,360 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-14 15:11:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-14 15:11:41,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:41,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:41,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 135 states. [2022-04-14 15:11:41,361 INFO L87 Difference]: Start difference. First operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 135 states. [2022-04-14 15:11:41,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:41,364 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-14 15:11:41,364 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-14 15:11:41,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:41,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:41,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:41,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-14 15:11:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-04-14 15:11:41,368 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 55 [2022-04-14 15:11:41,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:41,369 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-04-14 15:11:41,369 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 15:11:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-14 15:11:41,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-14 15:11:41,369 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:41,370 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:11:41,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-14 15:11:41,583 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:41,583 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:41,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-14 15:11:41,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:41,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817629606] [2022-04-14 15:11:41,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:41,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:41,595 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:41,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [234940750] [2022-04-14 15:11:41,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:41,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:41,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:41,596 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 15:11:41,605 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 15:11:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:41,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-14 15:11:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:41,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:48,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-14 15:11:48,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {5223#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; {5223#true} is VALID [2022-04-14 15:11:48,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:48,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-14 15:11:48,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-14 15:11:48,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {5223#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:11:48,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:11:48,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:11:48,128 INFO L272 TraceCheckUtils]: 8: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:48,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:48,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:48,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:48,129 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #59#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:11:48,129 INFO L272 TraceCheckUtils]: 13: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:48,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:48,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:48,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:48,130 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #61#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:11:48,130 INFO L272 TraceCheckUtils]: 18: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:48,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:48,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:48,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:48,131 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #63#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:11:48,131 INFO L272 TraceCheckUtils]: 23: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:48,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:48,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:48,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:48,131 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #65#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:11:48,131 INFO L272 TraceCheckUtils]: 28: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:48,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:48,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:48,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:48,132 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #67#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:11:48,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:48,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:48,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:48,134 INFO L272 TraceCheckUtils]: 36: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:48,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:48,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:48,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:48,134 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #59#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:48,134 INFO L272 TraceCheckUtils]: 41: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:48,134 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:48,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:48,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:48,135 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #61#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:48,135 INFO L272 TraceCheckUtils]: 46: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:48,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:48,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:48,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:48,136 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #63#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:48,136 INFO L272 TraceCheckUtils]: 51: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:48,136 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:48,136 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:48,136 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:48,137 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #65#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:48,137 INFO L272 TraceCheckUtils]: 56: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:48,137 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:48,137 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:48,137 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:48,137 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #67#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:48,138 INFO L290 TraceCheckUtils]: 61: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-14 15:11:48,138 INFO L272 TraceCheckUtils]: 62: Hoare triple {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:48,138 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:48,138 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:48,139 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:48,139 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5223#true} {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #69#return; {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-14 15:11:48,140 INFO L272 TraceCheckUtils]: 67: Hoare triple {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:48,140 INFO L290 TraceCheckUtils]: 68: Hoare triple {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5436#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:48,140 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-14 15:11:48,140 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-14 15:11:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-14 15:11:48,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:11:49,018 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-14 15:11:49,019 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-14 15:11:49,019 INFO L290 TraceCheckUtils]: 68: Hoare triple {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5436#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:49,020 INFO L272 TraceCheckUtils]: 67: Hoare triple {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:49,020 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5223#true} {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} #69#return; {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-14 15:11:49,020 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:49,020 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:49,020 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:49,020 INFO L272 TraceCheckUtils]: 62: Hoare triple {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:49,021 INFO L290 TraceCheckUtils]: 61: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} assume !(~n~0 <= ~a~0); {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-14 15:11:49,021 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #67#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:11:49,021 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:49,021 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:49,022 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:49,022 INFO L272 TraceCheckUtils]: 56: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:49,022 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #65#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:11:49,022 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:49,022 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:49,022 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:49,022 INFO L272 TraceCheckUtils]: 51: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:49,023 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #63#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:11:49,023 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:49,023 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:49,023 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:49,023 INFO L272 TraceCheckUtils]: 46: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:49,026 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #61#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:11:49,026 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:49,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:49,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:49,026 INFO L272 TraceCheckUtils]: 41: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:49,026 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #59#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:11:49,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:49,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:49,027 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:49,027 INFO L272 TraceCheckUtils]: 36: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:49,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} assume !!(#t~post5 < 50);havoc #t~post5; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:11:49,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:11:49,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:11:49,032 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #67#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:11:49,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:49,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:49,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:49,032 INFO L272 TraceCheckUtils]: 28: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:49,033 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #65#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:11:49,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:49,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:49,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:49,033 INFO L272 TraceCheckUtils]: 23: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:49,034 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #63#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:11:49,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:49,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:49,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:49,034 INFO L272 TraceCheckUtils]: 18: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:49,035 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #61#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:11:49,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:49,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:49,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:49,035 INFO L272 TraceCheckUtils]: 13: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:49,036 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #59#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:11:49,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:49,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-14 15:11:49,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-14 15:11:49,036 INFO L272 TraceCheckUtils]: 8: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-14 15:11:49,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} assume !!(#t~post5 < 50);havoc #t~post5; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:11:49,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:11:49,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {5223#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:11:49,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-14 15:11:49,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-14 15:11:49,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-14 15:11:49,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {5223#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; {5223#true} is VALID [2022-04-14 15:11:49,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-14 15:11:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-14 15:11:49,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:11:49,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817629606] [2022-04-14 15:11:49,039 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:11:49,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234940750] [2022-04-14 15:11:49,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234940750] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:11:49,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:11:49,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-14 15:11:49,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737278733] [2022-04-14 15:11:49,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:11:49,040 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-14 15:11:49,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:11:49,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 15:11:49,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:49,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 15:11:49,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:11:49,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 15:11:49,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:11:49,122 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 15:11:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:50,258 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2022-04-14 15:11:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 15:11:50,258 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-14 15:11:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:11:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 15:11:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-14 15:11:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 15:11:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-14 15:11:50,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 92 transitions. [2022-04-14 15:11:50,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:11:50,373 INFO L225 Difference]: With dead ends: 148 [2022-04-14 15:11:50,373 INFO L226 Difference]: Without dead ends: 144 [2022-04-14 15:11:50,374 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:11:50,374 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-14 15:11:50,374 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 189 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 15:11:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-14 15:11:50,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-04-14 15:11:50,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:11:50,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-14 15:11:50,473 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-14 15:11:50,474 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-14 15:11:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:50,477 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-14 15:11:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-14 15:11:50,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:50,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:50,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 144 states. [2022-04-14 15:11:50,478 INFO L87 Difference]: Start difference. First operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 144 states. [2022-04-14 15:11:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:11:50,482 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-14 15:11:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-14 15:11:50,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:11:50,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:11:50,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:11:50,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:11:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-14 15:11:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-04-14 15:11:50,486 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 71 [2022-04-14 15:11:50,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:11:50,487 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-04-14 15:11:50,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 15:11:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-04-14 15:11:50,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-14 15:11:50,488 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:11:50,488 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 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 15:11:50,512 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 15:11:50,702 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,SelfDestructingSolverStorable10 [2022-04-14 15:11:50,703 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:11:50,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:11:50,703 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-14 15:11:50,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:11:50,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629278391] [2022-04-14 15:11:50,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:50,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:11:50,714 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:11:50,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [598647739] [2022-04-14 15:11:50,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:11:50,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:11:50,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:11:50,715 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 15:11:50,719 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 15:11:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:50,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-14 15:11:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:11:50,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:11:51,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {6368#true} call ULTIMATE.init(); {6368#true} is VALID [2022-04-14 15:11:51,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {6368#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; {6368#true} is VALID [2022-04-14 15:11:51,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:51,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6368#true} {6368#true} #81#return; {6368#true} is VALID [2022-04-14 15:11:51,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {6368#true} call #t~ret6 := main(); {6368#true} is VALID [2022-04-14 15:11:51,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {6368#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:11:51,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:11:51,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(#t~post5 < 50);havoc #t~post5; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:11:51,455 INFO L272 TraceCheckUtils]: 8: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:51,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:51,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:51,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:51,456 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #59#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:11:51,456 INFO L272 TraceCheckUtils]: 13: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:51,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:51,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:51,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:51,457 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #61#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:11:51,457 INFO L272 TraceCheckUtils]: 18: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:51,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:51,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:51,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:51,458 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #63#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:11:51,458 INFO L272 TraceCheckUtils]: 23: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:51,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:51,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:51,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:51,459 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #65#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:11:51,459 INFO L272 TraceCheckUtils]: 28: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:51,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:51,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:51,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:51,459 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #67#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-14 15:11:51,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:51,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:51,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:51,462 INFO L272 TraceCheckUtils]: 36: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:51,462 INFO L290 TraceCheckUtils]: 37: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:51,462 INFO L290 TraceCheckUtils]: 38: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:51,462 INFO L290 TraceCheckUtils]: 39: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:51,462 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #59#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:51,463 INFO L272 TraceCheckUtils]: 41: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:51,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:51,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:51,463 INFO L290 TraceCheckUtils]: 44: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:51,463 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #61#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:51,464 INFO L272 TraceCheckUtils]: 46: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:51,464 INFO L290 TraceCheckUtils]: 47: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:51,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:51,464 INFO L290 TraceCheckUtils]: 49: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:51,464 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #63#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:51,464 INFO L272 TraceCheckUtils]: 51: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:51,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:51,465 INFO L290 TraceCheckUtils]: 53: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:51,465 INFO L290 TraceCheckUtils]: 54: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:51,465 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #65#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:51,465 INFO L272 TraceCheckUtils]: 56: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:51,466 INFO L290 TraceCheckUtils]: 57: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:51,466 INFO L290 TraceCheckUtils]: 58: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:51,466 INFO L290 TraceCheckUtils]: 59: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:51,466 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #67#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:11:51,467 INFO L290 TraceCheckUtils]: 61: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-14 15:11:51,467 INFO L272 TraceCheckUtils]: 62: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:51,467 INFO L290 TraceCheckUtils]: 63: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:51,467 INFO L290 TraceCheckUtils]: 64: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:51,467 INFO L290 TraceCheckUtils]: 65: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:51,468 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6368#true} {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #69#return; {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-14 15:11:51,468 INFO L272 TraceCheckUtils]: 67: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6368#true} is VALID [2022-04-14 15:11:51,468 INFO L290 TraceCheckUtils]: 68: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-14 15:11:51,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-14 15:11:51,468 INFO L290 TraceCheckUtils]: 70: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-14 15:11:51,469 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6368#true} {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #71#return; {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-14 15:11:51,470 INFO L272 TraceCheckUtils]: 72: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:11:51,471 INFO L290 TraceCheckUtils]: 73: Hoare triple {6592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:11:51,471 INFO L290 TraceCheckUtils]: 74: Hoare triple {6596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6369#false} is VALID [2022-04-14 15:11:51,471 INFO L290 TraceCheckUtils]: 75: Hoare triple {6369#false} assume !false; {6369#false} is VALID [2022-04-14 15:11:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-14 15:11:51,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:12:00,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:12:00,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629278391] [2022-04-14 15:12:00,054 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:12:00,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598647739] [2022-04-14 15:12:00,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598647739] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:12:00,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:12:00,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-14 15:12:00,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790713315] [2022-04-14 15:12:00,055 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:12:00,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-14 15:12:00,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:12:00,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-14 15:12:00,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:12:00,092 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 15:12:00,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:12:00,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 15:12:00,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:12:00,093 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-14 15:12:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:00,605 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2022-04-14 15:12:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:12:00,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-14 15:12:00,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:12:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-14 15:12:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-14 15:12:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-14 15:12:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-14 15:12:00,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-14 15:12:00,687 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 15:12:00,689 INFO L225 Difference]: With dead ends: 143 [2022-04-14 15:12:00,689 INFO L226 Difference]: Without dead ends: 132 [2022-04-14 15:12:00,689 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:12:00,690 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:12:00,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:12:00,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-14 15:12:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-14 15:12:00,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:12:00,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:12:00,771 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:12:00,771 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:12:00,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:00,774 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-14 15:12:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-14 15:12:00,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:00,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:00,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 132 states. [2022-04-14 15:12:00,775 INFO L87 Difference]: Start difference. First operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 132 states. [2022-04-14 15:12:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:00,778 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-14 15:12:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-14 15:12:00,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:00,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:00,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:12:00,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:12:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:12:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-04-14 15:12:00,782 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 76 [2022-04-14 15:12:00,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:12:00,782 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-04-14 15:12:00,782 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-14 15:12:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-14 15:12:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-14 15:12:00,783 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:12:00,783 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:12:00,803 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 15:12:00,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:12:00,999 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:12:01,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:12:01,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1454229731, now seen corresponding path program 4 times [2022-04-14 15:12:01,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:12:01,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091720434] [2022-04-14 15:12:01,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:12:01,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:12:01,010 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:12:01,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [799209734] [2022-04-14 15:12:01,010 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 15:12:01,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:12:01,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:12:01,011 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 15:12:01,039 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 15:12:03,221 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 15:12:03,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:12:03,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-14 15:12:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:12:03,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:12:03,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-14 15:12:03,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#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; {7397#true} is VALID [2022-04-14 15:12:03,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:03,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-14 15:12:03,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-14 15:12:03,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7397#true} is VALID [2022-04-14 15:12:03,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-14 15:12:03,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 50);havoc #t~post5; {7397#true} is VALID [2022-04-14 15:12:03,803 INFO L272 TraceCheckUtils]: 8: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:03,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:03,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:03,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:03,803 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-14 15:12:03,803 INFO L272 TraceCheckUtils]: 13: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:03,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:03,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:03,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:03,805 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7397#true} #61#return; {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 15:12:03,805 INFO L272 TraceCheckUtils]: 18: Hoare triple {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:03,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:03,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:03,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:03,806 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:12:03,806 INFO L272 TraceCheckUtils]: 23: Hoare triple {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:03,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:03,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:03,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:03,807 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7397#true} {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:12:03,807 INFO L272 TraceCheckUtils]: 28: Hoare triple {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:03,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:03,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:03,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:03,808 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7397#true} {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:12:03,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:12:03,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:12:03,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} assume !!(#t~post5 < 50);havoc #t~post5; {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:12:03,818 INFO L272 TraceCheckUtils]: 36: Hoare triple {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:03,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:03,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:03,818 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:03,823 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7397#true} {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #59#return; {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:12:03,824 INFO L272 TraceCheckUtils]: 41: Hoare triple {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:03,824 INFO L290 TraceCheckUtils]: 42: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:03,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:03,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:03,826 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #61#return; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:12:03,826 INFO L272 TraceCheckUtils]: 46: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:03,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:03,827 INFO L290 TraceCheckUtils]: 48: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:03,827 INFO L290 TraceCheckUtils]: 49: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:03,828 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #63#return; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:12:03,828 INFO L272 TraceCheckUtils]: 51: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:03,828 INFO L290 TraceCheckUtils]: 52: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:03,829 INFO L290 TraceCheckUtils]: 53: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:03,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:03,830 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #65#return; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:12:03,830 INFO L272 TraceCheckUtils]: 56: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:03,830 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:03,830 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:03,830 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:03,831 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7397#true} {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #67#return; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:12:03,838 INFO L290 TraceCheckUtils]: 61: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:12:03,839 INFO L290 TraceCheckUtils]: 62: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:12:03,840 INFO L290 TraceCheckUtils]: 63: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} assume !!(#t~post5 < 50);havoc #t~post5; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-14 15:12:03,840 INFO L272 TraceCheckUtils]: 64: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:03,840 INFO L290 TraceCheckUtils]: 65: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:03,840 INFO L290 TraceCheckUtils]: 66: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:03,841 INFO L290 TraceCheckUtils]: 67: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:03,842 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #59#return; {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:12:03,842 INFO L272 TraceCheckUtils]: 69: Hoare triple {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:03,842 INFO L290 TraceCheckUtils]: 70: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:03,842 INFO L290 TraceCheckUtils]: 71: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:03,843 INFO L290 TraceCheckUtils]: 72: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:03,843 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {7627#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:12:03,844 INFO L272 TraceCheckUtils]: 74: Hoare triple {7627#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7631#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:12:03,844 INFO L290 TraceCheckUtils]: 75: Hoare triple {7631#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7635#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:03,845 INFO L290 TraceCheckUtils]: 76: Hoare triple {7635#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-14 15:12:03,845 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-14 15:12:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 104 proven. 43 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-04-14 15:12:03,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:12:04,786 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-14 15:12:04,786 INFO L290 TraceCheckUtils]: 76: Hoare triple {7635#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-14 15:12:04,786 INFO L290 TraceCheckUtils]: 75: Hoare triple {7631#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7635#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:04,787 INFO L272 TraceCheckUtils]: 74: Hoare triple {7627#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7631#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:12:04,788 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7654#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {7627#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:12:04,788 INFO L290 TraceCheckUtils]: 72: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:04,788 INFO L290 TraceCheckUtils]: 71: Hoare triple {7664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:04,788 INFO L290 TraceCheckUtils]: 70: Hoare triple {7397#true} ~cond := #in~cond; {7664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:12:04,789 INFO L272 TraceCheckUtils]: 69: Hoare triple {7654#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:04,789 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {7654#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:12:04,789 INFO L290 TraceCheckUtils]: 67: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:04,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {7664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:04,790 INFO L290 TraceCheckUtils]: 65: Hoare triple {7397#true} ~cond := #in~cond; {7664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:12:04,790 INFO L272 TraceCheckUtils]: 64: Hoare triple {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:04,791 INFO L290 TraceCheckUtils]: 63: Hoare triple {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 50);havoc #t~post5; {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:12:04,791 INFO L290 TraceCheckUtils]: 62: Hoare triple {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:12:05,372 INFO L290 TraceCheckUtils]: 61: Hoare triple {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:12:05,373 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7397#true} {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:12:05,373 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:05,373 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:05,373 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:05,373 INFO L272 TraceCheckUtils]: 56: Hoare triple {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:05,377 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7397#true} #65#return; {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:12:05,378 INFO L290 TraceCheckUtils]: 54: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:05,378 INFO L290 TraceCheckUtils]: 53: Hoare triple {7664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:05,378 INFO L290 TraceCheckUtils]: 52: Hoare triple {7397#true} ~cond := #in~cond; {7664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:12:05,379 INFO L272 TraceCheckUtils]: 51: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:05,379 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-14 15:12:05,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:05,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:05,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:05,379 INFO L272 TraceCheckUtils]: 46: Hoare triple {7397#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:05,379 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-14 15:12:05,379 INFO L290 TraceCheckUtils]: 44: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:05,379 INFO L290 TraceCheckUtils]: 43: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:05,379 INFO L290 TraceCheckUtils]: 42: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:05,379 INFO L272 TraceCheckUtils]: 41: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:05,379 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-14 15:12:05,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:05,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:05,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:05,380 INFO L272 TraceCheckUtils]: 36: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:05,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {7397#true} assume !!(#t~post5 < 50);havoc #t~post5; {7397#true} is VALID [2022-04-14 15:12:05,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-14 15:12:05,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {7397#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7397#true} is VALID [2022-04-14 15:12:05,380 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7397#true} {7397#true} #67#return; {7397#true} is VALID [2022-04-14 15:12:05,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:05,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:05,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:05,380 INFO L272 TraceCheckUtils]: 28: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:05,381 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7397#true} {7397#true} #65#return; {7397#true} is VALID [2022-04-14 15:12:05,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:05,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:05,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:05,381 INFO L272 TraceCheckUtils]: 23: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:05,381 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-14 15:12:05,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:05,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:05,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:05,381 INFO L272 TraceCheckUtils]: 18: Hoare triple {7397#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:05,382 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-14 15:12:05,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:05,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:05,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:05,382 INFO L272 TraceCheckUtils]: 13: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:05,382 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-14 15:12:05,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:05,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-14 15:12:05,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-14 15:12:05,382 INFO L272 TraceCheckUtils]: 8: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-14 15:12:05,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 50);havoc #t~post5; {7397#true} is VALID [2022-04-14 15:12:05,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-14 15:12:05,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7397#true} is VALID [2022-04-14 15:12:05,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-14 15:12:05,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-14 15:12:05,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-14 15:12:05,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#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; {7397#true} is VALID [2022-04-14 15:12:05,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-14 15:12:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-04-14 15:12:05,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:12:05,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091720434] [2022-04-14 15:12:05,384 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:12:05,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799209734] [2022-04-14 15:12:05,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799209734] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:12:05,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:12:05,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2022-04-14 15:12:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225880087] [2022-04-14 15:12:05,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:12:05,385 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 78 [2022-04-14 15:12:05,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:12:05,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-14 15:12:06,062 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 15:12:06,062 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-14 15:12:06,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:12:06,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-14 15:12:06,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:12:06,063 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-14 15:12:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:07,437 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2022-04-14 15:12:07,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:12:07,438 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 78 [2022-04-14 15:12:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:12:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-14 15:12:07,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-14 15:12:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-14 15:12:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-14 15:12:07,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-14 15:12:07,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:12:07,496 INFO L225 Difference]: With dead ends: 142 [2022-04-14 15:12:07,496 INFO L226 Difference]: Without dead ends: 138 [2022-04-14 15:12:07,497 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-14 15:12:07,497 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-14 15:12:07,497 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 88 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-14 15:12:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-14 15:12:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-04-14 15:12:07,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:12:07,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:12:07,598 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:12:07,598 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:12:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:07,600 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-14 15:12:07,600 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-14 15:12:07,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:07,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:07,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 138 states. [2022-04-14 15:12:07,601 INFO L87 Difference]: Start difference. First operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 138 states. [2022-04-14 15:12:07,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:07,604 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-14 15:12:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-14 15:12:07,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:07,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:07,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:12:07,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:12:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:12:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-04-14 15:12:07,608 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 78 [2022-04-14 15:12:07,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:12:07,608 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-04-14 15:12:07,609 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-14 15:12:07,609 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-14 15:12:07,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-14 15:12:07,610 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:12:07,610 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:12:07,623 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 15:12:07,827 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,SelfDestructingSolverStorable12 [2022-04-14 15:12:07,827 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:12:07,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:12:07,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 2 times [2022-04-14 15:12:07,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:12:07,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253923672] [2022-04-14 15:12:07,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:12:07,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:12:07,849 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:12:07,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1390711710] [2022-04-14 15:12:07,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:12:07,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:12:07,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:12:07,851 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 15:12:07,858 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 15:12:07,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:12:07,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:12:07,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-14 15:12:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:12:07,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:12:08,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {8554#true} call ULTIMATE.init(); {8554#true} is VALID [2022-04-14 15:12:08,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {8554#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; {8554#true} is VALID [2022-04-14 15:12:08,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8554#true} {8554#true} #81#return; {8554#true} is VALID [2022-04-14 15:12:08,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {8554#true} call #t~ret6 := main(); {8554#true} is VALID [2022-04-14 15:12:08,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {8554#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:08,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:08,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:08,535 INFO L272 TraceCheckUtils]: 8: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,535 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8554#true} {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:08,535 INFO L272 TraceCheckUtils]: 13: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,536 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8554#true} {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:08,536 INFO L272 TraceCheckUtils]: 18: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,537 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8554#true} {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:08,537 INFO L272 TraceCheckUtils]: 23: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,539 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8554#true} {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:08,539 INFO L272 TraceCheckUtils]: 28: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,540 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8554#true} {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:08,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-14 15:12:08,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-14 15:12:08,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-14 15:12:08,541 INFO L272 TraceCheckUtils]: 36: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,542 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8554#true} {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #59#return; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-14 15:12:08,542 INFO L272 TraceCheckUtils]: 41: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,542 INFO L290 TraceCheckUtils]: 44: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,543 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8554#true} {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #61#return; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-14 15:12:08,543 INFO L272 TraceCheckUtils]: 46: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,543 INFO L290 TraceCheckUtils]: 47: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,544 INFO L290 TraceCheckUtils]: 48: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,544 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8554#true} {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #63#return; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-14 15:12:08,544 INFO L272 TraceCheckUtils]: 51: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,544 INFO L290 TraceCheckUtils]: 52: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,544 INFO L290 TraceCheckUtils]: 53: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,544 INFO L290 TraceCheckUtils]: 54: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,545 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8554#true} {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #65#return; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-14 15:12:08,545 INFO L272 TraceCheckUtils]: 56: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,545 INFO L290 TraceCheckUtils]: 57: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,545 INFO L290 TraceCheckUtils]: 58: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,545 INFO L290 TraceCheckUtils]: 59: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,546 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8554#true} {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #67#return; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-14 15:12:08,546 INFO L290 TraceCheckUtils]: 61: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:12:08,546 INFO L290 TraceCheckUtils]: 62: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:12:08,547 INFO L290 TraceCheckUtils]: 63: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:12:08,547 INFO L272 TraceCheckUtils]: 64: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,547 INFO L290 TraceCheckUtils]: 65: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,547 INFO L290 TraceCheckUtils]: 66: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,547 INFO L290 TraceCheckUtils]: 67: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,548 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8554#true} {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #59#return; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:12:08,548 INFO L272 TraceCheckUtils]: 69: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,548 INFO L290 TraceCheckUtils]: 70: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,548 INFO L290 TraceCheckUtils]: 71: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,548 INFO L290 TraceCheckUtils]: 72: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,549 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8554#true} {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #61#return; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:12:08,549 INFO L272 TraceCheckUtils]: 74: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,549 INFO L290 TraceCheckUtils]: 75: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,549 INFO L290 TraceCheckUtils]: 76: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,549 INFO L290 TraceCheckUtils]: 77: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,549 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {8554#true} {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #63#return; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:12:08,549 INFO L272 TraceCheckUtils]: 79: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,549 INFO L290 TraceCheckUtils]: 80: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,550 INFO L290 TraceCheckUtils]: 81: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,550 INFO L290 TraceCheckUtils]: 82: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,550 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {8554#true} {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #65#return; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:12:08,550 INFO L272 TraceCheckUtils]: 84: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,550 INFO L290 TraceCheckUtils]: 85: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,550 INFO L290 TraceCheckUtils]: 86: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,550 INFO L290 TraceCheckUtils]: 87: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,551 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8554#true} {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #67#return; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-14 15:12:08,551 INFO L290 TraceCheckUtils]: 89: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} assume !(~n~0 <= ~a~0); {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} is VALID [2022-04-14 15:12:08,551 INFO L272 TraceCheckUtils]: 90: Hoare triple {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,551 INFO L290 TraceCheckUtils]: 91: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,551 INFO L290 TraceCheckUtils]: 92: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,551 INFO L290 TraceCheckUtils]: 93: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,552 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8554#true} {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} #69#return; {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} is VALID [2022-04-14 15:12:08,552 INFO L272 TraceCheckUtils]: 95: Hoare triple {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {8554#true} is VALID [2022-04-14 15:12:08,552 INFO L290 TraceCheckUtils]: 96: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-14 15:12:08,552 INFO L290 TraceCheckUtils]: 97: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-14 15:12:08,552 INFO L290 TraceCheckUtils]: 98: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-14 15:12:08,553 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {8554#true} {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} #71#return; {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} is VALID [2022-04-14 15:12:08,553 INFO L272 TraceCheckUtils]: 100: Hoare triple {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {8863#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:12:08,554 INFO L290 TraceCheckUtils]: 101: Hoare triple {8863#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8867#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:08,554 INFO L290 TraceCheckUtils]: 102: Hoare triple {8867#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8555#false} is VALID [2022-04-14 15:12:08,554 INFO L290 TraceCheckUtils]: 103: Hoare triple {8555#false} assume !false; {8555#false} is VALID [2022-04-14 15:12:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-14 15:12:08,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:12:14,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:12:14,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253923672] [2022-04-14 15:12:14,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:12:14,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390711710] [2022-04-14 15:12:14,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390711710] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:12:14,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:12:14,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-14 15:12:14,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596418026] [2022-04-14 15:12:14,928 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:12:14,928 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-04-14 15:12:14,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:12:14,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:12:14,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:12:14,978 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:12:14,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:12:14,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:12:14,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:12:14,979 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:12:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:15,840 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-04-14 15:12:15,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 15:12:15,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-04-14 15:12:15,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:12:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:12:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-14 15:12:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:12:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-14 15:12:15,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-14 15:12:15,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:12:15,938 INFO L225 Difference]: With dead ends: 140 [2022-04-14 15:12:15,938 INFO L226 Difference]: Without dead ends: 129 [2022-04-14 15:12:15,939 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-14 15:12:15,939 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 15:12:15,939 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 15:12:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-14 15:12:16,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-14 15:12:16,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:12:16,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 15:12:16,034 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 15:12:16,035 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 15:12:16,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:16,037 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-14 15:12:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-14 15:12:16,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:16,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:16,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 129 states. [2022-04-14 15:12:16,038 INFO L87 Difference]: Start difference. First operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 129 states. [2022-04-14 15:12:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:16,041 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-14 15:12:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-14 15:12:16,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:16,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:16,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:12:16,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:12:16,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 15:12:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-04-14 15:12:16,044 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [2022-04-14 15:12:16,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:12:16,045 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-04-14 15:12:16,045 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:12:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-14 15:12:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-14 15:12:16,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:12:16,046 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:12:16,069 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 15:12:16,269 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,SelfDestructingSolverStorable13 [2022-04-14 15:12:16,269 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:12:16,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:12:16,270 INFO L85 PathProgramCache]: Analyzing trace with hash -813840784, now seen corresponding path program 2 times [2022-04-14 15:12:16,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:12:16,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150658833] [2022-04-14 15:12:16,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:12:16,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:12:16,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:12:16,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217775766] [2022-04-14 15:12:16,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:12:16,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:12:16,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:12:16,283 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 15:12:16,303 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 15:12:16,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:12:16,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:12:16,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 15:12:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:12:16,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:12:17,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {9650#true} call ULTIMATE.init(); {9650#true} is VALID [2022-04-14 15:12:17,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {9650#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; {9650#true} is VALID [2022-04-14 15:12:17,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9650#true} {9650#true} #81#return; {9650#true} is VALID [2022-04-14 15:12:17,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {9650#true} call #t~ret6 := main(); {9650#true} is VALID [2022-04-14 15:12:17,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {9650#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:17,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:17,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:17,164 INFO L272 TraceCheckUtils]: 8: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,165 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9650#true} {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:17,165 INFO L272 TraceCheckUtils]: 13: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,166 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9650#true} {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:17,166 INFO L272 TraceCheckUtils]: 18: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,167 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9650#true} {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:17,167 INFO L272 TraceCheckUtils]: 23: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,168 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9650#true} {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:17,168 INFO L272 TraceCheckUtils]: 28: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,169 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9650#true} {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:17,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-14 15:12:17,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-14 15:12:17,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-14 15:12:17,170 INFO L272 TraceCheckUtils]: 36: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,171 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9650#true} {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #59#return; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-14 15:12:17,171 INFO L272 TraceCheckUtils]: 41: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,172 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9650#true} {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #61#return; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-14 15:12:17,172 INFO L272 TraceCheckUtils]: 46: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,172 INFO L290 TraceCheckUtils]: 47: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,173 INFO L290 TraceCheckUtils]: 48: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,173 INFO L290 TraceCheckUtils]: 49: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,173 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9650#true} {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #63#return; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-14 15:12:17,173 INFO L272 TraceCheckUtils]: 51: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,173 INFO L290 TraceCheckUtils]: 52: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,174 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9650#true} {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #65#return; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-14 15:12:17,174 INFO L272 TraceCheckUtils]: 56: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,174 INFO L290 TraceCheckUtils]: 57: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,174 INFO L290 TraceCheckUtils]: 58: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,175 INFO L290 TraceCheckUtils]: 59: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,175 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9650#true} {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #67#return; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-14 15:12:17,176 INFO L290 TraceCheckUtils]: 61: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-14 15:12:17,177 INFO L290 TraceCheckUtils]: 62: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-14 15:12:17,177 INFO L290 TraceCheckUtils]: 63: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} assume !!(#t~post5 < 50);havoc #t~post5; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-14 15:12:17,177 INFO L272 TraceCheckUtils]: 64: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,177 INFO L290 TraceCheckUtils]: 65: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,177 INFO L290 TraceCheckUtils]: 66: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,178 INFO L290 TraceCheckUtils]: 67: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,178 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9650#true} {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #59#return; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-14 15:12:17,178 INFO L272 TraceCheckUtils]: 69: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,178 INFO L290 TraceCheckUtils]: 70: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,179 INFO L290 TraceCheckUtils]: 71: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,179 INFO L290 TraceCheckUtils]: 72: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,183 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9650#true} {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #61#return; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-14 15:12:17,184 INFO L272 TraceCheckUtils]: 74: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,184 INFO L290 TraceCheckUtils]: 75: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,184 INFO L290 TraceCheckUtils]: 76: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,184 INFO L290 TraceCheckUtils]: 77: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,184 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {9650#true} {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #63#return; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-14 15:12:17,185 INFO L272 TraceCheckUtils]: 79: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,185 INFO L290 TraceCheckUtils]: 80: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,185 INFO L290 TraceCheckUtils]: 81: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,185 INFO L290 TraceCheckUtils]: 82: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,186 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {9650#true} {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #65#return; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-14 15:12:17,186 INFO L272 TraceCheckUtils]: 84: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,186 INFO L290 TraceCheckUtils]: 85: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,186 INFO L290 TraceCheckUtils]: 86: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,186 INFO L290 TraceCheckUtils]: 87: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,187 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9650#true} {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #67#return; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-14 15:12:17,187 INFO L290 TraceCheckUtils]: 89: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:12:17,188 INFO L290 TraceCheckUtils]: 90: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:12:17,188 INFO L290 TraceCheckUtils]: 91: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} assume !!(#t~post5 < 50);havoc #t~post5; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:12:17,188 INFO L272 TraceCheckUtils]: 92: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,188 INFO L290 TraceCheckUtils]: 93: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,189 INFO L290 TraceCheckUtils]: 94: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,189 INFO L290 TraceCheckUtils]: 95: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,189 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {9650#true} {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #59#return; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:12:17,189 INFO L272 TraceCheckUtils]: 97: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,189 INFO L290 TraceCheckUtils]: 98: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,190 INFO L290 TraceCheckUtils]: 99: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,190 INFO L290 TraceCheckUtils]: 100: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,190 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9650#true} {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #61#return; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:12:17,190 INFO L272 TraceCheckUtils]: 102: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,190 INFO L290 TraceCheckUtils]: 103: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,190 INFO L290 TraceCheckUtils]: 104: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,191 INFO L290 TraceCheckUtils]: 105: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,191 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {9650#true} {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #63#return; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:12:17,191 INFO L272 TraceCheckUtils]: 107: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,191 INFO L290 TraceCheckUtils]: 108: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,191 INFO L290 TraceCheckUtils]: 109: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,191 INFO L290 TraceCheckUtils]: 110: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,192 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {9650#true} {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #65#return; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:12:17,192 INFO L272 TraceCheckUtils]: 112: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,192 INFO L290 TraceCheckUtils]: 113: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,192 INFO L290 TraceCheckUtils]: 114: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,192 INFO L290 TraceCheckUtils]: 115: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,193 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {9650#true} {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #67#return; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:12:17,194 INFO L290 TraceCheckUtils]: 117: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} assume !(~n~0 <= ~a~0); {10010#(and (= main_~z~0 24) (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:12:17,194 INFO L272 TraceCheckUtils]: 118: Hoare triple {10010#(and (= main_~z~0 24) (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-14 15:12:17,194 INFO L290 TraceCheckUtils]: 119: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-14 15:12:17,194 INFO L290 TraceCheckUtils]: 120: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-14 15:12:17,194 INFO L290 TraceCheckUtils]: 121: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-14 15:12:17,194 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9650#true} {10010#(and (= main_~z~0 24) (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= main_~x~0 27))} #69#return; {10010#(and (= main_~z~0 24) (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-14 15:12:17,195 INFO L272 TraceCheckUtils]: 123: Hoare triple {10010#(and (= main_~z~0 24) (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10029#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:12:17,196 INFO L290 TraceCheckUtils]: 124: Hoare triple {10029#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10033#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:17,196 INFO L290 TraceCheckUtils]: 125: Hoare triple {10033#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9651#false} is VALID [2022-04-14 15:12:17,196 INFO L290 TraceCheckUtils]: 126: Hoare triple {9651#false} assume !false; {9651#false} is VALID [2022-04-14 15:12:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-14 15:12:17,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:12:17,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:12:17,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150658833] [2022-04-14 15:12:17,585 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:12:17,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217775766] [2022-04-14 15:12:17,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217775766] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:12:17,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:12:17,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-14 15:12:17,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719668046] [2022-04-14 15:12:17,586 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:12:17,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-04-14 15:12:17,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:12:17,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-14 15:12:17,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:12:17,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 15:12:17,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:12:17,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 15:12:17,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:12:17,664 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-14 15:12:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:18,979 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2022-04-14 15:12:18,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 15:12:18,980 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-04-14 15:12:18,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:12:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-14 15:12:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-14 15:12:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-14 15:12:18,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-14 15:12:18,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-14 15:12:19,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:12:19,102 INFO L225 Difference]: With dead ends: 152 [2022-04-14 15:12:19,102 INFO L226 Difference]: Without dead ends: 150 [2022-04-14 15:12:19,102 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:12:19,103 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-14 15:12:19,103 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 223 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-14 15:12:19,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-14 15:12:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-14 15:12:19,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:12:19,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 15:12:19,218 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 15:12:19,219 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 15:12:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:19,222 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-14 15:12:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-14 15:12:19,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:19,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:19,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 150 states. [2022-04-14 15:12:19,223 INFO L87 Difference]: Start difference. First operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 150 states. [2022-04-14 15:12:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:19,227 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-14 15:12:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-14 15:12:19,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:19,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:19,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:12:19,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:12:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 15:12:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2022-04-14 15:12:19,234 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 127 [2022-04-14 15:12:19,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:12:19,234 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2022-04-14 15:12:19,235 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-14 15:12:19,235 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2022-04-14 15:12:19,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-14 15:12:19,236 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:12:19,236 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:12:19,261 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 15:12:19,451 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,SelfDestructingSolverStorable14 [2022-04-14 15:12:19,451 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:12:19,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:12:19,452 INFO L85 PathProgramCache]: Analyzing trace with hash -167438485, now seen corresponding path program 2 times [2022-04-14 15:12:19,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:12:19,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952134454] [2022-04-14 15:12:19,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:12:19,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:12:19,471 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:12:19,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1732609170] [2022-04-14 15:12:19,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:12:19,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:12:19,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:12:19,477 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 15:12:19,508 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 15:12:19,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:12:19,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:12:19,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:12:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:12:19,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:12:20,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {10891#true} call ULTIMATE.init(); {10891#true} is VALID [2022-04-14 15:12:20,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {10891#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; {10899#(<= ~counter~0 0)} is VALID [2022-04-14 15:12:20,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {10899#(<= ~counter~0 0)} assume true; {10899#(<= ~counter~0 0)} is VALID [2022-04-14 15:12:20,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10899#(<= ~counter~0 0)} {10891#true} #81#return; {10899#(<= ~counter~0 0)} is VALID [2022-04-14 15:12:20,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {10899#(<= ~counter~0 0)} call #t~ret6 := main(); {10899#(<= ~counter~0 0)} is VALID [2022-04-14 15:12:20,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {10899#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10899#(<= ~counter~0 0)} is VALID [2022-04-14 15:12:20,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {10899#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {10915#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,101 INFO L272 TraceCheckUtils]: 8: Hoare triple {10915#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,103 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #59#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,103 INFO L272 TraceCheckUtils]: 13: Hoare triple {10915#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,104 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #61#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,105 INFO L272 TraceCheckUtils]: 18: Hoare triple {10915#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,106 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #63#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,107 INFO L272 TraceCheckUtils]: 23: Hoare triple {10915#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,108 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #65#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,108 INFO L272 TraceCheckUtils]: 28: Hoare triple {10915#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,110 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #67#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {10915#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10915#(<= ~counter~0 1)} is VALID [2022-04-14 15:12:20,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {10915#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {11000#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,111 INFO L272 TraceCheckUtils]: 36: Hoare triple {11000#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,112 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #59#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,113 INFO L272 TraceCheckUtils]: 41: Hoare triple {11000#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,113 INFO L290 TraceCheckUtils]: 44: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,127 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #61#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,128 INFO L272 TraceCheckUtils]: 46: Hoare triple {11000#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,128 INFO L290 TraceCheckUtils]: 47: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,128 INFO L290 TraceCheckUtils]: 48: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,129 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #63#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,130 INFO L272 TraceCheckUtils]: 51: Hoare triple {11000#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,130 INFO L290 TraceCheckUtils]: 52: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,131 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #65#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,132 INFO L272 TraceCheckUtils]: 56: Hoare triple {11000#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,132 INFO L290 TraceCheckUtils]: 57: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,132 INFO L290 TraceCheckUtils]: 58: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,133 INFO L290 TraceCheckUtils]: 59: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,133 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #67#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,134 INFO L290 TraceCheckUtils]: 61: Hoare triple {11000#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11000#(<= ~counter~0 2)} is VALID [2022-04-14 15:12:20,134 INFO L290 TraceCheckUtils]: 62: Hoare triple {11000#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,135 INFO L290 TraceCheckUtils]: 63: Hoare triple {11085#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,135 INFO L272 TraceCheckUtils]: 64: Hoare triple {11085#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,135 INFO L290 TraceCheckUtils]: 65: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,136 INFO L290 TraceCheckUtils]: 66: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,136 INFO L290 TraceCheckUtils]: 67: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,137 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #59#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,137 INFO L272 TraceCheckUtils]: 69: Hoare triple {11085#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,137 INFO L290 TraceCheckUtils]: 70: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,138 INFO L290 TraceCheckUtils]: 71: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,138 INFO L290 TraceCheckUtils]: 72: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,139 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #61#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,139 INFO L272 TraceCheckUtils]: 74: Hoare triple {11085#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,140 INFO L290 TraceCheckUtils]: 75: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,140 INFO L290 TraceCheckUtils]: 76: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,140 INFO L290 TraceCheckUtils]: 77: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,141 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #63#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,141 INFO L272 TraceCheckUtils]: 79: Hoare triple {11085#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,142 INFO L290 TraceCheckUtils]: 80: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,142 INFO L290 TraceCheckUtils]: 81: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,142 INFO L290 TraceCheckUtils]: 82: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,143 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #65#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,143 INFO L272 TraceCheckUtils]: 84: Hoare triple {11085#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,144 INFO L290 TraceCheckUtils]: 85: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,144 INFO L290 TraceCheckUtils]: 86: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,144 INFO L290 TraceCheckUtils]: 87: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,145 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #67#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,145 INFO L290 TraceCheckUtils]: 89: Hoare triple {11085#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11085#(<= ~counter~0 3)} is VALID [2022-04-14 15:12:20,146 INFO L290 TraceCheckUtils]: 90: Hoare triple {11085#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,146 INFO L290 TraceCheckUtils]: 91: Hoare triple {11170#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,147 INFO L272 TraceCheckUtils]: 92: Hoare triple {11170#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,147 INFO L290 TraceCheckUtils]: 93: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,147 INFO L290 TraceCheckUtils]: 94: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,148 INFO L290 TraceCheckUtils]: 95: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,148 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #59#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,149 INFO L272 TraceCheckUtils]: 97: Hoare triple {11170#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,149 INFO L290 TraceCheckUtils]: 98: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,149 INFO L290 TraceCheckUtils]: 99: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,150 INFO L290 TraceCheckUtils]: 100: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,150 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #61#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,151 INFO L272 TraceCheckUtils]: 102: Hoare triple {11170#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,151 INFO L290 TraceCheckUtils]: 103: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,151 INFO L290 TraceCheckUtils]: 104: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,152 INFO L290 TraceCheckUtils]: 105: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,152 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #63#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,153 INFO L272 TraceCheckUtils]: 107: Hoare triple {11170#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,153 INFO L290 TraceCheckUtils]: 108: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,153 INFO L290 TraceCheckUtils]: 109: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,154 INFO L290 TraceCheckUtils]: 110: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,154 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #65#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,155 INFO L272 TraceCheckUtils]: 112: Hoare triple {11170#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,155 INFO L290 TraceCheckUtils]: 113: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,156 INFO L290 TraceCheckUtils]: 114: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,156 INFO L290 TraceCheckUtils]: 115: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,156 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #67#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,157 INFO L290 TraceCheckUtils]: 117: Hoare triple {11170#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11170#(<= ~counter~0 4)} is VALID [2022-04-14 15:12:20,157 INFO L290 TraceCheckUtils]: 118: Hoare triple {11170#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11255#(<= |main_#t~post5| 4)} is VALID [2022-04-14 15:12:20,158 INFO L290 TraceCheckUtils]: 119: Hoare triple {11255#(<= |main_#t~post5| 4)} assume !(#t~post5 < 50);havoc #t~post5; {10892#false} is VALID [2022-04-14 15:12:20,158 INFO L272 TraceCheckUtils]: 120: Hoare triple {10892#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10892#false} is VALID [2022-04-14 15:12:20,158 INFO L290 TraceCheckUtils]: 121: Hoare triple {10892#false} ~cond := #in~cond; {10892#false} is VALID [2022-04-14 15:12:20,158 INFO L290 TraceCheckUtils]: 122: Hoare triple {10892#false} assume !(0 == ~cond); {10892#false} is VALID [2022-04-14 15:12:20,158 INFO L290 TraceCheckUtils]: 123: Hoare triple {10892#false} assume true; {10892#false} is VALID [2022-04-14 15:12:20,158 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10892#false} {10892#false} #69#return; {10892#false} is VALID [2022-04-14 15:12:20,158 INFO L272 TraceCheckUtils]: 125: Hoare triple {10892#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10892#false} is VALID [2022-04-14 15:12:20,158 INFO L290 TraceCheckUtils]: 126: Hoare triple {10892#false} ~cond := #in~cond; {10892#false} is VALID [2022-04-14 15:12:20,158 INFO L290 TraceCheckUtils]: 127: Hoare triple {10892#false} assume 0 == ~cond; {10892#false} is VALID [2022-04-14 15:12:20,158 INFO L290 TraceCheckUtils]: 128: Hoare triple {10892#false} assume !false; {10892#false} is VALID [2022-04-14 15:12:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-14 15:12:20,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:12:20,628 INFO L290 TraceCheckUtils]: 128: Hoare triple {10892#false} assume !false; {10892#false} is VALID [2022-04-14 15:12:20,628 INFO L290 TraceCheckUtils]: 127: Hoare triple {10892#false} assume 0 == ~cond; {10892#false} is VALID [2022-04-14 15:12:20,628 INFO L290 TraceCheckUtils]: 126: Hoare triple {10892#false} ~cond := #in~cond; {10892#false} is VALID [2022-04-14 15:12:20,628 INFO L272 TraceCheckUtils]: 125: Hoare triple {10892#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10892#false} is VALID [2022-04-14 15:12:20,628 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10891#true} {10892#false} #69#return; {10892#false} is VALID [2022-04-14 15:12:20,628 INFO L290 TraceCheckUtils]: 123: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,628 INFO L290 TraceCheckUtils]: 122: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,628 INFO L290 TraceCheckUtils]: 121: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,628 INFO L272 TraceCheckUtils]: 120: Hoare triple {10892#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,629 INFO L290 TraceCheckUtils]: 119: Hoare triple {11313#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {10892#false} is VALID [2022-04-14 15:12:20,629 INFO L290 TraceCheckUtils]: 118: Hoare triple {11317#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11313#(< |main_#t~post5| 50)} is VALID [2022-04-14 15:12:20,629 INFO L290 TraceCheckUtils]: 117: Hoare triple {11317#(< ~counter~0 50)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11317#(< ~counter~0 50)} is VALID [2022-04-14 15:12:20,630 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {10891#true} {11317#(< ~counter~0 50)} #67#return; {11317#(< ~counter~0 50)} is VALID [2022-04-14 15:12:20,630 INFO L290 TraceCheckUtils]: 115: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,630 INFO L290 TraceCheckUtils]: 114: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,630 INFO L290 TraceCheckUtils]: 113: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,630 INFO L272 TraceCheckUtils]: 112: Hoare triple {11317#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,631 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {10891#true} {11317#(< ~counter~0 50)} #65#return; {11317#(< ~counter~0 50)} is VALID [2022-04-14 15:12:20,631 INFO L290 TraceCheckUtils]: 110: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,631 INFO L290 TraceCheckUtils]: 109: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,631 INFO L290 TraceCheckUtils]: 108: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,631 INFO L272 TraceCheckUtils]: 107: Hoare triple {11317#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,631 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {10891#true} {11317#(< ~counter~0 50)} #63#return; {11317#(< ~counter~0 50)} is VALID [2022-04-14 15:12:20,632 INFO L290 TraceCheckUtils]: 105: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,632 INFO L290 TraceCheckUtils]: 104: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,632 INFO L290 TraceCheckUtils]: 103: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,632 INFO L272 TraceCheckUtils]: 102: Hoare triple {11317#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,632 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10891#true} {11317#(< ~counter~0 50)} #61#return; {11317#(< ~counter~0 50)} is VALID [2022-04-14 15:12:20,632 INFO L290 TraceCheckUtils]: 100: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,632 INFO L290 TraceCheckUtils]: 99: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,632 INFO L290 TraceCheckUtils]: 98: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,632 INFO L272 TraceCheckUtils]: 97: Hoare triple {11317#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,633 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {10891#true} {11317#(< ~counter~0 50)} #59#return; {11317#(< ~counter~0 50)} is VALID [2022-04-14 15:12:20,633 INFO L290 TraceCheckUtils]: 95: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,633 INFO L290 TraceCheckUtils]: 94: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,633 INFO L290 TraceCheckUtils]: 93: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,633 INFO L272 TraceCheckUtils]: 92: Hoare triple {11317#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,633 INFO L290 TraceCheckUtils]: 91: Hoare triple {11317#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {11317#(< ~counter~0 50)} is VALID [2022-04-14 15:12:20,634 INFO L290 TraceCheckUtils]: 90: Hoare triple {11402#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11317#(< ~counter~0 50)} is VALID [2022-04-14 15:12:20,634 INFO L290 TraceCheckUtils]: 89: Hoare triple {11402#(< ~counter~0 49)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11402#(< ~counter~0 49)} is VALID [2022-04-14 15:12:20,635 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10891#true} {11402#(< ~counter~0 49)} #67#return; {11402#(< ~counter~0 49)} is VALID [2022-04-14 15:12:20,635 INFO L290 TraceCheckUtils]: 87: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,635 INFO L290 TraceCheckUtils]: 86: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,635 INFO L290 TraceCheckUtils]: 85: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,635 INFO L272 TraceCheckUtils]: 84: Hoare triple {11402#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,636 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {10891#true} {11402#(< ~counter~0 49)} #65#return; {11402#(< ~counter~0 49)} is VALID [2022-04-14 15:12:20,636 INFO L290 TraceCheckUtils]: 82: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,636 INFO L290 TraceCheckUtils]: 81: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,636 INFO L290 TraceCheckUtils]: 80: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,636 INFO L272 TraceCheckUtils]: 79: Hoare triple {11402#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,636 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10891#true} {11402#(< ~counter~0 49)} #63#return; {11402#(< ~counter~0 49)} is VALID [2022-04-14 15:12:20,636 INFO L290 TraceCheckUtils]: 77: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,637 INFO L290 TraceCheckUtils]: 76: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,637 INFO L290 TraceCheckUtils]: 75: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,637 INFO L272 TraceCheckUtils]: 74: Hoare triple {11402#(< ~counter~0 49)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,637 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10891#true} {11402#(< ~counter~0 49)} #61#return; {11402#(< ~counter~0 49)} is VALID [2022-04-14 15:12:20,637 INFO L290 TraceCheckUtils]: 72: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,637 INFO L290 TraceCheckUtils]: 71: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,637 INFO L290 TraceCheckUtils]: 70: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,637 INFO L272 TraceCheckUtils]: 69: Hoare triple {11402#(< ~counter~0 49)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,638 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10891#true} {11402#(< ~counter~0 49)} #59#return; {11402#(< ~counter~0 49)} is VALID [2022-04-14 15:12:20,638 INFO L290 TraceCheckUtils]: 67: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,638 INFO L290 TraceCheckUtils]: 66: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,638 INFO L290 TraceCheckUtils]: 65: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,638 INFO L272 TraceCheckUtils]: 64: Hoare triple {11402#(< ~counter~0 49)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,638 INFO L290 TraceCheckUtils]: 63: Hoare triple {11402#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {11402#(< ~counter~0 49)} is VALID [2022-04-14 15:12:20,639 INFO L290 TraceCheckUtils]: 62: Hoare triple {11487#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11402#(< ~counter~0 49)} is VALID [2022-04-14 15:12:20,639 INFO L290 TraceCheckUtils]: 61: Hoare triple {11487#(< ~counter~0 48)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11487#(< ~counter~0 48)} is VALID [2022-04-14 15:12:20,639 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10891#true} {11487#(< ~counter~0 48)} #67#return; {11487#(< ~counter~0 48)} is VALID [2022-04-14 15:12:20,640 INFO L290 TraceCheckUtils]: 59: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,640 INFO L290 TraceCheckUtils]: 58: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,640 INFO L290 TraceCheckUtils]: 57: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,640 INFO L272 TraceCheckUtils]: 56: Hoare triple {11487#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,641 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10891#true} {11487#(< ~counter~0 48)} #65#return; {11487#(< ~counter~0 48)} is VALID [2022-04-14 15:12:20,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,641 INFO L290 TraceCheckUtils]: 53: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,641 INFO L290 TraceCheckUtils]: 52: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,641 INFO L272 TraceCheckUtils]: 51: Hoare triple {11487#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,641 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10891#true} {11487#(< ~counter~0 48)} #63#return; {11487#(< ~counter~0 48)} is VALID [2022-04-14 15:12:20,642 INFO L290 TraceCheckUtils]: 49: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,642 INFO L290 TraceCheckUtils]: 48: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,642 INFO L290 TraceCheckUtils]: 47: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,642 INFO L272 TraceCheckUtils]: 46: Hoare triple {11487#(< ~counter~0 48)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,642 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10891#true} {11487#(< ~counter~0 48)} #61#return; {11487#(< ~counter~0 48)} is VALID [2022-04-14 15:12:20,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,642 INFO L290 TraceCheckUtils]: 43: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,642 INFO L290 TraceCheckUtils]: 42: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,642 INFO L272 TraceCheckUtils]: 41: Hoare triple {11487#(< ~counter~0 48)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,643 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10891#true} {11487#(< ~counter~0 48)} #59#return; {11487#(< ~counter~0 48)} is VALID [2022-04-14 15:12:20,643 INFO L290 TraceCheckUtils]: 39: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,643 INFO L290 TraceCheckUtils]: 37: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,643 INFO L272 TraceCheckUtils]: 36: Hoare triple {11487#(< ~counter~0 48)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {11487#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {11487#(< ~counter~0 48)} is VALID [2022-04-14 15:12:20,644 INFO L290 TraceCheckUtils]: 34: Hoare triple {11572#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11487#(< ~counter~0 48)} is VALID [2022-04-14 15:12:20,644 INFO L290 TraceCheckUtils]: 33: Hoare triple {11572#(< ~counter~0 47)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11572#(< ~counter~0 47)} is VALID [2022-04-14 15:12:20,645 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10891#true} {11572#(< ~counter~0 47)} #67#return; {11572#(< ~counter~0 47)} is VALID [2022-04-14 15:12:20,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,645 INFO L272 TraceCheckUtils]: 28: Hoare triple {11572#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,650 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10891#true} {11572#(< ~counter~0 47)} #65#return; {11572#(< ~counter~0 47)} is VALID [2022-04-14 15:12:20,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,650 INFO L272 TraceCheckUtils]: 23: Hoare triple {11572#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,650 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10891#true} {11572#(< ~counter~0 47)} #63#return; {11572#(< ~counter~0 47)} is VALID [2022-04-14 15:12:20,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,651 INFO L272 TraceCheckUtils]: 18: Hoare triple {11572#(< ~counter~0 47)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,651 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10891#true} {11572#(< ~counter~0 47)} #61#return; {11572#(< ~counter~0 47)} is VALID [2022-04-14 15:12:20,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,651 INFO L272 TraceCheckUtils]: 13: Hoare triple {11572#(< ~counter~0 47)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,652 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10891#true} {11572#(< ~counter~0 47)} #59#return; {11572#(< ~counter~0 47)} is VALID [2022-04-14 15:12:20,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-14 15:12:20,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-14 15:12:20,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-14 15:12:20,652 INFO L272 TraceCheckUtils]: 8: Hoare triple {11572#(< ~counter~0 47)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-14 15:12:20,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {11572#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {11572#(< ~counter~0 47)} is VALID [2022-04-14 15:12:20,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {11657#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11572#(< ~counter~0 47)} is VALID [2022-04-14 15:12:20,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {11657#(< ~counter~0 46)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {11657#(< ~counter~0 46)} is VALID [2022-04-14 15:12:20,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {11657#(< ~counter~0 46)} call #t~ret6 := main(); {11657#(< ~counter~0 46)} is VALID [2022-04-14 15:12:20,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11657#(< ~counter~0 46)} {10891#true} #81#return; {11657#(< ~counter~0 46)} is VALID [2022-04-14 15:12:20,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {11657#(< ~counter~0 46)} assume true; {11657#(< ~counter~0 46)} is VALID [2022-04-14 15:12:20,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {10891#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; {11657#(< ~counter~0 46)} is VALID [2022-04-14 15:12:20,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {10891#true} call ULTIMATE.init(); {10891#true} is VALID [2022-04-14 15:12:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-14 15:12:20,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:12:20,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952134454] [2022-04-14 15:12:20,655 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:12:20,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732609170] [2022-04-14 15:12:20,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732609170] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:12:20,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:12:20,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-14 15:12:20,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084271167] [2022-04-14 15:12:20,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:12:20,656 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 129 [2022-04-14 15:12:20,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:12:20,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-14 15:12:20,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:12:20,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-14 15:12:20,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:12:20,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-14 15:12:20,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:12:20,771 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-14 15:12:22,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:22,779 INFO L93 Difference]: Finished difference Result 368 states and 388 transitions. [2022-04-14 15:12:22,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-14 15:12:22,779 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 129 [2022-04-14 15:12:22,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:12:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-14 15:12:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 241 transitions. [2022-04-14 15:12:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-14 15:12:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 241 transitions. [2022-04-14 15:12:22,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 241 transitions. [2022-04-14 15:12:22,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:12:23,005 INFO L225 Difference]: With dead ends: 368 [2022-04-14 15:12:23,005 INFO L226 Difference]: Without dead ends: 353 [2022-04-14 15:12:23,006 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-14 15:12:23,006 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 149 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 15:12:23,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 267 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 15:12:23,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-14 15:12:23,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2022-04-14 15:12:23,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:12:23,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-14 15:12:23,177 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-14 15:12:23,177 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-14 15:12:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:23,186 INFO L93 Difference]: Finished difference Result 353 states and 367 transitions. [2022-04-14 15:12:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 367 transitions. [2022-04-14 15:12:23,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:23,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:23,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) Second operand 353 states. [2022-04-14 15:12:23,188 INFO L87 Difference]: Start difference. First operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) Second operand 353 states. [2022-04-14 15:12:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:23,198 INFO L93 Difference]: Finished difference Result 353 states and 367 transitions. [2022-04-14 15:12:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 367 transitions. [2022-04-14 15:12:23,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:23,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:23,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:12:23,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:12:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-14 15:12:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 326 transitions. [2022-04-14 15:12:23,223 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 326 transitions. Word has length 129 [2022-04-14 15:12:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:12:23,223 INFO L478 AbstractCegarLoop]: Abstraction has 311 states and 326 transitions. [2022-04-14 15:12:23,223 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-14 15:12:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 326 transitions. [2022-04-14 15:12:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-14 15:12:23,224 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:12:23,225 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:12:23,251 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 15:12:23,439 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,SelfDestructingSolverStorable15 [2022-04-14 15:12:23,439 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:12:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:12:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash 173938976, now seen corresponding path program 3 times [2022-04-14 15:12:23,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:12:23,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077672378] [2022-04-14 15:12:23,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:12:23,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:12:23,461 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:12:23,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [673473746] [2022-04-14 15:12:23,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:12:23,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:12:23,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:12:23,463 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 15:12:23,464 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 15:12:23,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-14 15:12:23,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:12:23,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-14 15:12:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:12:23,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:12:24,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {13359#true} call ULTIMATE.init(); {13359#true} is VALID [2022-04-14 15:12:24,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {13359#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; {13359#true} is VALID [2022-04-14 15:12:24,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13359#true} {13359#true} #81#return; {13359#true} is VALID [2022-04-14 15:12:24,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {13359#true} call #t~ret6 := main(); {13359#true} is VALID [2022-04-14 15:12:24,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {13359#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:24,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:24,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:24,658 INFO L272 TraceCheckUtils]: 8: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,659 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13359#true} {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:24,659 INFO L272 TraceCheckUtils]: 13: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,660 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13359#true} {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:24,660 INFO L272 TraceCheckUtils]: 18: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,660 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13359#true} {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:24,660 INFO L272 TraceCheckUtils]: 23: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,661 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13359#true} {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:24,661 INFO L272 TraceCheckUtils]: 28: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,661 INFO L290 TraceCheckUtils]: 30: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,662 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13359#true} {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:12:24,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-14 15:12:24,663 INFO L290 TraceCheckUtils]: 34: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-14 15:12:24,663 INFO L290 TraceCheckUtils]: 35: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} assume !!(#t~post5 < 50);havoc #t~post5; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-14 15:12:24,663 INFO L272 TraceCheckUtils]: 36: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,664 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13359#true} {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #59#return; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-14 15:12:24,664 INFO L272 TraceCheckUtils]: 41: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,664 INFO L290 TraceCheckUtils]: 42: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,664 INFO L290 TraceCheckUtils]: 43: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,664 INFO L290 TraceCheckUtils]: 44: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,664 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13359#true} {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #61#return; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-14 15:12:24,664 INFO L272 TraceCheckUtils]: 46: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,664 INFO L290 TraceCheckUtils]: 47: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,665 INFO L290 TraceCheckUtils]: 49: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,665 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13359#true} {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #63#return; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-14 15:12:24,665 INFO L272 TraceCheckUtils]: 51: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,665 INFO L290 TraceCheckUtils]: 52: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,666 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13359#true} {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #65#return; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-14 15:12:24,666 INFO L272 TraceCheckUtils]: 56: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,666 INFO L290 TraceCheckUtils]: 57: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,666 INFO L290 TraceCheckUtils]: 58: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,666 INFO L290 TraceCheckUtils]: 59: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,666 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13359#true} {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #67#return; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-14 15:12:24,667 INFO L290 TraceCheckUtils]: 61: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:12:24,667 INFO L290 TraceCheckUtils]: 62: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:12:24,668 INFO L290 TraceCheckUtils]: 63: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !!(#t~post5 < 50);havoc #t~post5; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:12:24,668 INFO L272 TraceCheckUtils]: 64: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,668 INFO L290 TraceCheckUtils]: 65: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,668 INFO L290 TraceCheckUtils]: 66: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,668 INFO L290 TraceCheckUtils]: 67: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,668 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13359#true} {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #59#return; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:12:24,668 INFO L272 TraceCheckUtils]: 69: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,668 INFO L290 TraceCheckUtils]: 70: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,668 INFO L290 TraceCheckUtils]: 71: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,668 INFO L290 TraceCheckUtils]: 72: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,669 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13359#true} {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #61#return; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:12:24,669 INFO L272 TraceCheckUtils]: 74: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,669 INFO L290 TraceCheckUtils]: 75: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,669 INFO L290 TraceCheckUtils]: 76: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,669 INFO L290 TraceCheckUtils]: 77: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,670 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {13359#true} {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #63#return; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:12:24,670 INFO L272 TraceCheckUtils]: 79: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,670 INFO L290 TraceCheckUtils]: 80: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,670 INFO L290 TraceCheckUtils]: 81: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,670 INFO L290 TraceCheckUtils]: 82: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,670 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {13359#true} {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #65#return; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:12:24,670 INFO L272 TraceCheckUtils]: 84: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,670 INFO L290 TraceCheckUtils]: 85: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,670 INFO L290 TraceCheckUtils]: 86: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,671 INFO L290 TraceCheckUtils]: 87: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,671 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13359#true} {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #67#return; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-14 15:12:24,671 INFO L290 TraceCheckUtils]: 89: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-14 15:12:24,672 INFO L290 TraceCheckUtils]: 90: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-14 15:12:24,672 INFO L290 TraceCheckUtils]: 91: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-14 15:12:24,672 INFO L272 TraceCheckUtils]: 92: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,672 INFO L290 TraceCheckUtils]: 93: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,672 INFO L290 TraceCheckUtils]: 94: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,673 INFO L290 TraceCheckUtils]: 95: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,673 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13359#true} {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #59#return; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-14 15:12:24,673 INFO L272 TraceCheckUtils]: 97: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,673 INFO L290 TraceCheckUtils]: 98: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,673 INFO L290 TraceCheckUtils]: 99: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,673 INFO L290 TraceCheckUtils]: 100: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,674 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13359#true} {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #61#return; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-14 15:12:24,674 INFO L272 TraceCheckUtils]: 102: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,674 INFO L290 TraceCheckUtils]: 103: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,674 INFO L290 TraceCheckUtils]: 104: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,674 INFO L290 TraceCheckUtils]: 105: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,674 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {13359#true} {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #63#return; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-14 15:12:24,675 INFO L272 TraceCheckUtils]: 107: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,675 INFO L290 TraceCheckUtils]: 108: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,675 INFO L290 TraceCheckUtils]: 109: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,675 INFO L290 TraceCheckUtils]: 110: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,675 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {13359#true} {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #65#return; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-14 15:12:24,675 INFO L272 TraceCheckUtils]: 112: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,675 INFO L290 TraceCheckUtils]: 113: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,675 INFO L290 TraceCheckUtils]: 114: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,676 INFO L290 TraceCheckUtils]: 115: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,676 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13359#true} {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #67#return; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-14 15:12:24,676 INFO L290 TraceCheckUtils]: 117: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} assume !(~n~0 <= ~a~0); {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} is VALID [2022-04-14 15:12:24,676 INFO L272 TraceCheckUtils]: 118: Hoare triple {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,677 INFO L290 TraceCheckUtils]: 119: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,677 INFO L290 TraceCheckUtils]: 120: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,677 INFO L290 TraceCheckUtils]: 121: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,677 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13359#true} {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} #69#return; {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} is VALID [2022-04-14 15:12:24,677 INFO L272 TraceCheckUtils]: 123: Hoare triple {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {13359#true} is VALID [2022-04-14 15:12:24,677 INFO L290 TraceCheckUtils]: 124: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-14 15:12:24,677 INFO L290 TraceCheckUtils]: 125: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-14 15:12:24,677 INFO L290 TraceCheckUtils]: 126: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-14 15:12:24,678 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {13359#true} {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} #71#return; {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} is VALID [2022-04-14 15:12:24,679 INFO L272 TraceCheckUtils]: 128: Hoare triple {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {13753#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:12:24,679 INFO L290 TraceCheckUtils]: 129: Hoare triple {13753#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13757#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:24,679 INFO L290 TraceCheckUtils]: 130: Hoare triple {13757#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13360#false} is VALID [2022-04-14 15:12:24,679 INFO L290 TraceCheckUtils]: 131: Hoare triple {13360#false} assume !false; {13360#false} is VALID [2022-04-14 15:12:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-14 15:12:24,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:12:35,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:12:35,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077672378] [2022-04-14 15:12:35,990 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:12:35,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673473746] [2022-04-14 15:12:35,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673473746] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:12:35,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:12:35,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-14 15:12:35,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766396202] [2022-04-14 15:12:35,990 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:12:35,991 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-04-14 15:12:35,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:12:35,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-14 15:12:36,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:12:36,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 15:12:36,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:12:36,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 15:12:36,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:12:36,058 INFO L87 Difference]: Start difference. First operand 311 states and 326 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-14 15:12:37,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:37,283 INFO L93 Difference]: Finished difference Result 313 states and 327 transitions. [2022-04-14 15:12:37,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 15:12:37,283 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-04-14 15:12:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:12:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-14 15:12:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-14 15:12:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-14 15:12:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-14 15:12:37,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-14 15:12:37,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:12:37,415 INFO L225 Difference]: With dead ends: 313 [2022-04-14 15:12:37,415 INFO L226 Difference]: Without dead ends: 302 [2022-04-14 15:12:37,415 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:12:37,416 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-14 15:12:37,416 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 15:12:37,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-04-14 15:12:37,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-04-14 15:12:37,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:12:37,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 302 states. Second operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-14 15:12:37,617 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-14 15:12:37,618 INFO L87 Difference]: Start difference. First operand 302 states. Second operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-14 15:12:37,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:37,625 INFO L93 Difference]: Finished difference Result 302 states and 315 transitions. [2022-04-14 15:12:37,625 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-14 15:12:37,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:37,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:37,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) Second operand 302 states. [2022-04-14 15:12:37,627 INFO L87 Difference]: Start difference. First operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) Second operand 302 states. [2022-04-14 15:12:37,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:37,634 INFO L93 Difference]: Finished difference Result 302 states and 315 transitions. [2022-04-14 15:12:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-14 15:12:37,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:12:37,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:12:37,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:12:37,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:12:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-14 15:12:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 315 transitions. [2022-04-14 15:12:37,644 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 315 transitions. Word has length 132 [2022-04-14 15:12:37,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:12:37,644 INFO L478 AbstractCegarLoop]: Abstraction has 302 states and 315 transitions. [2022-04-14 15:12:37,644 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-14 15:12:37,644 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-14 15:12:37,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-14 15:12:37,645 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:12:37,645 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:12:37,651 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 15:12:37,851 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:12:37,851 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:12:37,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:12:37,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1020857049, now seen corresponding path program 3 times [2022-04-14 15:12:37,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:12:37,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288496666] [2022-04-14 15:12:37,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:12:37,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:12:37,868 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:12:37,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848869663] [2022-04-14 15:12:37,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:12:37,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:12:37,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:12:37,870 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 15:12:37,875 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 15:12:38,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-14 15:12:38,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:12:38,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:12:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:12:38,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:12:41,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {15374#true} call ULTIMATE.init(); {15374#true} is VALID [2022-04-14 15:12:41,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {15374#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; {15374#true} is VALID [2022-04-14 15:12:41,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15374#true} {15374#true} #81#return; {15374#true} is VALID [2022-04-14 15:12:41,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {15374#true} call #t~ret6 := main(); {15374#true} is VALID [2022-04-14 15:12:41,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {15374#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {15374#true} is VALID [2022-04-14 15:12:41,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-14 15:12:41,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-14 15:12:41,348 INFO L272 TraceCheckUtils]: 8: Hoare triple {15374#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L272 TraceCheckUtils]: 13: Hoare triple {15374#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L272 TraceCheckUtils]: 18: Hoare triple {15374#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L272 TraceCheckUtils]: 23: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L272 TraceCheckUtils]: 28: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L290 TraceCheckUtils]: 33: Hoare triple {15374#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L290 TraceCheckUtils]: 34: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L290 TraceCheckUtils]: 35: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L272 TraceCheckUtils]: 36: Hoare triple {15374#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L290 TraceCheckUtils]: 38: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L290 TraceCheckUtils]: 39: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L272 TraceCheckUtils]: 41: Hoare triple {15374#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,350 INFO L290 TraceCheckUtils]: 42: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,351 INFO L290 TraceCheckUtils]: 43: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,351 INFO L290 TraceCheckUtils]: 44: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,351 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-14 15:12:41,351 INFO L272 TraceCheckUtils]: 46: Hoare triple {15374#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,351 INFO L290 TraceCheckUtils]: 48: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,351 INFO L290 TraceCheckUtils]: 49: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,351 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-14 15:12:41,351 INFO L272 TraceCheckUtils]: 51: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,351 INFO L290 TraceCheckUtils]: 52: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,351 INFO L290 TraceCheckUtils]: 53: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,351 INFO L290 TraceCheckUtils]: 54: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,351 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-14 15:12:41,352 INFO L272 TraceCheckUtils]: 56: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,352 INFO L290 TraceCheckUtils]: 57: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,352 INFO L290 TraceCheckUtils]: 58: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,352 INFO L290 TraceCheckUtils]: 59: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,352 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-14 15:12:41,352 INFO L290 TraceCheckUtils]: 61: Hoare triple {15374#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {15374#true} is VALID [2022-04-14 15:12:41,352 INFO L290 TraceCheckUtils]: 62: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-14 15:12:41,352 INFO L290 TraceCheckUtils]: 63: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-14 15:12:41,352 INFO L272 TraceCheckUtils]: 64: Hoare triple {15374#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,352 INFO L290 TraceCheckUtils]: 65: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,352 INFO L290 TraceCheckUtils]: 66: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,352 INFO L290 TraceCheckUtils]: 67: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,352 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-14 15:12:41,352 INFO L272 TraceCheckUtils]: 69: Hoare triple {15374#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,352 INFO L290 TraceCheckUtils]: 70: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,353 INFO L290 TraceCheckUtils]: 71: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,353 INFO L290 TraceCheckUtils]: 72: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,353 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-14 15:12:41,353 INFO L272 TraceCheckUtils]: 74: Hoare triple {15374#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,353 INFO L290 TraceCheckUtils]: 75: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,353 INFO L290 TraceCheckUtils]: 76: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,353 INFO L290 TraceCheckUtils]: 77: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,353 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-14 15:12:41,353 INFO L272 TraceCheckUtils]: 79: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,353 INFO L290 TraceCheckUtils]: 80: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,353 INFO L290 TraceCheckUtils]: 81: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,353 INFO L290 TraceCheckUtils]: 82: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,353 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-14 15:12:41,354 INFO L272 TraceCheckUtils]: 84: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,354 INFO L290 TraceCheckUtils]: 85: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,354 INFO L290 TraceCheckUtils]: 86: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,354 INFO L290 TraceCheckUtils]: 87: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,354 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-14 15:12:41,354 INFO L290 TraceCheckUtils]: 89: Hoare triple {15374#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {15374#true} is VALID [2022-04-14 15:12:41,354 INFO L290 TraceCheckUtils]: 90: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-14 15:12:41,354 INFO L290 TraceCheckUtils]: 91: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-14 15:12:41,354 INFO L272 TraceCheckUtils]: 92: Hoare triple {15374#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,354 INFO L290 TraceCheckUtils]: 93: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,354 INFO L290 TraceCheckUtils]: 94: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,354 INFO L290 TraceCheckUtils]: 95: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,355 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-14 15:12:41,355 INFO L272 TraceCheckUtils]: 97: Hoare triple {15374#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,355 INFO L290 TraceCheckUtils]: 98: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,355 INFO L290 TraceCheckUtils]: 99: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,355 INFO L290 TraceCheckUtils]: 100: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,355 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-14 15:12:41,355 INFO L272 TraceCheckUtils]: 102: Hoare triple {15374#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,355 INFO L290 TraceCheckUtils]: 103: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,355 INFO L290 TraceCheckUtils]: 104: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,355 INFO L290 TraceCheckUtils]: 105: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,355 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-14 15:12:41,356 INFO L272 TraceCheckUtils]: 107: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,356 INFO L290 TraceCheckUtils]: 108: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,356 INFO L290 TraceCheckUtils]: 109: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,356 INFO L290 TraceCheckUtils]: 110: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,356 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-14 15:12:41,356 INFO L272 TraceCheckUtils]: 112: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,356 INFO L290 TraceCheckUtils]: 113: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,356 INFO L290 TraceCheckUtils]: 114: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,356 INFO L290 TraceCheckUtils]: 115: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,356 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-14 15:12:41,364 INFO L290 TraceCheckUtils]: 117: Hoare triple {15374#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {15730#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-14 15:12:41,365 INFO L290 TraceCheckUtils]: 118: Hoare triple {15730#(<= main_~n~0 (+ main_~a~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15730#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-14 15:12:41,365 INFO L290 TraceCheckUtils]: 119: Hoare triple {15730#(<= main_~n~0 (+ main_~a~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {15730#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-14 15:12:41,365 INFO L272 TraceCheckUtils]: 120: Hoare triple {15730#(<= main_~n~0 (+ main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,365 INFO L290 TraceCheckUtils]: 121: Hoare triple {15374#true} ~cond := #in~cond; {15743#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:41,366 INFO L290 TraceCheckUtils]: 122: Hoare triple {15743#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:41,366 INFO L290 TraceCheckUtils]: 123: Hoare triple {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:41,367 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} {15730#(<= main_~n~0 (+ main_~a~0 1))} #59#return; {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-14 15:12:41,367 INFO L272 TraceCheckUtils]: 125: Hoare triple {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,367 INFO L290 TraceCheckUtils]: 126: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,367 INFO L290 TraceCheckUtils]: 127: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,367 INFO L290 TraceCheckUtils]: 128: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,368 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {15374#true} {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #61#return; {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-14 15:12:41,368 INFO L272 TraceCheckUtils]: 130: Hoare triple {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,368 INFO L290 TraceCheckUtils]: 131: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,368 INFO L290 TraceCheckUtils]: 132: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,368 INFO L290 TraceCheckUtils]: 133: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,369 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {15374#true} {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #63#return; {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-14 15:12:41,369 INFO L272 TraceCheckUtils]: 135: Hoare triple {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,369 INFO L290 TraceCheckUtils]: 136: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,369 INFO L290 TraceCheckUtils]: 137: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,369 INFO L290 TraceCheckUtils]: 138: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,370 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {15374#true} {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #65#return; {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-14 15:12:41,370 INFO L272 TraceCheckUtils]: 140: Hoare triple {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,370 INFO L290 TraceCheckUtils]: 141: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,370 INFO L290 TraceCheckUtils]: 142: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,371 INFO L290 TraceCheckUtils]: 143: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,371 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {15374#true} {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #67#return; {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-14 15:12:41,373 INFO L290 TraceCheckUtils]: 145: Hoare triple {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} assume !(~n~0 <= ~a~0); {15818#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-14 15:12:41,373 INFO L272 TraceCheckUtils]: 146: Hoare triple {15818#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:41,373 INFO L290 TraceCheckUtils]: 147: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:41,373 INFO L290 TraceCheckUtils]: 148: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:41,373 INFO L290 TraceCheckUtils]: 149: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:41,373 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {15374#true} {15818#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #69#return; {15818#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-14 15:12:41,733 INFO L272 TraceCheckUtils]: 151: Hoare triple {15818#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {15837#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:12:41,734 INFO L290 TraceCheckUtils]: 152: Hoare triple {15837#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15841#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:41,734 INFO L290 TraceCheckUtils]: 153: Hoare triple {15841#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15375#false} is VALID [2022-04-14 15:12:41,734 INFO L290 TraceCheckUtils]: 154: Hoare triple {15375#false} assume !false; {15375#false} is VALID [2022-04-14 15:12:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-04-14 15:12:41,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:12:42,993 INFO L290 TraceCheckUtils]: 154: Hoare triple {15375#false} assume !false; {15375#false} is VALID [2022-04-14 15:12:42,994 INFO L290 TraceCheckUtils]: 153: Hoare triple {15841#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15375#false} is VALID [2022-04-14 15:12:42,994 INFO L290 TraceCheckUtils]: 152: Hoare triple {15837#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15841#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:12:44,955 INFO L272 TraceCheckUtils]: 151: Hoare triple {15818#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {15837#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:12:44,956 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {15374#true} {15818#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #69#return; {15818#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-14 15:12:44,956 INFO L290 TraceCheckUtils]: 149: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,956 INFO L290 TraceCheckUtils]: 148: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,956 INFO L290 TraceCheckUtils]: 147: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,956 INFO L272 TraceCheckUtils]: 146: Hoare triple {15818#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,957 INFO L290 TraceCheckUtils]: 145: Hoare triple {15875#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} assume !(~n~0 <= ~a~0); {15818#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-14 15:12:44,957 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {15374#true} {15875#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #67#return; {15875#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:12:44,958 INFO L290 TraceCheckUtils]: 143: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,958 INFO L290 TraceCheckUtils]: 142: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,958 INFO L290 TraceCheckUtils]: 141: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,958 INFO L272 TraceCheckUtils]: 140: Hoare triple {15875#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,958 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {15374#true} {15875#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #65#return; {15875#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:12:44,958 INFO L290 TraceCheckUtils]: 138: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,958 INFO L290 TraceCheckUtils]: 137: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,958 INFO L290 TraceCheckUtils]: 136: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,958 INFO L272 TraceCheckUtils]: 135: Hoare triple {15875#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,959 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {15374#true} {15875#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #63#return; {15875#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:12:44,959 INFO L290 TraceCheckUtils]: 133: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,959 INFO L290 TraceCheckUtils]: 132: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,959 INFO L290 TraceCheckUtils]: 131: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,959 INFO L272 TraceCheckUtils]: 130: Hoare triple {15875#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,960 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {15374#true} {15875#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #61#return; {15875#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:12:44,960 INFO L290 TraceCheckUtils]: 128: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,960 INFO L290 TraceCheckUtils]: 127: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,960 INFO L290 TraceCheckUtils]: 126: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,960 INFO L272 TraceCheckUtils]: 125: Hoare triple {15875#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,962 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} {15939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} #59#return; {15875#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:12:44,962 INFO L290 TraceCheckUtils]: 123: Hoare triple {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:44,962 INFO L290 TraceCheckUtils]: 122: Hoare triple {15949#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:12:44,962 INFO L290 TraceCheckUtils]: 121: Hoare triple {15374#true} ~cond := #in~cond; {15949#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:12:44,963 INFO L272 TraceCheckUtils]: 120: Hoare triple {15939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,963 INFO L290 TraceCheckUtils]: 119: Hoare triple {15939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} assume !!(#t~post5 < 50);havoc #t~post5; {15939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-14 15:12:44,963 INFO L290 TraceCheckUtils]: 118: Hoare triple {15939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-14 15:12:44,964 INFO L290 TraceCheckUtils]: 117: Hoare triple {15374#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {15939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-14 15:12:44,964 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-14 15:12:44,964 INFO L290 TraceCheckUtils]: 115: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,964 INFO L290 TraceCheckUtils]: 114: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,964 INFO L290 TraceCheckUtils]: 113: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,964 INFO L272 TraceCheckUtils]: 112: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,965 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-14 15:12:44,965 INFO L290 TraceCheckUtils]: 110: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,965 INFO L290 TraceCheckUtils]: 109: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,965 INFO L290 TraceCheckUtils]: 108: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,965 INFO L272 TraceCheckUtils]: 107: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,965 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-14 15:12:44,965 INFO L290 TraceCheckUtils]: 105: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,965 INFO L290 TraceCheckUtils]: 104: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,965 INFO L290 TraceCheckUtils]: 103: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,965 INFO L272 TraceCheckUtils]: 102: Hoare triple {15374#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,965 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-14 15:12:44,965 INFO L290 TraceCheckUtils]: 100: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,965 INFO L290 TraceCheckUtils]: 99: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,965 INFO L290 TraceCheckUtils]: 98: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,965 INFO L272 TraceCheckUtils]: 97: Hoare triple {15374#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,965 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L290 TraceCheckUtils]: 95: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L290 TraceCheckUtils]: 94: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L290 TraceCheckUtils]: 93: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L272 TraceCheckUtils]: 92: Hoare triple {15374#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L290 TraceCheckUtils]: 91: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L290 TraceCheckUtils]: 90: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L290 TraceCheckUtils]: 89: Hoare triple {15374#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L290 TraceCheckUtils]: 87: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L290 TraceCheckUtils]: 86: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L290 TraceCheckUtils]: 85: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L272 TraceCheckUtils]: 84: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L290 TraceCheckUtils]: 82: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L290 TraceCheckUtils]: 81: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L290 TraceCheckUtils]: 80: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,966 INFO L272 TraceCheckUtils]: 79: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L290 TraceCheckUtils]: 77: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L290 TraceCheckUtils]: 76: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L290 TraceCheckUtils]: 75: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L272 TraceCheckUtils]: 74: Hoare triple {15374#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L290 TraceCheckUtils]: 72: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L290 TraceCheckUtils]: 71: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L290 TraceCheckUtils]: 70: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L272 TraceCheckUtils]: 69: Hoare triple {15374#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L290 TraceCheckUtils]: 67: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L290 TraceCheckUtils]: 66: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L290 TraceCheckUtils]: 65: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L272 TraceCheckUtils]: 64: Hoare triple {15374#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L290 TraceCheckUtils]: 63: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-14 15:12:44,967 INFO L290 TraceCheckUtils]: 62: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-14 15:12:44,968 INFO L290 TraceCheckUtils]: 61: Hoare triple {15374#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {15374#true} is VALID [2022-04-14 15:12:44,968 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-14 15:12:44,968 INFO L290 TraceCheckUtils]: 59: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,968 INFO L290 TraceCheckUtils]: 58: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,968 INFO L290 TraceCheckUtils]: 57: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,968 INFO L272 TraceCheckUtils]: 56: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,968 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-14 15:12:44,968 INFO L290 TraceCheckUtils]: 54: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,968 INFO L290 TraceCheckUtils]: 53: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,968 INFO L290 TraceCheckUtils]: 52: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,968 INFO L272 TraceCheckUtils]: 51: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,968 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-14 15:12:44,968 INFO L290 TraceCheckUtils]: 49: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,968 INFO L290 TraceCheckUtils]: 48: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,968 INFO L290 TraceCheckUtils]: 47: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,969 INFO L272 TraceCheckUtils]: 46: Hoare triple {15374#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,969 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-14 15:12:44,969 INFO L290 TraceCheckUtils]: 44: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,969 INFO L290 TraceCheckUtils]: 43: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,969 INFO L272 TraceCheckUtils]: 41: Hoare triple {15374#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,969 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-14 15:12:44,969 INFO L290 TraceCheckUtils]: 39: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,970 INFO L272 TraceCheckUtils]: 36: Hoare triple {15374#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-14 15:12:44,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-14 15:12:44,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {15374#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {15374#true} is VALID [2022-04-14 15:12:44,970 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-14 15:12:44,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,970 INFO L272 TraceCheckUtils]: 28: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,970 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-14 15:12:44,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,971 INFO L272 TraceCheckUtils]: 23: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,971 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-14 15:12:44,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,971 INFO L272 TraceCheckUtils]: 18: Hoare triple {15374#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,971 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-14 15:12:44,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,971 INFO L272 TraceCheckUtils]: 13: Hoare triple {15374#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,972 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-14 15:12:44,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-14 15:12:44,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-14 15:12:44,972 INFO L272 TraceCheckUtils]: 8: Hoare triple {15374#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-14 15:12:44,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-14 15:12:44,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-14 15:12:44,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {15374#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {15374#true} is VALID [2022-04-14 15:12:44,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {15374#true} call #t~ret6 := main(); {15374#true} is VALID [2022-04-14 15:12:44,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15374#true} {15374#true} #81#return; {15374#true} is VALID [2022-04-14 15:12:44,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-14 15:12:44,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {15374#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; {15374#true} is VALID [2022-04-14 15:12:44,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {15374#true} call ULTIMATE.init(); {15374#true} is VALID [2022-04-14 15:12:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-04-14 15:12:44,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:12:44,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288496666] [2022-04-14 15:12:44,974 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:12:44,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848869663] [2022-04-14 15:12:44,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848869663] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:12:44,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:12:44,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-04-14 15:12:44,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682004564] [2022-04-14 15:12:44,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:12:44,977 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 155 [2022-04-14 15:12:44,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:12:44,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-14 15:12:47,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 60 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 15:12:47,040 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-14 15:12:47,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:12:47,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-14 15:12:47,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:12:47,041 INFO L87 Difference]: Start difference. First operand 302 states and 315 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-14 15:12:52,424 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 15:12:54,429 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 15:12:58,947 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 15:12:59,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:12:59,131 INFO L93 Difference]: Finished difference Result 311 states and 325 transitions. [2022-04-14 15:12:59,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 15:12:59,131 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 155 [2022-04-14 15:12:59,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:12:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-14 15:12:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-14 15:12:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-14 15:12:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-14 15:12:59,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-04-14 15:13:01,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 15:13:01,206 INFO L225 Difference]: With dead ends: 311 [2022-04-14 15:13:01,206 INFO L226 Difference]: Without dead ends: 309 [2022-04-14 15:13:01,207 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-14 15:13:01,207 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 34 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-14 15:13:01,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 113 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 173 Invalid, 3 Unknown, 0 Unchecked, 7.4s Time] [2022-04-14 15:13:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-14 15:13:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2022-04-14 15:13:01,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:13:01,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-14 15:13:01,447 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-14 15:13:01,447 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-14 15:13:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:01,454 INFO L93 Difference]: Finished difference Result 309 states and 323 transitions. [2022-04-14 15:13:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 323 transitions. [2022-04-14 15:13:01,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:01,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:01,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) Second operand 309 states. [2022-04-14 15:13:01,456 INFO L87 Difference]: Start difference. First operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) Second operand 309 states. [2022-04-14 15:13:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:01,462 INFO L93 Difference]: Finished difference Result 309 states and 323 transitions. [2022-04-14 15:13:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 323 transitions. [2022-04-14 15:13:01,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:01,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:01,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:13:01,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:13:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-14 15:13:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 322 transitions. [2022-04-14 15:13:01,471 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 322 transitions. Word has length 155 [2022-04-14 15:13:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:13:01,472 INFO L478 AbstractCegarLoop]: Abstraction has 308 states and 322 transitions. [2022-04-14 15:13:01,472 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-14 15:13:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 322 transitions. [2022-04-14 15:13:01,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-14 15:13:01,473 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:13:01,473 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:13:01,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-14 15:13:01,678 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,SelfDestructingSolverStorable17 [2022-04-14 15:13:01,679 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:13:01,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:13:01,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2056924759, now seen corresponding path program 4 times [2022-04-14 15:13:01,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:13:01,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922295423] [2022-04-14 15:13:01,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:01,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:13:01,690 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:13:01,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528860928] [2022-04-14 15:13:01,691 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 15:13:01,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:13:01,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:13:01,692 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 15:13:01,695 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 15:13:03,529 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 15:13:03,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:13:03,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-14 15:13:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:03,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:15:29,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {17813#true} call ULTIMATE.init(); {17813#true} is VALID [2022-04-14 15:15:29,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {17813#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; {17813#true} is VALID [2022-04-14 15:15:29,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:29,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17813#true} {17813#true} #81#return; {17813#true} is VALID [2022-04-14 15:15:29,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {17813#true} call #t~ret6 := main(); {17813#true} is VALID [2022-04-14 15:15:29,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {17813#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17813#true} is VALID [2022-04-14 15:15:29,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {17813#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17813#true} is VALID [2022-04-14 15:15:29,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {17813#true} assume !!(#t~post5 < 50);havoc #t~post5; {17813#true} is VALID [2022-04-14 15:15:29,754 INFO L272 TraceCheckUtils]: 8: Hoare triple {17813#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:29,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:29,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:29,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:29,754 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17813#true} {17813#true} #59#return; {17813#true} is VALID [2022-04-14 15:15:29,754 INFO L272 TraceCheckUtils]: 13: Hoare triple {17813#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:29,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:29,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:29,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:29,755 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {17813#true} #61#return; {17871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 15:15:29,755 INFO L272 TraceCheckUtils]: 18: Hoare triple {17871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:29,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:29,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:29,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:29,757 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {17871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {17887#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:15:29,757 INFO L272 TraceCheckUtils]: 23: Hoare triple {17887#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:29,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:29,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:29,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:29,759 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {17887#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:15:29,759 INFO L272 TraceCheckUtils]: 28: Hoare triple {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:29,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:29,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:29,759 INFO L290 TraceCheckUtils]: 31: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:29,760 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17813#true} {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:15:31,762 WARN L290 TraceCheckUtils]: 33: Hoare triple {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is UNKNOWN [2022-04-14 15:15:31,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:15:31,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 50);havoc #t~post5; {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:15:31,763 INFO L272 TraceCheckUtils]: 36: Hoare triple {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:31,763 INFO L290 TraceCheckUtils]: 37: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:31,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:31,763 INFO L290 TraceCheckUtils]: 39: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:31,764 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {17813#true} {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:15:31,764 INFO L272 TraceCheckUtils]: 41: Hoare triple {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:31,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:31,764 INFO L290 TraceCheckUtils]: 43: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:31,765 INFO L290 TraceCheckUtils]: 44: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:31,765 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-14 15:15:31,765 INFO L272 TraceCheckUtils]: 46: Hoare triple {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:31,765 INFO L290 TraceCheckUtils]: 47: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:31,766 INFO L290 TraceCheckUtils]: 48: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:31,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:31,767 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {17903#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #63#return; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:31,767 INFO L272 TraceCheckUtils]: 51: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:31,767 INFO L290 TraceCheckUtils]: 52: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:31,767 INFO L290 TraceCheckUtils]: 53: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:31,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:31,768 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17813#true} {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #65#return; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:31,768 INFO L272 TraceCheckUtils]: 56: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:31,768 INFO L290 TraceCheckUtils]: 57: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:31,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:31,768 INFO L290 TraceCheckUtils]: 59: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:31,768 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {17813#true} {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #67#return; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:33,770 WARN L290 TraceCheckUtils]: 61: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is UNKNOWN [2022-04-14 15:15:33,771 INFO L290 TraceCheckUtils]: 62: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:33,771 INFO L290 TraceCheckUtils]: 63: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !!(#t~post5 < 50);havoc #t~post5; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:33,771 INFO L272 TraceCheckUtils]: 64: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:33,771 INFO L290 TraceCheckUtils]: 65: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:33,771 INFO L290 TraceCheckUtils]: 66: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:33,772 INFO L290 TraceCheckUtils]: 67: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:33,772 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17813#true} {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #59#return; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:33,772 INFO L272 TraceCheckUtils]: 69: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:33,772 INFO L290 TraceCheckUtils]: 70: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:33,773 INFO L290 TraceCheckUtils]: 71: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:33,773 INFO L290 TraceCheckUtils]: 72: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:33,773 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #61#return; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:33,773 INFO L272 TraceCheckUtils]: 74: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:33,774 INFO L290 TraceCheckUtils]: 75: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:33,774 INFO L290 TraceCheckUtils]: 76: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:33,774 INFO L290 TraceCheckUtils]: 77: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:33,774 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {17813#true} {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #63#return; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:33,774 INFO L272 TraceCheckUtils]: 79: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:33,774 INFO L290 TraceCheckUtils]: 80: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:33,774 INFO L290 TraceCheckUtils]: 81: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:33,774 INFO L290 TraceCheckUtils]: 82: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:33,775 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {17813#true} {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #65#return; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:33,775 INFO L272 TraceCheckUtils]: 84: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:33,775 INFO L290 TraceCheckUtils]: 85: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:33,775 INFO L290 TraceCheckUtils]: 86: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:33,775 INFO L290 TraceCheckUtils]: 87: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:33,776 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {17813#true} {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #67#return; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:35,777 WARN L290 TraceCheckUtils]: 89: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is UNKNOWN [2022-04-14 15:15:35,778 INFO L290 TraceCheckUtils]: 90: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:35,779 INFO L290 TraceCheckUtils]: 91: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !!(#t~post5 < 50);havoc #t~post5; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:35,779 INFO L272 TraceCheckUtils]: 92: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:35,779 INFO L290 TraceCheckUtils]: 93: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:35,779 INFO L290 TraceCheckUtils]: 94: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:35,779 INFO L290 TraceCheckUtils]: 95: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:35,779 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {17813#true} {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #59#return; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:35,780 INFO L272 TraceCheckUtils]: 97: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:35,780 INFO L290 TraceCheckUtils]: 98: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:35,780 INFO L290 TraceCheckUtils]: 99: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:35,780 INFO L290 TraceCheckUtils]: 100: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:35,781 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #61#return; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:35,781 INFO L272 TraceCheckUtils]: 102: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:35,781 INFO L290 TraceCheckUtils]: 103: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:35,781 INFO L290 TraceCheckUtils]: 104: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:35,781 INFO L290 TraceCheckUtils]: 105: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:35,782 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17813#true} {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #63#return; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:35,782 INFO L272 TraceCheckUtils]: 107: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:35,782 INFO L290 TraceCheckUtils]: 108: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:35,782 INFO L290 TraceCheckUtils]: 109: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:35,782 INFO L290 TraceCheckUtils]: 110: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:35,782 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {17813#true} {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #65#return; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:35,782 INFO L272 TraceCheckUtils]: 112: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:35,782 INFO L290 TraceCheckUtils]: 113: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:35,782 INFO L290 TraceCheckUtils]: 114: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:35,783 INFO L290 TraceCheckUtils]: 115: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:35,783 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {17813#true} {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #67#return; {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-14 15:15:37,785 WARN L290 TraceCheckUtils]: 117: Hoare triple {17973#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is UNKNOWN [2022-04-14 15:15:37,786 INFO L290 TraceCheckUtils]: 118: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-14 15:15:37,786 INFO L290 TraceCheckUtils]: 119: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} assume !!(#t~post5 < 50);havoc #t~post5; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-14 15:15:37,787 INFO L272 TraceCheckUtils]: 120: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:37,787 INFO L290 TraceCheckUtils]: 121: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:37,787 INFO L290 TraceCheckUtils]: 122: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:37,787 INFO L290 TraceCheckUtils]: 123: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:37,787 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17813#true} {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} #59#return; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-14 15:15:37,787 INFO L272 TraceCheckUtils]: 125: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:37,788 INFO L290 TraceCheckUtils]: 126: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:37,788 INFO L290 TraceCheckUtils]: 127: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:37,788 INFO L290 TraceCheckUtils]: 128: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:37,789 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} #61#return; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-14 15:15:37,789 INFO L272 TraceCheckUtils]: 130: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:37,789 INFO L290 TraceCheckUtils]: 131: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:37,789 INFO L290 TraceCheckUtils]: 132: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:37,789 INFO L290 TraceCheckUtils]: 133: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:37,789 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {17813#true} {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} #63#return; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-14 15:15:37,789 INFO L272 TraceCheckUtils]: 135: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:37,790 INFO L290 TraceCheckUtils]: 136: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:37,790 INFO L290 TraceCheckUtils]: 137: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:37,790 INFO L290 TraceCheckUtils]: 138: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:37,790 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {17813#true} {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} #65#return; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-14 15:15:37,790 INFO L272 TraceCheckUtils]: 140: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:37,790 INFO L290 TraceCheckUtils]: 141: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:37,790 INFO L290 TraceCheckUtils]: 142: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:37,790 INFO L290 TraceCheckUtils]: 143: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:37,791 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {17813#true} {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} #67#return; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-14 15:15:37,792 INFO L290 TraceCheckUtils]: 145: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} assume !(~n~0 <= ~a~0); {18260#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (not (<= main_~n~0 main_~a~0)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-14 15:15:37,792 INFO L272 TraceCheckUtils]: 146: Hoare triple {18260#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (not (<= main_~n~0 main_~a~0)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:37,792 INFO L290 TraceCheckUtils]: 147: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:37,792 INFO L290 TraceCheckUtils]: 148: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:37,793 INFO L290 TraceCheckUtils]: 149: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:39,799 WARN L284 TraceCheckUtils]: 150: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {18260#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (not (<= main_~n~0 main_~a~0)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} #69#return; {18276#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) 3 (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 9) (* (div (+ main_~z~0 (- 6)) 6) 6) (* (* (div (+ main_~z~0 (- 6)) 6) main_~y~0) 3)) (+ (* main_~y~0 3) (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) main_~y~0)))) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} is UNKNOWN [2022-04-14 15:15:39,799 INFO L272 TraceCheckUtils]: 151: Hoare triple {18276#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) 3 (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 9) (* (div (+ main_~z~0 (- 6)) 6) 6) (* (* (div (+ main_~z~0 (- 6)) 6) main_~y~0) 3)) (+ (* main_~y~0 3) (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) main_~y~0)))) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:39,800 INFO L290 TraceCheckUtils]: 152: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:39,800 INFO L290 TraceCheckUtils]: 153: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:39,800 INFO L290 TraceCheckUtils]: 154: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:39,800 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {17813#true} {18276#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) 3 (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 9) (* (div (+ main_~z~0 (- 6)) 6) 6) (* (* (div (+ main_~z~0 (- 6)) 6) main_~y~0) 3)) (+ (* main_~y~0 3) (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) main_~y~0)))) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} #71#return; {18276#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) 3 (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 9) (* (div (+ main_~z~0 (- 6)) 6) 6) (* (* (div (+ main_~z~0 (- 6)) 6) main_~y~0) 3)) (+ (* main_~y~0 3) (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) main_~y~0)))) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} is VALID [2022-04-14 15:15:39,806 INFO L272 TraceCheckUtils]: 156: Hoare triple {18276#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) 3 (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 9) (* (div (+ main_~z~0 (- 6)) 6) 6) (* (* (div (+ main_~z~0 (- 6)) 6) main_~y~0) 3)) (+ (* main_~y~0 3) (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) main_~y~0)))) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {18295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:15:39,806 INFO L290 TraceCheckUtils]: 157: Hoare triple {18295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:39,807 INFO L290 TraceCheckUtils]: 158: Hoare triple {18299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17814#false} is VALID [2022-04-14 15:15:39,807 INFO L290 TraceCheckUtils]: 159: Hoare triple {17814#false} assume !false; {17814#false} is VALID [2022-04-14 15:15:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 252 proven. 354 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2022-04-14 15:15:39,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:15:48,972 INFO L290 TraceCheckUtils]: 159: Hoare triple {17814#false} assume !false; {17814#false} is VALID [2022-04-14 15:15:48,972 INFO L290 TraceCheckUtils]: 158: Hoare triple {18299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17814#false} is VALID [2022-04-14 15:15:48,973 INFO L290 TraceCheckUtils]: 157: Hoare triple {18295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:48,973 INFO L272 TraceCheckUtils]: 156: Hoare triple {18315#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {18295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:15:48,974 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {17813#true} {18315#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #71#return; {18315#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-14 15:15:48,974 INFO L290 TraceCheckUtils]: 154: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,974 INFO L290 TraceCheckUtils]: 153: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,974 INFO L290 TraceCheckUtils]: 152: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,974 INFO L272 TraceCheckUtils]: 151: Hoare triple {18315#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,975 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {18334#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} #69#return; {18315#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-14 15:15:48,975 INFO L290 TraceCheckUtils]: 149: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:48,975 INFO L290 TraceCheckUtils]: 148: Hoare triple {18344#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:48,976 INFO L290 TraceCheckUtils]: 147: Hoare triple {17813#true} ~cond := #in~cond; {18344#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:15:48,976 INFO L272 TraceCheckUtils]: 146: Hoare triple {18334#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,976 INFO L290 TraceCheckUtils]: 145: Hoare triple {18351#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} assume !(~n~0 <= ~a~0); {18334#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} is VALID [2022-04-14 15:15:48,977 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {17813#true} {18351#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #67#return; {18351#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:15:48,977 INFO L290 TraceCheckUtils]: 143: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,977 INFO L290 TraceCheckUtils]: 142: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,977 INFO L290 TraceCheckUtils]: 141: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,977 INFO L272 TraceCheckUtils]: 140: Hoare triple {18351#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,977 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {17813#true} {18351#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #65#return; {18351#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:15:48,977 INFO L290 TraceCheckUtils]: 138: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,978 INFO L290 TraceCheckUtils]: 137: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,978 INFO L290 TraceCheckUtils]: 136: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,978 INFO L272 TraceCheckUtils]: 135: Hoare triple {18351#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,978 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {17813#true} {18351#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #63#return; {18351#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:15:48,978 INFO L290 TraceCheckUtils]: 133: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,978 INFO L290 TraceCheckUtils]: 132: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,978 INFO L290 TraceCheckUtils]: 131: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,978 INFO L272 TraceCheckUtils]: 130: Hoare triple {18351#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,979 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {18400#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #61#return; {18351#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:15:48,979 INFO L290 TraceCheckUtils]: 128: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:48,980 INFO L290 TraceCheckUtils]: 127: Hoare triple {18344#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:48,980 INFO L290 TraceCheckUtils]: 126: Hoare triple {17813#true} ~cond := #in~cond; {18344#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:15:48,980 INFO L272 TraceCheckUtils]: 125: Hoare triple {18400#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,981 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17813#true} {18400#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #59#return; {18400#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:15:48,981 INFO L290 TraceCheckUtils]: 123: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,981 INFO L290 TraceCheckUtils]: 122: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,981 INFO L290 TraceCheckUtils]: 121: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,981 INFO L272 TraceCheckUtils]: 120: Hoare triple {18400#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,981 INFO L290 TraceCheckUtils]: 119: Hoare triple {18400#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} assume !!(#t~post5 < 50);havoc #t~post5; {18400#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:15:48,982 INFO L290 TraceCheckUtils]: 118: Hoare triple {18400#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18400#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:15:48,985 INFO L290 TraceCheckUtils]: 117: Hoare triple {17813#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {18400#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-14 15:15:48,985 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {17813#true} {17813#true} #67#return; {17813#true} is VALID [2022-04-14 15:15:48,985 INFO L290 TraceCheckUtils]: 115: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,985 INFO L290 TraceCheckUtils]: 114: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,985 INFO L290 TraceCheckUtils]: 113: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,985 INFO L272 TraceCheckUtils]: 112: Hoare triple {17813#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,985 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {17813#true} {17813#true} #65#return; {17813#true} is VALID [2022-04-14 15:15:48,985 INFO L290 TraceCheckUtils]: 110: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,985 INFO L290 TraceCheckUtils]: 109: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,985 INFO L290 TraceCheckUtils]: 108: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,985 INFO L272 TraceCheckUtils]: 107: Hoare triple {17813#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,985 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17813#true} {17813#true} #63#return; {17813#true} is VALID [2022-04-14 15:15:48,985 INFO L290 TraceCheckUtils]: 105: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,985 INFO L290 TraceCheckUtils]: 104: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,986 INFO L290 TraceCheckUtils]: 103: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,986 INFO L272 TraceCheckUtils]: 102: Hoare triple {17813#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,986 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {17813#true} {17813#true} #61#return; {17813#true} is VALID [2022-04-14 15:15:48,986 INFO L290 TraceCheckUtils]: 100: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,986 INFO L290 TraceCheckUtils]: 99: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,986 INFO L290 TraceCheckUtils]: 98: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,986 INFO L272 TraceCheckUtils]: 97: Hoare triple {17813#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,986 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {17813#true} {17813#true} #59#return; {17813#true} is VALID [2022-04-14 15:15:48,986 INFO L290 TraceCheckUtils]: 95: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,986 INFO L290 TraceCheckUtils]: 94: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,986 INFO L290 TraceCheckUtils]: 93: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,986 INFO L272 TraceCheckUtils]: 92: Hoare triple {17813#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,986 INFO L290 TraceCheckUtils]: 91: Hoare triple {17813#true} assume !!(#t~post5 < 50);havoc #t~post5; {17813#true} is VALID [2022-04-14 15:15:48,986 INFO L290 TraceCheckUtils]: 90: Hoare triple {17813#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17813#true} is VALID [2022-04-14 15:15:48,986 INFO L290 TraceCheckUtils]: 89: Hoare triple {17813#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17813#true} is VALID [2022-04-14 15:15:48,986 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {17813#true} {17813#true} #67#return; {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L290 TraceCheckUtils]: 87: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L290 TraceCheckUtils]: 86: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L290 TraceCheckUtils]: 85: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L272 TraceCheckUtils]: 84: Hoare triple {17813#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {17813#true} {17813#true} #65#return; {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L290 TraceCheckUtils]: 82: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L290 TraceCheckUtils]: 81: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L290 TraceCheckUtils]: 80: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L272 TraceCheckUtils]: 79: Hoare triple {17813#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {17813#true} {17813#true} #63#return; {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L290 TraceCheckUtils]: 77: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L290 TraceCheckUtils]: 76: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L290 TraceCheckUtils]: 75: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L272 TraceCheckUtils]: 74: Hoare triple {17813#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17813#true} {17813#true} #61#return; {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L290 TraceCheckUtils]: 72: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,987 INFO L290 TraceCheckUtils]: 71: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L290 TraceCheckUtils]: 70: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L272 TraceCheckUtils]: 69: Hoare triple {17813#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17813#true} {17813#true} #59#return; {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L290 TraceCheckUtils]: 67: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L290 TraceCheckUtils]: 66: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L290 TraceCheckUtils]: 65: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L272 TraceCheckUtils]: 64: Hoare triple {17813#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L290 TraceCheckUtils]: 63: Hoare triple {17813#true} assume !!(#t~post5 < 50);havoc #t~post5; {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L290 TraceCheckUtils]: 62: Hoare triple {17813#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L290 TraceCheckUtils]: 61: Hoare triple {17813#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {17813#true} {17813#true} #67#return; {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L290 TraceCheckUtils]: 59: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L290 TraceCheckUtils]: 58: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L290 TraceCheckUtils]: 57: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L272 TraceCheckUtils]: 56: Hoare triple {17813#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17813#true} {17813#true} #65#return; {17813#true} is VALID [2022-04-14 15:15:48,988 INFO L290 TraceCheckUtils]: 54: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,989 INFO L290 TraceCheckUtils]: 53: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,989 INFO L290 TraceCheckUtils]: 52: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,989 INFO L272 TraceCheckUtils]: 51: Hoare triple {17813#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,989 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17813#true} {17813#true} #63#return; {17813#true} is VALID [2022-04-14 15:15:48,989 INFO L290 TraceCheckUtils]: 49: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,989 INFO L290 TraceCheckUtils]: 48: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,989 INFO L290 TraceCheckUtils]: 47: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,989 INFO L272 TraceCheckUtils]: 46: Hoare triple {17813#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,989 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17813#true} {17813#true} #61#return; {17813#true} is VALID [2022-04-14 15:15:48,989 INFO L290 TraceCheckUtils]: 44: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,989 INFO L290 TraceCheckUtils]: 43: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,989 INFO L290 TraceCheckUtils]: 42: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,989 INFO L272 TraceCheckUtils]: 41: Hoare triple {17813#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,989 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {17813#true} {17813#true} #59#return; {17813#true} is VALID [2022-04-14 15:15:48,989 INFO L290 TraceCheckUtils]: 39: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,989 INFO L290 TraceCheckUtils]: 38: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,990 INFO L290 TraceCheckUtils]: 37: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,990 INFO L272 TraceCheckUtils]: 36: Hoare triple {17813#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,990 INFO L290 TraceCheckUtils]: 35: Hoare triple {17813#true} assume !!(#t~post5 < 50);havoc #t~post5; {17813#true} is VALID [2022-04-14 15:15:48,990 INFO L290 TraceCheckUtils]: 34: Hoare triple {17813#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17813#true} is VALID [2022-04-14 15:15:48,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {17813#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17813#true} is VALID [2022-04-14 15:15:48,990 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17813#true} {17813#true} #67#return; {17813#true} is VALID [2022-04-14 15:15:48,990 INFO L290 TraceCheckUtils]: 31: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,990 INFO L272 TraceCheckUtils]: 28: Hoare triple {17813#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,990 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17813#true} {17813#true} #65#return; {17813#true} is VALID [2022-04-14 15:15:48,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,990 INFO L272 TraceCheckUtils]: 23: Hoare triple {17813#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,990 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17813#true} {17813#true} #63#return; {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L272 TraceCheckUtils]: 18: Hoare triple {17813#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17813#true} {17813#true} #61#return; {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L272 TraceCheckUtils]: 13: Hoare triple {17813#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17813#true} {17813#true} #59#return; {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L272 TraceCheckUtils]: 8: Hoare triple {17813#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {17813#true} assume !!(#t~post5 < 50);havoc #t~post5; {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {17813#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17813#true} is VALID [2022-04-14 15:15:48,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {17813#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17813#true} is VALID [2022-04-14 15:15:48,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {17813#true} call #t~ret6 := main(); {17813#true} is VALID [2022-04-14 15:15:48,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17813#true} {17813#true} #81#return; {17813#true} is VALID [2022-04-14 15:15:48,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-14 15:15:48,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {17813#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; {17813#true} is VALID [2022-04-14 15:15:48,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {17813#true} call ULTIMATE.init(); {17813#true} is VALID [2022-04-14 15:15:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 219 proven. 17 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2022-04-14 15:15:48,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:15:48,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922295423] [2022-04-14 15:15:48,993 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:15:48,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528860928] [2022-04-14 15:15:48,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528860928] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:15:48,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:15:48,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-14 15:15:48,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880645436] [2022-04-14 15:15:48,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:15:48,994 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) Word has length 160 [2022-04-14 15:15:49,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:15:49,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-14 15:15:55,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 94 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 15:15:55,542 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-14 15:15:55,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:15:55,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-14 15:15:55,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=241, Unknown=2, NotChecked=0, Total=306 [2022-04-14 15:15:55,543 INFO L87 Difference]: Start difference. First operand 308 states and 322 transitions. Second operand has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-14 15:16:03,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:05,606 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:14,104 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:22,553 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 15:16:37,169 WARN L232 SmtUtils]: Spent 10.11s on a formula simplification. DAG size of input: 78 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-14 15:16:45,759 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:47,761 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 15:16:49,764 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 15:16:52,126 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:54,128 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 15:16:56,130 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 15:17:03,437 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:04,463 INFO L93 Difference]: Finished difference Result 315 states and 328 transitions. [2022-04-14 15:17:04,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-14 15:17:04,464 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) Word has length 160 [2022-04-14 15:17:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:17:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-14 15:17:04,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-14 15:17:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-14 15:17:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-14 15:17:04,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2022-04-14 15:17:08,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 54 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:08,526 INFO L225 Difference]: With dead ends: 315 [2022-04-14 15:17:08,526 INFO L226 Difference]: Without dead ends: 294 [2022-04-14 15:17:08,526 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 299 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=140, Invalid=456, Unknown=4, NotChecked=0, Total=600 [2022-04-14 15:17:08,526 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 96 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:17:08,528 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 101 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 201 Invalid, 7 Unknown, 0 Unchecked, 29.1s Time] [2022-04-14 15:17:08,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-04-14 15:17:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-04-14 15:17:08,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:17:08,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-14 15:17:08,704 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-14 15:17:08,705 INFO L87 Difference]: Start difference. First operand 294 states. Second operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-14 15:17:08,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:08,710 INFO L93 Difference]: Finished difference Result 294 states and 295 transitions. [2022-04-14 15:17:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-14 15:17:08,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:08,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:08,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 294 states. [2022-04-14 15:17:08,712 INFO L87 Difference]: Start difference. First operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 294 states. [2022-04-14 15:17:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:08,717 INFO L93 Difference]: Finished difference Result 294 states and 295 transitions. [2022-04-14 15:17:08,717 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-14 15:17:08,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:08,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:08,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:17:08,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:17:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-14 15:17:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2022-04-14 15:17:08,725 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 160 [2022-04-14 15:17:08,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:17:08,725 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2022-04-14 15:17:08,725 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-14 15:17:08,725 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-14 15:17:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-04-14 15:17:08,729 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:17:08,729 INFO L499 BasicCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:17:08,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-14 15:17:08,936 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:08,936 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:17:08,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:17:08,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1533533153, now seen corresponding path program 3 times [2022-04-14 15:17:08,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:17:08,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526865123] [2022-04-14 15:17:08,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:08,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:17:08,965 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:17:08,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [16833402] [2022-04-14 15:17:08,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:17:08,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:08,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:17:08,966 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 15:17:08,967 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 15:17:09,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2022-04-14 15:17:09,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:17:09,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-14 15:17:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:09,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:17:10,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {20249#true} call ULTIMATE.init(); {20249#true} is VALID [2022-04-14 15:17:10,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {20249#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; {20257#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:10,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {20257#(<= ~counter~0 0)} assume true; {20257#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:10,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20257#(<= ~counter~0 0)} {20249#true} #81#return; {20257#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:10,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {20257#(<= ~counter~0 0)} call #t~ret6 := main(); {20257#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:10,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {20257#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {20257#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:10,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {20257#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {20273#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,546 INFO L272 TraceCheckUtils]: 8: Hoare triple {20273#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {20273#(<= ~counter~0 1)} ~cond := #in~cond; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {20273#(<= ~counter~0 1)} assume !(0 == ~cond); {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {20273#(<= ~counter~0 1)} assume true; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,547 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20273#(<= ~counter~0 1)} {20273#(<= ~counter~0 1)} #59#return; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,547 INFO L272 TraceCheckUtils]: 13: Hoare triple {20273#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {20273#(<= ~counter~0 1)} ~cond := #in~cond; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {20273#(<= ~counter~0 1)} assume !(0 == ~cond); {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {20273#(<= ~counter~0 1)} assume true; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,548 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20273#(<= ~counter~0 1)} {20273#(<= ~counter~0 1)} #61#return; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,549 INFO L272 TraceCheckUtils]: 18: Hoare triple {20273#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {20273#(<= ~counter~0 1)} ~cond := #in~cond; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {20273#(<= ~counter~0 1)} assume !(0 == ~cond); {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {20273#(<= ~counter~0 1)} assume true; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,550 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20273#(<= ~counter~0 1)} {20273#(<= ~counter~0 1)} #63#return; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,550 INFO L272 TraceCheckUtils]: 23: Hoare triple {20273#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {20273#(<= ~counter~0 1)} ~cond := #in~cond; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {20273#(<= ~counter~0 1)} assume !(0 == ~cond); {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {20273#(<= ~counter~0 1)} assume true; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,552 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20273#(<= ~counter~0 1)} {20273#(<= ~counter~0 1)} #65#return; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,552 INFO L272 TraceCheckUtils]: 28: Hoare triple {20273#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {20273#(<= ~counter~0 1)} ~cond := #in~cond; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {20273#(<= ~counter~0 1)} assume !(0 == ~cond); {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {20273#(<= ~counter~0 1)} assume true; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,553 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20273#(<= ~counter~0 1)} {20273#(<= ~counter~0 1)} #67#return; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {20273#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20273#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:10,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {20273#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {20358#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,555 INFO L272 TraceCheckUtils]: 36: Hoare triple {20358#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {20358#(<= ~counter~0 2)} ~cond := #in~cond; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {20358#(<= ~counter~0 2)} assume !(0 == ~cond); {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {20358#(<= ~counter~0 2)} assume true; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,556 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20358#(<= ~counter~0 2)} {20358#(<= ~counter~0 2)} #59#return; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,557 INFO L272 TraceCheckUtils]: 41: Hoare triple {20358#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {20358#(<= ~counter~0 2)} ~cond := #in~cond; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {20358#(<= ~counter~0 2)} assume !(0 == ~cond); {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {20358#(<= ~counter~0 2)} assume true; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,558 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20358#(<= ~counter~0 2)} {20358#(<= ~counter~0 2)} #61#return; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,558 INFO L272 TraceCheckUtils]: 46: Hoare triple {20358#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,558 INFO L290 TraceCheckUtils]: 47: Hoare triple {20358#(<= ~counter~0 2)} ~cond := #in~cond; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {20358#(<= ~counter~0 2)} assume !(0 == ~cond); {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {20358#(<= ~counter~0 2)} assume true; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,559 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20358#(<= ~counter~0 2)} {20358#(<= ~counter~0 2)} #63#return; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,560 INFO L272 TraceCheckUtils]: 51: Hoare triple {20358#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,560 INFO L290 TraceCheckUtils]: 52: Hoare triple {20358#(<= ~counter~0 2)} ~cond := #in~cond; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {20358#(<= ~counter~0 2)} assume !(0 == ~cond); {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,561 INFO L290 TraceCheckUtils]: 54: Hoare triple {20358#(<= ~counter~0 2)} assume true; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,561 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20358#(<= ~counter~0 2)} {20358#(<= ~counter~0 2)} #65#return; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,562 INFO L272 TraceCheckUtils]: 56: Hoare triple {20358#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,562 INFO L290 TraceCheckUtils]: 57: Hoare triple {20358#(<= ~counter~0 2)} ~cond := #in~cond; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,562 INFO L290 TraceCheckUtils]: 58: Hoare triple {20358#(<= ~counter~0 2)} assume !(0 == ~cond); {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,562 INFO L290 TraceCheckUtils]: 59: Hoare triple {20358#(<= ~counter~0 2)} assume true; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,563 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20358#(<= ~counter~0 2)} {20358#(<= ~counter~0 2)} #67#return; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,563 INFO L290 TraceCheckUtils]: 61: Hoare triple {20358#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20358#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:10,564 INFO L290 TraceCheckUtils]: 62: Hoare triple {20358#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,564 INFO L290 TraceCheckUtils]: 63: Hoare triple {20443#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,564 INFO L272 TraceCheckUtils]: 64: Hoare triple {20443#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,565 INFO L290 TraceCheckUtils]: 65: Hoare triple {20443#(<= ~counter~0 3)} ~cond := #in~cond; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,565 INFO L290 TraceCheckUtils]: 66: Hoare triple {20443#(<= ~counter~0 3)} assume !(0 == ~cond); {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,565 INFO L290 TraceCheckUtils]: 67: Hoare triple {20443#(<= ~counter~0 3)} assume true; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,566 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {20443#(<= ~counter~0 3)} {20443#(<= ~counter~0 3)} #59#return; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,566 INFO L272 TraceCheckUtils]: 69: Hoare triple {20443#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,566 INFO L290 TraceCheckUtils]: 70: Hoare triple {20443#(<= ~counter~0 3)} ~cond := #in~cond; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,567 INFO L290 TraceCheckUtils]: 71: Hoare triple {20443#(<= ~counter~0 3)} assume !(0 == ~cond); {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,567 INFO L290 TraceCheckUtils]: 72: Hoare triple {20443#(<= ~counter~0 3)} assume true; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,567 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20443#(<= ~counter~0 3)} {20443#(<= ~counter~0 3)} #61#return; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,568 INFO L272 TraceCheckUtils]: 74: Hoare triple {20443#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,568 INFO L290 TraceCheckUtils]: 75: Hoare triple {20443#(<= ~counter~0 3)} ~cond := #in~cond; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,568 INFO L290 TraceCheckUtils]: 76: Hoare triple {20443#(<= ~counter~0 3)} assume !(0 == ~cond); {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,569 INFO L290 TraceCheckUtils]: 77: Hoare triple {20443#(<= ~counter~0 3)} assume true; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,569 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {20443#(<= ~counter~0 3)} {20443#(<= ~counter~0 3)} #63#return; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,569 INFO L272 TraceCheckUtils]: 79: Hoare triple {20443#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,570 INFO L290 TraceCheckUtils]: 80: Hoare triple {20443#(<= ~counter~0 3)} ~cond := #in~cond; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,570 INFO L290 TraceCheckUtils]: 81: Hoare triple {20443#(<= ~counter~0 3)} assume !(0 == ~cond); {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,570 INFO L290 TraceCheckUtils]: 82: Hoare triple {20443#(<= ~counter~0 3)} assume true; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,571 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {20443#(<= ~counter~0 3)} {20443#(<= ~counter~0 3)} #65#return; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,571 INFO L272 TraceCheckUtils]: 84: Hoare triple {20443#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,571 INFO L290 TraceCheckUtils]: 85: Hoare triple {20443#(<= ~counter~0 3)} ~cond := #in~cond; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,572 INFO L290 TraceCheckUtils]: 86: Hoare triple {20443#(<= ~counter~0 3)} assume !(0 == ~cond); {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,572 INFO L290 TraceCheckUtils]: 87: Hoare triple {20443#(<= ~counter~0 3)} assume true; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,572 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {20443#(<= ~counter~0 3)} {20443#(<= ~counter~0 3)} #67#return; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,573 INFO L290 TraceCheckUtils]: 89: Hoare triple {20443#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20443#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:10,573 INFO L290 TraceCheckUtils]: 90: Hoare triple {20443#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,573 INFO L290 TraceCheckUtils]: 91: Hoare triple {20528#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,574 INFO L272 TraceCheckUtils]: 92: Hoare triple {20528#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,574 INFO L290 TraceCheckUtils]: 93: Hoare triple {20528#(<= ~counter~0 4)} ~cond := #in~cond; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,574 INFO L290 TraceCheckUtils]: 94: Hoare triple {20528#(<= ~counter~0 4)} assume !(0 == ~cond); {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,575 INFO L290 TraceCheckUtils]: 95: Hoare triple {20528#(<= ~counter~0 4)} assume true; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,575 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {20528#(<= ~counter~0 4)} {20528#(<= ~counter~0 4)} #59#return; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,576 INFO L272 TraceCheckUtils]: 97: Hoare triple {20528#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,576 INFO L290 TraceCheckUtils]: 98: Hoare triple {20528#(<= ~counter~0 4)} ~cond := #in~cond; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,576 INFO L290 TraceCheckUtils]: 99: Hoare triple {20528#(<= ~counter~0 4)} assume !(0 == ~cond); {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,576 INFO L290 TraceCheckUtils]: 100: Hoare triple {20528#(<= ~counter~0 4)} assume true; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,577 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {20528#(<= ~counter~0 4)} {20528#(<= ~counter~0 4)} #61#return; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,577 INFO L272 TraceCheckUtils]: 102: Hoare triple {20528#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,577 INFO L290 TraceCheckUtils]: 103: Hoare triple {20528#(<= ~counter~0 4)} ~cond := #in~cond; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,578 INFO L290 TraceCheckUtils]: 104: Hoare triple {20528#(<= ~counter~0 4)} assume !(0 == ~cond); {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,578 INFO L290 TraceCheckUtils]: 105: Hoare triple {20528#(<= ~counter~0 4)} assume true; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,578 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20528#(<= ~counter~0 4)} {20528#(<= ~counter~0 4)} #63#return; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,579 INFO L272 TraceCheckUtils]: 107: Hoare triple {20528#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,579 INFO L290 TraceCheckUtils]: 108: Hoare triple {20528#(<= ~counter~0 4)} ~cond := #in~cond; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,580 INFO L290 TraceCheckUtils]: 109: Hoare triple {20528#(<= ~counter~0 4)} assume !(0 == ~cond); {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,580 INFO L290 TraceCheckUtils]: 110: Hoare triple {20528#(<= ~counter~0 4)} assume true; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,580 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {20528#(<= ~counter~0 4)} {20528#(<= ~counter~0 4)} #65#return; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,581 INFO L272 TraceCheckUtils]: 112: Hoare triple {20528#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,581 INFO L290 TraceCheckUtils]: 113: Hoare triple {20528#(<= ~counter~0 4)} ~cond := #in~cond; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,581 INFO L290 TraceCheckUtils]: 114: Hoare triple {20528#(<= ~counter~0 4)} assume !(0 == ~cond); {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,581 INFO L290 TraceCheckUtils]: 115: Hoare triple {20528#(<= ~counter~0 4)} assume true; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,582 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {20528#(<= ~counter~0 4)} {20528#(<= ~counter~0 4)} #67#return; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,582 INFO L290 TraceCheckUtils]: 117: Hoare triple {20528#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20528#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:10,583 INFO L290 TraceCheckUtils]: 118: Hoare triple {20528#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,583 INFO L290 TraceCheckUtils]: 119: Hoare triple {20613#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,583 INFO L272 TraceCheckUtils]: 120: Hoare triple {20613#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,584 INFO L290 TraceCheckUtils]: 121: Hoare triple {20613#(<= ~counter~0 5)} ~cond := #in~cond; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,584 INFO L290 TraceCheckUtils]: 122: Hoare triple {20613#(<= ~counter~0 5)} assume !(0 == ~cond); {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,584 INFO L290 TraceCheckUtils]: 123: Hoare triple {20613#(<= ~counter~0 5)} assume true; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,585 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {20613#(<= ~counter~0 5)} {20613#(<= ~counter~0 5)} #59#return; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,585 INFO L272 TraceCheckUtils]: 125: Hoare triple {20613#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,585 INFO L290 TraceCheckUtils]: 126: Hoare triple {20613#(<= ~counter~0 5)} ~cond := #in~cond; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,586 INFO L290 TraceCheckUtils]: 127: Hoare triple {20613#(<= ~counter~0 5)} assume !(0 == ~cond); {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,586 INFO L290 TraceCheckUtils]: 128: Hoare triple {20613#(<= ~counter~0 5)} assume true; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,586 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {20613#(<= ~counter~0 5)} {20613#(<= ~counter~0 5)} #61#return; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,587 INFO L272 TraceCheckUtils]: 130: Hoare triple {20613#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,587 INFO L290 TraceCheckUtils]: 131: Hoare triple {20613#(<= ~counter~0 5)} ~cond := #in~cond; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,587 INFO L290 TraceCheckUtils]: 132: Hoare triple {20613#(<= ~counter~0 5)} assume !(0 == ~cond); {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,588 INFO L290 TraceCheckUtils]: 133: Hoare triple {20613#(<= ~counter~0 5)} assume true; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,588 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {20613#(<= ~counter~0 5)} {20613#(<= ~counter~0 5)} #63#return; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,588 INFO L272 TraceCheckUtils]: 135: Hoare triple {20613#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,589 INFO L290 TraceCheckUtils]: 136: Hoare triple {20613#(<= ~counter~0 5)} ~cond := #in~cond; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,589 INFO L290 TraceCheckUtils]: 137: Hoare triple {20613#(<= ~counter~0 5)} assume !(0 == ~cond); {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,589 INFO L290 TraceCheckUtils]: 138: Hoare triple {20613#(<= ~counter~0 5)} assume true; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,590 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {20613#(<= ~counter~0 5)} {20613#(<= ~counter~0 5)} #65#return; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,590 INFO L272 TraceCheckUtils]: 140: Hoare triple {20613#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,590 INFO L290 TraceCheckUtils]: 141: Hoare triple {20613#(<= ~counter~0 5)} ~cond := #in~cond; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,591 INFO L290 TraceCheckUtils]: 142: Hoare triple {20613#(<= ~counter~0 5)} assume !(0 == ~cond); {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,591 INFO L290 TraceCheckUtils]: 143: Hoare triple {20613#(<= ~counter~0 5)} assume true; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,591 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {20613#(<= ~counter~0 5)} {20613#(<= ~counter~0 5)} #67#return; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,592 INFO L290 TraceCheckUtils]: 145: Hoare triple {20613#(<= ~counter~0 5)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20613#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:10,592 INFO L290 TraceCheckUtils]: 146: Hoare triple {20613#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,592 INFO L290 TraceCheckUtils]: 147: Hoare triple {20698#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,593 INFO L272 TraceCheckUtils]: 148: Hoare triple {20698#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,593 INFO L290 TraceCheckUtils]: 149: Hoare triple {20698#(<= ~counter~0 6)} ~cond := #in~cond; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,593 INFO L290 TraceCheckUtils]: 150: Hoare triple {20698#(<= ~counter~0 6)} assume !(0 == ~cond); {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,594 INFO L290 TraceCheckUtils]: 151: Hoare triple {20698#(<= ~counter~0 6)} assume true; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,594 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {20698#(<= ~counter~0 6)} {20698#(<= ~counter~0 6)} #59#return; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,594 INFO L272 TraceCheckUtils]: 153: Hoare triple {20698#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,595 INFO L290 TraceCheckUtils]: 154: Hoare triple {20698#(<= ~counter~0 6)} ~cond := #in~cond; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,595 INFO L290 TraceCheckUtils]: 155: Hoare triple {20698#(<= ~counter~0 6)} assume !(0 == ~cond); {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,595 INFO L290 TraceCheckUtils]: 156: Hoare triple {20698#(<= ~counter~0 6)} assume true; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,596 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {20698#(<= ~counter~0 6)} {20698#(<= ~counter~0 6)} #61#return; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,596 INFO L272 TraceCheckUtils]: 158: Hoare triple {20698#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,596 INFO L290 TraceCheckUtils]: 159: Hoare triple {20698#(<= ~counter~0 6)} ~cond := #in~cond; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,597 INFO L290 TraceCheckUtils]: 160: Hoare triple {20698#(<= ~counter~0 6)} assume !(0 == ~cond); {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,597 INFO L290 TraceCheckUtils]: 161: Hoare triple {20698#(<= ~counter~0 6)} assume true; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,597 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {20698#(<= ~counter~0 6)} {20698#(<= ~counter~0 6)} #63#return; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,598 INFO L272 TraceCheckUtils]: 163: Hoare triple {20698#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,598 INFO L290 TraceCheckUtils]: 164: Hoare triple {20698#(<= ~counter~0 6)} ~cond := #in~cond; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,598 INFO L290 TraceCheckUtils]: 165: Hoare triple {20698#(<= ~counter~0 6)} assume !(0 == ~cond); {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,598 INFO L290 TraceCheckUtils]: 166: Hoare triple {20698#(<= ~counter~0 6)} assume true; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,599 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {20698#(<= ~counter~0 6)} {20698#(<= ~counter~0 6)} #65#return; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,599 INFO L272 TraceCheckUtils]: 168: Hoare triple {20698#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,600 INFO L290 TraceCheckUtils]: 169: Hoare triple {20698#(<= ~counter~0 6)} ~cond := #in~cond; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,600 INFO L290 TraceCheckUtils]: 170: Hoare triple {20698#(<= ~counter~0 6)} assume !(0 == ~cond); {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,600 INFO L290 TraceCheckUtils]: 171: Hoare triple {20698#(<= ~counter~0 6)} assume true; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,601 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {20698#(<= ~counter~0 6)} {20698#(<= ~counter~0 6)} #67#return; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,601 INFO L290 TraceCheckUtils]: 173: Hoare triple {20698#(<= ~counter~0 6)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20698#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:10,601 INFO L290 TraceCheckUtils]: 174: Hoare triple {20698#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,602 INFO L290 TraceCheckUtils]: 175: Hoare triple {20783#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,602 INFO L272 TraceCheckUtils]: 176: Hoare triple {20783#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,602 INFO L290 TraceCheckUtils]: 177: Hoare triple {20783#(<= ~counter~0 7)} ~cond := #in~cond; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,602 INFO L290 TraceCheckUtils]: 178: Hoare triple {20783#(<= ~counter~0 7)} assume !(0 == ~cond); {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,603 INFO L290 TraceCheckUtils]: 179: Hoare triple {20783#(<= ~counter~0 7)} assume true; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,603 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {20783#(<= ~counter~0 7)} {20783#(<= ~counter~0 7)} #59#return; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,604 INFO L272 TraceCheckUtils]: 181: Hoare triple {20783#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,604 INFO L290 TraceCheckUtils]: 182: Hoare triple {20783#(<= ~counter~0 7)} ~cond := #in~cond; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,604 INFO L290 TraceCheckUtils]: 183: Hoare triple {20783#(<= ~counter~0 7)} assume !(0 == ~cond); {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,604 INFO L290 TraceCheckUtils]: 184: Hoare triple {20783#(<= ~counter~0 7)} assume true; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,605 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {20783#(<= ~counter~0 7)} {20783#(<= ~counter~0 7)} #61#return; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,605 INFO L272 TraceCheckUtils]: 186: Hoare triple {20783#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,605 INFO L290 TraceCheckUtils]: 187: Hoare triple {20783#(<= ~counter~0 7)} ~cond := #in~cond; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,606 INFO L290 TraceCheckUtils]: 188: Hoare triple {20783#(<= ~counter~0 7)} assume !(0 == ~cond); {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,606 INFO L290 TraceCheckUtils]: 189: Hoare triple {20783#(<= ~counter~0 7)} assume true; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,606 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {20783#(<= ~counter~0 7)} {20783#(<= ~counter~0 7)} #63#return; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,607 INFO L272 TraceCheckUtils]: 191: Hoare triple {20783#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,607 INFO L290 TraceCheckUtils]: 192: Hoare triple {20783#(<= ~counter~0 7)} ~cond := #in~cond; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,607 INFO L290 TraceCheckUtils]: 193: Hoare triple {20783#(<= ~counter~0 7)} assume !(0 == ~cond); {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,608 INFO L290 TraceCheckUtils]: 194: Hoare triple {20783#(<= ~counter~0 7)} assume true; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,608 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {20783#(<= ~counter~0 7)} {20783#(<= ~counter~0 7)} #65#return; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,609 INFO L272 TraceCheckUtils]: 196: Hoare triple {20783#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,609 INFO L290 TraceCheckUtils]: 197: Hoare triple {20783#(<= ~counter~0 7)} ~cond := #in~cond; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,609 INFO L290 TraceCheckUtils]: 198: Hoare triple {20783#(<= ~counter~0 7)} assume !(0 == ~cond); {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,609 INFO L290 TraceCheckUtils]: 199: Hoare triple {20783#(<= ~counter~0 7)} assume true; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,610 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {20783#(<= ~counter~0 7)} {20783#(<= ~counter~0 7)} #67#return; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,610 INFO L290 TraceCheckUtils]: 201: Hoare triple {20783#(<= ~counter~0 7)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20783#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:10,610 INFO L290 TraceCheckUtils]: 202: Hoare triple {20783#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,611 INFO L290 TraceCheckUtils]: 203: Hoare triple {20868#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,611 INFO L272 TraceCheckUtils]: 204: Hoare triple {20868#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,611 INFO L290 TraceCheckUtils]: 205: Hoare triple {20868#(<= ~counter~0 8)} ~cond := #in~cond; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,612 INFO L290 TraceCheckUtils]: 206: Hoare triple {20868#(<= ~counter~0 8)} assume !(0 == ~cond); {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,612 INFO L290 TraceCheckUtils]: 207: Hoare triple {20868#(<= ~counter~0 8)} assume true; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,612 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {20868#(<= ~counter~0 8)} {20868#(<= ~counter~0 8)} #59#return; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,613 INFO L272 TraceCheckUtils]: 209: Hoare triple {20868#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,613 INFO L290 TraceCheckUtils]: 210: Hoare triple {20868#(<= ~counter~0 8)} ~cond := #in~cond; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,613 INFO L290 TraceCheckUtils]: 211: Hoare triple {20868#(<= ~counter~0 8)} assume !(0 == ~cond); {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,614 INFO L290 TraceCheckUtils]: 212: Hoare triple {20868#(<= ~counter~0 8)} assume true; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,614 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {20868#(<= ~counter~0 8)} {20868#(<= ~counter~0 8)} #61#return; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,614 INFO L272 TraceCheckUtils]: 214: Hoare triple {20868#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,615 INFO L290 TraceCheckUtils]: 215: Hoare triple {20868#(<= ~counter~0 8)} ~cond := #in~cond; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,615 INFO L290 TraceCheckUtils]: 216: Hoare triple {20868#(<= ~counter~0 8)} assume !(0 == ~cond); {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,615 INFO L290 TraceCheckUtils]: 217: Hoare triple {20868#(<= ~counter~0 8)} assume true; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,616 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {20868#(<= ~counter~0 8)} {20868#(<= ~counter~0 8)} #63#return; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,616 INFO L272 TraceCheckUtils]: 219: Hoare triple {20868#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,616 INFO L290 TraceCheckUtils]: 220: Hoare triple {20868#(<= ~counter~0 8)} ~cond := #in~cond; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,617 INFO L290 TraceCheckUtils]: 221: Hoare triple {20868#(<= ~counter~0 8)} assume !(0 == ~cond); {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,617 INFO L290 TraceCheckUtils]: 222: Hoare triple {20868#(<= ~counter~0 8)} assume true; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,617 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {20868#(<= ~counter~0 8)} {20868#(<= ~counter~0 8)} #65#return; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,618 INFO L272 TraceCheckUtils]: 224: Hoare triple {20868#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,618 INFO L290 TraceCheckUtils]: 225: Hoare triple {20868#(<= ~counter~0 8)} ~cond := #in~cond; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,618 INFO L290 TraceCheckUtils]: 226: Hoare triple {20868#(<= ~counter~0 8)} assume !(0 == ~cond); {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,618 INFO L290 TraceCheckUtils]: 227: Hoare triple {20868#(<= ~counter~0 8)} assume true; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,619 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {20868#(<= ~counter~0 8)} {20868#(<= ~counter~0 8)} #67#return; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,619 INFO L290 TraceCheckUtils]: 229: Hoare triple {20868#(<= ~counter~0 8)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20868#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:10,620 INFO L290 TraceCheckUtils]: 230: Hoare triple {20868#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,620 INFO L290 TraceCheckUtils]: 231: Hoare triple {20953#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,620 INFO L272 TraceCheckUtils]: 232: Hoare triple {20953#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,621 INFO L290 TraceCheckUtils]: 233: Hoare triple {20953#(<= ~counter~0 9)} ~cond := #in~cond; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,621 INFO L290 TraceCheckUtils]: 234: Hoare triple {20953#(<= ~counter~0 9)} assume !(0 == ~cond); {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,621 INFO L290 TraceCheckUtils]: 235: Hoare triple {20953#(<= ~counter~0 9)} assume true; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,622 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {20953#(<= ~counter~0 9)} {20953#(<= ~counter~0 9)} #59#return; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,622 INFO L272 TraceCheckUtils]: 237: Hoare triple {20953#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,622 INFO L290 TraceCheckUtils]: 238: Hoare triple {20953#(<= ~counter~0 9)} ~cond := #in~cond; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,623 INFO L290 TraceCheckUtils]: 239: Hoare triple {20953#(<= ~counter~0 9)} assume !(0 == ~cond); {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,623 INFO L290 TraceCheckUtils]: 240: Hoare triple {20953#(<= ~counter~0 9)} assume true; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,623 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {20953#(<= ~counter~0 9)} {20953#(<= ~counter~0 9)} #61#return; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,624 INFO L272 TraceCheckUtils]: 242: Hoare triple {20953#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,624 INFO L290 TraceCheckUtils]: 243: Hoare triple {20953#(<= ~counter~0 9)} ~cond := #in~cond; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,624 INFO L290 TraceCheckUtils]: 244: Hoare triple {20953#(<= ~counter~0 9)} assume !(0 == ~cond); {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,624 INFO L290 TraceCheckUtils]: 245: Hoare triple {20953#(<= ~counter~0 9)} assume true; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,625 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {20953#(<= ~counter~0 9)} {20953#(<= ~counter~0 9)} #63#return; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,625 INFO L272 TraceCheckUtils]: 247: Hoare triple {20953#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,626 INFO L290 TraceCheckUtils]: 248: Hoare triple {20953#(<= ~counter~0 9)} ~cond := #in~cond; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,626 INFO L290 TraceCheckUtils]: 249: Hoare triple {20953#(<= ~counter~0 9)} assume !(0 == ~cond); {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,626 INFO L290 TraceCheckUtils]: 250: Hoare triple {20953#(<= ~counter~0 9)} assume true; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,627 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {20953#(<= ~counter~0 9)} {20953#(<= ~counter~0 9)} #65#return; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,627 INFO L272 TraceCheckUtils]: 252: Hoare triple {20953#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,627 INFO L290 TraceCheckUtils]: 253: Hoare triple {20953#(<= ~counter~0 9)} ~cond := #in~cond; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,628 INFO L290 TraceCheckUtils]: 254: Hoare triple {20953#(<= ~counter~0 9)} assume !(0 == ~cond); {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,628 INFO L290 TraceCheckUtils]: 255: Hoare triple {20953#(<= ~counter~0 9)} assume true; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,628 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {20953#(<= ~counter~0 9)} {20953#(<= ~counter~0 9)} #67#return; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,628 INFO L290 TraceCheckUtils]: 257: Hoare triple {20953#(<= ~counter~0 9)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20953#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:10,629 INFO L290 TraceCheckUtils]: 258: Hoare triple {20953#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,629 INFO L290 TraceCheckUtils]: 259: Hoare triple {21038#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,630 INFO L272 TraceCheckUtils]: 260: Hoare triple {21038#(<= ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,630 INFO L290 TraceCheckUtils]: 261: Hoare triple {21038#(<= ~counter~0 10)} ~cond := #in~cond; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,630 INFO L290 TraceCheckUtils]: 262: Hoare triple {21038#(<= ~counter~0 10)} assume !(0 == ~cond); {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,630 INFO L290 TraceCheckUtils]: 263: Hoare triple {21038#(<= ~counter~0 10)} assume true; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,631 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {21038#(<= ~counter~0 10)} {21038#(<= ~counter~0 10)} #59#return; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,631 INFO L272 TraceCheckUtils]: 265: Hoare triple {21038#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,632 INFO L290 TraceCheckUtils]: 266: Hoare triple {21038#(<= ~counter~0 10)} ~cond := #in~cond; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,632 INFO L290 TraceCheckUtils]: 267: Hoare triple {21038#(<= ~counter~0 10)} assume !(0 == ~cond); {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,632 INFO L290 TraceCheckUtils]: 268: Hoare triple {21038#(<= ~counter~0 10)} assume true; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,633 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {21038#(<= ~counter~0 10)} {21038#(<= ~counter~0 10)} #61#return; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,633 INFO L272 TraceCheckUtils]: 270: Hoare triple {21038#(<= ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,633 INFO L290 TraceCheckUtils]: 271: Hoare triple {21038#(<= ~counter~0 10)} ~cond := #in~cond; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,633 INFO L290 TraceCheckUtils]: 272: Hoare triple {21038#(<= ~counter~0 10)} assume !(0 == ~cond); {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,634 INFO L290 TraceCheckUtils]: 273: Hoare triple {21038#(<= ~counter~0 10)} assume true; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,634 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {21038#(<= ~counter~0 10)} {21038#(<= ~counter~0 10)} #63#return; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,635 INFO L272 TraceCheckUtils]: 275: Hoare triple {21038#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,635 INFO L290 TraceCheckUtils]: 276: Hoare triple {21038#(<= ~counter~0 10)} ~cond := #in~cond; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,635 INFO L290 TraceCheckUtils]: 277: Hoare triple {21038#(<= ~counter~0 10)} assume !(0 == ~cond); {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,635 INFO L290 TraceCheckUtils]: 278: Hoare triple {21038#(<= ~counter~0 10)} assume true; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,636 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {21038#(<= ~counter~0 10)} {21038#(<= ~counter~0 10)} #65#return; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,636 INFO L272 TraceCheckUtils]: 280: Hoare triple {21038#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,637 INFO L290 TraceCheckUtils]: 281: Hoare triple {21038#(<= ~counter~0 10)} ~cond := #in~cond; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,637 INFO L290 TraceCheckUtils]: 282: Hoare triple {21038#(<= ~counter~0 10)} assume !(0 == ~cond); {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,637 INFO L290 TraceCheckUtils]: 283: Hoare triple {21038#(<= ~counter~0 10)} assume true; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,638 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {21038#(<= ~counter~0 10)} {21038#(<= ~counter~0 10)} #67#return; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,638 INFO L290 TraceCheckUtils]: 285: Hoare triple {21038#(<= ~counter~0 10)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21038#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:10,638 INFO L290 TraceCheckUtils]: 286: Hoare triple {21038#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21123#(<= |main_#t~post5| 10)} is VALID [2022-04-14 15:17:10,639 INFO L290 TraceCheckUtils]: 287: Hoare triple {21123#(<= |main_#t~post5| 10)} assume !(#t~post5 < 50);havoc #t~post5; {20250#false} is VALID [2022-04-14 15:17:10,639 INFO L272 TraceCheckUtils]: 288: Hoare triple {20250#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20250#false} is VALID [2022-04-14 15:17:10,639 INFO L290 TraceCheckUtils]: 289: Hoare triple {20250#false} ~cond := #in~cond; {20250#false} is VALID [2022-04-14 15:17:10,639 INFO L290 TraceCheckUtils]: 290: Hoare triple {20250#false} assume !(0 == ~cond); {20250#false} is VALID [2022-04-14 15:17:10,639 INFO L290 TraceCheckUtils]: 291: Hoare triple {20250#false} assume true; {20250#false} is VALID [2022-04-14 15:17:10,639 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {20250#false} {20250#false} #69#return; {20250#false} is VALID [2022-04-14 15:17:10,639 INFO L272 TraceCheckUtils]: 293: Hoare triple {20250#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {20250#false} is VALID [2022-04-14 15:17:10,639 INFO L290 TraceCheckUtils]: 294: Hoare triple {20250#false} ~cond := #in~cond; {20250#false} is VALID [2022-04-14 15:17:10,639 INFO L290 TraceCheckUtils]: 295: Hoare triple {20250#false} assume 0 == ~cond; {20250#false} is VALID [2022-04-14 15:17:10,639 INFO L290 TraceCheckUtils]: 296: Hoare triple {20250#false} assume !false; {20250#false} is VALID [2022-04-14 15:17:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-04-14 15:17:10,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:17:11,804 INFO L290 TraceCheckUtils]: 296: Hoare triple {20250#false} assume !false; {20250#false} is VALID [2022-04-14 15:17:11,804 INFO L290 TraceCheckUtils]: 295: Hoare triple {20250#false} assume 0 == ~cond; {20250#false} is VALID [2022-04-14 15:17:11,804 INFO L290 TraceCheckUtils]: 294: Hoare triple {20250#false} ~cond := #in~cond; {20250#false} is VALID [2022-04-14 15:17:11,805 INFO L272 TraceCheckUtils]: 293: Hoare triple {20250#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {20250#false} is VALID [2022-04-14 15:17:11,805 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {20249#true} {20250#false} #69#return; {20250#false} is VALID [2022-04-14 15:17:11,805 INFO L290 TraceCheckUtils]: 291: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,805 INFO L290 TraceCheckUtils]: 290: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,805 INFO L290 TraceCheckUtils]: 289: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,805 INFO L272 TraceCheckUtils]: 288: Hoare triple {20250#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,805 INFO L290 TraceCheckUtils]: 287: Hoare triple {21181#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {20250#false} is VALID [2022-04-14 15:17:11,805 INFO L290 TraceCheckUtils]: 286: Hoare triple {21185#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21181#(< |main_#t~post5| 50)} is VALID [2022-04-14 15:17:11,806 INFO L290 TraceCheckUtils]: 285: Hoare triple {21185#(< ~counter~0 50)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21185#(< ~counter~0 50)} is VALID [2022-04-14 15:17:11,806 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {20249#true} {21185#(< ~counter~0 50)} #67#return; {21185#(< ~counter~0 50)} is VALID [2022-04-14 15:17:11,806 INFO L290 TraceCheckUtils]: 283: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,806 INFO L290 TraceCheckUtils]: 282: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,806 INFO L290 TraceCheckUtils]: 281: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,806 INFO L272 TraceCheckUtils]: 280: Hoare triple {21185#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,807 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {20249#true} {21185#(< ~counter~0 50)} #65#return; {21185#(< ~counter~0 50)} is VALID [2022-04-14 15:17:11,807 INFO L290 TraceCheckUtils]: 278: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,807 INFO L290 TraceCheckUtils]: 277: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,807 INFO L290 TraceCheckUtils]: 276: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,807 INFO L272 TraceCheckUtils]: 275: Hoare triple {21185#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,808 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {20249#true} {21185#(< ~counter~0 50)} #63#return; {21185#(< ~counter~0 50)} is VALID [2022-04-14 15:17:11,808 INFO L290 TraceCheckUtils]: 273: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,808 INFO L290 TraceCheckUtils]: 272: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,808 INFO L290 TraceCheckUtils]: 271: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,808 INFO L272 TraceCheckUtils]: 270: Hoare triple {21185#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,808 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {20249#true} {21185#(< ~counter~0 50)} #61#return; {21185#(< ~counter~0 50)} is VALID [2022-04-14 15:17:11,808 INFO L290 TraceCheckUtils]: 268: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,808 INFO L290 TraceCheckUtils]: 267: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,808 INFO L290 TraceCheckUtils]: 266: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,809 INFO L272 TraceCheckUtils]: 265: Hoare triple {21185#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,809 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {20249#true} {21185#(< ~counter~0 50)} #59#return; {21185#(< ~counter~0 50)} is VALID [2022-04-14 15:17:11,809 INFO L290 TraceCheckUtils]: 263: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,809 INFO L290 TraceCheckUtils]: 262: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,809 INFO L290 TraceCheckUtils]: 261: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,809 INFO L272 TraceCheckUtils]: 260: Hoare triple {21185#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,809 INFO L290 TraceCheckUtils]: 259: Hoare triple {21185#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {21185#(< ~counter~0 50)} is VALID [2022-04-14 15:17:11,810 INFO L290 TraceCheckUtils]: 258: Hoare triple {21270#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21185#(< ~counter~0 50)} is VALID [2022-04-14 15:17:11,810 INFO L290 TraceCheckUtils]: 257: Hoare triple {21270#(< ~counter~0 49)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21270#(< ~counter~0 49)} is VALID [2022-04-14 15:17:11,811 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {20249#true} {21270#(< ~counter~0 49)} #67#return; {21270#(< ~counter~0 49)} is VALID [2022-04-14 15:17:11,811 INFO L290 TraceCheckUtils]: 255: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,811 INFO L290 TraceCheckUtils]: 254: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,811 INFO L290 TraceCheckUtils]: 253: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,811 INFO L272 TraceCheckUtils]: 252: Hoare triple {21270#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,812 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {20249#true} {21270#(< ~counter~0 49)} #65#return; {21270#(< ~counter~0 49)} is VALID [2022-04-14 15:17:11,812 INFO L290 TraceCheckUtils]: 250: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,812 INFO L290 TraceCheckUtils]: 249: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,812 INFO L290 TraceCheckUtils]: 248: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,812 INFO L272 TraceCheckUtils]: 247: Hoare triple {21270#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,812 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {20249#true} {21270#(< ~counter~0 49)} #63#return; {21270#(< ~counter~0 49)} is VALID [2022-04-14 15:17:11,812 INFO L290 TraceCheckUtils]: 245: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,812 INFO L290 TraceCheckUtils]: 244: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,812 INFO L290 TraceCheckUtils]: 243: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,813 INFO L272 TraceCheckUtils]: 242: Hoare triple {21270#(< ~counter~0 49)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,813 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {20249#true} {21270#(< ~counter~0 49)} #61#return; {21270#(< ~counter~0 49)} is VALID [2022-04-14 15:17:11,813 INFO L290 TraceCheckUtils]: 240: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,813 INFO L290 TraceCheckUtils]: 239: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,813 INFO L290 TraceCheckUtils]: 238: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,813 INFO L272 TraceCheckUtils]: 237: Hoare triple {21270#(< ~counter~0 49)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,814 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {20249#true} {21270#(< ~counter~0 49)} #59#return; {21270#(< ~counter~0 49)} is VALID [2022-04-14 15:17:11,814 INFO L290 TraceCheckUtils]: 235: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,814 INFO L290 TraceCheckUtils]: 234: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,814 INFO L290 TraceCheckUtils]: 233: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,814 INFO L272 TraceCheckUtils]: 232: Hoare triple {21270#(< ~counter~0 49)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,814 INFO L290 TraceCheckUtils]: 231: Hoare triple {21270#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {21270#(< ~counter~0 49)} is VALID [2022-04-14 15:17:11,815 INFO L290 TraceCheckUtils]: 230: Hoare triple {21355#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21270#(< ~counter~0 49)} is VALID [2022-04-14 15:17:11,815 INFO L290 TraceCheckUtils]: 229: Hoare triple {21355#(< ~counter~0 48)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21355#(< ~counter~0 48)} is VALID [2022-04-14 15:17:11,815 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {20249#true} {21355#(< ~counter~0 48)} #67#return; {21355#(< ~counter~0 48)} is VALID [2022-04-14 15:17:11,815 INFO L290 TraceCheckUtils]: 227: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,815 INFO L290 TraceCheckUtils]: 226: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,815 INFO L290 TraceCheckUtils]: 225: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,816 INFO L272 TraceCheckUtils]: 224: Hoare triple {21355#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,816 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {20249#true} {21355#(< ~counter~0 48)} #65#return; {21355#(< ~counter~0 48)} is VALID [2022-04-14 15:17:11,816 INFO L290 TraceCheckUtils]: 222: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,816 INFO L290 TraceCheckUtils]: 221: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,816 INFO L290 TraceCheckUtils]: 220: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,816 INFO L272 TraceCheckUtils]: 219: Hoare triple {21355#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,817 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {20249#true} {21355#(< ~counter~0 48)} #63#return; {21355#(< ~counter~0 48)} is VALID [2022-04-14 15:17:11,817 INFO L290 TraceCheckUtils]: 217: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,817 INFO L290 TraceCheckUtils]: 216: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,817 INFO L290 TraceCheckUtils]: 215: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,817 INFO L272 TraceCheckUtils]: 214: Hoare triple {21355#(< ~counter~0 48)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,817 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {20249#true} {21355#(< ~counter~0 48)} #61#return; {21355#(< ~counter~0 48)} is VALID [2022-04-14 15:17:11,817 INFO L290 TraceCheckUtils]: 212: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,817 INFO L290 TraceCheckUtils]: 211: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,818 INFO L290 TraceCheckUtils]: 210: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,818 INFO L272 TraceCheckUtils]: 209: Hoare triple {21355#(< ~counter~0 48)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,818 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {20249#true} {21355#(< ~counter~0 48)} #59#return; {21355#(< ~counter~0 48)} is VALID [2022-04-14 15:17:11,818 INFO L290 TraceCheckUtils]: 207: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,818 INFO L290 TraceCheckUtils]: 206: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,818 INFO L290 TraceCheckUtils]: 205: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,818 INFO L272 TraceCheckUtils]: 204: Hoare triple {21355#(< ~counter~0 48)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,819 INFO L290 TraceCheckUtils]: 203: Hoare triple {21355#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {21355#(< ~counter~0 48)} is VALID [2022-04-14 15:17:11,820 INFO L290 TraceCheckUtils]: 202: Hoare triple {21440#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21355#(< ~counter~0 48)} is VALID [2022-04-14 15:17:11,820 INFO L290 TraceCheckUtils]: 201: Hoare triple {21440#(< ~counter~0 47)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21440#(< ~counter~0 47)} is VALID [2022-04-14 15:17:11,821 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {20249#true} {21440#(< ~counter~0 47)} #67#return; {21440#(< ~counter~0 47)} is VALID [2022-04-14 15:17:11,821 INFO L290 TraceCheckUtils]: 199: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,821 INFO L290 TraceCheckUtils]: 198: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,821 INFO L290 TraceCheckUtils]: 197: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,821 INFO L272 TraceCheckUtils]: 196: Hoare triple {21440#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,822 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {20249#true} {21440#(< ~counter~0 47)} #65#return; {21440#(< ~counter~0 47)} is VALID [2022-04-14 15:17:11,822 INFO L290 TraceCheckUtils]: 194: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,822 INFO L290 TraceCheckUtils]: 193: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,822 INFO L290 TraceCheckUtils]: 192: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,822 INFO L272 TraceCheckUtils]: 191: Hoare triple {21440#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,823 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {20249#true} {21440#(< ~counter~0 47)} #63#return; {21440#(< ~counter~0 47)} is VALID [2022-04-14 15:17:11,823 INFO L290 TraceCheckUtils]: 189: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,823 INFO L290 TraceCheckUtils]: 188: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,823 INFO L290 TraceCheckUtils]: 187: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,823 INFO L272 TraceCheckUtils]: 186: Hoare triple {21440#(< ~counter~0 47)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,824 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {20249#true} {21440#(< ~counter~0 47)} #61#return; {21440#(< ~counter~0 47)} is VALID [2022-04-14 15:17:11,824 INFO L290 TraceCheckUtils]: 184: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,824 INFO L290 TraceCheckUtils]: 183: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,824 INFO L290 TraceCheckUtils]: 182: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,824 INFO L272 TraceCheckUtils]: 181: Hoare triple {21440#(< ~counter~0 47)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,825 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {20249#true} {21440#(< ~counter~0 47)} #59#return; {21440#(< ~counter~0 47)} is VALID [2022-04-14 15:17:11,825 INFO L290 TraceCheckUtils]: 179: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,825 INFO L290 TraceCheckUtils]: 178: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,825 INFO L290 TraceCheckUtils]: 177: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,825 INFO L272 TraceCheckUtils]: 176: Hoare triple {21440#(< ~counter~0 47)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,826 INFO L290 TraceCheckUtils]: 175: Hoare triple {21440#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {21440#(< ~counter~0 47)} is VALID [2022-04-14 15:17:11,826 INFO L290 TraceCheckUtils]: 174: Hoare triple {21525#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21440#(< ~counter~0 47)} is VALID [2022-04-14 15:17:11,827 INFO L290 TraceCheckUtils]: 173: Hoare triple {21525#(< ~counter~0 46)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21525#(< ~counter~0 46)} is VALID [2022-04-14 15:17:11,827 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {20249#true} {21525#(< ~counter~0 46)} #67#return; {21525#(< ~counter~0 46)} is VALID [2022-04-14 15:17:11,827 INFO L290 TraceCheckUtils]: 171: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,827 INFO L290 TraceCheckUtils]: 170: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,828 INFO L290 TraceCheckUtils]: 169: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,828 INFO L272 TraceCheckUtils]: 168: Hoare triple {21525#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,828 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {20249#true} {21525#(< ~counter~0 46)} #65#return; {21525#(< ~counter~0 46)} is VALID [2022-04-14 15:17:11,828 INFO L290 TraceCheckUtils]: 166: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,828 INFO L290 TraceCheckUtils]: 165: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,829 INFO L290 TraceCheckUtils]: 164: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,829 INFO L272 TraceCheckUtils]: 163: Hoare triple {21525#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,829 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {20249#true} {21525#(< ~counter~0 46)} #63#return; {21525#(< ~counter~0 46)} is VALID [2022-04-14 15:17:11,829 INFO L290 TraceCheckUtils]: 161: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,829 INFO L290 TraceCheckUtils]: 160: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,830 INFO L290 TraceCheckUtils]: 159: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,830 INFO L272 TraceCheckUtils]: 158: Hoare triple {21525#(< ~counter~0 46)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,830 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {20249#true} {21525#(< ~counter~0 46)} #61#return; {21525#(< ~counter~0 46)} is VALID [2022-04-14 15:17:11,830 INFO L290 TraceCheckUtils]: 156: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,830 INFO L290 TraceCheckUtils]: 155: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,831 INFO L290 TraceCheckUtils]: 154: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,831 INFO L272 TraceCheckUtils]: 153: Hoare triple {21525#(< ~counter~0 46)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,831 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {20249#true} {21525#(< ~counter~0 46)} #59#return; {21525#(< ~counter~0 46)} is VALID [2022-04-14 15:17:11,831 INFO L290 TraceCheckUtils]: 151: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,831 INFO L290 TraceCheckUtils]: 150: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,831 INFO L290 TraceCheckUtils]: 149: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,832 INFO L272 TraceCheckUtils]: 148: Hoare triple {21525#(< ~counter~0 46)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,832 INFO L290 TraceCheckUtils]: 147: Hoare triple {21525#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {21525#(< ~counter~0 46)} is VALID [2022-04-14 15:17:11,833 INFO L290 TraceCheckUtils]: 146: Hoare triple {21610#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21525#(< ~counter~0 46)} is VALID [2022-04-14 15:17:11,833 INFO L290 TraceCheckUtils]: 145: Hoare triple {21610#(< ~counter~0 45)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21610#(< ~counter~0 45)} is VALID [2022-04-14 15:17:11,833 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {20249#true} {21610#(< ~counter~0 45)} #67#return; {21610#(< ~counter~0 45)} is VALID [2022-04-14 15:17:11,834 INFO L290 TraceCheckUtils]: 143: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,834 INFO L290 TraceCheckUtils]: 142: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,834 INFO L290 TraceCheckUtils]: 141: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,834 INFO L272 TraceCheckUtils]: 140: Hoare triple {21610#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,834 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {20249#true} {21610#(< ~counter~0 45)} #65#return; {21610#(< ~counter~0 45)} is VALID [2022-04-14 15:17:11,835 INFO L290 TraceCheckUtils]: 138: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,835 INFO L290 TraceCheckUtils]: 137: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,835 INFO L290 TraceCheckUtils]: 136: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,835 INFO L272 TraceCheckUtils]: 135: Hoare triple {21610#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,835 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {20249#true} {21610#(< ~counter~0 45)} #63#return; {21610#(< ~counter~0 45)} is VALID [2022-04-14 15:17:11,835 INFO L290 TraceCheckUtils]: 133: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,836 INFO L290 TraceCheckUtils]: 132: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,836 INFO L290 TraceCheckUtils]: 131: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,836 INFO L272 TraceCheckUtils]: 130: Hoare triple {21610#(< ~counter~0 45)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,836 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {20249#true} {21610#(< ~counter~0 45)} #61#return; {21610#(< ~counter~0 45)} is VALID [2022-04-14 15:17:11,836 INFO L290 TraceCheckUtils]: 128: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,836 INFO L290 TraceCheckUtils]: 127: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,837 INFO L290 TraceCheckUtils]: 126: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,837 INFO L272 TraceCheckUtils]: 125: Hoare triple {21610#(< ~counter~0 45)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,837 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {20249#true} {21610#(< ~counter~0 45)} #59#return; {21610#(< ~counter~0 45)} is VALID [2022-04-14 15:17:11,837 INFO L290 TraceCheckUtils]: 123: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,837 INFO L290 TraceCheckUtils]: 122: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,837 INFO L290 TraceCheckUtils]: 121: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,838 INFO L272 TraceCheckUtils]: 120: Hoare triple {21610#(< ~counter~0 45)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,838 INFO L290 TraceCheckUtils]: 119: Hoare triple {21610#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {21610#(< ~counter~0 45)} is VALID [2022-04-14 15:17:11,839 INFO L290 TraceCheckUtils]: 118: Hoare triple {21695#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21610#(< ~counter~0 45)} is VALID [2022-04-14 15:17:11,839 INFO L290 TraceCheckUtils]: 117: Hoare triple {21695#(< ~counter~0 44)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21695#(< ~counter~0 44)} is VALID [2022-04-14 15:17:11,839 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {20249#true} {21695#(< ~counter~0 44)} #67#return; {21695#(< ~counter~0 44)} is VALID [2022-04-14 15:17:11,840 INFO L290 TraceCheckUtils]: 115: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,840 INFO L290 TraceCheckUtils]: 114: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,840 INFO L290 TraceCheckUtils]: 113: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,840 INFO L272 TraceCheckUtils]: 112: Hoare triple {21695#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,840 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {20249#true} {21695#(< ~counter~0 44)} #65#return; {21695#(< ~counter~0 44)} is VALID [2022-04-14 15:17:11,840 INFO L290 TraceCheckUtils]: 110: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,841 INFO L290 TraceCheckUtils]: 109: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,841 INFO L290 TraceCheckUtils]: 108: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,841 INFO L272 TraceCheckUtils]: 107: Hoare triple {21695#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,841 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20249#true} {21695#(< ~counter~0 44)} #63#return; {21695#(< ~counter~0 44)} is VALID [2022-04-14 15:17:11,841 INFO L290 TraceCheckUtils]: 105: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,841 INFO L290 TraceCheckUtils]: 104: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,841 INFO L290 TraceCheckUtils]: 103: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,842 INFO L272 TraceCheckUtils]: 102: Hoare triple {21695#(< ~counter~0 44)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,842 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {20249#true} {21695#(< ~counter~0 44)} #61#return; {21695#(< ~counter~0 44)} is VALID [2022-04-14 15:17:11,842 INFO L290 TraceCheckUtils]: 100: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,842 INFO L290 TraceCheckUtils]: 99: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,842 INFO L290 TraceCheckUtils]: 98: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,842 INFO L272 TraceCheckUtils]: 97: Hoare triple {21695#(< ~counter~0 44)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,843 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {20249#true} {21695#(< ~counter~0 44)} #59#return; {21695#(< ~counter~0 44)} is VALID [2022-04-14 15:17:11,843 INFO L290 TraceCheckUtils]: 95: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,843 INFO L290 TraceCheckUtils]: 94: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,843 INFO L290 TraceCheckUtils]: 93: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,843 INFO L272 TraceCheckUtils]: 92: Hoare triple {21695#(< ~counter~0 44)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,843 INFO L290 TraceCheckUtils]: 91: Hoare triple {21695#(< ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {21695#(< ~counter~0 44)} is VALID [2022-04-14 15:17:11,844 INFO L290 TraceCheckUtils]: 90: Hoare triple {21780#(< ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21695#(< ~counter~0 44)} is VALID [2022-04-14 15:17:11,844 INFO L290 TraceCheckUtils]: 89: Hoare triple {21780#(< ~counter~0 43)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21780#(< ~counter~0 43)} is VALID [2022-04-14 15:17:11,845 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {20249#true} {21780#(< ~counter~0 43)} #67#return; {21780#(< ~counter~0 43)} is VALID [2022-04-14 15:17:11,845 INFO L290 TraceCheckUtils]: 87: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,845 INFO L290 TraceCheckUtils]: 86: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,845 INFO L290 TraceCheckUtils]: 85: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,845 INFO L272 TraceCheckUtils]: 84: Hoare triple {21780#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,846 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {20249#true} {21780#(< ~counter~0 43)} #65#return; {21780#(< ~counter~0 43)} is VALID [2022-04-14 15:17:11,846 INFO L290 TraceCheckUtils]: 82: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,846 INFO L290 TraceCheckUtils]: 81: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,846 INFO L290 TraceCheckUtils]: 80: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,846 INFO L272 TraceCheckUtils]: 79: Hoare triple {21780#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,847 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {20249#true} {21780#(< ~counter~0 43)} #63#return; {21780#(< ~counter~0 43)} is VALID [2022-04-14 15:17:11,847 INFO L290 TraceCheckUtils]: 77: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,847 INFO L290 TraceCheckUtils]: 76: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,847 INFO L290 TraceCheckUtils]: 75: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,847 INFO L272 TraceCheckUtils]: 74: Hoare triple {21780#(< ~counter~0 43)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,847 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20249#true} {21780#(< ~counter~0 43)} #61#return; {21780#(< ~counter~0 43)} is VALID [2022-04-14 15:17:11,848 INFO L290 TraceCheckUtils]: 72: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,848 INFO L290 TraceCheckUtils]: 71: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,848 INFO L290 TraceCheckUtils]: 70: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,848 INFO L272 TraceCheckUtils]: 69: Hoare triple {21780#(< ~counter~0 43)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,848 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {20249#true} {21780#(< ~counter~0 43)} #59#return; {21780#(< ~counter~0 43)} is VALID [2022-04-14 15:17:11,848 INFO L290 TraceCheckUtils]: 67: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,848 INFO L290 TraceCheckUtils]: 66: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,849 INFO L290 TraceCheckUtils]: 65: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,849 INFO L272 TraceCheckUtils]: 64: Hoare triple {21780#(< ~counter~0 43)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,849 INFO L290 TraceCheckUtils]: 63: Hoare triple {21780#(< ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {21780#(< ~counter~0 43)} is VALID [2022-04-14 15:17:11,850 INFO L290 TraceCheckUtils]: 62: Hoare triple {21865#(< ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21780#(< ~counter~0 43)} is VALID [2022-04-14 15:17:11,850 INFO L290 TraceCheckUtils]: 61: Hoare triple {21865#(< ~counter~0 42)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21865#(< ~counter~0 42)} is VALID [2022-04-14 15:17:11,850 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20249#true} {21865#(< ~counter~0 42)} #67#return; {21865#(< ~counter~0 42)} is VALID [2022-04-14 15:17:11,851 INFO L290 TraceCheckUtils]: 59: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,851 INFO L290 TraceCheckUtils]: 58: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,851 INFO L290 TraceCheckUtils]: 57: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,851 INFO L272 TraceCheckUtils]: 56: Hoare triple {21865#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,851 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20249#true} {21865#(< ~counter~0 42)} #65#return; {21865#(< ~counter~0 42)} is VALID [2022-04-14 15:17:11,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,851 INFO L272 TraceCheckUtils]: 51: Hoare triple {21865#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,852 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20249#true} {21865#(< ~counter~0 42)} #63#return; {21865#(< ~counter~0 42)} is VALID [2022-04-14 15:17:11,852 INFO L290 TraceCheckUtils]: 49: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,852 INFO L290 TraceCheckUtils]: 48: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,852 INFO L290 TraceCheckUtils]: 47: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,852 INFO L272 TraceCheckUtils]: 46: Hoare triple {21865#(< ~counter~0 42)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,853 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20249#true} {21865#(< ~counter~0 42)} #61#return; {21865#(< ~counter~0 42)} is VALID [2022-04-14 15:17:11,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,853 INFO L290 TraceCheckUtils]: 43: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,853 INFO L272 TraceCheckUtils]: 41: Hoare triple {21865#(< ~counter~0 42)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,853 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20249#true} {21865#(< ~counter~0 42)} #59#return; {21865#(< ~counter~0 42)} is VALID [2022-04-14 15:17:11,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,854 INFO L290 TraceCheckUtils]: 37: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,854 INFO L272 TraceCheckUtils]: 36: Hoare triple {21865#(< ~counter~0 42)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {21865#(< ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {21865#(< ~counter~0 42)} is VALID [2022-04-14 15:17:11,855 INFO L290 TraceCheckUtils]: 34: Hoare triple {21950#(< ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21865#(< ~counter~0 42)} is VALID [2022-04-14 15:17:11,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {21950#(< ~counter~0 41)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21950#(< ~counter~0 41)} is VALID [2022-04-14 15:17:11,855 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20249#true} {21950#(< ~counter~0 41)} #67#return; {21950#(< ~counter~0 41)} is VALID [2022-04-14 15:17:11,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,856 INFO L272 TraceCheckUtils]: 28: Hoare triple {21950#(< ~counter~0 41)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,856 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20249#true} {21950#(< ~counter~0 41)} #65#return; {21950#(< ~counter~0 41)} is VALID [2022-04-14 15:17:11,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,857 INFO L272 TraceCheckUtils]: 23: Hoare triple {21950#(< ~counter~0 41)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,857 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20249#true} {21950#(< ~counter~0 41)} #63#return; {21950#(< ~counter~0 41)} is VALID [2022-04-14 15:17:11,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,857 INFO L272 TraceCheckUtils]: 18: Hoare triple {21950#(< ~counter~0 41)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,858 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20249#true} {21950#(< ~counter~0 41)} #61#return; {21950#(< ~counter~0 41)} is VALID [2022-04-14 15:17:11,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,858 INFO L272 TraceCheckUtils]: 13: Hoare triple {21950#(< ~counter~0 41)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,859 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20249#true} {21950#(< ~counter~0 41)} #59#return; {21950#(< ~counter~0 41)} is VALID [2022-04-14 15:17:11,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {20249#true} assume true; {20249#true} is VALID [2022-04-14 15:17:11,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {20249#true} assume !(0 == ~cond); {20249#true} is VALID [2022-04-14 15:17:11,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {20249#true} ~cond := #in~cond; {20249#true} is VALID [2022-04-14 15:17:11,859 INFO L272 TraceCheckUtils]: 8: Hoare triple {21950#(< ~counter~0 41)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20249#true} is VALID [2022-04-14 15:17:11,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {21950#(< ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {21950#(< ~counter~0 41)} is VALID [2022-04-14 15:17:11,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {22035#(< ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21950#(< ~counter~0 41)} is VALID [2022-04-14 15:17:11,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {22035#(< ~counter~0 40)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {22035#(< ~counter~0 40)} is VALID [2022-04-14 15:17:11,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {22035#(< ~counter~0 40)} call #t~ret6 := main(); {22035#(< ~counter~0 40)} is VALID [2022-04-14 15:17:11,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22035#(< ~counter~0 40)} {20249#true} #81#return; {22035#(< ~counter~0 40)} is VALID [2022-04-14 15:17:11,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {22035#(< ~counter~0 40)} assume true; {22035#(< ~counter~0 40)} is VALID [2022-04-14 15:17:11,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {20249#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; {22035#(< ~counter~0 40)} is VALID [2022-04-14 15:17:11,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {20249#true} call ULTIMATE.init(); {20249#true} is VALID [2022-04-14 15:17:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2022-04-14 15:17:11,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:17:11,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526865123] [2022-04-14 15:17:11,863 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:17:11,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16833402] [2022-04-14 15:17:11,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16833402] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:17:11,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:17:11,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-14 15:17:11,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497958817] [2022-04-14 15:17:11,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:17:11,865 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) Word has length 297 [2022-04-14 15:17:11,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:17:11,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) [2022-04-14 15:17:12,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:12,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-14 15:17:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:17:12,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-14 15:17:12,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-14 15:17:12,162 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) [2022-04-14 15:17:16,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:16,805 INFO L93 Difference]: Finished difference Result 640 states and 652 transitions. [2022-04-14 15:17:16,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-14 15:17:16,806 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) Word has length 297 [2022-04-14 15:17:16,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:17:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) [2022-04-14 15:17:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 386 transitions. [2022-04-14 15:17:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) [2022-04-14 15:17:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 386 transitions. [2022-04-14 15:17:16,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 386 transitions. [2022-04-14 15:17:17,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:17,252 INFO L225 Difference]: With dead ends: 640 [2022-04-14 15:17:17,252 INFO L226 Difference]: Without dead ends: 630 [2022-04-14 15:17:17,253 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-04-14 15:17:17,253 INFO L913 BasicCegarLoop]: 131 mSDtfsCounter, 221 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-14 15:17:17,254 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 556 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-14 15:17:17,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-04-14 15:17:17,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2022-04-14 15:17:17,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:17:17,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 630 states. Second operand has 630 states, 404 states have (on average 1.0024752475247525) internal successors, (405), 404 states have internal predecessors, (405), 114 states have call successors, (114), 113 states have call predecessors, (114), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-14 15:17:17,607 INFO L74 IsIncluded]: Start isIncluded. First operand 630 states. Second operand has 630 states, 404 states have (on average 1.0024752475247525) internal successors, (405), 404 states have internal predecessors, (405), 114 states have call successors, (114), 113 states have call predecessors, (114), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-14 15:17:17,607 INFO L87 Difference]: Start difference. First operand 630 states. Second operand has 630 states, 404 states have (on average 1.0024752475247525) internal successors, (405), 404 states have internal predecessors, (405), 114 states have call successors, (114), 113 states have call predecessors, (114), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-14 15:17:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:17,626 INFO L93 Difference]: Finished difference Result 630 states and 631 transitions. [2022-04-14 15:17:17,626 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 631 transitions. [2022-04-14 15:17:17,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:17,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:17,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 630 states, 404 states have (on average 1.0024752475247525) internal successors, (405), 404 states have internal predecessors, (405), 114 states have call successors, (114), 113 states have call predecessors, (114), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 630 states. [2022-04-14 15:17:17,629 INFO L87 Difference]: Start difference. First operand has 630 states, 404 states have (on average 1.0024752475247525) internal successors, (405), 404 states have internal predecessors, (405), 114 states have call successors, (114), 113 states have call predecessors, (114), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 630 states. [2022-04-14 15:17:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:17,647 INFO L93 Difference]: Finished difference Result 630 states and 631 transitions. [2022-04-14 15:17:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 631 transitions. [2022-04-14 15:17:17,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:17,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:17,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:17:17,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:17:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 404 states have (on average 1.0024752475247525) internal successors, (405), 404 states have internal predecessors, (405), 114 states have call successors, (114), 113 states have call predecessors, (114), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-14 15:17:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 631 transitions. [2022-04-14 15:17:17,689 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 631 transitions. Word has length 297 [2022-04-14 15:17:17,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:17:17,690 INFO L478 AbstractCegarLoop]: Abstraction has 630 states and 631 transitions. [2022-04-14 15:17:17,690 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) [2022-04-14 15:17:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 631 transitions. [2022-04-14 15:17:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2022-04-14 15:17:17,695 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:17:17,695 INFO L499 BasicCegarLoop]: trace histogram [112, 111, 111, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:17:17,705 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 15:17:17,901 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:17,902 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:17:17,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:17:17,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1616558797, now seen corresponding path program 4 times [2022-04-14 15:17:17,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:17:17,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859769553] [2022-04-14 15:17:17,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:17,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:17:17,933 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:17:17,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [934777756] [2022-04-14 15:17:17,934 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 15:17:17,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:17,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:17:17,935 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 15:17:17,947 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 15:17:18,220 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 15:17:18,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:17:18,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-14 15:17:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:18,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:17:20,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {25132#true} call ULTIMATE.init(); {25132#true} is VALID [2022-04-14 15:17:20,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {25132#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; {25140#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:20,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {25140#(<= ~counter~0 0)} assume true; {25140#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:20,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25140#(<= ~counter~0 0)} {25132#true} #81#return; {25140#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:20,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {25140#(<= ~counter~0 0)} call #t~ret6 := main(); {25140#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:20,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {25140#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {25140#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:20,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {25140#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {25156#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,914 INFO L272 TraceCheckUtils]: 8: Hoare triple {25156#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {25156#(<= ~counter~0 1)} ~cond := #in~cond; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {25156#(<= ~counter~0 1)} assume !(0 == ~cond); {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {25156#(<= ~counter~0 1)} assume true; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,915 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {25156#(<= ~counter~0 1)} {25156#(<= ~counter~0 1)} #59#return; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,916 INFO L272 TraceCheckUtils]: 13: Hoare triple {25156#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {25156#(<= ~counter~0 1)} ~cond := #in~cond; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {25156#(<= ~counter~0 1)} assume !(0 == ~cond); {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {25156#(<= ~counter~0 1)} assume true; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,917 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25156#(<= ~counter~0 1)} {25156#(<= ~counter~0 1)} #61#return; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,917 INFO L272 TraceCheckUtils]: 18: Hoare triple {25156#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {25156#(<= ~counter~0 1)} ~cond := #in~cond; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {25156#(<= ~counter~0 1)} assume !(0 == ~cond); {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {25156#(<= ~counter~0 1)} assume true; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,918 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {25156#(<= ~counter~0 1)} {25156#(<= ~counter~0 1)} #63#return; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,919 INFO L272 TraceCheckUtils]: 23: Hoare triple {25156#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {25156#(<= ~counter~0 1)} ~cond := #in~cond; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {25156#(<= ~counter~0 1)} assume !(0 == ~cond); {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {25156#(<= ~counter~0 1)} assume true; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,921 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25156#(<= ~counter~0 1)} {25156#(<= ~counter~0 1)} #65#return; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,922 INFO L272 TraceCheckUtils]: 28: Hoare triple {25156#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,922 INFO L290 TraceCheckUtils]: 29: Hoare triple {25156#(<= ~counter~0 1)} ~cond := #in~cond; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,922 INFO L290 TraceCheckUtils]: 30: Hoare triple {25156#(<= ~counter~0 1)} assume !(0 == ~cond); {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {25156#(<= ~counter~0 1)} assume true; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,923 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25156#(<= ~counter~0 1)} {25156#(<= ~counter~0 1)} #67#return; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {25156#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25156#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:20,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {25156#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {25241#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,924 INFO L272 TraceCheckUtils]: 36: Hoare triple {25241#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,925 INFO L290 TraceCheckUtils]: 37: Hoare triple {25241#(<= ~counter~0 2)} ~cond := #in~cond; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {25241#(<= ~counter~0 2)} assume !(0 == ~cond); {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {25241#(<= ~counter~0 2)} assume true; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,925 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {25241#(<= ~counter~0 2)} {25241#(<= ~counter~0 2)} #59#return; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,926 INFO L272 TraceCheckUtils]: 41: Hoare triple {25241#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,926 INFO L290 TraceCheckUtils]: 42: Hoare triple {25241#(<= ~counter~0 2)} ~cond := #in~cond; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,926 INFO L290 TraceCheckUtils]: 43: Hoare triple {25241#(<= ~counter~0 2)} assume !(0 == ~cond); {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,927 INFO L290 TraceCheckUtils]: 44: Hoare triple {25241#(<= ~counter~0 2)} assume true; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,927 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25241#(<= ~counter~0 2)} {25241#(<= ~counter~0 2)} #61#return; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,928 INFO L272 TraceCheckUtils]: 46: Hoare triple {25241#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,928 INFO L290 TraceCheckUtils]: 47: Hoare triple {25241#(<= ~counter~0 2)} ~cond := #in~cond; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,928 INFO L290 TraceCheckUtils]: 48: Hoare triple {25241#(<= ~counter~0 2)} assume !(0 == ~cond); {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {25241#(<= ~counter~0 2)} assume true; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,929 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25241#(<= ~counter~0 2)} {25241#(<= ~counter~0 2)} #63#return; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,929 INFO L272 TraceCheckUtils]: 51: Hoare triple {25241#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,930 INFO L290 TraceCheckUtils]: 52: Hoare triple {25241#(<= ~counter~0 2)} ~cond := #in~cond; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,930 INFO L290 TraceCheckUtils]: 53: Hoare triple {25241#(<= ~counter~0 2)} assume !(0 == ~cond); {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,930 INFO L290 TraceCheckUtils]: 54: Hoare triple {25241#(<= ~counter~0 2)} assume true; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,931 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25241#(<= ~counter~0 2)} {25241#(<= ~counter~0 2)} #65#return; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,931 INFO L272 TraceCheckUtils]: 56: Hoare triple {25241#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,931 INFO L290 TraceCheckUtils]: 57: Hoare triple {25241#(<= ~counter~0 2)} ~cond := #in~cond; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,931 INFO L290 TraceCheckUtils]: 58: Hoare triple {25241#(<= ~counter~0 2)} assume !(0 == ~cond); {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,932 INFO L290 TraceCheckUtils]: 59: Hoare triple {25241#(<= ~counter~0 2)} assume true; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,932 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25241#(<= ~counter~0 2)} {25241#(<= ~counter~0 2)} #67#return; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,932 INFO L290 TraceCheckUtils]: 61: Hoare triple {25241#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25241#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:20,933 INFO L290 TraceCheckUtils]: 62: Hoare triple {25241#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,933 INFO L290 TraceCheckUtils]: 63: Hoare triple {25326#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,934 INFO L272 TraceCheckUtils]: 64: Hoare triple {25326#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {25326#(<= ~counter~0 3)} ~cond := #in~cond; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,934 INFO L290 TraceCheckUtils]: 66: Hoare triple {25326#(<= ~counter~0 3)} assume !(0 == ~cond); {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,934 INFO L290 TraceCheckUtils]: 67: Hoare triple {25326#(<= ~counter~0 3)} assume true; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,935 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {25326#(<= ~counter~0 3)} {25326#(<= ~counter~0 3)} #59#return; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,935 INFO L272 TraceCheckUtils]: 69: Hoare triple {25326#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,935 INFO L290 TraceCheckUtils]: 70: Hoare triple {25326#(<= ~counter~0 3)} ~cond := #in~cond; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,936 INFO L290 TraceCheckUtils]: 71: Hoare triple {25326#(<= ~counter~0 3)} assume !(0 == ~cond); {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,936 INFO L290 TraceCheckUtils]: 72: Hoare triple {25326#(<= ~counter~0 3)} assume true; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,936 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {25326#(<= ~counter~0 3)} {25326#(<= ~counter~0 3)} #61#return; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,937 INFO L272 TraceCheckUtils]: 74: Hoare triple {25326#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,937 INFO L290 TraceCheckUtils]: 75: Hoare triple {25326#(<= ~counter~0 3)} ~cond := #in~cond; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,937 INFO L290 TraceCheckUtils]: 76: Hoare triple {25326#(<= ~counter~0 3)} assume !(0 == ~cond); {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,937 INFO L290 TraceCheckUtils]: 77: Hoare triple {25326#(<= ~counter~0 3)} assume true; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,938 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {25326#(<= ~counter~0 3)} {25326#(<= ~counter~0 3)} #63#return; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,938 INFO L272 TraceCheckUtils]: 79: Hoare triple {25326#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,939 INFO L290 TraceCheckUtils]: 80: Hoare triple {25326#(<= ~counter~0 3)} ~cond := #in~cond; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,939 INFO L290 TraceCheckUtils]: 81: Hoare triple {25326#(<= ~counter~0 3)} assume !(0 == ~cond); {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,939 INFO L290 TraceCheckUtils]: 82: Hoare triple {25326#(<= ~counter~0 3)} assume true; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,940 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {25326#(<= ~counter~0 3)} {25326#(<= ~counter~0 3)} #65#return; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,940 INFO L272 TraceCheckUtils]: 84: Hoare triple {25326#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,940 INFO L290 TraceCheckUtils]: 85: Hoare triple {25326#(<= ~counter~0 3)} ~cond := #in~cond; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,941 INFO L290 TraceCheckUtils]: 86: Hoare triple {25326#(<= ~counter~0 3)} assume !(0 == ~cond); {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,941 INFO L290 TraceCheckUtils]: 87: Hoare triple {25326#(<= ~counter~0 3)} assume true; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,941 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {25326#(<= ~counter~0 3)} {25326#(<= ~counter~0 3)} #67#return; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,941 INFO L290 TraceCheckUtils]: 89: Hoare triple {25326#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25326#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:20,942 INFO L290 TraceCheckUtils]: 90: Hoare triple {25326#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,942 INFO L290 TraceCheckUtils]: 91: Hoare triple {25411#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,943 INFO L272 TraceCheckUtils]: 92: Hoare triple {25411#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,943 INFO L290 TraceCheckUtils]: 93: Hoare triple {25411#(<= ~counter~0 4)} ~cond := #in~cond; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,943 INFO L290 TraceCheckUtils]: 94: Hoare triple {25411#(<= ~counter~0 4)} assume !(0 == ~cond); {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,943 INFO L290 TraceCheckUtils]: 95: Hoare triple {25411#(<= ~counter~0 4)} assume true; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,944 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {25411#(<= ~counter~0 4)} {25411#(<= ~counter~0 4)} #59#return; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,944 INFO L272 TraceCheckUtils]: 97: Hoare triple {25411#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,944 INFO L290 TraceCheckUtils]: 98: Hoare triple {25411#(<= ~counter~0 4)} ~cond := #in~cond; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,945 INFO L290 TraceCheckUtils]: 99: Hoare triple {25411#(<= ~counter~0 4)} assume !(0 == ~cond); {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,945 INFO L290 TraceCheckUtils]: 100: Hoare triple {25411#(<= ~counter~0 4)} assume true; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,945 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {25411#(<= ~counter~0 4)} {25411#(<= ~counter~0 4)} #61#return; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,946 INFO L272 TraceCheckUtils]: 102: Hoare triple {25411#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,946 INFO L290 TraceCheckUtils]: 103: Hoare triple {25411#(<= ~counter~0 4)} ~cond := #in~cond; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,946 INFO L290 TraceCheckUtils]: 104: Hoare triple {25411#(<= ~counter~0 4)} assume !(0 == ~cond); {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,947 INFO L290 TraceCheckUtils]: 105: Hoare triple {25411#(<= ~counter~0 4)} assume true; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,947 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {25411#(<= ~counter~0 4)} {25411#(<= ~counter~0 4)} #63#return; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,947 INFO L272 TraceCheckUtils]: 107: Hoare triple {25411#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,948 INFO L290 TraceCheckUtils]: 108: Hoare triple {25411#(<= ~counter~0 4)} ~cond := #in~cond; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,948 INFO L290 TraceCheckUtils]: 109: Hoare triple {25411#(<= ~counter~0 4)} assume !(0 == ~cond); {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,948 INFO L290 TraceCheckUtils]: 110: Hoare triple {25411#(<= ~counter~0 4)} assume true; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,949 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {25411#(<= ~counter~0 4)} {25411#(<= ~counter~0 4)} #65#return; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,949 INFO L272 TraceCheckUtils]: 112: Hoare triple {25411#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,949 INFO L290 TraceCheckUtils]: 113: Hoare triple {25411#(<= ~counter~0 4)} ~cond := #in~cond; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,950 INFO L290 TraceCheckUtils]: 114: Hoare triple {25411#(<= ~counter~0 4)} assume !(0 == ~cond); {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,950 INFO L290 TraceCheckUtils]: 115: Hoare triple {25411#(<= ~counter~0 4)} assume true; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,950 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25411#(<= ~counter~0 4)} {25411#(<= ~counter~0 4)} #67#return; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,950 INFO L290 TraceCheckUtils]: 117: Hoare triple {25411#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25411#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:20,951 INFO L290 TraceCheckUtils]: 118: Hoare triple {25411#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,951 INFO L290 TraceCheckUtils]: 119: Hoare triple {25496#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,952 INFO L272 TraceCheckUtils]: 120: Hoare triple {25496#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,952 INFO L290 TraceCheckUtils]: 121: Hoare triple {25496#(<= ~counter~0 5)} ~cond := #in~cond; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,952 INFO L290 TraceCheckUtils]: 122: Hoare triple {25496#(<= ~counter~0 5)} assume !(0 == ~cond); {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,952 INFO L290 TraceCheckUtils]: 123: Hoare triple {25496#(<= ~counter~0 5)} assume true; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,953 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {25496#(<= ~counter~0 5)} {25496#(<= ~counter~0 5)} #59#return; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,953 INFO L272 TraceCheckUtils]: 125: Hoare triple {25496#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,954 INFO L290 TraceCheckUtils]: 126: Hoare triple {25496#(<= ~counter~0 5)} ~cond := #in~cond; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,954 INFO L290 TraceCheckUtils]: 127: Hoare triple {25496#(<= ~counter~0 5)} assume !(0 == ~cond); {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,954 INFO L290 TraceCheckUtils]: 128: Hoare triple {25496#(<= ~counter~0 5)} assume true; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,954 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {25496#(<= ~counter~0 5)} {25496#(<= ~counter~0 5)} #61#return; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,955 INFO L272 TraceCheckUtils]: 130: Hoare triple {25496#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,955 INFO L290 TraceCheckUtils]: 131: Hoare triple {25496#(<= ~counter~0 5)} ~cond := #in~cond; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,955 INFO L290 TraceCheckUtils]: 132: Hoare triple {25496#(<= ~counter~0 5)} assume !(0 == ~cond); {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,956 INFO L290 TraceCheckUtils]: 133: Hoare triple {25496#(<= ~counter~0 5)} assume true; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,956 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {25496#(<= ~counter~0 5)} {25496#(<= ~counter~0 5)} #63#return; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,956 INFO L272 TraceCheckUtils]: 135: Hoare triple {25496#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,957 INFO L290 TraceCheckUtils]: 136: Hoare triple {25496#(<= ~counter~0 5)} ~cond := #in~cond; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,957 INFO L290 TraceCheckUtils]: 137: Hoare triple {25496#(<= ~counter~0 5)} assume !(0 == ~cond); {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,957 INFO L290 TraceCheckUtils]: 138: Hoare triple {25496#(<= ~counter~0 5)} assume true; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,958 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {25496#(<= ~counter~0 5)} {25496#(<= ~counter~0 5)} #65#return; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,958 INFO L272 TraceCheckUtils]: 140: Hoare triple {25496#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,958 INFO L290 TraceCheckUtils]: 141: Hoare triple {25496#(<= ~counter~0 5)} ~cond := #in~cond; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,959 INFO L290 TraceCheckUtils]: 142: Hoare triple {25496#(<= ~counter~0 5)} assume !(0 == ~cond); {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,959 INFO L290 TraceCheckUtils]: 143: Hoare triple {25496#(<= ~counter~0 5)} assume true; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,959 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {25496#(<= ~counter~0 5)} {25496#(<= ~counter~0 5)} #67#return; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,960 INFO L290 TraceCheckUtils]: 145: Hoare triple {25496#(<= ~counter~0 5)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25496#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:20,960 INFO L290 TraceCheckUtils]: 146: Hoare triple {25496#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,960 INFO L290 TraceCheckUtils]: 147: Hoare triple {25581#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,961 INFO L272 TraceCheckUtils]: 148: Hoare triple {25581#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,961 INFO L290 TraceCheckUtils]: 149: Hoare triple {25581#(<= ~counter~0 6)} ~cond := #in~cond; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,961 INFO L290 TraceCheckUtils]: 150: Hoare triple {25581#(<= ~counter~0 6)} assume !(0 == ~cond); {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,961 INFO L290 TraceCheckUtils]: 151: Hoare triple {25581#(<= ~counter~0 6)} assume true; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,962 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {25581#(<= ~counter~0 6)} {25581#(<= ~counter~0 6)} #59#return; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,962 INFO L272 TraceCheckUtils]: 153: Hoare triple {25581#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,963 INFO L290 TraceCheckUtils]: 154: Hoare triple {25581#(<= ~counter~0 6)} ~cond := #in~cond; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,963 INFO L290 TraceCheckUtils]: 155: Hoare triple {25581#(<= ~counter~0 6)} assume !(0 == ~cond); {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,963 INFO L290 TraceCheckUtils]: 156: Hoare triple {25581#(<= ~counter~0 6)} assume true; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,963 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25581#(<= ~counter~0 6)} {25581#(<= ~counter~0 6)} #61#return; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,964 INFO L272 TraceCheckUtils]: 158: Hoare triple {25581#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,964 INFO L290 TraceCheckUtils]: 159: Hoare triple {25581#(<= ~counter~0 6)} ~cond := #in~cond; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,964 INFO L290 TraceCheckUtils]: 160: Hoare triple {25581#(<= ~counter~0 6)} assume !(0 == ~cond); {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,965 INFO L290 TraceCheckUtils]: 161: Hoare triple {25581#(<= ~counter~0 6)} assume true; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,965 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {25581#(<= ~counter~0 6)} {25581#(<= ~counter~0 6)} #63#return; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,965 INFO L272 TraceCheckUtils]: 163: Hoare triple {25581#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,966 INFO L290 TraceCheckUtils]: 164: Hoare triple {25581#(<= ~counter~0 6)} ~cond := #in~cond; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,966 INFO L290 TraceCheckUtils]: 165: Hoare triple {25581#(<= ~counter~0 6)} assume !(0 == ~cond); {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,966 INFO L290 TraceCheckUtils]: 166: Hoare triple {25581#(<= ~counter~0 6)} assume true; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,967 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {25581#(<= ~counter~0 6)} {25581#(<= ~counter~0 6)} #65#return; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,967 INFO L272 TraceCheckUtils]: 168: Hoare triple {25581#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,967 INFO L290 TraceCheckUtils]: 169: Hoare triple {25581#(<= ~counter~0 6)} ~cond := #in~cond; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,968 INFO L290 TraceCheckUtils]: 170: Hoare triple {25581#(<= ~counter~0 6)} assume !(0 == ~cond); {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,968 INFO L290 TraceCheckUtils]: 171: Hoare triple {25581#(<= ~counter~0 6)} assume true; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,968 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25581#(<= ~counter~0 6)} {25581#(<= ~counter~0 6)} #67#return; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,969 INFO L290 TraceCheckUtils]: 173: Hoare triple {25581#(<= ~counter~0 6)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25581#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:20,969 INFO L290 TraceCheckUtils]: 174: Hoare triple {25581#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,969 INFO L290 TraceCheckUtils]: 175: Hoare triple {25666#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,970 INFO L272 TraceCheckUtils]: 176: Hoare triple {25666#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,970 INFO L290 TraceCheckUtils]: 177: Hoare triple {25666#(<= ~counter~0 7)} ~cond := #in~cond; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,970 INFO L290 TraceCheckUtils]: 178: Hoare triple {25666#(<= ~counter~0 7)} assume !(0 == ~cond); {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,970 INFO L290 TraceCheckUtils]: 179: Hoare triple {25666#(<= ~counter~0 7)} assume true; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,971 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {25666#(<= ~counter~0 7)} {25666#(<= ~counter~0 7)} #59#return; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,971 INFO L272 TraceCheckUtils]: 181: Hoare triple {25666#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,972 INFO L290 TraceCheckUtils]: 182: Hoare triple {25666#(<= ~counter~0 7)} ~cond := #in~cond; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,972 INFO L290 TraceCheckUtils]: 183: Hoare triple {25666#(<= ~counter~0 7)} assume !(0 == ~cond); {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,972 INFO L290 TraceCheckUtils]: 184: Hoare triple {25666#(<= ~counter~0 7)} assume true; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,972 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {25666#(<= ~counter~0 7)} {25666#(<= ~counter~0 7)} #61#return; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,973 INFO L272 TraceCheckUtils]: 186: Hoare triple {25666#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,973 INFO L290 TraceCheckUtils]: 187: Hoare triple {25666#(<= ~counter~0 7)} ~cond := #in~cond; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,973 INFO L290 TraceCheckUtils]: 188: Hoare triple {25666#(<= ~counter~0 7)} assume !(0 == ~cond); {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,974 INFO L290 TraceCheckUtils]: 189: Hoare triple {25666#(<= ~counter~0 7)} assume true; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,974 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {25666#(<= ~counter~0 7)} {25666#(<= ~counter~0 7)} #63#return; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,975 INFO L272 TraceCheckUtils]: 191: Hoare triple {25666#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,975 INFO L290 TraceCheckUtils]: 192: Hoare triple {25666#(<= ~counter~0 7)} ~cond := #in~cond; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,975 INFO L290 TraceCheckUtils]: 193: Hoare triple {25666#(<= ~counter~0 7)} assume !(0 == ~cond); {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,975 INFO L290 TraceCheckUtils]: 194: Hoare triple {25666#(<= ~counter~0 7)} assume true; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,976 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {25666#(<= ~counter~0 7)} {25666#(<= ~counter~0 7)} #65#return; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,976 INFO L272 TraceCheckUtils]: 196: Hoare triple {25666#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,976 INFO L290 TraceCheckUtils]: 197: Hoare triple {25666#(<= ~counter~0 7)} ~cond := #in~cond; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,977 INFO L290 TraceCheckUtils]: 198: Hoare triple {25666#(<= ~counter~0 7)} assume !(0 == ~cond); {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,977 INFO L290 TraceCheckUtils]: 199: Hoare triple {25666#(<= ~counter~0 7)} assume true; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,977 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {25666#(<= ~counter~0 7)} {25666#(<= ~counter~0 7)} #67#return; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,978 INFO L290 TraceCheckUtils]: 201: Hoare triple {25666#(<= ~counter~0 7)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25666#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:20,978 INFO L290 TraceCheckUtils]: 202: Hoare triple {25666#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,978 INFO L290 TraceCheckUtils]: 203: Hoare triple {25751#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,979 INFO L272 TraceCheckUtils]: 204: Hoare triple {25751#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,979 INFO L290 TraceCheckUtils]: 205: Hoare triple {25751#(<= ~counter~0 8)} ~cond := #in~cond; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,979 INFO L290 TraceCheckUtils]: 206: Hoare triple {25751#(<= ~counter~0 8)} assume !(0 == ~cond); {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,980 INFO L290 TraceCheckUtils]: 207: Hoare triple {25751#(<= ~counter~0 8)} assume true; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,980 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {25751#(<= ~counter~0 8)} {25751#(<= ~counter~0 8)} #59#return; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,980 INFO L272 TraceCheckUtils]: 209: Hoare triple {25751#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,981 INFO L290 TraceCheckUtils]: 210: Hoare triple {25751#(<= ~counter~0 8)} ~cond := #in~cond; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,981 INFO L290 TraceCheckUtils]: 211: Hoare triple {25751#(<= ~counter~0 8)} assume !(0 == ~cond); {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,981 INFO L290 TraceCheckUtils]: 212: Hoare triple {25751#(<= ~counter~0 8)} assume true; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,982 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {25751#(<= ~counter~0 8)} {25751#(<= ~counter~0 8)} #61#return; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,982 INFO L272 TraceCheckUtils]: 214: Hoare triple {25751#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,982 INFO L290 TraceCheckUtils]: 215: Hoare triple {25751#(<= ~counter~0 8)} ~cond := #in~cond; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,982 INFO L290 TraceCheckUtils]: 216: Hoare triple {25751#(<= ~counter~0 8)} assume !(0 == ~cond); {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,983 INFO L290 TraceCheckUtils]: 217: Hoare triple {25751#(<= ~counter~0 8)} assume true; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,983 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {25751#(<= ~counter~0 8)} {25751#(<= ~counter~0 8)} #63#return; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,984 INFO L272 TraceCheckUtils]: 219: Hoare triple {25751#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,984 INFO L290 TraceCheckUtils]: 220: Hoare triple {25751#(<= ~counter~0 8)} ~cond := #in~cond; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,984 INFO L290 TraceCheckUtils]: 221: Hoare triple {25751#(<= ~counter~0 8)} assume !(0 == ~cond); {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,984 INFO L290 TraceCheckUtils]: 222: Hoare triple {25751#(<= ~counter~0 8)} assume true; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,985 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {25751#(<= ~counter~0 8)} {25751#(<= ~counter~0 8)} #65#return; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,985 INFO L272 TraceCheckUtils]: 224: Hoare triple {25751#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,985 INFO L290 TraceCheckUtils]: 225: Hoare triple {25751#(<= ~counter~0 8)} ~cond := #in~cond; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,986 INFO L290 TraceCheckUtils]: 226: Hoare triple {25751#(<= ~counter~0 8)} assume !(0 == ~cond); {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,986 INFO L290 TraceCheckUtils]: 227: Hoare triple {25751#(<= ~counter~0 8)} assume true; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,986 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {25751#(<= ~counter~0 8)} {25751#(<= ~counter~0 8)} #67#return; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,987 INFO L290 TraceCheckUtils]: 229: Hoare triple {25751#(<= ~counter~0 8)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25751#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:20,987 INFO L290 TraceCheckUtils]: 230: Hoare triple {25751#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,987 INFO L290 TraceCheckUtils]: 231: Hoare triple {25836#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,988 INFO L272 TraceCheckUtils]: 232: Hoare triple {25836#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,988 INFO L290 TraceCheckUtils]: 233: Hoare triple {25836#(<= ~counter~0 9)} ~cond := #in~cond; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,988 INFO L290 TraceCheckUtils]: 234: Hoare triple {25836#(<= ~counter~0 9)} assume !(0 == ~cond); {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,989 INFO L290 TraceCheckUtils]: 235: Hoare triple {25836#(<= ~counter~0 9)} assume true; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,989 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {25836#(<= ~counter~0 9)} {25836#(<= ~counter~0 9)} #59#return; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,989 INFO L272 TraceCheckUtils]: 237: Hoare triple {25836#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,990 INFO L290 TraceCheckUtils]: 238: Hoare triple {25836#(<= ~counter~0 9)} ~cond := #in~cond; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,990 INFO L290 TraceCheckUtils]: 239: Hoare triple {25836#(<= ~counter~0 9)} assume !(0 == ~cond); {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,990 INFO L290 TraceCheckUtils]: 240: Hoare triple {25836#(<= ~counter~0 9)} assume true; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,991 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {25836#(<= ~counter~0 9)} {25836#(<= ~counter~0 9)} #61#return; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,991 INFO L272 TraceCheckUtils]: 242: Hoare triple {25836#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,991 INFO L290 TraceCheckUtils]: 243: Hoare triple {25836#(<= ~counter~0 9)} ~cond := #in~cond; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,991 INFO L290 TraceCheckUtils]: 244: Hoare triple {25836#(<= ~counter~0 9)} assume !(0 == ~cond); {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,992 INFO L290 TraceCheckUtils]: 245: Hoare triple {25836#(<= ~counter~0 9)} assume true; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,992 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {25836#(<= ~counter~0 9)} {25836#(<= ~counter~0 9)} #63#return; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,993 INFO L272 TraceCheckUtils]: 247: Hoare triple {25836#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,993 INFO L290 TraceCheckUtils]: 248: Hoare triple {25836#(<= ~counter~0 9)} ~cond := #in~cond; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,993 INFO L290 TraceCheckUtils]: 249: Hoare triple {25836#(<= ~counter~0 9)} assume !(0 == ~cond); {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,993 INFO L290 TraceCheckUtils]: 250: Hoare triple {25836#(<= ~counter~0 9)} assume true; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,994 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {25836#(<= ~counter~0 9)} {25836#(<= ~counter~0 9)} #65#return; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,994 INFO L272 TraceCheckUtils]: 252: Hoare triple {25836#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,994 INFO L290 TraceCheckUtils]: 253: Hoare triple {25836#(<= ~counter~0 9)} ~cond := #in~cond; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,995 INFO L290 TraceCheckUtils]: 254: Hoare triple {25836#(<= ~counter~0 9)} assume !(0 == ~cond); {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,995 INFO L290 TraceCheckUtils]: 255: Hoare triple {25836#(<= ~counter~0 9)} assume true; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,995 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {25836#(<= ~counter~0 9)} {25836#(<= ~counter~0 9)} #67#return; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,996 INFO L290 TraceCheckUtils]: 257: Hoare triple {25836#(<= ~counter~0 9)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25836#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:20,996 INFO L290 TraceCheckUtils]: 258: Hoare triple {25836#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:20,996 INFO L290 TraceCheckUtils]: 259: Hoare triple {25921#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:20,997 INFO L272 TraceCheckUtils]: 260: Hoare triple {25921#(<= ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:20,997 INFO L290 TraceCheckUtils]: 261: Hoare triple {25921#(<= ~counter~0 10)} ~cond := #in~cond; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:20,997 INFO L290 TraceCheckUtils]: 262: Hoare triple {25921#(<= ~counter~0 10)} assume !(0 == ~cond); {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:20,998 INFO L290 TraceCheckUtils]: 263: Hoare triple {25921#(<= ~counter~0 10)} assume true; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:20,998 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {25921#(<= ~counter~0 10)} {25921#(<= ~counter~0 10)} #59#return; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:20,998 INFO L272 TraceCheckUtils]: 265: Hoare triple {25921#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:20,999 INFO L290 TraceCheckUtils]: 266: Hoare triple {25921#(<= ~counter~0 10)} ~cond := #in~cond; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:20,999 INFO L290 TraceCheckUtils]: 267: Hoare triple {25921#(<= ~counter~0 10)} assume !(0 == ~cond); {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:20,999 INFO L290 TraceCheckUtils]: 268: Hoare triple {25921#(<= ~counter~0 10)} assume true; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,000 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {25921#(<= ~counter~0 10)} {25921#(<= ~counter~0 10)} #61#return; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,000 INFO L272 TraceCheckUtils]: 270: Hoare triple {25921#(<= ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,000 INFO L290 TraceCheckUtils]: 271: Hoare triple {25921#(<= ~counter~0 10)} ~cond := #in~cond; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,001 INFO L290 TraceCheckUtils]: 272: Hoare triple {25921#(<= ~counter~0 10)} assume !(0 == ~cond); {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,001 INFO L290 TraceCheckUtils]: 273: Hoare triple {25921#(<= ~counter~0 10)} assume true; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,001 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {25921#(<= ~counter~0 10)} {25921#(<= ~counter~0 10)} #63#return; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,002 INFO L272 TraceCheckUtils]: 275: Hoare triple {25921#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,002 INFO L290 TraceCheckUtils]: 276: Hoare triple {25921#(<= ~counter~0 10)} ~cond := #in~cond; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,002 INFO L290 TraceCheckUtils]: 277: Hoare triple {25921#(<= ~counter~0 10)} assume !(0 == ~cond); {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,002 INFO L290 TraceCheckUtils]: 278: Hoare triple {25921#(<= ~counter~0 10)} assume true; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,003 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {25921#(<= ~counter~0 10)} {25921#(<= ~counter~0 10)} #65#return; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,003 INFO L272 TraceCheckUtils]: 280: Hoare triple {25921#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,004 INFO L290 TraceCheckUtils]: 281: Hoare triple {25921#(<= ~counter~0 10)} ~cond := #in~cond; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,004 INFO L290 TraceCheckUtils]: 282: Hoare triple {25921#(<= ~counter~0 10)} assume !(0 == ~cond); {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,004 INFO L290 TraceCheckUtils]: 283: Hoare triple {25921#(<= ~counter~0 10)} assume true; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,004 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {25921#(<= ~counter~0 10)} {25921#(<= ~counter~0 10)} #67#return; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,005 INFO L290 TraceCheckUtils]: 285: Hoare triple {25921#(<= ~counter~0 10)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25921#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:21,005 INFO L290 TraceCheckUtils]: 286: Hoare triple {25921#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,005 INFO L290 TraceCheckUtils]: 287: Hoare triple {26006#(<= ~counter~0 11)} assume !!(#t~post5 < 50);havoc #t~post5; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,006 INFO L272 TraceCheckUtils]: 288: Hoare triple {26006#(<= ~counter~0 11)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,006 INFO L290 TraceCheckUtils]: 289: Hoare triple {26006#(<= ~counter~0 11)} ~cond := #in~cond; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,006 INFO L290 TraceCheckUtils]: 290: Hoare triple {26006#(<= ~counter~0 11)} assume !(0 == ~cond); {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,007 INFO L290 TraceCheckUtils]: 291: Hoare triple {26006#(<= ~counter~0 11)} assume true; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,007 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {26006#(<= ~counter~0 11)} {26006#(<= ~counter~0 11)} #59#return; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,008 INFO L272 TraceCheckUtils]: 293: Hoare triple {26006#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,008 INFO L290 TraceCheckUtils]: 294: Hoare triple {26006#(<= ~counter~0 11)} ~cond := #in~cond; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,008 INFO L290 TraceCheckUtils]: 295: Hoare triple {26006#(<= ~counter~0 11)} assume !(0 == ~cond); {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,008 INFO L290 TraceCheckUtils]: 296: Hoare triple {26006#(<= ~counter~0 11)} assume true; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,009 INFO L284 TraceCheckUtils]: 297: Hoare quadruple {26006#(<= ~counter~0 11)} {26006#(<= ~counter~0 11)} #61#return; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,009 INFO L272 TraceCheckUtils]: 298: Hoare triple {26006#(<= ~counter~0 11)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,009 INFO L290 TraceCheckUtils]: 299: Hoare triple {26006#(<= ~counter~0 11)} ~cond := #in~cond; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,010 INFO L290 TraceCheckUtils]: 300: Hoare triple {26006#(<= ~counter~0 11)} assume !(0 == ~cond); {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,010 INFO L290 TraceCheckUtils]: 301: Hoare triple {26006#(<= ~counter~0 11)} assume true; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,010 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {26006#(<= ~counter~0 11)} {26006#(<= ~counter~0 11)} #63#return; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,011 INFO L272 TraceCheckUtils]: 303: Hoare triple {26006#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,011 INFO L290 TraceCheckUtils]: 304: Hoare triple {26006#(<= ~counter~0 11)} ~cond := #in~cond; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,011 INFO L290 TraceCheckUtils]: 305: Hoare triple {26006#(<= ~counter~0 11)} assume !(0 == ~cond); {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,012 INFO L290 TraceCheckUtils]: 306: Hoare triple {26006#(<= ~counter~0 11)} assume true; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,012 INFO L284 TraceCheckUtils]: 307: Hoare quadruple {26006#(<= ~counter~0 11)} {26006#(<= ~counter~0 11)} #65#return; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,012 INFO L272 TraceCheckUtils]: 308: Hoare triple {26006#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,013 INFO L290 TraceCheckUtils]: 309: Hoare triple {26006#(<= ~counter~0 11)} ~cond := #in~cond; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,013 INFO L290 TraceCheckUtils]: 310: Hoare triple {26006#(<= ~counter~0 11)} assume !(0 == ~cond); {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,013 INFO L290 TraceCheckUtils]: 311: Hoare triple {26006#(<= ~counter~0 11)} assume true; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,014 INFO L284 TraceCheckUtils]: 312: Hoare quadruple {26006#(<= ~counter~0 11)} {26006#(<= ~counter~0 11)} #67#return; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,014 INFO L290 TraceCheckUtils]: 313: Hoare triple {26006#(<= ~counter~0 11)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26006#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:21,014 INFO L290 TraceCheckUtils]: 314: Hoare triple {26006#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,015 INFO L290 TraceCheckUtils]: 315: Hoare triple {26091#(<= ~counter~0 12)} assume !!(#t~post5 < 50);havoc #t~post5; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,015 INFO L272 TraceCheckUtils]: 316: Hoare triple {26091#(<= ~counter~0 12)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,015 INFO L290 TraceCheckUtils]: 317: Hoare triple {26091#(<= ~counter~0 12)} ~cond := #in~cond; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,016 INFO L290 TraceCheckUtils]: 318: Hoare triple {26091#(<= ~counter~0 12)} assume !(0 == ~cond); {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,016 INFO L290 TraceCheckUtils]: 319: Hoare triple {26091#(<= ~counter~0 12)} assume true; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,016 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {26091#(<= ~counter~0 12)} {26091#(<= ~counter~0 12)} #59#return; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,017 INFO L272 TraceCheckUtils]: 321: Hoare triple {26091#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,017 INFO L290 TraceCheckUtils]: 322: Hoare triple {26091#(<= ~counter~0 12)} ~cond := #in~cond; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,017 INFO L290 TraceCheckUtils]: 323: Hoare triple {26091#(<= ~counter~0 12)} assume !(0 == ~cond); {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,017 INFO L290 TraceCheckUtils]: 324: Hoare triple {26091#(<= ~counter~0 12)} assume true; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,018 INFO L284 TraceCheckUtils]: 325: Hoare quadruple {26091#(<= ~counter~0 12)} {26091#(<= ~counter~0 12)} #61#return; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,018 INFO L272 TraceCheckUtils]: 326: Hoare triple {26091#(<= ~counter~0 12)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,019 INFO L290 TraceCheckUtils]: 327: Hoare triple {26091#(<= ~counter~0 12)} ~cond := #in~cond; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,019 INFO L290 TraceCheckUtils]: 328: Hoare triple {26091#(<= ~counter~0 12)} assume !(0 == ~cond); {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,019 INFO L290 TraceCheckUtils]: 329: Hoare triple {26091#(<= ~counter~0 12)} assume true; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,019 INFO L284 TraceCheckUtils]: 330: Hoare quadruple {26091#(<= ~counter~0 12)} {26091#(<= ~counter~0 12)} #63#return; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,020 INFO L272 TraceCheckUtils]: 331: Hoare triple {26091#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,020 INFO L290 TraceCheckUtils]: 332: Hoare triple {26091#(<= ~counter~0 12)} ~cond := #in~cond; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,020 INFO L290 TraceCheckUtils]: 333: Hoare triple {26091#(<= ~counter~0 12)} assume !(0 == ~cond); {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,021 INFO L290 TraceCheckUtils]: 334: Hoare triple {26091#(<= ~counter~0 12)} assume true; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,021 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {26091#(<= ~counter~0 12)} {26091#(<= ~counter~0 12)} #65#return; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,022 INFO L272 TraceCheckUtils]: 336: Hoare triple {26091#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,022 INFO L290 TraceCheckUtils]: 337: Hoare triple {26091#(<= ~counter~0 12)} ~cond := #in~cond; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,022 INFO L290 TraceCheckUtils]: 338: Hoare triple {26091#(<= ~counter~0 12)} assume !(0 == ~cond); {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,022 INFO L290 TraceCheckUtils]: 339: Hoare triple {26091#(<= ~counter~0 12)} assume true; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,023 INFO L284 TraceCheckUtils]: 340: Hoare quadruple {26091#(<= ~counter~0 12)} {26091#(<= ~counter~0 12)} #67#return; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,023 INFO L290 TraceCheckUtils]: 341: Hoare triple {26091#(<= ~counter~0 12)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26091#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:21,024 INFO L290 TraceCheckUtils]: 342: Hoare triple {26091#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,024 INFO L290 TraceCheckUtils]: 343: Hoare triple {26176#(<= ~counter~0 13)} assume !!(#t~post5 < 50);havoc #t~post5; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,024 INFO L272 TraceCheckUtils]: 344: Hoare triple {26176#(<= ~counter~0 13)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,025 INFO L290 TraceCheckUtils]: 345: Hoare triple {26176#(<= ~counter~0 13)} ~cond := #in~cond; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,025 INFO L290 TraceCheckUtils]: 346: Hoare triple {26176#(<= ~counter~0 13)} assume !(0 == ~cond); {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,025 INFO L290 TraceCheckUtils]: 347: Hoare triple {26176#(<= ~counter~0 13)} assume true; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,025 INFO L284 TraceCheckUtils]: 348: Hoare quadruple {26176#(<= ~counter~0 13)} {26176#(<= ~counter~0 13)} #59#return; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,026 INFO L272 TraceCheckUtils]: 349: Hoare triple {26176#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,026 INFO L290 TraceCheckUtils]: 350: Hoare triple {26176#(<= ~counter~0 13)} ~cond := #in~cond; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,026 INFO L290 TraceCheckUtils]: 351: Hoare triple {26176#(<= ~counter~0 13)} assume !(0 == ~cond); {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,027 INFO L290 TraceCheckUtils]: 352: Hoare triple {26176#(<= ~counter~0 13)} assume true; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,027 INFO L284 TraceCheckUtils]: 353: Hoare quadruple {26176#(<= ~counter~0 13)} {26176#(<= ~counter~0 13)} #61#return; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,027 INFO L272 TraceCheckUtils]: 354: Hoare triple {26176#(<= ~counter~0 13)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,028 INFO L290 TraceCheckUtils]: 355: Hoare triple {26176#(<= ~counter~0 13)} ~cond := #in~cond; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,028 INFO L290 TraceCheckUtils]: 356: Hoare triple {26176#(<= ~counter~0 13)} assume !(0 == ~cond); {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,028 INFO L290 TraceCheckUtils]: 357: Hoare triple {26176#(<= ~counter~0 13)} assume true; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,029 INFO L284 TraceCheckUtils]: 358: Hoare quadruple {26176#(<= ~counter~0 13)} {26176#(<= ~counter~0 13)} #63#return; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,029 INFO L272 TraceCheckUtils]: 359: Hoare triple {26176#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,029 INFO L290 TraceCheckUtils]: 360: Hoare triple {26176#(<= ~counter~0 13)} ~cond := #in~cond; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,030 INFO L290 TraceCheckUtils]: 361: Hoare triple {26176#(<= ~counter~0 13)} assume !(0 == ~cond); {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,030 INFO L290 TraceCheckUtils]: 362: Hoare triple {26176#(<= ~counter~0 13)} assume true; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,030 INFO L284 TraceCheckUtils]: 363: Hoare quadruple {26176#(<= ~counter~0 13)} {26176#(<= ~counter~0 13)} #65#return; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,031 INFO L272 TraceCheckUtils]: 364: Hoare triple {26176#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,031 INFO L290 TraceCheckUtils]: 365: Hoare triple {26176#(<= ~counter~0 13)} ~cond := #in~cond; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,031 INFO L290 TraceCheckUtils]: 366: Hoare triple {26176#(<= ~counter~0 13)} assume !(0 == ~cond); {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,032 INFO L290 TraceCheckUtils]: 367: Hoare triple {26176#(<= ~counter~0 13)} assume true; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,032 INFO L284 TraceCheckUtils]: 368: Hoare quadruple {26176#(<= ~counter~0 13)} {26176#(<= ~counter~0 13)} #67#return; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,032 INFO L290 TraceCheckUtils]: 369: Hoare triple {26176#(<= ~counter~0 13)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26176#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:21,033 INFO L290 TraceCheckUtils]: 370: Hoare triple {26176#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,033 INFO L290 TraceCheckUtils]: 371: Hoare triple {26261#(<= ~counter~0 14)} assume !!(#t~post5 < 50);havoc #t~post5; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,033 INFO L272 TraceCheckUtils]: 372: Hoare triple {26261#(<= ~counter~0 14)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,034 INFO L290 TraceCheckUtils]: 373: Hoare triple {26261#(<= ~counter~0 14)} ~cond := #in~cond; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,034 INFO L290 TraceCheckUtils]: 374: Hoare triple {26261#(<= ~counter~0 14)} assume !(0 == ~cond); {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,034 INFO L290 TraceCheckUtils]: 375: Hoare triple {26261#(<= ~counter~0 14)} assume true; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,035 INFO L284 TraceCheckUtils]: 376: Hoare quadruple {26261#(<= ~counter~0 14)} {26261#(<= ~counter~0 14)} #59#return; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,035 INFO L272 TraceCheckUtils]: 377: Hoare triple {26261#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,035 INFO L290 TraceCheckUtils]: 378: Hoare triple {26261#(<= ~counter~0 14)} ~cond := #in~cond; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,036 INFO L290 TraceCheckUtils]: 379: Hoare triple {26261#(<= ~counter~0 14)} assume !(0 == ~cond); {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,036 INFO L290 TraceCheckUtils]: 380: Hoare triple {26261#(<= ~counter~0 14)} assume true; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,036 INFO L284 TraceCheckUtils]: 381: Hoare quadruple {26261#(<= ~counter~0 14)} {26261#(<= ~counter~0 14)} #61#return; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,037 INFO L272 TraceCheckUtils]: 382: Hoare triple {26261#(<= ~counter~0 14)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,037 INFO L290 TraceCheckUtils]: 383: Hoare triple {26261#(<= ~counter~0 14)} ~cond := #in~cond; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,037 INFO L290 TraceCheckUtils]: 384: Hoare triple {26261#(<= ~counter~0 14)} assume !(0 == ~cond); {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,037 INFO L290 TraceCheckUtils]: 385: Hoare triple {26261#(<= ~counter~0 14)} assume true; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,038 INFO L284 TraceCheckUtils]: 386: Hoare quadruple {26261#(<= ~counter~0 14)} {26261#(<= ~counter~0 14)} #63#return; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,038 INFO L272 TraceCheckUtils]: 387: Hoare triple {26261#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,039 INFO L290 TraceCheckUtils]: 388: Hoare triple {26261#(<= ~counter~0 14)} ~cond := #in~cond; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,039 INFO L290 TraceCheckUtils]: 389: Hoare triple {26261#(<= ~counter~0 14)} assume !(0 == ~cond); {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,039 INFO L290 TraceCheckUtils]: 390: Hoare triple {26261#(<= ~counter~0 14)} assume true; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,040 INFO L284 TraceCheckUtils]: 391: Hoare quadruple {26261#(<= ~counter~0 14)} {26261#(<= ~counter~0 14)} #65#return; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,040 INFO L272 TraceCheckUtils]: 392: Hoare triple {26261#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,040 INFO L290 TraceCheckUtils]: 393: Hoare triple {26261#(<= ~counter~0 14)} ~cond := #in~cond; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,040 INFO L290 TraceCheckUtils]: 394: Hoare triple {26261#(<= ~counter~0 14)} assume !(0 == ~cond); {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,041 INFO L290 TraceCheckUtils]: 395: Hoare triple {26261#(<= ~counter~0 14)} assume true; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,041 INFO L284 TraceCheckUtils]: 396: Hoare quadruple {26261#(<= ~counter~0 14)} {26261#(<= ~counter~0 14)} #67#return; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,041 INFO L290 TraceCheckUtils]: 397: Hoare triple {26261#(<= ~counter~0 14)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26261#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:21,042 INFO L290 TraceCheckUtils]: 398: Hoare triple {26261#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,042 INFO L290 TraceCheckUtils]: 399: Hoare triple {26346#(<= ~counter~0 15)} assume !!(#t~post5 < 50);havoc #t~post5; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,043 INFO L272 TraceCheckUtils]: 400: Hoare triple {26346#(<= ~counter~0 15)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,043 INFO L290 TraceCheckUtils]: 401: Hoare triple {26346#(<= ~counter~0 15)} ~cond := #in~cond; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,043 INFO L290 TraceCheckUtils]: 402: Hoare triple {26346#(<= ~counter~0 15)} assume !(0 == ~cond); {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,043 INFO L290 TraceCheckUtils]: 403: Hoare triple {26346#(<= ~counter~0 15)} assume true; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,044 INFO L284 TraceCheckUtils]: 404: Hoare quadruple {26346#(<= ~counter~0 15)} {26346#(<= ~counter~0 15)} #59#return; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,044 INFO L272 TraceCheckUtils]: 405: Hoare triple {26346#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,045 INFO L290 TraceCheckUtils]: 406: Hoare triple {26346#(<= ~counter~0 15)} ~cond := #in~cond; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,045 INFO L290 TraceCheckUtils]: 407: Hoare triple {26346#(<= ~counter~0 15)} assume !(0 == ~cond); {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,045 INFO L290 TraceCheckUtils]: 408: Hoare triple {26346#(<= ~counter~0 15)} assume true; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,045 INFO L284 TraceCheckUtils]: 409: Hoare quadruple {26346#(<= ~counter~0 15)} {26346#(<= ~counter~0 15)} #61#return; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,046 INFO L272 TraceCheckUtils]: 410: Hoare triple {26346#(<= ~counter~0 15)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,046 INFO L290 TraceCheckUtils]: 411: Hoare triple {26346#(<= ~counter~0 15)} ~cond := #in~cond; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,046 INFO L290 TraceCheckUtils]: 412: Hoare triple {26346#(<= ~counter~0 15)} assume !(0 == ~cond); {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,047 INFO L290 TraceCheckUtils]: 413: Hoare triple {26346#(<= ~counter~0 15)} assume true; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,047 INFO L284 TraceCheckUtils]: 414: Hoare quadruple {26346#(<= ~counter~0 15)} {26346#(<= ~counter~0 15)} #63#return; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,047 INFO L272 TraceCheckUtils]: 415: Hoare triple {26346#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,048 INFO L290 TraceCheckUtils]: 416: Hoare triple {26346#(<= ~counter~0 15)} ~cond := #in~cond; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,048 INFO L290 TraceCheckUtils]: 417: Hoare triple {26346#(<= ~counter~0 15)} assume !(0 == ~cond); {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,048 INFO L290 TraceCheckUtils]: 418: Hoare triple {26346#(<= ~counter~0 15)} assume true; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,049 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {26346#(<= ~counter~0 15)} {26346#(<= ~counter~0 15)} #65#return; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,049 INFO L272 TraceCheckUtils]: 420: Hoare triple {26346#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,049 INFO L290 TraceCheckUtils]: 421: Hoare triple {26346#(<= ~counter~0 15)} ~cond := #in~cond; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,050 INFO L290 TraceCheckUtils]: 422: Hoare triple {26346#(<= ~counter~0 15)} assume !(0 == ~cond); {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,050 INFO L290 TraceCheckUtils]: 423: Hoare triple {26346#(<= ~counter~0 15)} assume true; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,050 INFO L284 TraceCheckUtils]: 424: Hoare quadruple {26346#(<= ~counter~0 15)} {26346#(<= ~counter~0 15)} #67#return; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,051 INFO L290 TraceCheckUtils]: 425: Hoare triple {26346#(<= ~counter~0 15)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26346#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:21,051 INFO L290 TraceCheckUtils]: 426: Hoare triple {26346#(<= ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,051 INFO L290 TraceCheckUtils]: 427: Hoare triple {26431#(<= ~counter~0 16)} assume !!(#t~post5 < 50);havoc #t~post5; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,052 INFO L272 TraceCheckUtils]: 428: Hoare triple {26431#(<= ~counter~0 16)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,052 INFO L290 TraceCheckUtils]: 429: Hoare triple {26431#(<= ~counter~0 16)} ~cond := #in~cond; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,052 INFO L290 TraceCheckUtils]: 430: Hoare triple {26431#(<= ~counter~0 16)} assume !(0 == ~cond); {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,053 INFO L290 TraceCheckUtils]: 431: Hoare triple {26431#(<= ~counter~0 16)} assume true; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,053 INFO L284 TraceCheckUtils]: 432: Hoare quadruple {26431#(<= ~counter~0 16)} {26431#(<= ~counter~0 16)} #59#return; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,054 INFO L272 TraceCheckUtils]: 433: Hoare triple {26431#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,054 INFO L290 TraceCheckUtils]: 434: Hoare triple {26431#(<= ~counter~0 16)} ~cond := #in~cond; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,054 INFO L290 TraceCheckUtils]: 435: Hoare triple {26431#(<= ~counter~0 16)} assume !(0 == ~cond); {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,054 INFO L290 TraceCheckUtils]: 436: Hoare triple {26431#(<= ~counter~0 16)} assume true; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,055 INFO L284 TraceCheckUtils]: 437: Hoare quadruple {26431#(<= ~counter~0 16)} {26431#(<= ~counter~0 16)} #61#return; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,055 INFO L272 TraceCheckUtils]: 438: Hoare triple {26431#(<= ~counter~0 16)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,055 INFO L290 TraceCheckUtils]: 439: Hoare triple {26431#(<= ~counter~0 16)} ~cond := #in~cond; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,056 INFO L290 TraceCheckUtils]: 440: Hoare triple {26431#(<= ~counter~0 16)} assume !(0 == ~cond); {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,056 INFO L290 TraceCheckUtils]: 441: Hoare triple {26431#(<= ~counter~0 16)} assume true; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,056 INFO L284 TraceCheckUtils]: 442: Hoare quadruple {26431#(<= ~counter~0 16)} {26431#(<= ~counter~0 16)} #63#return; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,057 INFO L272 TraceCheckUtils]: 443: Hoare triple {26431#(<= ~counter~0 16)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,057 INFO L290 TraceCheckUtils]: 444: Hoare triple {26431#(<= ~counter~0 16)} ~cond := #in~cond; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,057 INFO L290 TraceCheckUtils]: 445: Hoare triple {26431#(<= ~counter~0 16)} assume !(0 == ~cond); {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,058 INFO L290 TraceCheckUtils]: 446: Hoare triple {26431#(<= ~counter~0 16)} assume true; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,058 INFO L284 TraceCheckUtils]: 447: Hoare quadruple {26431#(<= ~counter~0 16)} {26431#(<= ~counter~0 16)} #65#return; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,058 INFO L272 TraceCheckUtils]: 448: Hoare triple {26431#(<= ~counter~0 16)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,059 INFO L290 TraceCheckUtils]: 449: Hoare triple {26431#(<= ~counter~0 16)} ~cond := #in~cond; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,059 INFO L290 TraceCheckUtils]: 450: Hoare triple {26431#(<= ~counter~0 16)} assume !(0 == ~cond); {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,059 INFO L290 TraceCheckUtils]: 451: Hoare triple {26431#(<= ~counter~0 16)} assume true; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,060 INFO L284 TraceCheckUtils]: 452: Hoare quadruple {26431#(<= ~counter~0 16)} {26431#(<= ~counter~0 16)} #67#return; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,060 INFO L290 TraceCheckUtils]: 453: Hoare triple {26431#(<= ~counter~0 16)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26431#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:21,060 INFO L290 TraceCheckUtils]: 454: Hoare triple {26431#(<= ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,061 INFO L290 TraceCheckUtils]: 455: Hoare triple {26516#(<= ~counter~0 17)} assume !!(#t~post5 < 50);havoc #t~post5; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,061 INFO L272 TraceCheckUtils]: 456: Hoare triple {26516#(<= ~counter~0 17)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,061 INFO L290 TraceCheckUtils]: 457: Hoare triple {26516#(<= ~counter~0 17)} ~cond := #in~cond; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,062 INFO L290 TraceCheckUtils]: 458: Hoare triple {26516#(<= ~counter~0 17)} assume !(0 == ~cond); {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,062 INFO L290 TraceCheckUtils]: 459: Hoare triple {26516#(<= ~counter~0 17)} assume true; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,062 INFO L284 TraceCheckUtils]: 460: Hoare quadruple {26516#(<= ~counter~0 17)} {26516#(<= ~counter~0 17)} #59#return; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,063 INFO L272 TraceCheckUtils]: 461: Hoare triple {26516#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,063 INFO L290 TraceCheckUtils]: 462: Hoare triple {26516#(<= ~counter~0 17)} ~cond := #in~cond; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,063 INFO L290 TraceCheckUtils]: 463: Hoare triple {26516#(<= ~counter~0 17)} assume !(0 == ~cond); {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,063 INFO L290 TraceCheckUtils]: 464: Hoare triple {26516#(<= ~counter~0 17)} assume true; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,065 INFO L284 TraceCheckUtils]: 465: Hoare quadruple {26516#(<= ~counter~0 17)} {26516#(<= ~counter~0 17)} #61#return; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,066 INFO L272 TraceCheckUtils]: 466: Hoare triple {26516#(<= ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,066 INFO L290 TraceCheckUtils]: 467: Hoare triple {26516#(<= ~counter~0 17)} ~cond := #in~cond; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,066 INFO L290 TraceCheckUtils]: 468: Hoare triple {26516#(<= ~counter~0 17)} assume !(0 == ~cond); {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,066 INFO L290 TraceCheckUtils]: 469: Hoare triple {26516#(<= ~counter~0 17)} assume true; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,067 INFO L284 TraceCheckUtils]: 470: Hoare quadruple {26516#(<= ~counter~0 17)} {26516#(<= ~counter~0 17)} #63#return; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,067 INFO L272 TraceCheckUtils]: 471: Hoare triple {26516#(<= ~counter~0 17)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,068 INFO L290 TraceCheckUtils]: 472: Hoare triple {26516#(<= ~counter~0 17)} ~cond := #in~cond; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,068 INFO L290 TraceCheckUtils]: 473: Hoare triple {26516#(<= ~counter~0 17)} assume !(0 == ~cond); {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,068 INFO L290 TraceCheckUtils]: 474: Hoare triple {26516#(<= ~counter~0 17)} assume true; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,069 INFO L284 TraceCheckUtils]: 475: Hoare quadruple {26516#(<= ~counter~0 17)} {26516#(<= ~counter~0 17)} #65#return; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,069 INFO L272 TraceCheckUtils]: 476: Hoare triple {26516#(<= ~counter~0 17)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,069 INFO L290 TraceCheckUtils]: 477: Hoare triple {26516#(<= ~counter~0 17)} ~cond := #in~cond; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,069 INFO L290 TraceCheckUtils]: 478: Hoare triple {26516#(<= ~counter~0 17)} assume !(0 == ~cond); {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,070 INFO L290 TraceCheckUtils]: 479: Hoare triple {26516#(<= ~counter~0 17)} assume true; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,070 INFO L284 TraceCheckUtils]: 480: Hoare quadruple {26516#(<= ~counter~0 17)} {26516#(<= ~counter~0 17)} #67#return; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,070 INFO L290 TraceCheckUtils]: 481: Hoare triple {26516#(<= ~counter~0 17)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26516#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:21,071 INFO L290 TraceCheckUtils]: 482: Hoare triple {26516#(<= ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,071 INFO L290 TraceCheckUtils]: 483: Hoare triple {26601#(<= ~counter~0 18)} assume !!(#t~post5 < 50);havoc #t~post5; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,072 INFO L272 TraceCheckUtils]: 484: Hoare triple {26601#(<= ~counter~0 18)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,072 INFO L290 TraceCheckUtils]: 485: Hoare triple {26601#(<= ~counter~0 18)} ~cond := #in~cond; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,072 INFO L290 TraceCheckUtils]: 486: Hoare triple {26601#(<= ~counter~0 18)} assume !(0 == ~cond); {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,072 INFO L290 TraceCheckUtils]: 487: Hoare triple {26601#(<= ~counter~0 18)} assume true; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,073 INFO L284 TraceCheckUtils]: 488: Hoare quadruple {26601#(<= ~counter~0 18)} {26601#(<= ~counter~0 18)} #59#return; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,073 INFO L272 TraceCheckUtils]: 489: Hoare triple {26601#(<= ~counter~0 18)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,073 INFO L290 TraceCheckUtils]: 490: Hoare triple {26601#(<= ~counter~0 18)} ~cond := #in~cond; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,074 INFO L290 TraceCheckUtils]: 491: Hoare triple {26601#(<= ~counter~0 18)} assume !(0 == ~cond); {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,074 INFO L290 TraceCheckUtils]: 492: Hoare triple {26601#(<= ~counter~0 18)} assume true; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,074 INFO L284 TraceCheckUtils]: 493: Hoare quadruple {26601#(<= ~counter~0 18)} {26601#(<= ~counter~0 18)} #61#return; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,075 INFO L272 TraceCheckUtils]: 494: Hoare triple {26601#(<= ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,075 INFO L290 TraceCheckUtils]: 495: Hoare triple {26601#(<= ~counter~0 18)} ~cond := #in~cond; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,075 INFO L290 TraceCheckUtils]: 496: Hoare triple {26601#(<= ~counter~0 18)} assume !(0 == ~cond); {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,076 INFO L290 TraceCheckUtils]: 497: Hoare triple {26601#(<= ~counter~0 18)} assume true; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,076 INFO L284 TraceCheckUtils]: 498: Hoare quadruple {26601#(<= ~counter~0 18)} {26601#(<= ~counter~0 18)} #63#return; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,076 INFO L272 TraceCheckUtils]: 499: Hoare triple {26601#(<= ~counter~0 18)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,077 INFO L290 TraceCheckUtils]: 500: Hoare triple {26601#(<= ~counter~0 18)} ~cond := #in~cond; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,077 INFO L290 TraceCheckUtils]: 501: Hoare triple {26601#(<= ~counter~0 18)} assume !(0 == ~cond); {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,077 INFO L290 TraceCheckUtils]: 502: Hoare triple {26601#(<= ~counter~0 18)} assume true; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,078 INFO L284 TraceCheckUtils]: 503: Hoare quadruple {26601#(<= ~counter~0 18)} {26601#(<= ~counter~0 18)} #65#return; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,078 INFO L272 TraceCheckUtils]: 504: Hoare triple {26601#(<= ~counter~0 18)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,078 INFO L290 TraceCheckUtils]: 505: Hoare triple {26601#(<= ~counter~0 18)} ~cond := #in~cond; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,079 INFO L290 TraceCheckUtils]: 506: Hoare triple {26601#(<= ~counter~0 18)} assume !(0 == ~cond); {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,079 INFO L290 TraceCheckUtils]: 507: Hoare triple {26601#(<= ~counter~0 18)} assume true; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,079 INFO L284 TraceCheckUtils]: 508: Hoare quadruple {26601#(<= ~counter~0 18)} {26601#(<= ~counter~0 18)} #67#return; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,080 INFO L290 TraceCheckUtils]: 509: Hoare triple {26601#(<= ~counter~0 18)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26601#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:21,080 INFO L290 TraceCheckUtils]: 510: Hoare triple {26601#(<= ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,080 INFO L290 TraceCheckUtils]: 511: Hoare triple {26686#(<= ~counter~0 19)} assume !!(#t~post5 < 50);havoc #t~post5; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,081 INFO L272 TraceCheckUtils]: 512: Hoare triple {26686#(<= ~counter~0 19)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,081 INFO L290 TraceCheckUtils]: 513: Hoare triple {26686#(<= ~counter~0 19)} ~cond := #in~cond; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,081 INFO L290 TraceCheckUtils]: 514: Hoare triple {26686#(<= ~counter~0 19)} assume !(0 == ~cond); {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,082 INFO L290 TraceCheckUtils]: 515: Hoare triple {26686#(<= ~counter~0 19)} assume true; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,082 INFO L284 TraceCheckUtils]: 516: Hoare quadruple {26686#(<= ~counter~0 19)} {26686#(<= ~counter~0 19)} #59#return; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,082 INFO L272 TraceCheckUtils]: 517: Hoare triple {26686#(<= ~counter~0 19)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,083 INFO L290 TraceCheckUtils]: 518: Hoare triple {26686#(<= ~counter~0 19)} ~cond := #in~cond; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,083 INFO L290 TraceCheckUtils]: 519: Hoare triple {26686#(<= ~counter~0 19)} assume !(0 == ~cond); {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,083 INFO L290 TraceCheckUtils]: 520: Hoare triple {26686#(<= ~counter~0 19)} assume true; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,084 INFO L284 TraceCheckUtils]: 521: Hoare quadruple {26686#(<= ~counter~0 19)} {26686#(<= ~counter~0 19)} #61#return; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,084 INFO L272 TraceCheckUtils]: 522: Hoare triple {26686#(<= ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,084 INFO L290 TraceCheckUtils]: 523: Hoare triple {26686#(<= ~counter~0 19)} ~cond := #in~cond; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,084 INFO L290 TraceCheckUtils]: 524: Hoare triple {26686#(<= ~counter~0 19)} assume !(0 == ~cond); {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,085 INFO L290 TraceCheckUtils]: 525: Hoare triple {26686#(<= ~counter~0 19)} assume true; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,085 INFO L284 TraceCheckUtils]: 526: Hoare quadruple {26686#(<= ~counter~0 19)} {26686#(<= ~counter~0 19)} #63#return; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,086 INFO L272 TraceCheckUtils]: 527: Hoare triple {26686#(<= ~counter~0 19)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,086 INFO L290 TraceCheckUtils]: 528: Hoare triple {26686#(<= ~counter~0 19)} ~cond := #in~cond; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,086 INFO L290 TraceCheckUtils]: 529: Hoare triple {26686#(<= ~counter~0 19)} assume !(0 == ~cond); {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,086 INFO L290 TraceCheckUtils]: 530: Hoare triple {26686#(<= ~counter~0 19)} assume true; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,087 INFO L284 TraceCheckUtils]: 531: Hoare quadruple {26686#(<= ~counter~0 19)} {26686#(<= ~counter~0 19)} #65#return; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,087 INFO L272 TraceCheckUtils]: 532: Hoare triple {26686#(<= ~counter~0 19)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,087 INFO L290 TraceCheckUtils]: 533: Hoare triple {26686#(<= ~counter~0 19)} ~cond := #in~cond; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,088 INFO L290 TraceCheckUtils]: 534: Hoare triple {26686#(<= ~counter~0 19)} assume !(0 == ~cond); {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,088 INFO L290 TraceCheckUtils]: 535: Hoare triple {26686#(<= ~counter~0 19)} assume true; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,088 INFO L284 TraceCheckUtils]: 536: Hoare quadruple {26686#(<= ~counter~0 19)} {26686#(<= ~counter~0 19)} #67#return; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,089 INFO L290 TraceCheckUtils]: 537: Hoare triple {26686#(<= ~counter~0 19)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26686#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:21,089 INFO L290 TraceCheckUtils]: 538: Hoare triple {26686#(<= ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,089 INFO L290 TraceCheckUtils]: 539: Hoare triple {26771#(<= ~counter~0 20)} assume !!(#t~post5 < 50);havoc #t~post5; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,090 INFO L272 TraceCheckUtils]: 540: Hoare triple {26771#(<= ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,090 INFO L290 TraceCheckUtils]: 541: Hoare triple {26771#(<= ~counter~0 20)} ~cond := #in~cond; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,090 INFO L290 TraceCheckUtils]: 542: Hoare triple {26771#(<= ~counter~0 20)} assume !(0 == ~cond); {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,091 INFO L290 TraceCheckUtils]: 543: Hoare triple {26771#(<= ~counter~0 20)} assume true; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,091 INFO L284 TraceCheckUtils]: 544: Hoare quadruple {26771#(<= ~counter~0 20)} {26771#(<= ~counter~0 20)} #59#return; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,091 INFO L272 TraceCheckUtils]: 545: Hoare triple {26771#(<= ~counter~0 20)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,092 INFO L290 TraceCheckUtils]: 546: Hoare triple {26771#(<= ~counter~0 20)} ~cond := #in~cond; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,092 INFO L290 TraceCheckUtils]: 547: Hoare triple {26771#(<= ~counter~0 20)} assume !(0 == ~cond); {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,092 INFO L290 TraceCheckUtils]: 548: Hoare triple {26771#(<= ~counter~0 20)} assume true; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,093 INFO L284 TraceCheckUtils]: 549: Hoare quadruple {26771#(<= ~counter~0 20)} {26771#(<= ~counter~0 20)} #61#return; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,093 INFO L272 TraceCheckUtils]: 550: Hoare triple {26771#(<= ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,111 INFO L290 TraceCheckUtils]: 551: Hoare triple {26771#(<= ~counter~0 20)} ~cond := #in~cond; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,112 INFO L290 TraceCheckUtils]: 552: Hoare triple {26771#(<= ~counter~0 20)} assume !(0 == ~cond); {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,112 INFO L290 TraceCheckUtils]: 553: Hoare triple {26771#(<= ~counter~0 20)} assume true; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,113 INFO L284 TraceCheckUtils]: 554: Hoare quadruple {26771#(<= ~counter~0 20)} {26771#(<= ~counter~0 20)} #63#return; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,114 INFO L272 TraceCheckUtils]: 555: Hoare triple {26771#(<= ~counter~0 20)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,115 INFO L290 TraceCheckUtils]: 556: Hoare triple {26771#(<= ~counter~0 20)} ~cond := #in~cond; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,115 INFO L290 TraceCheckUtils]: 557: Hoare triple {26771#(<= ~counter~0 20)} assume !(0 == ~cond); {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,116 INFO L290 TraceCheckUtils]: 558: Hoare triple {26771#(<= ~counter~0 20)} assume true; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,116 INFO L284 TraceCheckUtils]: 559: Hoare quadruple {26771#(<= ~counter~0 20)} {26771#(<= ~counter~0 20)} #65#return; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,117 INFO L272 TraceCheckUtils]: 560: Hoare triple {26771#(<= ~counter~0 20)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,118 INFO L290 TraceCheckUtils]: 561: Hoare triple {26771#(<= ~counter~0 20)} ~cond := #in~cond; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,118 INFO L290 TraceCheckUtils]: 562: Hoare triple {26771#(<= ~counter~0 20)} assume !(0 == ~cond); {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,119 INFO L290 TraceCheckUtils]: 563: Hoare triple {26771#(<= ~counter~0 20)} assume true; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,119 INFO L284 TraceCheckUtils]: 564: Hoare quadruple {26771#(<= ~counter~0 20)} {26771#(<= ~counter~0 20)} #67#return; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,120 INFO L290 TraceCheckUtils]: 565: Hoare triple {26771#(<= ~counter~0 20)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26771#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:21,121 INFO L290 TraceCheckUtils]: 566: Hoare triple {26771#(<= ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,122 INFO L290 TraceCheckUtils]: 567: Hoare triple {26856#(<= ~counter~0 21)} assume !!(#t~post5 < 50);havoc #t~post5; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,122 INFO L272 TraceCheckUtils]: 568: Hoare triple {26856#(<= ~counter~0 21)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,123 INFO L290 TraceCheckUtils]: 569: Hoare triple {26856#(<= ~counter~0 21)} ~cond := #in~cond; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,123 INFO L290 TraceCheckUtils]: 570: Hoare triple {26856#(<= ~counter~0 21)} assume !(0 == ~cond); {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,124 INFO L290 TraceCheckUtils]: 571: Hoare triple {26856#(<= ~counter~0 21)} assume true; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,125 INFO L284 TraceCheckUtils]: 572: Hoare quadruple {26856#(<= ~counter~0 21)} {26856#(<= ~counter~0 21)} #59#return; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,125 INFO L272 TraceCheckUtils]: 573: Hoare triple {26856#(<= ~counter~0 21)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,126 INFO L290 TraceCheckUtils]: 574: Hoare triple {26856#(<= ~counter~0 21)} ~cond := #in~cond; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,126 INFO L290 TraceCheckUtils]: 575: Hoare triple {26856#(<= ~counter~0 21)} assume !(0 == ~cond); {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,127 INFO L290 TraceCheckUtils]: 576: Hoare triple {26856#(<= ~counter~0 21)} assume true; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,128 INFO L284 TraceCheckUtils]: 577: Hoare quadruple {26856#(<= ~counter~0 21)} {26856#(<= ~counter~0 21)} #61#return; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,128 INFO L272 TraceCheckUtils]: 578: Hoare triple {26856#(<= ~counter~0 21)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,129 INFO L290 TraceCheckUtils]: 579: Hoare triple {26856#(<= ~counter~0 21)} ~cond := #in~cond; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,129 INFO L290 TraceCheckUtils]: 580: Hoare triple {26856#(<= ~counter~0 21)} assume !(0 == ~cond); {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,130 INFO L290 TraceCheckUtils]: 581: Hoare triple {26856#(<= ~counter~0 21)} assume true; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,131 INFO L284 TraceCheckUtils]: 582: Hoare quadruple {26856#(<= ~counter~0 21)} {26856#(<= ~counter~0 21)} #63#return; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,132 INFO L272 TraceCheckUtils]: 583: Hoare triple {26856#(<= ~counter~0 21)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,132 INFO L290 TraceCheckUtils]: 584: Hoare triple {26856#(<= ~counter~0 21)} ~cond := #in~cond; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,133 INFO L290 TraceCheckUtils]: 585: Hoare triple {26856#(<= ~counter~0 21)} assume !(0 == ~cond); {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,133 INFO L290 TraceCheckUtils]: 586: Hoare triple {26856#(<= ~counter~0 21)} assume true; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,134 INFO L284 TraceCheckUtils]: 587: Hoare quadruple {26856#(<= ~counter~0 21)} {26856#(<= ~counter~0 21)} #65#return; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,135 INFO L272 TraceCheckUtils]: 588: Hoare triple {26856#(<= ~counter~0 21)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,135 INFO L290 TraceCheckUtils]: 589: Hoare triple {26856#(<= ~counter~0 21)} ~cond := #in~cond; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,135 INFO L290 TraceCheckUtils]: 590: Hoare triple {26856#(<= ~counter~0 21)} assume !(0 == ~cond); {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,136 INFO L290 TraceCheckUtils]: 591: Hoare triple {26856#(<= ~counter~0 21)} assume true; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,136 INFO L284 TraceCheckUtils]: 592: Hoare quadruple {26856#(<= ~counter~0 21)} {26856#(<= ~counter~0 21)} #67#return; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,137 INFO L290 TraceCheckUtils]: 593: Hoare triple {26856#(<= ~counter~0 21)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26856#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:21,137 INFO L290 TraceCheckUtils]: 594: Hoare triple {26856#(<= ~counter~0 21)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,138 INFO L290 TraceCheckUtils]: 595: Hoare triple {26941#(<= ~counter~0 22)} assume !!(#t~post5 < 50);havoc #t~post5; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,138 INFO L272 TraceCheckUtils]: 596: Hoare triple {26941#(<= ~counter~0 22)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,139 INFO L290 TraceCheckUtils]: 597: Hoare triple {26941#(<= ~counter~0 22)} ~cond := #in~cond; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,139 INFO L290 TraceCheckUtils]: 598: Hoare triple {26941#(<= ~counter~0 22)} assume !(0 == ~cond); {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,139 INFO L290 TraceCheckUtils]: 599: Hoare triple {26941#(<= ~counter~0 22)} assume true; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,140 INFO L284 TraceCheckUtils]: 600: Hoare quadruple {26941#(<= ~counter~0 22)} {26941#(<= ~counter~0 22)} #59#return; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,140 INFO L272 TraceCheckUtils]: 601: Hoare triple {26941#(<= ~counter~0 22)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,141 INFO L290 TraceCheckUtils]: 602: Hoare triple {26941#(<= ~counter~0 22)} ~cond := #in~cond; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,141 INFO L290 TraceCheckUtils]: 603: Hoare triple {26941#(<= ~counter~0 22)} assume !(0 == ~cond); {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,141 INFO L290 TraceCheckUtils]: 604: Hoare triple {26941#(<= ~counter~0 22)} assume true; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,142 INFO L284 TraceCheckUtils]: 605: Hoare quadruple {26941#(<= ~counter~0 22)} {26941#(<= ~counter~0 22)} #61#return; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,143 INFO L272 TraceCheckUtils]: 606: Hoare triple {26941#(<= ~counter~0 22)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,143 INFO L290 TraceCheckUtils]: 607: Hoare triple {26941#(<= ~counter~0 22)} ~cond := #in~cond; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,143 INFO L290 TraceCheckUtils]: 608: Hoare triple {26941#(<= ~counter~0 22)} assume !(0 == ~cond); {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,144 INFO L290 TraceCheckUtils]: 609: Hoare triple {26941#(<= ~counter~0 22)} assume true; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,144 INFO L284 TraceCheckUtils]: 610: Hoare quadruple {26941#(<= ~counter~0 22)} {26941#(<= ~counter~0 22)} #63#return; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,145 INFO L272 TraceCheckUtils]: 611: Hoare triple {26941#(<= ~counter~0 22)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,145 INFO L290 TraceCheckUtils]: 612: Hoare triple {26941#(<= ~counter~0 22)} ~cond := #in~cond; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,145 INFO L290 TraceCheckUtils]: 613: Hoare triple {26941#(<= ~counter~0 22)} assume !(0 == ~cond); {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,146 INFO L290 TraceCheckUtils]: 614: Hoare triple {26941#(<= ~counter~0 22)} assume true; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,146 INFO L284 TraceCheckUtils]: 615: Hoare quadruple {26941#(<= ~counter~0 22)} {26941#(<= ~counter~0 22)} #65#return; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,147 INFO L272 TraceCheckUtils]: 616: Hoare triple {26941#(<= ~counter~0 22)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,147 INFO L290 TraceCheckUtils]: 617: Hoare triple {26941#(<= ~counter~0 22)} ~cond := #in~cond; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,147 INFO L290 TraceCheckUtils]: 618: Hoare triple {26941#(<= ~counter~0 22)} assume !(0 == ~cond); {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,148 INFO L290 TraceCheckUtils]: 619: Hoare triple {26941#(<= ~counter~0 22)} assume true; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,148 INFO L284 TraceCheckUtils]: 620: Hoare quadruple {26941#(<= ~counter~0 22)} {26941#(<= ~counter~0 22)} #67#return; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,149 INFO L290 TraceCheckUtils]: 621: Hoare triple {26941#(<= ~counter~0 22)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26941#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:21,149 INFO L290 TraceCheckUtils]: 622: Hoare triple {26941#(<= ~counter~0 22)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27026#(<= |main_#t~post5| 22)} is VALID [2022-04-14 15:17:21,149 INFO L290 TraceCheckUtils]: 623: Hoare triple {27026#(<= |main_#t~post5| 22)} assume !(#t~post5 < 50);havoc #t~post5; {25133#false} is VALID [2022-04-14 15:17:21,150 INFO L272 TraceCheckUtils]: 624: Hoare triple {25133#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25133#false} is VALID [2022-04-14 15:17:21,150 INFO L290 TraceCheckUtils]: 625: Hoare triple {25133#false} ~cond := #in~cond; {25133#false} is VALID [2022-04-14 15:17:21,150 INFO L290 TraceCheckUtils]: 626: Hoare triple {25133#false} assume !(0 == ~cond); {25133#false} is VALID [2022-04-14 15:17:21,150 INFO L290 TraceCheckUtils]: 627: Hoare triple {25133#false} assume true; {25133#false} is VALID [2022-04-14 15:17:21,150 INFO L284 TraceCheckUtils]: 628: Hoare quadruple {25133#false} {25133#false} #69#return; {25133#false} is VALID [2022-04-14 15:17:21,150 INFO L272 TraceCheckUtils]: 629: Hoare triple {25133#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {25133#false} is VALID [2022-04-14 15:17:21,150 INFO L290 TraceCheckUtils]: 630: Hoare triple {25133#false} ~cond := #in~cond; {25133#false} is VALID [2022-04-14 15:17:21,150 INFO L290 TraceCheckUtils]: 631: Hoare triple {25133#false} assume 0 == ~cond; {25133#false} is VALID [2022-04-14 15:17:21,150 INFO L290 TraceCheckUtils]: 632: Hoare triple {25133#false} assume !false; {25133#false} is VALID [2022-04-14 15:17:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 660 proven. 24992 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2022-04-14 15:17:21,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:17:23,846 INFO L290 TraceCheckUtils]: 632: Hoare triple {25133#false} assume !false; {25133#false} is VALID [2022-04-14 15:17:23,846 INFO L290 TraceCheckUtils]: 631: Hoare triple {25133#false} assume 0 == ~cond; {25133#false} is VALID [2022-04-14 15:17:23,847 INFO L290 TraceCheckUtils]: 630: Hoare triple {25133#false} ~cond := #in~cond; {25133#false} is VALID [2022-04-14 15:17:23,847 INFO L272 TraceCheckUtils]: 629: Hoare triple {25133#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {25133#false} is VALID [2022-04-14 15:17:23,847 INFO L284 TraceCheckUtils]: 628: Hoare quadruple {25132#true} {25133#false} #69#return; {25133#false} is VALID [2022-04-14 15:17:23,847 INFO L290 TraceCheckUtils]: 627: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,847 INFO L290 TraceCheckUtils]: 626: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,847 INFO L290 TraceCheckUtils]: 625: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,847 INFO L272 TraceCheckUtils]: 624: Hoare triple {25133#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,847 INFO L290 TraceCheckUtils]: 623: Hoare triple {27084#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {25133#false} is VALID [2022-04-14 15:17:23,848 INFO L290 TraceCheckUtils]: 622: Hoare triple {27088#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27084#(< |main_#t~post5| 50)} is VALID [2022-04-14 15:17:23,848 INFO L290 TraceCheckUtils]: 621: Hoare triple {27088#(< ~counter~0 50)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27088#(< ~counter~0 50)} is VALID [2022-04-14 15:17:23,849 INFO L284 TraceCheckUtils]: 620: Hoare quadruple {25132#true} {27088#(< ~counter~0 50)} #67#return; {27088#(< ~counter~0 50)} is VALID [2022-04-14 15:17:23,849 INFO L290 TraceCheckUtils]: 619: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,849 INFO L290 TraceCheckUtils]: 618: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,849 INFO L290 TraceCheckUtils]: 617: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,849 INFO L272 TraceCheckUtils]: 616: Hoare triple {27088#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,850 INFO L284 TraceCheckUtils]: 615: Hoare quadruple {25132#true} {27088#(< ~counter~0 50)} #65#return; {27088#(< ~counter~0 50)} is VALID [2022-04-14 15:17:23,850 INFO L290 TraceCheckUtils]: 614: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,850 INFO L290 TraceCheckUtils]: 613: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,850 INFO L290 TraceCheckUtils]: 612: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,850 INFO L272 TraceCheckUtils]: 611: Hoare triple {27088#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,850 INFO L284 TraceCheckUtils]: 610: Hoare quadruple {25132#true} {27088#(< ~counter~0 50)} #63#return; {27088#(< ~counter~0 50)} is VALID [2022-04-14 15:17:23,851 INFO L290 TraceCheckUtils]: 609: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,851 INFO L290 TraceCheckUtils]: 608: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,851 INFO L290 TraceCheckUtils]: 607: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,851 INFO L272 TraceCheckUtils]: 606: Hoare triple {27088#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,851 INFO L284 TraceCheckUtils]: 605: Hoare quadruple {25132#true} {27088#(< ~counter~0 50)} #61#return; {27088#(< ~counter~0 50)} is VALID [2022-04-14 15:17:23,851 INFO L290 TraceCheckUtils]: 604: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,851 INFO L290 TraceCheckUtils]: 603: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,852 INFO L290 TraceCheckUtils]: 602: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,852 INFO L272 TraceCheckUtils]: 601: Hoare triple {27088#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,852 INFO L284 TraceCheckUtils]: 600: Hoare quadruple {25132#true} {27088#(< ~counter~0 50)} #59#return; {27088#(< ~counter~0 50)} is VALID [2022-04-14 15:17:23,852 INFO L290 TraceCheckUtils]: 599: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,852 INFO L290 TraceCheckUtils]: 598: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,852 INFO L290 TraceCheckUtils]: 597: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,852 INFO L272 TraceCheckUtils]: 596: Hoare triple {27088#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,853 INFO L290 TraceCheckUtils]: 595: Hoare triple {27088#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {27088#(< ~counter~0 50)} is VALID [2022-04-14 15:17:23,854 INFO L290 TraceCheckUtils]: 594: Hoare triple {27173#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27088#(< ~counter~0 50)} is VALID [2022-04-14 15:17:23,854 INFO L290 TraceCheckUtils]: 593: Hoare triple {27173#(< ~counter~0 49)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27173#(< ~counter~0 49)} is VALID [2022-04-14 15:17:23,855 INFO L284 TraceCheckUtils]: 592: Hoare quadruple {25132#true} {27173#(< ~counter~0 49)} #67#return; {27173#(< ~counter~0 49)} is VALID [2022-04-14 15:17:23,855 INFO L290 TraceCheckUtils]: 591: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,855 INFO L290 TraceCheckUtils]: 590: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,855 INFO L290 TraceCheckUtils]: 589: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,855 INFO L272 TraceCheckUtils]: 588: Hoare triple {27173#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,856 INFO L284 TraceCheckUtils]: 587: Hoare quadruple {25132#true} {27173#(< ~counter~0 49)} #65#return; {27173#(< ~counter~0 49)} is VALID [2022-04-14 15:17:23,856 INFO L290 TraceCheckUtils]: 586: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,856 INFO L290 TraceCheckUtils]: 585: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,856 INFO L290 TraceCheckUtils]: 584: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,856 INFO L272 TraceCheckUtils]: 583: Hoare triple {27173#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,857 INFO L284 TraceCheckUtils]: 582: Hoare quadruple {25132#true} {27173#(< ~counter~0 49)} #63#return; {27173#(< ~counter~0 49)} is VALID [2022-04-14 15:17:23,857 INFO L290 TraceCheckUtils]: 581: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,857 INFO L290 TraceCheckUtils]: 580: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,857 INFO L290 TraceCheckUtils]: 579: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,857 INFO L272 TraceCheckUtils]: 578: Hoare triple {27173#(< ~counter~0 49)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,858 INFO L284 TraceCheckUtils]: 577: Hoare quadruple {25132#true} {27173#(< ~counter~0 49)} #61#return; {27173#(< ~counter~0 49)} is VALID [2022-04-14 15:17:23,858 INFO L290 TraceCheckUtils]: 576: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,858 INFO L290 TraceCheckUtils]: 575: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,858 INFO L290 TraceCheckUtils]: 574: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,858 INFO L272 TraceCheckUtils]: 573: Hoare triple {27173#(< ~counter~0 49)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,859 INFO L284 TraceCheckUtils]: 572: Hoare quadruple {25132#true} {27173#(< ~counter~0 49)} #59#return; {27173#(< ~counter~0 49)} is VALID [2022-04-14 15:17:23,859 INFO L290 TraceCheckUtils]: 571: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,859 INFO L290 TraceCheckUtils]: 570: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,859 INFO L290 TraceCheckUtils]: 569: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,859 INFO L272 TraceCheckUtils]: 568: Hoare triple {27173#(< ~counter~0 49)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,859 INFO L290 TraceCheckUtils]: 567: Hoare triple {27173#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {27173#(< ~counter~0 49)} is VALID [2022-04-14 15:17:23,860 INFO L290 TraceCheckUtils]: 566: Hoare triple {27258#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27173#(< ~counter~0 49)} is VALID [2022-04-14 15:17:23,861 INFO L290 TraceCheckUtils]: 565: Hoare triple {27258#(< ~counter~0 48)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27258#(< ~counter~0 48)} is VALID [2022-04-14 15:17:23,861 INFO L284 TraceCheckUtils]: 564: Hoare quadruple {25132#true} {27258#(< ~counter~0 48)} #67#return; {27258#(< ~counter~0 48)} is VALID [2022-04-14 15:17:23,861 INFO L290 TraceCheckUtils]: 563: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,861 INFO L290 TraceCheckUtils]: 562: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,861 INFO L290 TraceCheckUtils]: 561: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,861 INFO L272 TraceCheckUtils]: 560: Hoare triple {27258#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,862 INFO L284 TraceCheckUtils]: 559: Hoare quadruple {25132#true} {27258#(< ~counter~0 48)} #65#return; {27258#(< ~counter~0 48)} is VALID [2022-04-14 15:17:23,862 INFO L290 TraceCheckUtils]: 558: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,862 INFO L290 TraceCheckUtils]: 557: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,862 INFO L290 TraceCheckUtils]: 556: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,862 INFO L272 TraceCheckUtils]: 555: Hoare triple {27258#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,863 INFO L284 TraceCheckUtils]: 554: Hoare quadruple {25132#true} {27258#(< ~counter~0 48)} #63#return; {27258#(< ~counter~0 48)} is VALID [2022-04-14 15:17:23,863 INFO L290 TraceCheckUtils]: 553: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,863 INFO L290 TraceCheckUtils]: 552: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,863 INFO L290 TraceCheckUtils]: 551: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,863 INFO L272 TraceCheckUtils]: 550: Hoare triple {27258#(< ~counter~0 48)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,864 INFO L284 TraceCheckUtils]: 549: Hoare quadruple {25132#true} {27258#(< ~counter~0 48)} #61#return; {27258#(< ~counter~0 48)} is VALID [2022-04-14 15:17:23,864 INFO L290 TraceCheckUtils]: 548: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,864 INFO L290 TraceCheckUtils]: 547: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,864 INFO L290 TraceCheckUtils]: 546: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,864 INFO L272 TraceCheckUtils]: 545: Hoare triple {27258#(< ~counter~0 48)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,864 INFO L284 TraceCheckUtils]: 544: Hoare quadruple {25132#true} {27258#(< ~counter~0 48)} #59#return; {27258#(< ~counter~0 48)} is VALID [2022-04-14 15:17:23,865 INFO L290 TraceCheckUtils]: 543: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,865 INFO L290 TraceCheckUtils]: 542: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,865 INFO L290 TraceCheckUtils]: 541: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,865 INFO L272 TraceCheckUtils]: 540: Hoare triple {27258#(< ~counter~0 48)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,865 INFO L290 TraceCheckUtils]: 539: Hoare triple {27258#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {27258#(< ~counter~0 48)} is VALID [2022-04-14 15:17:23,866 INFO L290 TraceCheckUtils]: 538: Hoare triple {27343#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27258#(< ~counter~0 48)} is VALID [2022-04-14 15:17:23,866 INFO L290 TraceCheckUtils]: 537: Hoare triple {27343#(< ~counter~0 47)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27343#(< ~counter~0 47)} is VALID [2022-04-14 15:17:23,867 INFO L284 TraceCheckUtils]: 536: Hoare quadruple {25132#true} {27343#(< ~counter~0 47)} #67#return; {27343#(< ~counter~0 47)} is VALID [2022-04-14 15:17:23,867 INFO L290 TraceCheckUtils]: 535: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,867 INFO L290 TraceCheckUtils]: 534: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,867 INFO L290 TraceCheckUtils]: 533: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,867 INFO L272 TraceCheckUtils]: 532: Hoare triple {27343#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,868 INFO L284 TraceCheckUtils]: 531: Hoare quadruple {25132#true} {27343#(< ~counter~0 47)} #65#return; {27343#(< ~counter~0 47)} is VALID [2022-04-14 15:17:23,868 INFO L290 TraceCheckUtils]: 530: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,868 INFO L290 TraceCheckUtils]: 529: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,868 INFO L290 TraceCheckUtils]: 528: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,868 INFO L272 TraceCheckUtils]: 527: Hoare triple {27343#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,868 INFO L284 TraceCheckUtils]: 526: Hoare quadruple {25132#true} {27343#(< ~counter~0 47)} #63#return; {27343#(< ~counter~0 47)} is VALID [2022-04-14 15:17:23,868 INFO L290 TraceCheckUtils]: 525: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,869 INFO L290 TraceCheckUtils]: 524: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,869 INFO L290 TraceCheckUtils]: 523: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,869 INFO L272 TraceCheckUtils]: 522: Hoare triple {27343#(< ~counter~0 47)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,869 INFO L284 TraceCheckUtils]: 521: Hoare quadruple {25132#true} {27343#(< ~counter~0 47)} #61#return; {27343#(< ~counter~0 47)} is VALID [2022-04-14 15:17:23,869 INFO L290 TraceCheckUtils]: 520: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,869 INFO L290 TraceCheckUtils]: 519: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,869 INFO L290 TraceCheckUtils]: 518: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,870 INFO L272 TraceCheckUtils]: 517: Hoare triple {27343#(< ~counter~0 47)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,870 INFO L284 TraceCheckUtils]: 516: Hoare quadruple {25132#true} {27343#(< ~counter~0 47)} #59#return; {27343#(< ~counter~0 47)} is VALID [2022-04-14 15:17:23,870 INFO L290 TraceCheckUtils]: 515: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,870 INFO L290 TraceCheckUtils]: 514: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,870 INFO L290 TraceCheckUtils]: 513: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,870 INFO L272 TraceCheckUtils]: 512: Hoare triple {27343#(< ~counter~0 47)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,871 INFO L290 TraceCheckUtils]: 511: Hoare triple {27343#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {27343#(< ~counter~0 47)} is VALID [2022-04-14 15:17:23,871 INFO L290 TraceCheckUtils]: 510: Hoare triple {27428#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27343#(< ~counter~0 47)} is VALID [2022-04-14 15:17:23,872 INFO L290 TraceCheckUtils]: 509: Hoare triple {27428#(< ~counter~0 46)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27428#(< ~counter~0 46)} is VALID [2022-04-14 15:17:23,872 INFO L284 TraceCheckUtils]: 508: Hoare quadruple {25132#true} {27428#(< ~counter~0 46)} #67#return; {27428#(< ~counter~0 46)} is VALID [2022-04-14 15:17:23,872 INFO L290 TraceCheckUtils]: 507: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,872 INFO L290 TraceCheckUtils]: 506: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,872 INFO L290 TraceCheckUtils]: 505: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,873 INFO L272 TraceCheckUtils]: 504: Hoare triple {27428#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,873 INFO L284 TraceCheckUtils]: 503: Hoare quadruple {25132#true} {27428#(< ~counter~0 46)} #65#return; {27428#(< ~counter~0 46)} is VALID [2022-04-14 15:17:23,873 INFO L290 TraceCheckUtils]: 502: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,873 INFO L290 TraceCheckUtils]: 501: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,873 INFO L290 TraceCheckUtils]: 500: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,873 INFO L272 TraceCheckUtils]: 499: Hoare triple {27428#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,874 INFO L284 TraceCheckUtils]: 498: Hoare quadruple {25132#true} {27428#(< ~counter~0 46)} #63#return; {27428#(< ~counter~0 46)} is VALID [2022-04-14 15:17:23,874 INFO L290 TraceCheckUtils]: 497: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,874 INFO L290 TraceCheckUtils]: 496: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,874 INFO L290 TraceCheckUtils]: 495: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,874 INFO L272 TraceCheckUtils]: 494: Hoare triple {27428#(< ~counter~0 46)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,875 INFO L284 TraceCheckUtils]: 493: Hoare quadruple {25132#true} {27428#(< ~counter~0 46)} #61#return; {27428#(< ~counter~0 46)} is VALID [2022-04-14 15:17:23,875 INFO L290 TraceCheckUtils]: 492: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,875 INFO L290 TraceCheckUtils]: 491: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,875 INFO L290 TraceCheckUtils]: 490: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,875 INFO L272 TraceCheckUtils]: 489: Hoare triple {27428#(< ~counter~0 46)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,876 INFO L284 TraceCheckUtils]: 488: Hoare quadruple {25132#true} {27428#(< ~counter~0 46)} #59#return; {27428#(< ~counter~0 46)} is VALID [2022-04-14 15:17:23,876 INFO L290 TraceCheckUtils]: 487: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,876 INFO L290 TraceCheckUtils]: 486: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,876 INFO L290 TraceCheckUtils]: 485: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,876 INFO L272 TraceCheckUtils]: 484: Hoare triple {27428#(< ~counter~0 46)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,876 INFO L290 TraceCheckUtils]: 483: Hoare triple {27428#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {27428#(< ~counter~0 46)} is VALID [2022-04-14 15:17:23,877 INFO L290 TraceCheckUtils]: 482: Hoare triple {27513#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27428#(< ~counter~0 46)} is VALID [2022-04-14 15:17:23,877 INFO L290 TraceCheckUtils]: 481: Hoare triple {27513#(< ~counter~0 45)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27513#(< ~counter~0 45)} is VALID [2022-04-14 15:17:23,878 INFO L284 TraceCheckUtils]: 480: Hoare quadruple {25132#true} {27513#(< ~counter~0 45)} #67#return; {27513#(< ~counter~0 45)} is VALID [2022-04-14 15:17:23,878 INFO L290 TraceCheckUtils]: 479: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,878 INFO L290 TraceCheckUtils]: 478: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,878 INFO L290 TraceCheckUtils]: 477: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,878 INFO L272 TraceCheckUtils]: 476: Hoare triple {27513#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,879 INFO L284 TraceCheckUtils]: 475: Hoare quadruple {25132#true} {27513#(< ~counter~0 45)} #65#return; {27513#(< ~counter~0 45)} is VALID [2022-04-14 15:17:23,879 INFO L290 TraceCheckUtils]: 474: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,879 INFO L290 TraceCheckUtils]: 473: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,879 INFO L290 TraceCheckUtils]: 472: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,879 INFO L272 TraceCheckUtils]: 471: Hoare triple {27513#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,880 INFO L284 TraceCheckUtils]: 470: Hoare quadruple {25132#true} {27513#(< ~counter~0 45)} #63#return; {27513#(< ~counter~0 45)} is VALID [2022-04-14 15:17:23,880 INFO L290 TraceCheckUtils]: 469: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,880 INFO L290 TraceCheckUtils]: 468: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,880 INFO L290 TraceCheckUtils]: 467: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,880 INFO L272 TraceCheckUtils]: 466: Hoare triple {27513#(< ~counter~0 45)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,880 INFO L284 TraceCheckUtils]: 465: Hoare quadruple {25132#true} {27513#(< ~counter~0 45)} #61#return; {27513#(< ~counter~0 45)} is VALID [2022-04-14 15:17:23,881 INFO L290 TraceCheckUtils]: 464: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,881 INFO L290 TraceCheckUtils]: 463: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,881 INFO L290 TraceCheckUtils]: 462: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,881 INFO L272 TraceCheckUtils]: 461: Hoare triple {27513#(< ~counter~0 45)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,881 INFO L284 TraceCheckUtils]: 460: Hoare quadruple {25132#true} {27513#(< ~counter~0 45)} #59#return; {27513#(< ~counter~0 45)} is VALID [2022-04-14 15:17:23,881 INFO L290 TraceCheckUtils]: 459: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,882 INFO L290 TraceCheckUtils]: 458: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,882 INFO L290 TraceCheckUtils]: 457: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,882 INFO L272 TraceCheckUtils]: 456: Hoare triple {27513#(< ~counter~0 45)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,882 INFO L290 TraceCheckUtils]: 455: Hoare triple {27513#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {27513#(< ~counter~0 45)} is VALID [2022-04-14 15:17:23,883 INFO L290 TraceCheckUtils]: 454: Hoare triple {27598#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27513#(< ~counter~0 45)} is VALID [2022-04-14 15:17:23,883 INFO L290 TraceCheckUtils]: 453: Hoare triple {27598#(< ~counter~0 44)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27598#(< ~counter~0 44)} is VALID [2022-04-14 15:17:23,884 INFO L284 TraceCheckUtils]: 452: Hoare quadruple {25132#true} {27598#(< ~counter~0 44)} #67#return; {27598#(< ~counter~0 44)} is VALID [2022-04-14 15:17:23,884 INFO L290 TraceCheckUtils]: 451: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,884 INFO L290 TraceCheckUtils]: 450: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,884 INFO L290 TraceCheckUtils]: 449: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,884 INFO L272 TraceCheckUtils]: 448: Hoare triple {27598#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,885 INFO L284 TraceCheckUtils]: 447: Hoare quadruple {25132#true} {27598#(< ~counter~0 44)} #65#return; {27598#(< ~counter~0 44)} is VALID [2022-04-14 15:17:23,885 INFO L290 TraceCheckUtils]: 446: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,885 INFO L290 TraceCheckUtils]: 445: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,885 INFO L290 TraceCheckUtils]: 444: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,885 INFO L272 TraceCheckUtils]: 443: Hoare triple {27598#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,886 INFO L284 TraceCheckUtils]: 442: Hoare quadruple {25132#true} {27598#(< ~counter~0 44)} #63#return; {27598#(< ~counter~0 44)} is VALID [2022-04-14 15:17:23,886 INFO L290 TraceCheckUtils]: 441: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,886 INFO L290 TraceCheckUtils]: 440: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,886 INFO L290 TraceCheckUtils]: 439: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,886 INFO L272 TraceCheckUtils]: 438: Hoare triple {27598#(< ~counter~0 44)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,887 INFO L284 TraceCheckUtils]: 437: Hoare quadruple {25132#true} {27598#(< ~counter~0 44)} #61#return; {27598#(< ~counter~0 44)} is VALID [2022-04-14 15:17:23,887 INFO L290 TraceCheckUtils]: 436: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,887 INFO L290 TraceCheckUtils]: 435: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,887 INFO L290 TraceCheckUtils]: 434: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,887 INFO L272 TraceCheckUtils]: 433: Hoare triple {27598#(< ~counter~0 44)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,887 INFO L284 TraceCheckUtils]: 432: Hoare quadruple {25132#true} {27598#(< ~counter~0 44)} #59#return; {27598#(< ~counter~0 44)} is VALID [2022-04-14 15:17:23,888 INFO L290 TraceCheckUtils]: 431: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,888 INFO L290 TraceCheckUtils]: 430: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,888 INFO L290 TraceCheckUtils]: 429: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,888 INFO L272 TraceCheckUtils]: 428: Hoare triple {27598#(< ~counter~0 44)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,888 INFO L290 TraceCheckUtils]: 427: Hoare triple {27598#(< ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {27598#(< ~counter~0 44)} is VALID [2022-04-14 15:17:23,889 INFO L290 TraceCheckUtils]: 426: Hoare triple {27683#(< ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27598#(< ~counter~0 44)} is VALID [2022-04-14 15:17:23,889 INFO L290 TraceCheckUtils]: 425: Hoare triple {27683#(< ~counter~0 43)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27683#(< ~counter~0 43)} is VALID [2022-04-14 15:17:23,890 INFO L284 TraceCheckUtils]: 424: Hoare quadruple {25132#true} {27683#(< ~counter~0 43)} #67#return; {27683#(< ~counter~0 43)} is VALID [2022-04-14 15:17:23,890 INFO L290 TraceCheckUtils]: 423: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,890 INFO L290 TraceCheckUtils]: 422: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,890 INFO L290 TraceCheckUtils]: 421: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,890 INFO L272 TraceCheckUtils]: 420: Hoare triple {27683#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,890 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {25132#true} {27683#(< ~counter~0 43)} #65#return; {27683#(< ~counter~0 43)} is VALID [2022-04-14 15:17:23,891 INFO L290 TraceCheckUtils]: 418: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,891 INFO L290 TraceCheckUtils]: 417: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,891 INFO L290 TraceCheckUtils]: 416: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,891 INFO L272 TraceCheckUtils]: 415: Hoare triple {27683#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,891 INFO L284 TraceCheckUtils]: 414: Hoare quadruple {25132#true} {27683#(< ~counter~0 43)} #63#return; {27683#(< ~counter~0 43)} is VALID [2022-04-14 15:17:23,891 INFO L290 TraceCheckUtils]: 413: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,892 INFO L290 TraceCheckUtils]: 412: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,892 INFO L290 TraceCheckUtils]: 411: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,892 INFO L272 TraceCheckUtils]: 410: Hoare triple {27683#(< ~counter~0 43)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,892 INFO L284 TraceCheckUtils]: 409: Hoare quadruple {25132#true} {27683#(< ~counter~0 43)} #61#return; {27683#(< ~counter~0 43)} is VALID [2022-04-14 15:17:23,892 INFO L290 TraceCheckUtils]: 408: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,892 INFO L290 TraceCheckUtils]: 407: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,892 INFO L290 TraceCheckUtils]: 406: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,893 INFO L272 TraceCheckUtils]: 405: Hoare triple {27683#(< ~counter~0 43)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,893 INFO L284 TraceCheckUtils]: 404: Hoare quadruple {25132#true} {27683#(< ~counter~0 43)} #59#return; {27683#(< ~counter~0 43)} is VALID [2022-04-14 15:17:23,893 INFO L290 TraceCheckUtils]: 403: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,893 INFO L290 TraceCheckUtils]: 402: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,893 INFO L290 TraceCheckUtils]: 401: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,893 INFO L272 TraceCheckUtils]: 400: Hoare triple {27683#(< ~counter~0 43)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,894 INFO L290 TraceCheckUtils]: 399: Hoare triple {27683#(< ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {27683#(< ~counter~0 43)} is VALID [2022-04-14 15:17:23,894 INFO L290 TraceCheckUtils]: 398: Hoare triple {27768#(< ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27683#(< ~counter~0 43)} is VALID [2022-04-14 15:17:23,895 INFO L290 TraceCheckUtils]: 397: Hoare triple {27768#(< ~counter~0 42)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27768#(< ~counter~0 42)} is VALID [2022-04-14 15:17:23,895 INFO L284 TraceCheckUtils]: 396: Hoare quadruple {25132#true} {27768#(< ~counter~0 42)} #67#return; {27768#(< ~counter~0 42)} is VALID [2022-04-14 15:17:23,895 INFO L290 TraceCheckUtils]: 395: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,895 INFO L290 TraceCheckUtils]: 394: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,895 INFO L290 TraceCheckUtils]: 393: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,896 INFO L272 TraceCheckUtils]: 392: Hoare triple {27768#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,896 INFO L284 TraceCheckUtils]: 391: Hoare quadruple {25132#true} {27768#(< ~counter~0 42)} #65#return; {27768#(< ~counter~0 42)} is VALID [2022-04-14 15:17:23,896 INFO L290 TraceCheckUtils]: 390: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,896 INFO L290 TraceCheckUtils]: 389: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,896 INFO L290 TraceCheckUtils]: 388: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,897 INFO L272 TraceCheckUtils]: 387: Hoare triple {27768#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,897 INFO L284 TraceCheckUtils]: 386: Hoare quadruple {25132#true} {27768#(< ~counter~0 42)} #63#return; {27768#(< ~counter~0 42)} is VALID [2022-04-14 15:17:23,897 INFO L290 TraceCheckUtils]: 385: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,897 INFO L290 TraceCheckUtils]: 384: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,897 INFO L290 TraceCheckUtils]: 383: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,897 INFO L272 TraceCheckUtils]: 382: Hoare triple {27768#(< ~counter~0 42)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,898 INFO L284 TraceCheckUtils]: 381: Hoare quadruple {25132#true} {27768#(< ~counter~0 42)} #61#return; {27768#(< ~counter~0 42)} is VALID [2022-04-14 15:17:23,898 INFO L290 TraceCheckUtils]: 380: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,898 INFO L290 TraceCheckUtils]: 379: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,898 INFO L290 TraceCheckUtils]: 378: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,898 INFO L272 TraceCheckUtils]: 377: Hoare triple {27768#(< ~counter~0 42)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,899 INFO L284 TraceCheckUtils]: 376: Hoare quadruple {25132#true} {27768#(< ~counter~0 42)} #59#return; {27768#(< ~counter~0 42)} is VALID [2022-04-14 15:17:23,899 INFO L290 TraceCheckUtils]: 375: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,899 INFO L290 TraceCheckUtils]: 374: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,899 INFO L290 TraceCheckUtils]: 373: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,899 INFO L272 TraceCheckUtils]: 372: Hoare triple {27768#(< ~counter~0 42)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,899 INFO L290 TraceCheckUtils]: 371: Hoare triple {27768#(< ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {27768#(< ~counter~0 42)} is VALID [2022-04-14 15:17:23,900 INFO L290 TraceCheckUtils]: 370: Hoare triple {27853#(< ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27768#(< ~counter~0 42)} is VALID [2022-04-14 15:17:23,900 INFO L290 TraceCheckUtils]: 369: Hoare triple {27853#(< ~counter~0 41)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27853#(< ~counter~0 41)} is VALID [2022-04-14 15:17:23,901 INFO L284 TraceCheckUtils]: 368: Hoare quadruple {25132#true} {27853#(< ~counter~0 41)} #67#return; {27853#(< ~counter~0 41)} is VALID [2022-04-14 15:17:23,901 INFO L290 TraceCheckUtils]: 367: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,901 INFO L290 TraceCheckUtils]: 366: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,901 INFO L290 TraceCheckUtils]: 365: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,901 INFO L272 TraceCheckUtils]: 364: Hoare triple {27853#(< ~counter~0 41)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,902 INFO L284 TraceCheckUtils]: 363: Hoare quadruple {25132#true} {27853#(< ~counter~0 41)} #65#return; {27853#(< ~counter~0 41)} is VALID [2022-04-14 15:17:23,902 INFO L290 TraceCheckUtils]: 362: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,902 INFO L290 TraceCheckUtils]: 361: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,902 INFO L290 TraceCheckUtils]: 360: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,902 INFO L272 TraceCheckUtils]: 359: Hoare triple {27853#(< ~counter~0 41)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,902 INFO L284 TraceCheckUtils]: 358: Hoare quadruple {25132#true} {27853#(< ~counter~0 41)} #63#return; {27853#(< ~counter~0 41)} is VALID [2022-04-14 15:17:23,902 INFO L290 TraceCheckUtils]: 357: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,903 INFO L290 TraceCheckUtils]: 356: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,903 INFO L290 TraceCheckUtils]: 355: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,903 INFO L272 TraceCheckUtils]: 354: Hoare triple {27853#(< ~counter~0 41)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,903 INFO L284 TraceCheckUtils]: 353: Hoare quadruple {25132#true} {27853#(< ~counter~0 41)} #61#return; {27853#(< ~counter~0 41)} is VALID [2022-04-14 15:17:23,903 INFO L290 TraceCheckUtils]: 352: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,903 INFO L290 TraceCheckUtils]: 351: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,903 INFO L290 TraceCheckUtils]: 350: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,904 INFO L272 TraceCheckUtils]: 349: Hoare triple {27853#(< ~counter~0 41)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,904 INFO L284 TraceCheckUtils]: 348: Hoare quadruple {25132#true} {27853#(< ~counter~0 41)} #59#return; {27853#(< ~counter~0 41)} is VALID [2022-04-14 15:17:23,904 INFO L290 TraceCheckUtils]: 347: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,904 INFO L290 TraceCheckUtils]: 346: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,904 INFO L290 TraceCheckUtils]: 345: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,904 INFO L272 TraceCheckUtils]: 344: Hoare triple {27853#(< ~counter~0 41)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,905 INFO L290 TraceCheckUtils]: 343: Hoare triple {27853#(< ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {27853#(< ~counter~0 41)} is VALID [2022-04-14 15:17:23,905 INFO L290 TraceCheckUtils]: 342: Hoare triple {27938#(< ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27853#(< ~counter~0 41)} is VALID [2022-04-14 15:17:23,906 INFO L290 TraceCheckUtils]: 341: Hoare triple {27938#(< ~counter~0 40)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27938#(< ~counter~0 40)} is VALID [2022-04-14 15:17:23,906 INFO L284 TraceCheckUtils]: 340: Hoare quadruple {25132#true} {27938#(< ~counter~0 40)} #67#return; {27938#(< ~counter~0 40)} is VALID [2022-04-14 15:17:23,906 INFO L290 TraceCheckUtils]: 339: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,906 INFO L290 TraceCheckUtils]: 338: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,906 INFO L290 TraceCheckUtils]: 337: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,906 INFO L272 TraceCheckUtils]: 336: Hoare triple {27938#(< ~counter~0 40)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,907 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {25132#true} {27938#(< ~counter~0 40)} #65#return; {27938#(< ~counter~0 40)} is VALID [2022-04-14 15:17:23,907 INFO L290 TraceCheckUtils]: 334: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,907 INFO L290 TraceCheckUtils]: 333: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,907 INFO L290 TraceCheckUtils]: 332: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,907 INFO L272 TraceCheckUtils]: 331: Hoare triple {27938#(< ~counter~0 40)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,908 INFO L284 TraceCheckUtils]: 330: Hoare quadruple {25132#true} {27938#(< ~counter~0 40)} #63#return; {27938#(< ~counter~0 40)} is VALID [2022-04-14 15:17:23,908 INFO L290 TraceCheckUtils]: 329: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,908 INFO L290 TraceCheckUtils]: 328: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,908 INFO L290 TraceCheckUtils]: 327: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,908 INFO L272 TraceCheckUtils]: 326: Hoare triple {27938#(< ~counter~0 40)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,909 INFO L284 TraceCheckUtils]: 325: Hoare quadruple {25132#true} {27938#(< ~counter~0 40)} #61#return; {27938#(< ~counter~0 40)} is VALID [2022-04-14 15:17:23,909 INFO L290 TraceCheckUtils]: 324: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,909 INFO L290 TraceCheckUtils]: 323: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,909 INFO L290 TraceCheckUtils]: 322: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,909 INFO L272 TraceCheckUtils]: 321: Hoare triple {27938#(< ~counter~0 40)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,909 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {25132#true} {27938#(< ~counter~0 40)} #59#return; {27938#(< ~counter~0 40)} is VALID [2022-04-14 15:17:23,909 INFO L290 TraceCheckUtils]: 319: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,909 INFO L290 TraceCheckUtils]: 318: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,910 INFO L290 TraceCheckUtils]: 317: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,910 INFO L272 TraceCheckUtils]: 316: Hoare triple {27938#(< ~counter~0 40)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,910 INFO L290 TraceCheckUtils]: 315: Hoare triple {27938#(< ~counter~0 40)} assume !!(#t~post5 < 50);havoc #t~post5; {27938#(< ~counter~0 40)} is VALID [2022-04-14 15:17:23,911 INFO L290 TraceCheckUtils]: 314: Hoare triple {28023#(< ~counter~0 39)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27938#(< ~counter~0 40)} is VALID [2022-04-14 15:17:23,911 INFO L290 TraceCheckUtils]: 313: Hoare triple {28023#(< ~counter~0 39)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28023#(< ~counter~0 39)} is VALID [2022-04-14 15:17:23,911 INFO L284 TraceCheckUtils]: 312: Hoare quadruple {25132#true} {28023#(< ~counter~0 39)} #67#return; {28023#(< ~counter~0 39)} is VALID [2022-04-14 15:17:23,911 INFO L290 TraceCheckUtils]: 311: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,912 INFO L290 TraceCheckUtils]: 310: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,912 INFO L290 TraceCheckUtils]: 309: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,912 INFO L272 TraceCheckUtils]: 308: Hoare triple {28023#(< ~counter~0 39)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,912 INFO L284 TraceCheckUtils]: 307: Hoare quadruple {25132#true} {28023#(< ~counter~0 39)} #65#return; {28023#(< ~counter~0 39)} is VALID [2022-04-14 15:17:23,912 INFO L290 TraceCheckUtils]: 306: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,912 INFO L290 TraceCheckUtils]: 305: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,912 INFO L290 TraceCheckUtils]: 304: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,913 INFO L272 TraceCheckUtils]: 303: Hoare triple {28023#(< ~counter~0 39)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,913 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {25132#true} {28023#(< ~counter~0 39)} #63#return; {28023#(< ~counter~0 39)} is VALID [2022-04-14 15:17:23,913 INFO L290 TraceCheckUtils]: 301: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,913 INFO L290 TraceCheckUtils]: 300: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,913 INFO L290 TraceCheckUtils]: 299: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,913 INFO L272 TraceCheckUtils]: 298: Hoare triple {28023#(< ~counter~0 39)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,914 INFO L284 TraceCheckUtils]: 297: Hoare quadruple {25132#true} {28023#(< ~counter~0 39)} #61#return; {28023#(< ~counter~0 39)} is VALID [2022-04-14 15:17:23,914 INFO L290 TraceCheckUtils]: 296: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,914 INFO L290 TraceCheckUtils]: 295: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,914 INFO L290 TraceCheckUtils]: 294: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,914 INFO L272 TraceCheckUtils]: 293: Hoare triple {28023#(< ~counter~0 39)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,914 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {25132#true} {28023#(< ~counter~0 39)} #59#return; {28023#(< ~counter~0 39)} is VALID [2022-04-14 15:17:23,914 INFO L290 TraceCheckUtils]: 291: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,914 INFO L290 TraceCheckUtils]: 290: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,914 INFO L290 TraceCheckUtils]: 289: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,914 INFO L272 TraceCheckUtils]: 288: Hoare triple {28023#(< ~counter~0 39)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,915 INFO L290 TraceCheckUtils]: 287: Hoare triple {28023#(< ~counter~0 39)} assume !!(#t~post5 < 50);havoc #t~post5; {28023#(< ~counter~0 39)} is VALID [2022-04-14 15:17:23,915 INFO L290 TraceCheckUtils]: 286: Hoare triple {28108#(< ~counter~0 38)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28023#(< ~counter~0 39)} is VALID [2022-04-14 15:17:23,916 INFO L290 TraceCheckUtils]: 285: Hoare triple {28108#(< ~counter~0 38)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28108#(< ~counter~0 38)} is VALID [2022-04-14 15:17:23,916 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {25132#true} {28108#(< ~counter~0 38)} #67#return; {28108#(< ~counter~0 38)} is VALID [2022-04-14 15:17:23,916 INFO L290 TraceCheckUtils]: 283: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,916 INFO L290 TraceCheckUtils]: 282: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,916 INFO L290 TraceCheckUtils]: 281: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,916 INFO L272 TraceCheckUtils]: 280: Hoare triple {28108#(< ~counter~0 38)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,917 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {25132#true} {28108#(< ~counter~0 38)} #65#return; {28108#(< ~counter~0 38)} is VALID [2022-04-14 15:17:23,917 INFO L290 TraceCheckUtils]: 278: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,917 INFO L290 TraceCheckUtils]: 277: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,917 INFO L290 TraceCheckUtils]: 276: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,917 INFO L272 TraceCheckUtils]: 275: Hoare triple {28108#(< ~counter~0 38)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,917 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {25132#true} {28108#(< ~counter~0 38)} #63#return; {28108#(< ~counter~0 38)} is VALID [2022-04-14 15:17:23,917 INFO L290 TraceCheckUtils]: 273: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,917 INFO L290 TraceCheckUtils]: 272: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,917 INFO L290 TraceCheckUtils]: 271: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,917 INFO L272 TraceCheckUtils]: 270: Hoare triple {28108#(< ~counter~0 38)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,918 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {25132#true} {28108#(< ~counter~0 38)} #61#return; {28108#(< ~counter~0 38)} is VALID [2022-04-14 15:17:23,918 INFO L290 TraceCheckUtils]: 268: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,918 INFO L290 TraceCheckUtils]: 267: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,918 INFO L290 TraceCheckUtils]: 266: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,918 INFO L272 TraceCheckUtils]: 265: Hoare triple {28108#(< ~counter~0 38)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,919 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {25132#true} {28108#(< ~counter~0 38)} #59#return; {28108#(< ~counter~0 38)} is VALID [2022-04-14 15:17:23,919 INFO L290 TraceCheckUtils]: 263: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,919 INFO L290 TraceCheckUtils]: 262: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,919 INFO L290 TraceCheckUtils]: 261: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,919 INFO L272 TraceCheckUtils]: 260: Hoare triple {28108#(< ~counter~0 38)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,919 INFO L290 TraceCheckUtils]: 259: Hoare triple {28108#(< ~counter~0 38)} assume !!(#t~post5 < 50);havoc #t~post5; {28108#(< ~counter~0 38)} is VALID [2022-04-14 15:17:23,920 INFO L290 TraceCheckUtils]: 258: Hoare triple {28193#(< ~counter~0 37)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28108#(< ~counter~0 38)} is VALID [2022-04-14 15:17:23,920 INFO L290 TraceCheckUtils]: 257: Hoare triple {28193#(< ~counter~0 37)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28193#(< ~counter~0 37)} is VALID [2022-04-14 15:17:23,920 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {25132#true} {28193#(< ~counter~0 37)} #67#return; {28193#(< ~counter~0 37)} is VALID [2022-04-14 15:17:23,920 INFO L290 TraceCheckUtils]: 255: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,921 INFO L290 TraceCheckUtils]: 254: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,921 INFO L290 TraceCheckUtils]: 253: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,921 INFO L272 TraceCheckUtils]: 252: Hoare triple {28193#(< ~counter~0 37)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,921 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {25132#true} {28193#(< ~counter~0 37)} #65#return; {28193#(< ~counter~0 37)} is VALID [2022-04-14 15:17:23,921 INFO L290 TraceCheckUtils]: 250: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,921 INFO L290 TraceCheckUtils]: 249: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,921 INFO L290 TraceCheckUtils]: 248: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,921 INFO L272 TraceCheckUtils]: 247: Hoare triple {28193#(< ~counter~0 37)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,922 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {25132#true} {28193#(< ~counter~0 37)} #63#return; {28193#(< ~counter~0 37)} is VALID [2022-04-14 15:17:23,922 INFO L290 TraceCheckUtils]: 245: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,922 INFO L290 TraceCheckUtils]: 244: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,922 INFO L290 TraceCheckUtils]: 243: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,922 INFO L272 TraceCheckUtils]: 242: Hoare triple {28193#(< ~counter~0 37)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,922 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {25132#true} {28193#(< ~counter~0 37)} #61#return; {28193#(< ~counter~0 37)} is VALID [2022-04-14 15:17:23,922 INFO L290 TraceCheckUtils]: 240: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,922 INFO L290 TraceCheckUtils]: 239: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,923 INFO L290 TraceCheckUtils]: 238: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,923 INFO L272 TraceCheckUtils]: 237: Hoare triple {28193#(< ~counter~0 37)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,923 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {25132#true} {28193#(< ~counter~0 37)} #59#return; {28193#(< ~counter~0 37)} is VALID [2022-04-14 15:17:23,923 INFO L290 TraceCheckUtils]: 235: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,923 INFO L290 TraceCheckUtils]: 234: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,923 INFO L290 TraceCheckUtils]: 233: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,923 INFO L272 TraceCheckUtils]: 232: Hoare triple {28193#(< ~counter~0 37)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,923 INFO L290 TraceCheckUtils]: 231: Hoare triple {28193#(< ~counter~0 37)} assume !!(#t~post5 < 50);havoc #t~post5; {28193#(< ~counter~0 37)} is VALID [2022-04-14 15:17:23,924 INFO L290 TraceCheckUtils]: 230: Hoare triple {28278#(< ~counter~0 36)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28193#(< ~counter~0 37)} is VALID [2022-04-14 15:17:23,924 INFO L290 TraceCheckUtils]: 229: Hoare triple {28278#(< ~counter~0 36)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28278#(< ~counter~0 36)} is VALID [2022-04-14 15:17:23,925 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {25132#true} {28278#(< ~counter~0 36)} #67#return; {28278#(< ~counter~0 36)} is VALID [2022-04-14 15:17:23,925 INFO L290 TraceCheckUtils]: 227: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,925 INFO L290 TraceCheckUtils]: 226: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,925 INFO L290 TraceCheckUtils]: 225: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,925 INFO L272 TraceCheckUtils]: 224: Hoare triple {28278#(< ~counter~0 36)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,925 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {25132#true} {28278#(< ~counter~0 36)} #65#return; {28278#(< ~counter~0 36)} is VALID [2022-04-14 15:17:23,925 INFO L290 TraceCheckUtils]: 222: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,925 INFO L290 TraceCheckUtils]: 221: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,926 INFO L290 TraceCheckUtils]: 220: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,926 INFO L272 TraceCheckUtils]: 219: Hoare triple {28278#(< ~counter~0 36)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,926 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {25132#true} {28278#(< ~counter~0 36)} #63#return; {28278#(< ~counter~0 36)} is VALID [2022-04-14 15:17:23,926 INFO L290 TraceCheckUtils]: 217: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,926 INFO L290 TraceCheckUtils]: 216: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,926 INFO L290 TraceCheckUtils]: 215: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,926 INFO L272 TraceCheckUtils]: 214: Hoare triple {28278#(< ~counter~0 36)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,927 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {25132#true} {28278#(< ~counter~0 36)} #61#return; {28278#(< ~counter~0 36)} is VALID [2022-04-14 15:17:23,927 INFO L290 TraceCheckUtils]: 212: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,927 INFO L290 TraceCheckUtils]: 211: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,927 INFO L290 TraceCheckUtils]: 210: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,927 INFO L272 TraceCheckUtils]: 209: Hoare triple {28278#(< ~counter~0 36)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,927 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {25132#true} {28278#(< ~counter~0 36)} #59#return; {28278#(< ~counter~0 36)} is VALID [2022-04-14 15:17:23,927 INFO L290 TraceCheckUtils]: 207: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,927 INFO L290 TraceCheckUtils]: 206: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,927 INFO L290 TraceCheckUtils]: 205: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,928 INFO L272 TraceCheckUtils]: 204: Hoare triple {28278#(< ~counter~0 36)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,928 INFO L290 TraceCheckUtils]: 203: Hoare triple {28278#(< ~counter~0 36)} assume !!(#t~post5 < 50);havoc #t~post5; {28278#(< ~counter~0 36)} is VALID [2022-04-14 15:17:23,928 INFO L290 TraceCheckUtils]: 202: Hoare triple {28363#(< ~counter~0 35)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28278#(< ~counter~0 36)} is VALID [2022-04-14 15:17:23,929 INFO L290 TraceCheckUtils]: 201: Hoare triple {28363#(< ~counter~0 35)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28363#(< ~counter~0 35)} is VALID [2022-04-14 15:17:23,929 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {25132#true} {28363#(< ~counter~0 35)} #67#return; {28363#(< ~counter~0 35)} is VALID [2022-04-14 15:17:23,929 INFO L290 TraceCheckUtils]: 199: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,929 INFO L290 TraceCheckUtils]: 198: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,929 INFO L290 TraceCheckUtils]: 197: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,929 INFO L272 TraceCheckUtils]: 196: Hoare triple {28363#(< ~counter~0 35)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,930 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {25132#true} {28363#(< ~counter~0 35)} #65#return; {28363#(< ~counter~0 35)} is VALID [2022-04-14 15:17:23,930 INFO L290 TraceCheckUtils]: 194: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,930 INFO L290 TraceCheckUtils]: 193: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,930 INFO L290 TraceCheckUtils]: 192: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,930 INFO L272 TraceCheckUtils]: 191: Hoare triple {28363#(< ~counter~0 35)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,930 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {25132#true} {28363#(< ~counter~0 35)} #63#return; {28363#(< ~counter~0 35)} is VALID [2022-04-14 15:17:23,930 INFO L290 TraceCheckUtils]: 189: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,930 INFO L290 TraceCheckUtils]: 188: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,931 INFO L290 TraceCheckUtils]: 187: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,931 INFO L272 TraceCheckUtils]: 186: Hoare triple {28363#(< ~counter~0 35)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,931 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {25132#true} {28363#(< ~counter~0 35)} #61#return; {28363#(< ~counter~0 35)} is VALID [2022-04-14 15:17:23,931 INFO L290 TraceCheckUtils]: 184: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,931 INFO L290 TraceCheckUtils]: 183: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,931 INFO L290 TraceCheckUtils]: 182: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,931 INFO L272 TraceCheckUtils]: 181: Hoare triple {28363#(< ~counter~0 35)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,932 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {25132#true} {28363#(< ~counter~0 35)} #59#return; {28363#(< ~counter~0 35)} is VALID [2022-04-14 15:17:23,932 INFO L290 TraceCheckUtils]: 179: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,932 INFO L290 TraceCheckUtils]: 178: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,932 INFO L290 TraceCheckUtils]: 177: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,932 INFO L272 TraceCheckUtils]: 176: Hoare triple {28363#(< ~counter~0 35)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,932 INFO L290 TraceCheckUtils]: 175: Hoare triple {28363#(< ~counter~0 35)} assume !!(#t~post5 < 50);havoc #t~post5; {28363#(< ~counter~0 35)} is VALID [2022-04-14 15:17:23,933 INFO L290 TraceCheckUtils]: 174: Hoare triple {28448#(< ~counter~0 34)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28363#(< ~counter~0 35)} is VALID [2022-04-14 15:17:23,933 INFO L290 TraceCheckUtils]: 173: Hoare triple {28448#(< ~counter~0 34)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28448#(< ~counter~0 34)} is VALID [2022-04-14 15:17:23,933 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25132#true} {28448#(< ~counter~0 34)} #67#return; {28448#(< ~counter~0 34)} is VALID [2022-04-14 15:17:23,933 INFO L290 TraceCheckUtils]: 171: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,933 INFO L290 TraceCheckUtils]: 170: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,934 INFO L290 TraceCheckUtils]: 169: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,934 INFO L272 TraceCheckUtils]: 168: Hoare triple {28448#(< ~counter~0 34)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,934 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {25132#true} {28448#(< ~counter~0 34)} #65#return; {28448#(< ~counter~0 34)} is VALID [2022-04-14 15:17:23,934 INFO L290 TraceCheckUtils]: 166: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,934 INFO L290 TraceCheckUtils]: 165: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,934 INFO L290 TraceCheckUtils]: 164: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,934 INFO L272 TraceCheckUtils]: 163: Hoare triple {28448#(< ~counter~0 34)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,935 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {25132#true} {28448#(< ~counter~0 34)} #63#return; {28448#(< ~counter~0 34)} is VALID [2022-04-14 15:17:23,935 INFO L290 TraceCheckUtils]: 161: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,935 INFO L290 TraceCheckUtils]: 160: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,935 INFO L290 TraceCheckUtils]: 159: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,935 INFO L272 TraceCheckUtils]: 158: Hoare triple {28448#(< ~counter~0 34)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,935 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25132#true} {28448#(< ~counter~0 34)} #61#return; {28448#(< ~counter~0 34)} is VALID [2022-04-14 15:17:23,935 INFO L290 TraceCheckUtils]: 156: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,935 INFO L290 TraceCheckUtils]: 155: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,935 INFO L290 TraceCheckUtils]: 154: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,936 INFO L272 TraceCheckUtils]: 153: Hoare triple {28448#(< ~counter~0 34)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,936 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {25132#true} {28448#(< ~counter~0 34)} #59#return; {28448#(< ~counter~0 34)} is VALID [2022-04-14 15:17:23,936 INFO L290 TraceCheckUtils]: 151: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,936 INFO L290 TraceCheckUtils]: 150: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,936 INFO L290 TraceCheckUtils]: 149: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,936 INFO L272 TraceCheckUtils]: 148: Hoare triple {28448#(< ~counter~0 34)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,936 INFO L290 TraceCheckUtils]: 147: Hoare triple {28448#(< ~counter~0 34)} assume !!(#t~post5 < 50);havoc #t~post5; {28448#(< ~counter~0 34)} is VALID [2022-04-14 15:17:23,937 INFO L290 TraceCheckUtils]: 146: Hoare triple {28533#(< ~counter~0 33)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28448#(< ~counter~0 34)} is VALID [2022-04-14 15:17:23,937 INFO L290 TraceCheckUtils]: 145: Hoare triple {28533#(< ~counter~0 33)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28533#(< ~counter~0 33)} is VALID [2022-04-14 15:17:23,938 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {25132#true} {28533#(< ~counter~0 33)} #67#return; {28533#(< ~counter~0 33)} is VALID [2022-04-14 15:17:23,938 INFO L290 TraceCheckUtils]: 143: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,938 INFO L290 TraceCheckUtils]: 142: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,938 INFO L290 TraceCheckUtils]: 141: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,938 INFO L272 TraceCheckUtils]: 140: Hoare triple {28533#(< ~counter~0 33)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,938 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {25132#true} {28533#(< ~counter~0 33)} #65#return; {28533#(< ~counter~0 33)} is VALID [2022-04-14 15:17:23,938 INFO L290 TraceCheckUtils]: 138: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,938 INFO L290 TraceCheckUtils]: 137: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,938 INFO L290 TraceCheckUtils]: 136: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,939 INFO L272 TraceCheckUtils]: 135: Hoare triple {28533#(< ~counter~0 33)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,939 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {25132#true} {28533#(< ~counter~0 33)} #63#return; {28533#(< ~counter~0 33)} is VALID [2022-04-14 15:17:23,939 INFO L290 TraceCheckUtils]: 133: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,939 INFO L290 TraceCheckUtils]: 132: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,939 INFO L290 TraceCheckUtils]: 131: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,939 INFO L272 TraceCheckUtils]: 130: Hoare triple {28533#(< ~counter~0 33)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,940 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {25132#true} {28533#(< ~counter~0 33)} #61#return; {28533#(< ~counter~0 33)} is VALID [2022-04-14 15:17:23,940 INFO L290 TraceCheckUtils]: 128: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,940 INFO L290 TraceCheckUtils]: 127: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,940 INFO L290 TraceCheckUtils]: 126: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,940 INFO L272 TraceCheckUtils]: 125: Hoare triple {28533#(< ~counter~0 33)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,940 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {25132#true} {28533#(< ~counter~0 33)} #59#return; {28533#(< ~counter~0 33)} is VALID [2022-04-14 15:17:23,940 INFO L290 TraceCheckUtils]: 123: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,940 INFO L290 TraceCheckUtils]: 122: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,940 INFO L290 TraceCheckUtils]: 121: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,940 INFO L272 TraceCheckUtils]: 120: Hoare triple {28533#(< ~counter~0 33)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,941 INFO L290 TraceCheckUtils]: 119: Hoare triple {28533#(< ~counter~0 33)} assume !!(#t~post5 < 50);havoc #t~post5; {28533#(< ~counter~0 33)} is VALID [2022-04-14 15:17:23,941 INFO L290 TraceCheckUtils]: 118: Hoare triple {28618#(< ~counter~0 32)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28533#(< ~counter~0 33)} is VALID [2022-04-14 15:17:23,941 INFO L290 TraceCheckUtils]: 117: Hoare triple {28618#(< ~counter~0 32)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28618#(< ~counter~0 32)} is VALID [2022-04-14 15:17:23,942 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25132#true} {28618#(< ~counter~0 32)} #67#return; {28618#(< ~counter~0 32)} is VALID [2022-04-14 15:17:23,942 INFO L290 TraceCheckUtils]: 115: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,942 INFO L290 TraceCheckUtils]: 114: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,942 INFO L290 TraceCheckUtils]: 113: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,942 INFO L272 TraceCheckUtils]: 112: Hoare triple {28618#(< ~counter~0 32)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,943 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {25132#true} {28618#(< ~counter~0 32)} #65#return; {28618#(< ~counter~0 32)} is VALID [2022-04-14 15:17:23,943 INFO L290 TraceCheckUtils]: 110: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,943 INFO L290 TraceCheckUtils]: 109: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,943 INFO L290 TraceCheckUtils]: 108: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,943 INFO L272 TraceCheckUtils]: 107: Hoare triple {28618#(< ~counter~0 32)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,943 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {25132#true} {28618#(< ~counter~0 32)} #63#return; {28618#(< ~counter~0 32)} is VALID [2022-04-14 15:17:23,943 INFO L290 TraceCheckUtils]: 105: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,943 INFO L290 TraceCheckUtils]: 104: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,943 INFO L290 TraceCheckUtils]: 103: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,943 INFO L272 TraceCheckUtils]: 102: Hoare triple {28618#(< ~counter~0 32)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,944 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {25132#true} {28618#(< ~counter~0 32)} #61#return; {28618#(< ~counter~0 32)} is VALID [2022-04-14 15:17:23,944 INFO L290 TraceCheckUtils]: 100: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,944 INFO L290 TraceCheckUtils]: 99: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,944 INFO L290 TraceCheckUtils]: 98: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,944 INFO L272 TraceCheckUtils]: 97: Hoare triple {28618#(< ~counter~0 32)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,944 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {25132#true} {28618#(< ~counter~0 32)} #59#return; {28618#(< ~counter~0 32)} is VALID [2022-04-14 15:17:23,945 INFO L290 TraceCheckUtils]: 95: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,945 INFO L290 TraceCheckUtils]: 94: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,945 INFO L290 TraceCheckUtils]: 93: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,945 INFO L272 TraceCheckUtils]: 92: Hoare triple {28618#(< ~counter~0 32)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,945 INFO L290 TraceCheckUtils]: 91: Hoare triple {28618#(< ~counter~0 32)} assume !!(#t~post5 < 50);havoc #t~post5; {28618#(< ~counter~0 32)} is VALID [2022-04-14 15:17:23,946 INFO L290 TraceCheckUtils]: 90: Hoare triple {28703#(< ~counter~0 31)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28618#(< ~counter~0 32)} is VALID [2022-04-14 15:17:23,946 INFO L290 TraceCheckUtils]: 89: Hoare triple {28703#(< ~counter~0 31)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28703#(< ~counter~0 31)} is VALID [2022-04-14 15:17:23,946 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {25132#true} {28703#(< ~counter~0 31)} #67#return; {28703#(< ~counter~0 31)} is VALID [2022-04-14 15:17:23,946 INFO L290 TraceCheckUtils]: 87: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,946 INFO L290 TraceCheckUtils]: 86: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,946 INFO L290 TraceCheckUtils]: 85: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,946 INFO L272 TraceCheckUtils]: 84: Hoare triple {28703#(< ~counter~0 31)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,947 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {25132#true} {28703#(< ~counter~0 31)} #65#return; {28703#(< ~counter~0 31)} is VALID [2022-04-14 15:17:23,947 INFO L290 TraceCheckUtils]: 82: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,947 INFO L290 TraceCheckUtils]: 81: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,947 INFO L290 TraceCheckUtils]: 80: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,947 INFO L272 TraceCheckUtils]: 79: Hoare triple {28703#(< ~counter~0 31)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,948 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {25132#true} {28703#(< ~counter~0 31)} #63#return; {28703#(< ~counter~0 31)} is VALID [2022-04-14 15:17:23,948 INFO L290 TraceCheckUtils]: 77: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,948 INFO L290 TraceCheckUtils]: 76: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,948 INFO L290 TraceCheckUtils]: 75: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,948 INFO L272 TraceCheckUtils]: 74: Hoare triple {28703#(< ~counter~0 31)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,948 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {25132#true} {28703#(< ~counter~0 31)} #61#return; {28703#(< ~counter~0 31)} is VALID [2022-04-14 15:17:23,948 INFO L290 TraceCheckUtils]: 72: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,948 INFO L290 TraceCheckUtils]: 71: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,948 INFO L290 TraceCheckUtils]: 70: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,948 INFO L272 TraceCheckUtils]: 69: Hoare triple {28703#(< ~counter~0 31)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,949 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {25132#true} {28703#(< ~counter~0 31)} #59#return; {28703#(< ~counter~0 31)} is VALID [2022-04-14 15:17:23,949 INFO L290 TraceCheckUtils]: 67: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,949 INFO L290 TraceCheckUtils]: 66: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,949 INFO L290 TraceCheckUtils]: 65: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,949 INFO L272 TraceCheckUtils]: 64: Hoare triple {28703#(< ~counter~0 31)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,949 INFO L290 TraceCheckUtils]: 63: Hoare triple {28703#(< ~counter~0 31)} assume !!(#t~post5 < 50);havoc #t~post5; {28703#(< ~counter~0 31)} is VALID [2022-04-14 15:17:23,950 INFO L290 TraceCheckUtils]: 62: Hoare triple {28788#(< ~counter~0 30)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28703#(< ~counter~0 31)} is VALID [2022-04-14 15:17:23,950 INFO L290 TraceCheckUtils]: 61: Hoare triple {28788#(< ~counter~0 30)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28788#(< ~counter~0 30)} is VALID [2022-04-14 15:17:23,951 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25132#true} {28788#(< ~counter~0 30)} #67#return; {28788#(< ~counter~0 30)} is VALID [2022-04-14 15:17:23,951 INFO L290 TraceCheckUtils]: 59: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,951 INFO L290 TraceCheckUtils]: 58: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,951 INFO L272 TraceCheckUtils]: 56: Hoare triple {28788#(< ~counter~0 30)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,951 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25132#true} {28788#(< ~counter~0 30)} #65#return; {28788#(< ~counter~0 30)} is VALID [2022-04-14 15:17:23,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,951 INFO L290 TraceCheckUtils]: 52: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,951 INFO L272 TraceCheckUtils]: 51: Hoare triple {28788#(< ~counter~0 30)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,952 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25132#true} {28788#(< ~counter~0 30)} #63#return; {28788#(< ~counter~0 30)} is VALID [2022-04-14 15:17:23,952 INFO L290 TraceCheckUtils]: 49: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,952 INFO L290 TraceCheckUtils]: 48: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,952 INFO L290 TraceCheckUtils]: 47: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,952 INFO L272 TraceCheckUtils]: 46: Hoare triple {28788#(< ~counter~0 30)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,953 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25132#true} {28788#(< ~counter~0 30)} #61#return; {28788#(< ~counter~0 30)} is VALID [2022-04-14 15:17:23,953 INFO L290 TraceCheckUtils]: 44: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,953 INFO L290 TraceCheckUtils]: 43: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,953 INFO L272 TraceCheckUtils]: 41: Hoare triple {28788#(< ~counter~0 30)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,953 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {25132#true} {28788#(< ~counter~0 30)} #59#return; {28788#(< ~counter~0 30)} is VALID [2022-04-14 15:17:23,953 INFO L290 TraceCheckUtils]: 39: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,953 INFO L290 TraceCheckUtils]: 38: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,953 INFO L290 TraceCheckUtils]: 37: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,953 INFO L272 TraceCheckUtils]: 36: Hoare triple {28788#(< ~counter~0 30)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {28788#(< ~counter~0 30)} assume !!(#t~post5 < 50);havoc #t~post5; {28788#(< ~counter~0 30)} is VALID [2022-04-14 15:17:23,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {28873#(< ~counter~0 29)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28788#(< ~counter~0 30)} is VALID [2022-04-14 15:17:23,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {28873#(< ~counter~0 29)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28873#(< ~counter~0 29)} is VALID [2022-04-14 15:17:23,955 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25132#true} {28873#(< ~counter~0 29)} #67#return; {28873#(< ~counter~0 29)} is VALID [2022-04-14 15:17:23,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,955 INFO L272 TraceCheckUtils]: 28: Hoare triple {28873#(< ~counter~0 29)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,956 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25132#true} {28873#(< ~counter~0 29)} #65#return; {28873#(< ~counter~0 29)} is VALID [2022-04-14 15:17:23,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,956 INFO L272 TraceCheckUtils]: 23: Hoare triple {28873#(< ~counter~0 29)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,956 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {25132#true} {28873#(< ~counter~0 29)} #63#return; {28873#(< ~counter~0 29)} is VALID [2022-04-14 15:17:23,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,956 INFO L272 TraceCheckUtils]: 18: Hoare triple {28873#(< ~counter~0 29)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,957 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25132#true} {28873#(< ~counter~0 29)} #61#return; {28873#(< ~counter~0 29)} is VALID [2022-04-14 15:17:23,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,957 INFO L272 TraceCheckUtils]: 13: Hoare triple {28873#(< ~counter~0 29)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,957 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {25132#true} {28873#(< ~counter~0 29)} #59#return; {28873#(< ~counter~0 29)} is VALID [2022-04-14 15:17:23,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {25132#true} assume true; {25132#true} is VALID [2022-04-14 15:17:23,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {25132#true} assume !(0 == ~cond); {25132#true} is VALID [2022-04-14 15:17:23,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {25132#true} ~cond := #in~cond; {25132#true} is VALID [2022-04-14 15:17:23,958 INFO L272 TraceCheckUtils]: 8: Hoare triple {28873#(< ~counter~0 29)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25132#true} is VALID [2022-04-14 15:17:23,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {28873#(< ~counter~0 29)} assume !!(#t~post5 < 50);havoc #t~post5; {28873#(< ~counter~0 29)} is VALID [2022-04-14 15:17:23,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {28958#(< ~counter~0 28)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28873#(< ~counter~0 29)} is VALID [2022-04-14 15:17:23,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {28958#(< ~counter~0 28)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {28958#(< ~counter~0 28)} is VALID [2022-04-14 15:17:23,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {28958#(< ~counter~0 28)} call #t~ret6 := main(); {28958#(< ~counter~0 28)} is VALID [2022-04-14 15:17:23,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28958#(< ~counter~0 28)} {25132#true} #81#return; {28958#(< ~counter~0 28)} is VALID [2022-04-14 15:17:23,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {28958#(< ~counter~0 28)} assume true; {28958#(< ~counter~0 28)} is VALID [2022-04-14 15:17:23,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {25132#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; {28958#(< ~counter~0 28)} is VALID [2022-04-14 15:17:23,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {25132#true} call ULTIMATE.init(); {25132#true} is VALID [2022-04-14 15:17:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 222 proven. 1892 refuted. 0 times theorem prover too weak. 24420 trivial. 0 not checked. [2022-04-14 15:17:23,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:17:23,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859769553] [2022-04-14 15:17:23,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:17:23,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934777756] [2022-04-14 15:17:23,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934777756] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:17:23,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:17:23,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-14 15:17:23,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488647805] [2022-04-14 15:17:23,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:17:23,968 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) Word has length 633 [2022-04-14 15:17:23,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:17:23,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) [2022-04-14 15:17:24,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 666 edges. 666 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:24,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-14 15:17:24,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:17:24,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-14 15:17:24,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-14 15:17:24,670 INFO L87 Difference]: Start difference. First operand 630 states and 631 transitions. Second operand has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) [2022-04-14 15:17:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:36,238 INFO L93 Difference]: Finished difference Result 1312 states and 1336 transitions. [2022-04-14 15:17:36,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-14 15:17:36,239 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) Word has length 633 [2022-04-14 15:17:36,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:17:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) [2022-04-14 15:17:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 782 transitions. [2022-04-14 15:17:36,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) [2022-04-14 15:17:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 782 transitions. [2022-04-14 15:17:36,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 782 transitions. [2022-04-14 15:17:36,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 782 edges. 782 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:37,038 INFO L225 Difference]: With dead ends: 1312 [2022-04-14 15:17:37,038 INFO L226 Difference]: Without dead ends: 1302 [2022-04-14 15:17:37,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1310 GetRequests, 1217 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-04-14 15:17:37,040 INFO L913 BasicCegarLoop]: 251 mSDtfsCounter, 664 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 908 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 908 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:17:37,041 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [664 Valid, 738 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [908 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-14 15:17:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2022-04-14 15:17:37,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2022-04-14 15:17:37,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:17:37,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1302 states. Second operand has 1302 states, 836 states have (on average 1.0011961722488039) internal successors, (837), 836 states have internal predecessors, (837), 234 states have call successors, (234), 233 states have call predecessors, (234), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) [2022-04-14 15:17:37,717 INFO L74 IsIncluded]: Start isIncluded. First operand 1302 states. Second operand has 1302 states, 836 states have (on average 1.0011961722488039) internal successors, (837), 836 states have internal predecessors, (837), 234 states have call successors, (234), 233 states have call predecessors, (234), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) [2022-04-14 15:17:37,719 INFO L87 Difference]: Start difference. First operand 1302 states. Second operand has 1302 states, 836 states have (on average 1.0011961722488039) internal successors, (837), 836 states have internal predecessors, (837), 234 states have call successors, (234), 233 states have call predecessors, (234), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) [2022-04-14 15:17:37,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:37,789 INFO L93 Difference]: Finished difference Result 1302 states and 1303 transitions. [2022-04-14 15:17:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1303 transitions. [2022-04-14 15:17:37,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:37,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:37,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 1302 states, 836 states have (on average 1.0011961722488039) internal successors, (837), 836 states have internal predecessors, (837), 234 states have call successors, (234), 233 states have call predecessors, (234), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) Second operand 1302 states. [2022-04-14 15:17:37,794 INFO L87 Difference]: Start difference. First operand has 1302 states, 836 states have (on average 1.0011961722488039) internal successors, (837), 836 states have internal predecessors, (837), 234 states have call successors, (234), 233 states have call predecessors, (234), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) Second operand 1302 states. [2022-04-14 15:17:37,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:37,860 INFO L93 Difference]: Finished difference Result 1302 states and 1303 transitions. [2022-04-14 15:17:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1303 transitions. [2022-04-14 15:17:37,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:37,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:37,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:17:37,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:17:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 836 states have (on average 1.0011961722488039) internal successors, (837), 836 states have internal predecessors, (837), 234 states have call successors, (234), 233 states have call predecessors, (234), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) [2022-04-14 15:17:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1303 transitions. [2022-04-14 15:17:37,969 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1303 transitions. Word has length 633 [2022-04-14 15:17:37,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:17:37,969 INFO L478 AbstractCegarLoop]: Abstraction has 1302 states and 1303 transitions. [2022-04-14 15:17:37,970 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) [2022-04-14 15:17:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1303 transitions. [2022-04-14 15:17:37,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1306 [2022-04-14 15:17:37,985 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:17:37,986 INFO L499 BasicCegarLoop]: trace histogram [232, 231, 231, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:17:38,009 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 15:17:38,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:38,203 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:17:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:17:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash 966643877, now seen corresponding path program 5 times [2022-04-14 15:17:38,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:17:38,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789412264] [2022-04-14 15:17:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:17:38,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:17:38,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1169450477] [2022-04-14 15:17:38,261 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-14 15:17:38,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:38,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:17:38,262 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 15:17:38,285 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 15:17:46,668 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 163 check-sat command(s) [2022-04-14 15:17:46,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:17:46,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 2794 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-14 15:17:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:46,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:17:52,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {35319#true} call ULTIMATE.init(); {35319#true} is VALID [2022-04-14 15:17:52,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {35319#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; {35327#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:52,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {35327#(<= ~counter~0 0)} assume true; {35327#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:52,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35327#(<= ~counter~0 0)} {35319#true} #81#return; {35327#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:52,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {35327#(<= ~counter~0 0)} call #t~ret6 := main(); {35327#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:52,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {35327#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {35327#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:52,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {35327#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {35343#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,669 INFO L272 TraceCheckUtils]: 8: Hoare triple {35343#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {35343#(<= ~counter~0 1)} ~cond := #in~cond; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {35343#(<= ~counter~0 1)} assume !(0 == ~cond); {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {35343#(<= ~counter~0 1)} assume true; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,670 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35343#(<= ~counter~0 1)} {35343#(<= ~counter~0 1)} #59#return; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,671 INFO L272 TraceCheckUtils]: 13: Hoare triple {35343#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {35343#(<= ~counter~0 1)} ~cond := #in~cond; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {35343#(<= ~counter~0 1)} assume !(0 == ~cond); {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {35343#(<= ~counter~0 1)} assume true; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,672 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35343#(<= ~counter~0 1)} {35343#(<= ~counter~0 1)} #61#return; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,673 INFO L272 TraceCheckUtils]: 18: Hoare triple {35343#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {35343#(<= ~counter~0 1)} ~cond := #in~cond; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {35343#(<= ~counter~0 1)} assume !(0 == ~cond); {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {35343#(<= ~counter~0 1)} assume true; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,674 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35343#(<= ~counter~0 1)} {35343#(<= ~counter~0 1)} #63#return; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,675 INFO L272 TraceCheckUtils]: 23: Hoare triple {35343#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {35343#(<= ~counter~0 1)} ~cond := #in~cond; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {35343#(<= ~counter~0 1)} assume !(0 == ~cond); {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {35343#(<= ~counter~0 1)} assume true; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,676 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {35343#(<= ~counter~0 1)} {35343#(<= ~counter~0 1)} #65#return; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,677 INFO L272 TraceCheckUtils]: 28: Hoare triple {35343#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {35343#(<= ~counter~0 1)} ~cond := #in~cond; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {35343#(<= ~counter~0 1)} assume !(0 == ~cond); {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {35343#(<= ~counter~0 1)} assume true; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,678 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {35343#(<= ~counter~0 1)} {35343#(<= ~counter~0 1)} #67#return; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {35343#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35343#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:52,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {35343#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {35428#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,681 INFO L272 TraceCheckUtils]: 36: Hoare triple {35428#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,681 INFO L290 TraceCheckUtils]: 37: Hoare triple {35428#(<= ~counter~0 2)} ~cond := #in~cond; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {35428#(<= ~counter~0 2)} assume !(0 == ~cond); {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,682 INFO L290 TraceCheckUtils]: 39: Hoare triple {35428#(<= ~counter~0 2)} assume true; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,682 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35428#(<= ~counter~0 2)} {35428#(<= ~counter~0 2)} #59#return; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,683 INFO L272 TraceCheckUtils]: 41: Hoare triple {35428#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {35428#(<= ~counter~0 2)} ~cond := #in~cond; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,683 INFO L290 TraceCheckUtils]: 43: Hoare triple {35428#(<= ~counter~0 2)} assume !(0 == ~cond); {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,683 INFO L290 TraceCheckUtils]: 44: Hoare triple {35428#(<= ~counter~0 2)} assume true; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,684 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {35428#(<= ~counter~0 2)} {35428#(<= ~counter~0 2)} #61#return; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,684 INFO L272 TraceCheckUtils]: 46: Hoare triple {35428#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,685 INFO L290 TraceCheckUtils]: 47: Hoare triple {35428#(<= ~counter~0 2)} ~cond := #in~cond; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {35428#(<= ~counter~0 2)} assume !(0 == ~cond); {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {35428#(<= ~counter~0 2)} assume true; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,686 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {35428#(<= ~counter~0 2)} {35428#(<= ~counter~0 2)} #63#return; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,686 INFO L272 TraceCheckUtils]: 51: Hoare triple {35428#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,687 INFO L290 TraceCheckUtils]: 52: Hoare triple {35428#(<= ~counter~0 2)} ~cond := #in~cond; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,687 INFO L290 TraceCheckUtils]: 53: Hoare triple {35428#(<= ~counter~0 2)} assume !(0 == ~cond); {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,687 INFO L290 TraceCheckUtils]: 54: Hoare triple {35428#(<= ~counter~0 2)} assume true; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,688 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {35428#(<= ~counter~0 2)} {35428#(<= ~counter~0 2)} #65#return; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,689 INFO L272 TraceCheckUtils]: 56: Hoare triple {35428#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {35428#(<= ~counter~0 2)} ~cond := #in~cond; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,689 INFO L290 TraceCheckUtils]: 58: Hoare triple {35428#(<= ~counter~0 2)} assume !(0 == ~cond); {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,689 INFO L290 TraceCheckUtils]: 59: Hoare triple {35428#(<= ~counter~0 2)} assume true; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,690 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {35428#(<= ~counter~0 2)} {35428#(<= ~counter~0 2)} #67#return; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {35428#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35428#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:52,691 INFO L290 TraceCheckUtils]: 62: Hoare triple {35428#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,692 INFO L290 TraceCheckUtils]: 63: Hoare triple {35513#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,692 INFO L272 TraceCheckUtils]: 64: Hoare triple {35513#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,692 INFO L290 TraceCheckUtils]: 65: Hoare triple {35513#(<= ~counter~0 3)} ~cond := #in~cond; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,693 INFO L290 TraceCheckUtils]: 66: Hoare triple {35513#(<= ~counter~0 3)} assume !(0 == ~cond); {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,693 INFO L290 TraceCheckUtils]: 67: Hoare triple {35513#(<= ~counter~0 3)} assume true; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,694 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {35513#(<= ~counter~0 3)} {35513#(<= ~counter~0 3)} #59#return; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,694 INFO L272 TraceCheckUtils]: 69: Hoare triple {35513#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,694 INFO L290 TraceCheckUtils]: 70: Hoare triple {35513#(<= ~counter~0 3)} ~cond := #in~cond; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,695 INFO L290 TraceCheckUtils]: 71: Hoare triple {35513#(<= ~counter~0 3)} assume !(0 == ~cond); {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,699 INFO L290 TraceCheckUtils]: 72: Hoare triple {35513#(<= ~counter~0 3)} assume true; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,700 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {35513#(<= ~counter~0 3)} {35513#(<= ~counter~0 3)} #61#return; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,700 INFO L272 TraceCheckUtils]: 74: Hoare triple {35513#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,700 INFO L290 TraceCheckUtils]: 75: Hoare triple {35513#(<= ~counter~0 3)} ~cond := #in~cond; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,701 INFO L290 TraceCheckUtils]: 76: Hoare triple {35513#(<= ~counter~0 3)} assume !(0 == ~cond); {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,701 INFO L290 TraceCheckUtils]: 77: Hoare triple {35513#(<= ~counter~0 3)} assume true; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,702 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {35513#(<= ~counter~0 3)} {35513#(<= ~counter~0 3)} #63#return; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,702 INFO L272 TraceCheckUtils]: 79: Hoare triple {35513#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,702 INFO L290 TraceCheckUtils]: 80: Hoare triple {35513#(<= ~counter~0 3)} ~cond := #in~cond; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,703 INFO L290 TraceCheckUtils]: 81: Hoare triple {35513#(<= ~counter~0 3)} assume !(0 == ~cond); {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,703 INFO L290 TraceCheckUtils]: 82: Hoare triple {35513#(<= ~counter~0 3)} assume true; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,704 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {35513#(<= ~counter~0 3)} {35513#(<= ~counter~0 3)} #65#return; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,704 INFO L272 TraceCheckUtils]: 84: Hoare triple {35513#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,704 INFO L290 TraceCheckUtils]: 85: Hoare triple {35513#(<= ~counter~0 3)} ~cond := #in~cond; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,705 INFO L290 TraceCheckUtils]: 86: Hoare triple {35513#(<= ~counter~0 3)} assume !(0 == ~cond); {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,705 INFO L290 TraceCheckUtils]: 87: Hoare triple {35513#(<= ~counter~0 3)} assume true; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,705 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {35513#(<= ~counter~0 3)} {35513#(<= ~counter~0 3)} #67#return; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,706 INFO L290 TraceCheckUtils]: 89: Hoare triple {35513#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:52,707 INFO L290 TraceCheckUtils]: 90: Hoare triple {35513#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,707 INFO L290 TraceCheckUtils]: 91: Hoare triple {35598#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,707 INFO L272 TraceCheckUtils]: 92: Hoare triple {35598#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,708 INFO L290 TraceCheckUtils]: 93: Hoare triple {35598#(<= ~counter~0 4)} ~cond := #in~cond; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,708 INFO L290 TraceCheckUtils]: 94: Hoare triple {35598#(<= ~counter~0 4)} assume !(0 == ~cond); {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,708 INFO L290 TraceCheckUtils]: 95: Hoare triple {35598#(<= ~counter~0 4)} assume true; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,709 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {35598#(<= ~counter~0 4)} {35598#(<= ~counter~0 4)} #59#return; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,709 INFO L272 TraceCheckUtils]: 97: Hoare triple {35598#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,710 INFO L290 TraceCheckUtils]: 98: Hoare triple {35598#(<= ~counter~0 4)} ~cond := #in~cond; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,710 INFO L290 TraceCheckUtils]: 99: Hoare triple {35598#(<= ~counter~0 4)} assume !(0 == ~cond); {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,711 INFO L290 TraceCheckUtils]: 100: Hoare triple {35598#(<= ~counter~0 4)} assume true; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,711 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {35598#(<= ~counter~0 4)} {35598#(<= ~counter~0 4)} #61#return; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,712 INFO L272 TraceCheckUtils]: 102: Hoare triple {35598#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,712 INFO L290 TraceCheckUtils]: 103: Hoare triple {35598#(<= ~counter~0 4)} ~cond := #in~cond; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,712 INFO L290 TraceCheckUtils]: 104: Hoare triple {35598#(<= ~counter~0 4)} assume !(0 == ~cond); {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,713 INFO L290 TraceCheckUtils]: 105: Hoare triple {35598#(<= ~counter~0 4)} assume true; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,713 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {35598#(<= ~counter~0 4)} {35598#(<= ~counter~0 4)} #63#return; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,714 INFO L272 TraceCheckUtils]: 107: Hoare triple {35598#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,714 INFO L290 TraceCheckUtils]: 108: Hoare triple {35598#(<= ~counter~0 4)} ~cond := #in~cond; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,714 INFO L290 TraceCheckUtils]: 109: Hoare triple {35598#(<= ~counter~0 4)} assume !(0 == ~cond); {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,715 INFO L290 TraceCheckUtils]: 110: Hoare triple {35598#(<= ~counter~0 4)} assume true; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,715 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {35598#(<= ~counter~0 4)} {35598#(<= ~counter~0 4)} #65#return; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,716 INFO L272 TraceCheckUtils]: 112: Hoare triple {35598#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,716 INFO L290 TraceCheckUtils]: 113: Hoare triple {35598#(<= ~counter~0 4)} ~cond := #in~cond; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,716 INFO L290 TraceCheckUtils]: 114: Hoare triple {35598#(<= ~counter~0 4)} assume !(0 == ~cond); {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,717 INFO L290 TraceCheckUtils]: 115: Hoare triple {35598#(<= ~counter~0 4)} assume true; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,717 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {35598#(<= ~counter~0 4)} {35598#(<= ~counter~0 4)} #67#return; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,718 INFO L290 TraceCheckUtils]: 117: Hoare triple {35598#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:52,719 INFO L290 TraceCheckUtils]: 118: Hoare triple {35598#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,719 INFO L290 TraceCheckUtils]: 119: Hoare triple {35683#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,720 INFO L272 TraceCheckUtils]: 120: Hoare triple {35683#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,720 INFO L290 TraceCheckUtils]: 121: Hoare triple {35683#(<= ~counter~0 5)} ~cond := #in~cond; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,720 INFO L290 TraceCheckUtils]: 122: Hoare triple {35683#(<= ~counter~0 5)} assume !(0 == ~cond); {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,721 INFO L290 TraceCheckUtils]: 123: Hoare triple {35683#(<= ~counter~0 5)} assume true; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,721 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {35683#(<= ~counter~0 5)} {35683#(<= ~counter~0 5)} #59#return; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,722 INFO L272 TraceCheckUtils]: 125: Hoare triple {35683#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,722 INFO L290 TraceCheckUtils]: 126: Hoare triple {35683#(<= ~counter~0 5)} ~cond := #in~cond; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,722 INFO L290 TraceCheckUtils]: 127: Hoare triple {35683#(<= ~counter~0 5)} assume !(0 == ~cond); {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,722 INFO L290 TraceCheckUtils]: 128: Hoare triple {35683#(<= ~counter~0 5)} assume true; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,723 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {35683#(<= ~counter~0 5)} {35683#(<= ~counter~0 5)} #61#return; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,724 INFO L272 TraceCheckUtils]: 130: Hoare triple {35683#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,724 INFO L290 TraceCheckUtils]: 131: Hoare triple {35683#(<= ~counter~0 5)} ~cond := #in~cond; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,724 INFO L290 TraceCheckUtils]: 132: Hoare triple {35683#(<= ~counter~0 5)} assume !(0 == ~cond); {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,725 INFO L290 TraceCheckUtils]: 133: Hoare triple {35683#(<= ~counter~0 5)} assume true; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,725 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {35683#(<= ~counter~0 5)} {35683#(<= ~counter~0 5)} #63#return; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,726 INFO L272 TraceCheckUtils]: 135: Hoare triple {35683#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,726 INFO L290 TraceCheckUtils]: 136: Hoare triple {35683#(<= ~counter~0 5)} ~cond := #in~cond; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,726 INFO L290 TraceCheckUtils]: 137: Hoare triple {35683#(<= ~counter~0 5)} assume !(0 == ~cond); {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,727 INFO L290 TraceCheckUtils]: 138: Hoare triple {35683#(<= ~counter~0 5)} assume true; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,727 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {35683#(<= ~counter~0 5)} {35683#(<= ~counter~0 5)} #65#return; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,728 INFO L272 TraceCheckUtils]: 140: Hoare triple {35683#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,728 INFO L290 TraceCheckUtils]: 141: Hoare triple {35683#(<= ~counter~0 5)} ~cond := #in~cond; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,728 INFO L290 TraceCheckUtils]: 142: Hoare triple {35683#(<= ~counter~0 5)} assume !(0 == ~cond); {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,729 INFO L290 TraceCheckUtils]: 143: Hoare triple {35683#(<= ~counter~0 5)} assume true; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,729 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {35683#(<= ~counter~0 5)} {35683#(<= ~counter~0 5)} #67#return; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,730 INFO L290 TraceCheckUtils]: 145: Hoare triple {35683#(<= ~counter~0 5)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:52,730 INFO L290 TraceCheckUtils]: 146: Hoare triple {35683#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,731 INFO L290 TraceCheckUtils]: 147: Hoare triple {35768#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,731 INFO L272 TraceCheckUtils]: 148: Hoare triple {35768#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,731 INFO L290 TraceCheckUtils]: 149: Hoare triple {35768#(<= ~counter~0 6)} ~cond := #in~cond; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,732 INFO L290 TraceCheckUtils]: 150: Hoare triple {35768#(<= ~counter~0 6)} assume !(0 == ~cond); {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,732 INFO L290 TraceCheckUtils]: 151: Hoare triple {35768#(<= ~counter~0 6)} assume true; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,733 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {35768#(<= ~counter~0 6)} {35768#(<= ~counter~0 6)} #59#return; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,733 INFO L272 TraceCheckUtils]: 153: Hoare triple {35768#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,734 INFO L290 TraceCheckUtils]: 154: Hoare triple {35768#(<= ~counter~0 6)} ~cond := #in~cond; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,734 INFO L290 TraceCheckUtils]: 155: Hoare triple {35768#(<= ~counter~0 6)} assume !(0 == ~cond); {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,734 INFO L290 TraceCheckUtils]: 156: Hoare triple {35768#(<= ~counter~0 6)} assume true; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,735 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {35768#(<= ~counter~0 6)} {35768#(<= ~counter~0 6)} #61#return; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,736 INFO L272 TraceCheckUtils]: 158: Hoare triple {35768#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,736 INFO L290 TraceCheckUtils]: 159: Hoare triple {35768#(<= ~counter~0 6)} ~cond := #in~cond; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,736 INFO L290 TraceCheckUtils]: 160: Hoare triple {35768#(<= ~counter~0 6)} assume !(0 == ~cond); {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,737 INFO L290 TraceCheckUtils]: 161: Hoare triple {35768#(<= ~counter~0 6)} assume true; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,737 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {35768#(<= ~counter~0 6)} {35768#(<= ~counter~0 6)} #63#return; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,738 INFO L272 TraceCheckUtils]: 163: Hoare triple {35768#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,738 INFO L290 TraceCheckUtils]: 164: Hoare triple {35768#(<= ~counter~0 6)} ~cond := #in~cond; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,739 INFO L290 TraceCheckUtils]: 165: Hoare triple {35768#(<= ~counter~0 6)} assume !(0 == ~cond); {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,739 INFO L290 TraceCheckUtils]: 166: Hoare triple {35768#(<= ~counter~0 6)} assume true; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,740 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {35768#(<= ~counter~0 6)} {35768#(<= ~counter~0 6)} #65#return; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,740 INFO L272 TraceCheckUtils]: 168: Hoare triple {35768#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,741 INFO L290 TraceCheckUtils]: 169: Hoare triple {35768#(<= ~counter~0 6)} ~cond := #in~cond; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,741 INFO L290 TraceCheckUtils]: 170: Hoare triple {35768#(<= ~counter~0 6)} assume !(0 == ~cond); {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,741 INFO L290 TraceCheckUtils]: 171: Hoare triple {35768#(<= ~counter~0 6)} assume true; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,742 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {35768#(<= ~counter~0 6)} {35768#(<= ~counter~0 6)} #67#return; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,742 INFO L290 TraceCheckUtils]: 173: Hoare triple {35768#(<= ~counter~0 6)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:52,743 INFO L290 TraceCheckUtils]: 174: Hoare triple {35768#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,744 INFO L290 TraceCheckUtils]: 175: Hoare triple {35853#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,744 INFO L272 TraceCheckUtils]: 176: Hoare triple {35853#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,744 INFO L290 TraceCheckUtils]: 177: Hoare triple {35853#(<= ~counter~0 7)} ~cond := #in~cond; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,745 INFO L290 TraceCheckUtils]: 178: Hoare triple {35853#(<= ~counter~0 7)} assume !(0 == ~cond); {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,745 INFO L290 TraceCheckUtils]: 179: Hoare triple {35853#(<= ~counter~0 7)} assume true; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,746 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {35853#(<= ~counter~0 7)} {35853#(<= ~counter~0 7)} #59#return; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,746 INFO L272 TraceCheckUtils]: 181: Hoare triple {35853#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,747 INFO L290 TraceCheckUtils]: 182: Hoare triple {35853#(<= ~counter~0 7)} ~cond := #in~cond; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,747 INFO L290 TraceCheckUtils]: 183: Hoare triple {35853#(<= ~counter~0 7)} assume !(0 == ~cond); {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,748 INFO L290 TraceCheckUtils]: 184: Hoare triple {35853#(<= ~counter~0 7)} assume true; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,748 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {35853#(<= ~counter~0 7)} {35853#(<= ~counter~0 7)} #61#return; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,749 INFO L272 TraceCheckUtils]: 186: Hoare triple {35853#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,749 INFO L290 TraceCheckUtils]: 187: Hoare triple {35853#(<= ~counter~0 7)} ~cond := #in~cond; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,750 INFO L290 TraceCheckUtils]: 188: Hoare triple {35853#(<= ~counter~0 7)} assume !(0 == ~cond); {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,750 INFO L290 TraceCheckUtils]: 189: Hoare triple {35853#(<= ~counter~0 7)} assume true; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,751 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {35853#(<= ~counter~0 7)} {35853#(<= ~counter~0 7)} #63#return; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,751 INFO L272 TraceCheckUtils]: 191: Hoare triple {35853#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,751 INFO L290 TraceCheckUtils]: 192: Hoare triple {35853#(<= ~counter~0 7)} ~cond := #in~cond; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,752 INFO L290 TraceCheckUtils]: 193: Hoare triple {35853#(<= ~counter~0 7)} assume !(0 == ~cond); {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,752 INFO L290 TraceCheckUtils]: 194: Hoare triple {35853#(<= ~counter~0 7)} assume true; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,753 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {35853#(<= ~counter~0 7)} {35853#(<= ~counter~0 7)} #65#return; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,753 INFO L272 TraceCheckUtils]: 196: Hoare triple {35853#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,754 INFO L290 TraceCheckUtils]: 197: Hoare triple {35853#(<= ~counter~0 7)} ~cond := #in~cond; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,754 INFO L290 TraceCheckUtils]: 198: Hoare triple {35853#(<= ~counter~0 7)} assume !(0 == ~cond); {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,754 INFO L290 TraceCheckUtils]: 199: Hoare triple {35853#(<= ~counter~0 7)} assume true; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,755 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {35853#(<= ~counter~0 7)} {35853#(<= ~counter~0 7)} #67#return; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,755 INFO L290 TraceCheckUtils]: 201: Hoare triple {35853#(<= ~counter~0 7)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:52,756 INFO L290 TraceCheckUtils]: 202: Hoare triple {35853#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,756 INFO L290 TraceCheckUtils]: 203: Hoare triple {35938#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,757 INFO L272 TraceCheckUtils]: 204: Hoare triple {35938#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,757 INFO L290 TraceCheckUtils]: 205: Hoare triple {35938#(<= ~counter~0 8)} ~cond := #in~cond; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,758 INFO L290 TraceCheckUtils]: 206: Hoare triple {35938#(<= ~counter~0 8)} assume !(0 == ~cond); {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,758 INFO L290 TraceCheckUtils]: 207: Hoare triple {35938#(<= ~counter~0 8)} assume true; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,758 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {35938#(<= ~counter~0 8)} {35938#(<= ~counter~0 8)} #59#return; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,759 INFO L272 TraceCheckUtils]: 209: Hoare triple {35938#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,759 INFO L290 TraceCheckUtils]: 210: Hoare triple {35938#(<= ~counter~0 8)} ~cond := #in~cond; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,760 INFO L290 TraceCheckUtils]: 211: Hoare triple {35938#(<= ~counter~0 8)} assume !(0 == ~cond); {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,760 INFO L290 TraceCheckUtils]: 212: Hoare triple {35938#(<= ~counter~0 8)} assume true; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,760 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {35938#(<= ~counter~0 8)} {35938#(<= ~counter~0 8)} #61#return; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,761 INFO L272 TraceCheckUtils]: 214: Hoare triple {35938#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,761 INFO L290 TraceCheckUtils]: 215: Hoare triple {35938#(<= ~counter~0 8)} ~cond := #in~cond; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,762 INFO L290 TraceCheckUtils]: 216: Hoare triple {35938#(<= ~counter~0 8)} assume !(0 == ~cond); {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,762 INFO L290 TraceCheckUtils]: 217: Hoare triple {35938#(<= ~counter~0 8)} assume true; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,763 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {35938#(<= ~counter~0 8)} {35938#(<= ~counter~0 8)} #63#return; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,763 INFO L272 TraceCheckUtils]: 219: Hoare triple {35938#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,763 INFO L290 TraceCheckUtils]: 220: Hoare triple {35938#(<= ~counter~0 8)} ~cond := #in~cond; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,764 INFO L290 TraceCheckUtils]: 221: Hoare triple {35938#(<= ~counter~0 8)} assume !(0 == ~cond); {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,764 INFO L290 TraceCheckUtils]: 222: Hoare triple {35938#(<= ~counter~0 8)} assume true; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,765 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {35938#(<= ~counter~0 8)} {35938#(<= ~counter~0 8)} #65#return; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,765 INFO L272 TraceCheckUtils]: 224: Hoare triple {35938#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,766 INFO L290 TraceCheckUtils]: 225: Hoare triple {35938#(<= ~counter~0 8)} ~cond := #in~cond; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,766 INFO L290 TraceCheckUtils]: 226: Hoare triple {35938#(<= ~counter~0 8)} assume !(0 == ~cond); {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,766 INFO L290 TraceCheckUtils]: 227: Hoare triple {35938#(<= ~counter~0 8)} assume true; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,767 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {35938#(<= ~counter~0 8)} {35938#(<= ~counter~0 8)} #67#return; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,767 INFO L290 TraceCheckUtils]: 229: Hoare triple {35938#(<= ~counter~0 8)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:52,768 INFO L290 TraceCheckUtils]: 230: Hoare triple {35938#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,769 INFO L290 TraceCheckUtils]: 231: Hoare triple {36023#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,769 INFO L272 TraceCheckUtils]: 232: Hoare triple {36023#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,769 INFO L290 TraceCheckUtils]: 233: Hoare triple {36023#(<= ~counter~0 9)} ~cond := #in~cond; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,770 INFO L290 TraceCheckUtils]: 234: Hoare triple {36023#(<= ~counter~0 9)} assume !(0 == ~cond); {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,770 INFO L290 TraceCheckUtils]: 235: Hoare triple {36023#(<= ~counter~0 9)} assume true; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,771 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {36023#(<= ~counter~0 9)} {36023#(<= ~counter~0 9)} #59#return; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,771 INFO L272 TraceCheckUtils]: 237: Hoare triple {36023#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,771 INFO L290 TraceCheckUtils]: 238: Hoare triple {36023#(<= ~counter~0 9)} ~cond := #in~cond; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,772 INFO L290 TraceCheckUtils]: 239: Hoare triple {36023#(<= ~counter~0 9)} assume !(0 == ~cond); {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,772 INFO L290 TraceCheckUtils]: 240: Hoare triple {36023#(<= ~counter~0 9)} assume true; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,773 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {36023#(<= ~counter~0 9)} {36023#(<= ~counter~0 9)} #61#return; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,773 INFO L272 TraceCheckUtils]: 242: Hoare triple {36023#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,773 INFO L290 TraceCheckUtils]: 243: Hoare triple {36023#(<= ~counter~0 9)} ~cond := #in~cond; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,774 INFO L290 TraceCheckUtils]: 244: Hoare triple {36023#(<= ~counter~0 9)} assume !(0 == ~cond); {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,774 INFO L290 TraceCheckUtils]: 245: Hoare triple {36023#(<= ~counter~0 9)} assume true; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,775 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {36023#(<= ~counter~0 9)} {36023#(<= ~counter~0 9)} #63#return; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,775 INFO L272 TraceCheckUtils]: 247: Hoare triple {36023#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,776 INFO L290 TraceCheckUtils]: 248: Hoare triple {36023#(<= ~counter~0 9)} ~cond := #in~cond; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,776 INFO L290 TraceCheckUtils]: 249: Hoare triple {36023#(<= ~counter~0 9)} assume !(0 == ~cond); {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,776 INFO L290 TraceCheckUtils]: 250: Hoare triple {36023#(<= ~counter~0 9)} assume true; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,777 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {36023#(<= ~counter~0 9)} {36023#(<= ~counter~0 9)} #65#return; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,777 INFO L272 TraceCheckUtils]: 252: Hoare triple {36023#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,778 INFO L290 TraceCheckUtils]: 253: Hoare triple {36023#(<= ~counter~0 9)} ~cond := #in~cond; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,778 INFO L290 TraceCheckUtils]: 254: Hoare triple {36023#(<= ~counter~0 9)} assume !(0 == ~cond); {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,778 INFO L290 TraceCheckUtils]: 255: Hoare triple {36023#(<= ~counter~0 9)} assume true; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,779 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {36023#(<= ~counter~0 9)} {36023#(<= ~counter~0 9)} #67#return; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,779 INFO L290 TraceCheckUtils]: 257: Hoare triple {36023#(<= ~counter~0 9)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:52,780 INFO L290 TraceCheckUtils]: 258: Hoare triple {36023#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,781 INFO L290 TraceCheckUtils]: 259: Hoare triple {36108#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,781 INFO L272 TraceCheckUtils]: 260: Hoare triple {36108#(<= ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,782 INFO L290 TraceCheckUtils]: 261: Hoare triple {36108#(<= ~counter~0 10)} ~cond := #in~cond; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,782 INFO L290 TraceCheckUtils]: 262: Hoare triple {36108#(<= ~counter~0 10)} assume !(0 == ~cond); {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,782 INFO L290 TraceCheckUtils]: 263: Hoare triple {36108#(<= ~counter~0 10)} assume true; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,783 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {36108#(<= ~counter~0 10)} {36108#(<= ~counter~0 10)} #59#return; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,783 INFO L272 TraceCheckUtils]: 265: Hoare triple {36108#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,784 INFO L290 TraceCheckUtils]: 266: Hoare triple {36108#(<= ~counter~0 10)} ~cond := #in~cond; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,784 INFO L290 TraceCheckUtils]: 267: Hoare triple {36108#(<= ~counter~0 10)} assume !(0 == ~cond); {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,784 INFO L290 TraceCheckUtils]: 268: Hoare triple {36108#(<= ~counter~0 10)} assume true; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,785 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {36108#(<= ~counter~0 10)} {36108#(<= ~counter~0 10)} #61#return; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,785 INFO L272 TraceCheckUtils]: 270: Hoare triple {36108#(<= ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,786 INFO L290 TraceCheckUtils]: 271: Hoare triple {36108#(<= ~counter~0 10)} ~cond := #in~cond; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,786 INFO L290 TraceCheckUtils]: 272: Hoare triple {36108#(<= ~counter~0 10)} assume !(0 == ~cond); {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,786 INFO L290 TraceCheckUtils]: 273: Hoare triple {36108#(<= ~counter~0 10)} assume true; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,787 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {36108#(<= ~counter~0 10)} {36108#(<= ~counter~0 10)} #63#return; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,787 INFO L272 TraceCheckUtils]: 275: Hoare triple {36108#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,788 INFO L290 TraceCheckUtils]: 276: Hoare triple {36108#(<= ~counter~0 10)} ~cond := #in~cond; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,788 INFO L290 TraceCheckUtils]: 277: Hoare triple {36108#(<= ~counter~0 10)} assume !(0 == ~cond); {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,788 INFO L290 TraceCheckUtils]: 278: Hoare triple {36108#(<= ~counter~0 10)} assume true; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,789 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {36108#(<= ~counter~0 10)} {36108#(<= ~counter~0 10)} #65#return; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,789 INFO L272 TraceCheckUtils]: 280: Hoare triple {36108#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,790 INFO L290 TraceCheckUtils]: 281: Hoare triple {36108#(<= ~counter~0 10)} ~cond := #in~cond; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,790 INFO L290 TraceCheckUtils]: 282: Hoare triple {36108#(<= ~counter~0 10)} assume !(0 == ~cond); {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,790 INFO L290 TraceCheckUtils]: 283: Hoare triple {36108#(<= ~counter~0 10)} assume true; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,791 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {36108#(<= ~counter~0 10)} {36108#(<= ~counter~0 10)} #67#return; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,791 INFO L290 TraceCheckUtils]: 285: Hoare triple {36108#(<= ~counter~0 10)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:52,792 INFO L290 TraceCheckUtils]: 286: Hoare triple {36108#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,792 INFO L290 TraceCheckUtils]: 287: Hoare triple {36193#(<= ~counter~0 11)} assume !!(#t~post5 < 50);havoc #t~post5; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,793 INFO L272 TraceCheckUtils]: 288: Hoare triple {36193#(<= ~counter~0 11)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,793 INFO L290 TraceCheckUtils]: 289: Hoare triple {36193#(<= ~counter~0 11)} ~cond := #in~cond; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,793 INFO L290 TraceCheckUtils]: 290: Hoare triple {36193#(<= ~counter~0 11)} assume !(0 == ~cond); {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,794 INFO L290 TraceCheckUtils]: 291: Hoare triple {36193#(<= ~counter~0 11)} assume true; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,794 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {36193#(<= ~counter~0 11)} {36193#(<= ~counter~0 11)} #59#return; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,795 INFO L272 TraceCheckUtils]: 293: Hoare triple {36193#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,795 INFO L290 TraceCheckUtils]: 294: Hoare triple {36193#(<= ~counter~0 11)} ~cond := #in~cond; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,795 INFO L290 TraceCheckUtils]: 295: Hoare triple {36193#(<= ~counter~0 11)} assume !(0 == ~cond); {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,795 INFO L290 TraceCheckUtils]: 296: Hoare triple {36193#(<= ~counter~0 11)} assume true; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,796 INFO L284 TraceCheckUtils]: 297: Hoare quadruple {36193#(<= ~counter~0 11)} {36193#(<= ~counter~0 11)} #61#return; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,796 INFO L272 TraceCheckUtils]: 298: Hoare triple {36193#(<= ~counter~0 11)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,797 INFO L290 TraceCheckUtils]: 299: Hoare triple {36193#(<= ~counter~0 11)} ~cond := #in~cond; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,797 INFO L290 TraceCheckUtils]: 300: Hoare triple {36193#(<= ~counter~0 11)} assume !(0 == ~cond); {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,797 INFO L290 TraceCheckUtils]: 301: Hoare triple {36193#(<= ~counter~0 11)} assume true; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,798 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {36193#(<= ~counter~0 11)} {36193#(<= ~counter~0 11)} #63#return; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,798 INFO L272 TraceCheckUtils]: 303: Hoare triple {36193#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,799 INFO L290 TraceCheckUtils]: 304: Hoare triple {36193#(<= ~counter~0 11)} ~cond := #in~cond; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,799 INFO L290 TraceCheckUtils]: 305: Hoare triple {36193#(<= ~counter~0 11)} assume !(0 == ~cond); {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,799 INFO L290 TraceCheckUtils]: 306: Hoare triple {36193#(<= ~counter~0 11)} assume true; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,800 INFO L284 TraceCheckUtils]: 307: Hoare quadruple {36193#(<= ~counter~0 11)} {36193#(<= ~counter~0 11)} #65#return; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,800 INFO L272 TraceCheckUtils]: 308: Hoare triple {36193#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,800 INFO L290 TraceCheckUtils]: 309: Hoare triple {36193#(<= ~counter~0 11)} ~cond := #in~cond; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,801 INFO L290 TraceCheckUtils]: 310: Hoare triple {36193#(<= ~counter~0 11)} assume !(0 == ~cond); {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,801 INFO L290 TraceCheckUtils]: 311: Hoare triple {36193#(<= ~counter~0 11)} assume true; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,801 INFO L284 TraceCheckUtils]: 312: Hoare quadruple {36193#(<= ~counter~0 11)} {36193#(<= ~counter~0 11)} #67#return; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,802 INFO L290 TraceCheckUtils]: 313: Hoare triple {36193#(<= ~counter~0 11)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:52,803 INFO L290 TraceCheckUtils]: 314: Hoare triple {36193#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,803 INFO L290 TraceCheckUtils]: 315: Hoare triple {36278#(<= ~counter~0 12)} assume !!(#t~post5 < 50);havoc #t~post5; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,804 INFO L272 TraceCheckUtils]: 316: Hoare triple {36278#(<= ~counter~0 12)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,804 INFO L290 TraceCheckUtils]: 317: Hoare triple {36278#(<= ~counter~0 12)} ~cond := #in~cond; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,804 INFO L290 TraceCheckUtils]: 318: Hoare triple {36278#(<= ~counter~0 12)} assume !(0 == ~cond); {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,804 INFO L290 TraceCheckUtils]: 319: Hoare triple {36278#(<= ~counter~0 12)} assume true; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,805 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {36278#(<= ~counter~0 12)} {36278#(<= ~counter~0 12)} #59#return; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,806 INFO L272 TraceCheckUtils]: 321: Hoare triple {36278#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,806 INFO L290 TraceCheckUtils]: 322: Hoare triple {36278#(<= ~counter~0 12)} ~cond := #in~cond; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,806 INFO L290 TraceCheckUtils]: 323: Hoare triple {36278#(<= ~counter~0 12)} assume !(0 == ~cond); {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,806 INFO L290 TraceCheckUtils]: 324: Hoare triple {36278#(<= ~counter~0 12)} assume true; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,807 INFO L284 TraceCheckUtils]: 325: Hoare quadruple {36278#(<= ~counter~0 12)} {36278#(<= ~counter~0 12)} #61#return; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,807 INFO L272 TraceCheckUtils]: 326: Hoare triple {36278#(<= ~counter~0 12)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,808 INFO L290 TraceCheckUtils]: 327: Hoare triple {36278#(<= ~counter~0 12)} ~cond := #in~cond; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,808 INFO L290 TraceCheckUtils]: 328: Hoare triple {36278#(<= ~counter~0 12)} assume !(0 == ~cond); {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,808 INFO L290 TraceCheckUtils]: 329: Hoare triple {36278#(<= ~counter~0 12)} assume true; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,809 INFO L284 TraceCheckUtils]: 330: Hoare quadruple {36278#(<= ~counter~0 12)} {36278#(<= ~counter~0 12)} #63#return; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,809 INFO L272 TraceCheckUtils]: 331: Hoare triple {36278#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,810 INFO L290 TraceCheckUtils]: 332: Hoare triple {36278#(<= ~counter~0 12)} ~cond := #in~cond; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,810 INFO L290 TraceCheckUtils]: 333: Hoare triple {36278#(<= ~counter~0 12)} assume !(0 == ~cond); {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,810 INFO L290 TraceCheckUtils]: 334: Hoare triple {36278#(<= ~counter~0 12)} assume true; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,811 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {36278#(<= ~counter~0 12)} {36278#(<= ~counter~0 12)} #65#return; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,811 INFO L272 TraceCheckUtils]: 336: Hoare triple {36278#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,812 INFO L290 TraceCheckUtils]: 337: Hoare triple {36278#(<= ~counter~0 12)} ~cond := #in~cond; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,812 INFO L290 TraceCheckUtils]: 338: Hoare triple {36278#(<= ~counter~0 12)} assume !(0 == ~cond); {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,812 INFO L290 TraceCheckUtils]: 339: Hoare triple {36278#(<= ~counter~0 12)} assume true; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,813 INFO L284 TraceCheckUtils]: 340: Hoare quadruple {36278#(<= ~counter~0 12)} {36278#(<= ~counter~0 12)} #67#return; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,813 INFO L290 TraceCheckUtils]: 341: Hoare triple {36278#(<= ~counter~0 12)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:52,814 INFO L290 TraceCheckUtils]: 342: Hoare triple {36278#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,814 INFO L290 TraceCheckUtils]: 343: Hoare triple {36363#(<= ~counter~0 13)} assume !!(#t~post5 < 50);havoc #t~post5; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,815 INFO L272 TraceCheckUtils]: 344: Hoare triple {36363#(<= ~counter~0 13)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,815 INFO L290 TraceCheckUtils]: 345: Hoare triple {36363#(<= ~counter~0 13)} ~cond := #in~cond; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,815 INFO L290 TraceCheckUtils]: 346: Hoare triple {36363#(<= ~counter~0 13)} assume !(0 == ~cond); {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,816 INFO L290 TraceCheckUtils]: 347: Hoare triple {36363#(<= ~counter~0 13)} assume true; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,816 INFO L284 TraceCheckUtils]: 348: Hoare quadruple {36363#(<= ~counter~0 13)} {36363#(<= ~counter~0 13)} #59#return; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,817 INFO L272 TraceCheckUtils]: 349: Hoare triple {36363#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,817 INFO L290 TraceCheckUtils]: 350: Hoare triple {36363#(<= ~counter~0 13)} ~cond := #in~cond; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,817 INFO L290 TraceCheckUtils]: 351: Hoare triple {36363#(<= ~counter~0 13)} assume !(0 == ~cond); {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,817 INFO L290 TraceCheckUtils]: 352: Hoare triple {36363#(<= ~counter~0 13)} assume true; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,818 INFO L284 TraceCheckUtils]: 353: Hoare quadruple {36363#(<= ~counter~0 13)} {36363#(<= ~counter~0 13)} #61#return; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,818 INFO L272 TraceCheckUtils]: 354: Hoare triple {36363#(<= ~counter~0 13)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,819 INFO L290 TraceCheckUtils]: 355: Hoare triple {36363#(<= ~counter~0 13)} ~cond := #in~cond; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,819 INFO L290 TraceCheckUtils]: 356: Hoare triple {36363#(<= ~counter~0 13)} assume !(0 == ~cond); {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,819 INFO L290 TraceCheckUtils]: 357: Hoare triple {36363#(<= ~counter~0 13)} assume true; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,820 INFO L284 TraceCheckUtils]: 358: Hoare quadruple {36363#(<= ~counter~0 13)} {36363#(<= ~counter~0 13)} #63#return; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,820 INFO L272 TraceCheckUtils]: 359: Hoare triple {36363#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,821 INFO L290 TraceCheckUtils]: 360: Hoare triple {36363#(<= ~counter~0 13)} ~cond := #in~cond; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,821 INFO L290 TraceCheckUtils]: 361: Hoare triple {36363#(<= ~counter~0 13)} assume !(0 == ~cond); {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,821 INFO L290 TraceCheckUtils]: 362: Hoare triple {36363#(<= ~counter~0 13)} assume true; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,822 INFO L284 TraceCheckUtils]: 363: Hoare quadruple {36363#(<= ~counter~0 13)} {36363#(<= ~counter~0 13)} #65#return; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,822 INFO L272 TraceCheckUtils]: 364: Hoare triple {36363#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,823 INFO L290 TraceCheckUtils]: 365: Hoare triple {36363#(<= ~counter~0 13)} ~cond := #in~cond; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,823 INFO L290 TraceCheckUtils]: 366: Hoare triple {36363#(<= ~counter~0 13)} assume !(0 == ~cond); {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,823 INFO L290 TraceCheckUtils]: 367: Hoare triple {36363#(<= ~counter~0 13)} assume true; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,824 INFO L284 TraceCheckUtils]: 368: Hoare quadruple {36363#(<= ~counter~0 13)} {36363#(<= ~counter~0 13)} #67#return; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,824 INFO L290 TraceCheckUtils]: 369: Hoare triple {36363#(<= ~counter~0 13)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:52,825 INFO L290 TraceCheckUtils]: 370: Hoare triple {36363#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,825 INFO L290 TraceCheckUtils]: 371: Hoare triple {36448#(<= ~counter~0 14)} assume !!(#t~post5 < 50);havoc #t~post5; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,826 INFO L272 TraceCheckUtils]: 372: Hoare triple {36448#(<= ~counter~0 14)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,826 INFO L290 TraceCheckUtils]: 373: Hoare triple {36448#(<= ~counter~0 14)} ~cond := #in~cond; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,826 INFO L290 TraceCheckUtils]: 374: Hoare triple {36448#(<= ~counter~0 14)} assume !(0 == ~cond); {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,827 INFO L290 TraceCheckUtils]: 375: Hoare triple {36448#(<= ~counter~0 14)} assume true; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,827 INFO L284 TraceCheckUtils]: 376: Hoare quadruple {36448#(<= ~counter~0 14)} {36448#(<= ~counter~0 14)} #59#return; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,828 INFO L272 TraceCheckUtils]: 377: Hoare triple {36448#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,828 INFO L290 TraceCheckUtils]: 378: Hoare triple {36448#(<= ~counter~0 14)} ~cond := #in~cond; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,828 INFO L290 TraceCheckUtils]: 379: Hoare triple {36448#(<= ~counter~0 14)} assume !(0 == ~cond); {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,829 INFO L290 TraceCheckUtils]: 380: Hoare triple {36448#(<= ~counter~0 14)} assume true; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,829 INFO L284 TraceCheckUtils]: 381: Hoare quadruple {36448#(<= ~counter~0 14)} {36448#(<= ~counter~0 14)} #61#return; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,830 INFO L272 TraceCheckUtils]: 382: Hoare triple {36448#(<= ~counter~0 14)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,830 INFO L290 TraceCheckUtils]: 383: Hoare triple {36448#(<= ~counter~0 14)} ~cond := #in~cond; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,830 INFO L290 TraceCheckUtils]: 384: Hoare triple {36448#(<= ~counter~0 14)} assume !(0 == ~cond); {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,830 INFO L290 TraceCheckUtils]: 385: Hoare triple {36448#(<= ~counter~0 14)} assume true; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,831 INFO L284 TraceCheckUtils]: 386: Hoare quadruple {36448#(<= ~counter~0 14)} {36448#(<= ~counter~0 14)} #63#return; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,831 INFO L272 TraceCheckUtils]: 387: Hoare triple {36448#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,832 INFO L290 TraceCheckUtils]: 388: Hoare triple {36448#(<= ~counter~0 14)} ~cond := #in~cond; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,832 INFO L290 TraceCheckUtils]: 389: Hoare triple {36448#(<= ~counter~0 14)} assume !(0 == ~cond); {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,832 INFO L290 TraceCheckUtils]: 390: Hoare triple {36448#(<= ~counter~0 14)} assume true; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,833 INFO L284 TraceCheckUtils]: 391: Hoare quadruple {36448#(<= ~counter~0 14)} {36448#(<= ~counter~0 14)} #65#return; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,833 INFO L272 TraceCheckUtils]: 392: Hoare triple {36448#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,834 INFO L290 TraceCheckUtils]: 393: Hoare triple {36448#(<= ~counter~0 14)} ~cond := #in~cond; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,834 INFO L290 TraceCheckUtils]: 394: Hoare triple {36448#(<= ~counter~0 14)} assume !(0 == ~cond); {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,834 INFO L290 TraceCheckUtils]: 395: Hoare triple {36448#(<= ~counter~0 14)} assume true; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,835 INFO L284 TraceCheckUtils]: 396: Hoare quadruple {36448#(<= ~counter~0 14)} {36448#(<= ~counter~0 14)} #67#return; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,835 INFO L290 TraceCheckUtils]: 397: Hoare triple {36448#(<= ~counter~0 14)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:52,836 INFO L290 TraceCheckUtils]: 398: Hoare triple {36448#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,836 INFO L290 TraceCheckUtils]: 399: Hoare triple {36533#(<= ~counter~0 15)} assume !!(#t~post5 < 50);havoc #t~post5; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,837 INFO L272 TraceCheckUtils]: 400: Hoare triple {36533#(<= ~counter~0 15)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,837 INFO L290 TraceCheckUtils]: 401: Hoare triple {36533#(<= ~counter~0 15)} ~cond := #in~cond; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,837 INFO L290 TraceCheckUtils]: 402: Hoare triple {36533#(<= ~counter~0 15)} assume !(0 == ~cond); {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,838 INFO L290 TraceCheckUtils]: 403: Hoare triple {36533#(<= ~counter~0 15)} assume true; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,838 INFO L284 TraceCheckUtils]: 404: Hoare quadruple {36533#(<= ~counter~0 15)} {36533#(<= ~counter~0 15)} #59#return; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,839 INFO L272 TraceCheckUtils]: 405: Hoare triple {36533#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,839 INFO L290 TraceCheckUtils]: 406: Hoare triple {36533#(<= ~counter~0 15)} ~cond := #in~cond; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,839 INFO L290 TraceCheckUtils]: 407: Hoare triple {36533#(<= ~counter~0 15)} assume !(0 == ~cond); {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,840 INFO L290 TraceCheckUtils]: 408: Hoare triple {36533#(<= ~counter~0 15)} assume true; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,840 INFO L284 TraceCheckUtils]: 409: Hoare quadruple {36533#(<= ~counter~0 15)} {36533#(<= ~counter~0 15)} #61#return; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,841 INFO L272 TraceCheckUtils]: 410: Hoare triple {36533#(<= ~counter~0 15)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,841 INFO L290 TraceCheckUtils]: 411: Hoare triple {36533#(<= ~counter~0 15)} ~cond := #in~cond; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,841 INFO L290 TraceCheckUtils]: 412: Hoare triple {36533#(<= ~counter~0 15)} assume !(0 == ~cond); {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,841 INFO L290 TraceCheckUtils]: 413: Hoare triple {36533#(<= ~counter~0 15)} assume true; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,842 INFO L284 TraceCheckUtils]: 414: Hoare quadruple {36533#(<= ~counter~0 15)} {36533#(<= ~counter~0 15)} #63#return; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,842 INFO L272 TraceCheckUtils]: 415: Hoare triple {36533#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,843 INFO L290 TraceCheckUtils]: 416: Hoare triple {36533#(<= ~counter~0 15)} ~cond := #in~cond; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,843 INFO L290 TraceCheckUtils]: 417: Hoare triple {36533#(<= ~counter~0 15)} assume !(0 == ~cond); {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,843 INFO L290 TraceCheckUtils]: 418: Hoare triple {36533#(<= ~counter~0 15)} assume true; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,844 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {36533#(<= ~counter~0 15)} {36533#(<= ~counter~0 15)} #65#return; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,844 INFO L272 TraceCheckUtils]: 420: Hoare triple {36533#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,845 INFO L290 TraceCheckUtils]: 421: Hoare triple {36533#(<= ~counter~0 15)} ~cond := #in~cond; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,845 INFO L290 TraceCheckUtils]: 422: Hoare triple {36533#(<= ~counter~0 15)} assume !(0 == ~cond); {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,845 INFO L290 TraceCheckUtils]: 423: Hoare triple {36533#(<= ~counter~0 15)} assume true; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,846 INFO L284 TraceCheckUtils]: 424: Hoare quadruple {36533#(<= ~counter~0 15)} {36533#(<= ~counter~0 15)} #67#return; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,846 INFO L290 TraceCheckUtils]: 425: Hoare triple {36533#(<= ~counter~0 15)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:52,847 INFO L290 TraceCheckUtils]: 426: Hoare triple {36533#(<= ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,847 INFO L290 TraceCheckUtils]: 427: Hoare triple {36618#(<= ~counter~0 16)} assume !!(#t~post5 < 50);havoc #t~post5; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,848 INFO L272 TraceCheckUtils]: 428: Hoare triple {36618#(<= ~counter~0 16)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,848 INFO L290 TraceCheckUtils]: 429: Hoare triple {36618#(<= ~counter~0 16)} ~cond := #in~cond; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,848 INFO L290 TraceCheckUtils]: 430: Hoare triple {36618#(<= ~counter~0 16)} assume !(0 == ~cond); {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,849 INFO L290 TraceCheckUtils]: 431: Hoare triple {36618#(<= ~counter~0 16)} assume true; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,849 INFO L284 TraceCheckUtils]: 432: Hoare quadruple {36618#(<= ~counter~0 16)} {36618#(<= ~counter~0 16)} #59#return; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,850 INFO L272 TraceCheckUtils]: 433: Hoare triple {36618#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,850 INFO L290 TraceCheckUtils]: 434: Hoare triple {36618#(<= ~counter~0 16)} ~cond := #in~cond; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,850 INFO L290 TraceCheckUtils]: 435: Hoare triple {36618#(<= ~counter~0 16)} assume !(0 == ~cond); {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,851 INFO L290 TraceCheckUtils]: 436: Hoare triple {36618#(<= ~counter~0 16)} assume true; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,851 INFO L284 TraceCheckUtils]: 437: Hoare quadruple {36618#(<= ~counter~0 16)} {36618#(<= ~counter~0 16)} #61#return; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,852 INFO L272 TraceCheckUtils]: 438: Hoare triple {36618#(<= ~counter~0 16)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,852 INFO L290 TraceCheckUtils]: 439: Hoare triple {36618#(<= ~counter~0 16)} ~cond := #in~cond; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,852 INFO L290 TraceCheckUtils]: 440: Hoare triple {36618#(<= ~counter~0 16)} assume !(0 == ~cond); {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,852 INFO L290 TraceCheckUtils]: 441: Hoare triple {36618#(<= ~counter~0 16)} assume true; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,853 INFO L284 TraceCheckUtils]: 442: Hoare quadruple {36618#(<= ~counter~0 16)} {36618#(<= ~counter~0 16)} #63#return; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,853 INFO L272 TraceCheckUtils]: 443: Hoare triple {36618#(<= ~counter~0 16)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,854 INFO L290 TraceCheckUtils]: 444: Hoare triple {36618#(<= ~counter~0 16)} ~cond := #in~cond; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,854 INFO L290 TraceCheckUtils]: 445: Hoare triple {36618#(<= ~counter~0 16)} assume !(0 == ~cond); {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,854 INFO L290 TraceCheckUtils]: 446: Hoare triple {36618#(<= ~counter~0 16)} assume true; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,855 INFO L284 TraceCheckUtils]: 447: Hoare quadruple {36618#(<= ~counter~0 16)} {36618#(<= ~counter~0 16)} #65#return; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,855 INFO L272 TraceCheckUtils]: 448: Hoare triple {36618#(<= ~counter~0 16)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,856 INFO L290 TraceCheckUtils]: 449: Hoare triple {36618#(<= ~counter~0 16)} ~cond := #in~cond; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,856 INFO L290 TraceCheckUtils]: 450: Hoare triple {36618#(<= ~counter~0 16)} assume !(0 == ~cond); {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,856 INFO L290 TraceCheckUtils]: 451: Hoare triple {36618#(<= ~counter~0 16)} assume true; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,857 INFO L284 TraceCheckUtils]: 452: Hoare quadruple {36618#(<= ~counter~0 16)} {36618#(<= ~counter~0 16)} #67#return; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,857 INFO L290 TraceCheckUtils]: 453: Hoare triple {36618#(<= ~counter~0 16)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:52,858 INFO L290 TraceCheckUtils]: 454: Hoare triple {36618#(<= ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,858 INFO L290 TraceCheckUtils]: 455: Hoare triple {36703#(<= ~counter~0 17)} assume !!(#t~post5 < 50);havoc #t~post5; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,859 INFO L272 TraceCheckUtils]: 456: Hoare triple {36703#(<= ~counter~0 17)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,859 INFO L290 TraceCheckUtils]: 457: Hoare triple {36703#(<= ~counter~0 17)} ~cond := #in~cond; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,859 INFO L290 TraceCheckUtils]: 458: Hoare triple {36703#(<= ~counter~0 17)} assume !(0 == ~cond); {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,860 INFO L290 TraceCheckUtils]: 459: Hoare triple {36703#(<= ~counter~0 17)} assume true; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,860 INFO L284 TraceCheckUtils]: 460: Hoare quadruple {36703#(<= ~counter~0 17)} {36703#(<= ~counter~0 17)} #59#return; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,861 INFO L272 TraceCheckUtils]: 461: Hoare triple {36703#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,861 INFO L290 TraceCheckUtils]: 462: Hoare triple {36703#(<= ~counter~0 17)} ~cond := #in~cond; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,861 INFO L290 TraceCheckUtils]: 463: Hoare triple {36703#(<= ~counter~0 17)} assume !(0 == ~cond); {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,862 INFO L290 TraceCheckUtils]: 464: Hoare triple {36703#(<= ~counter~0 17)} assume true; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,862 INFO L284 TraceCheckUtils]: 465: Hoare quadruple {36703#(<= ~counter~0 17)} {36703#(<= ~counter~0 17)} #61#return; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,863 INFO L272 TraceCheckUtils]: 466: Hoare triple {36703#(<= ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,863 INFO L290 TraceCheckUtils]: 467: Hoare triple {36703#(<= ~counter~0 17)} ~cond := #in~cond; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,863 INFO L290 TraceCheckUtils]: 468: Hoare triple {36703#(<= ~counter~0 17)} assume !(0 == ~cond); {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,863 INFO L290 TraceCheckUtils]: 469: Hoare triple {36703#(<= ~counter~0 17)} assume true; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,864 INFO L284 TraceCheckUtils]: 470: Hoare quadruple {36703#(<= ~counter~0 17)} {36703#(<= ~counter~0 17)} #63#return; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,864 INFO L272 TraceCheckUtils]: 471: Hoare triple {36703#(<= ~counter~0 17)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,865 INFO L290 TraceCheckUtils]: 472: Hoare triple {36703#(<= ~counter~0 17)} ~cond := #in~cond; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,865 INFO L290 TraceCheckUtils]: 473: Hoare triple {36703#(<= ~counter~0 17)} assume !(0 == ~cond); {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,865 INFO L290 TraceCheckUtils]: 474: Hoare triple {36703#(<= ~counter~0 17)} assume true; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,866 INFO L284 TraceCheckUtils]: 475: Hoare quadruple {36703#(<= ~counter~0 17)} {36703#(<= ~counter~0 17)} #65#return; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,866 INFO L272 TraceCheckUtils]: 476: Hoare triple {36703#(<= ~counter~0 17)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,867 INFO L290 TraceCheckUtils]: 477: Hoare triple {36703#(<= ~counter~0 17)} ~cond := #in~cond; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,867 INFO L290 TraceCheckUtils]: 478: Hoare triple {36703#(<= ~counter~0 17)} assume !(0 == ~cond); {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,867 INFO L290 TraceCheckUtils]: 479: Hoare triple {36703#(<= ~counter~0 17)} assume true; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,868 INFO L284 TraceCheckUtils]: 480: Hoare quadruple {36703#(<= ~counter~0 17)} {36703#(<= ~counter~0 17)} #67#return; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,868 INFO L290 TraceCheckUtils]: 481: Hoare triple {36703#(<= ~counter~0 17)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:52,869 INFO L290 TraceCheckUtils]: 482: Hoare triple {36703#(<= ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,869 INFO L290 TraceCheckUtils]: 483: Hoare triple {36788#(<= ~counter~0 18)} assume !!(#t~post5 < 50);havoc #t~post5; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,870 INFO L272 TraceCheckUtils]: 484: Hoare triple {36788#(<= ~counter~0 18)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,870 INFO L290 TraceCheckUtils]: 485: Hoare triple {36788#(<= ~counter~0 18)} ~cond := #in~cond; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,870 INFO L290 TraceCheckUtils]: 486: Hoare triple {36788#(<= ~counter~0 18)} assume !(0 == ~cond); {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,871 INFO L290 TraceCheckUtils]: 487: Hoare triple {36788#(<= ~counter~0 18)} assume true; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,871 INFO L284 TraceCheckUtils]: 488: Hoare quadruple {36788#(<= ~counter~0 18)} {36788#(<= ~counter~0 18)} #59#return; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,872 INFO L272 TraceCheckUtils]: 489: Hoare triple {36788#(<= ~counter~0 18)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,872 INFO L290 TraceCheckUtils]: 490: Hoare triple {36788#(<= ~counter~0 18)} ~cond := #in~cond; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,872 INFO L290 TraceCheckUtils]: 491: Hoare triple {36788#(<= ~counter~0 18)} assume !(0 == ~cond); {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,873 INFO L290 TraceCheckUtils]: 492: Hoare triple {36788#(<= ~counter~0 18)} assume true; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,873 INFO L284 TraceCheckUtils]: 493: Hoare quadruple {36788#(<= ~counter~0 18)} {36788#(<= ~counter~0 18)} #61#return; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,874 INFO L272 TraceCheckUtils]: 494: Hoare triple {36788#(<= ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,874 INFO L290 TraceCheckUtils]: 495: Hoare triple {36788#(<= ~counter~0 18)} ~cond := #in~cond; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,874 INFO L290 TraceCheckUtils]: 496: Hoare triple {36788#(<= ~counter~0 18)} assume !(0 == ~cond); {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,874 INFO L290 TraceCheckUtils]: 497: Hoare triple {36788#(<= ~counter~0 18)} assume true; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,875 INFO L284 TraceCheckUtils]: 498: Hoare quadruple {36788#(<= ~counter~0 18)} {36788#(<= ~counter~0 18)} #63#return; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,875 INFO L272 TraceCheckUtils]: 499: Hoare triple {36788#(<= ~counter~0 18)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,876 INFO L290 TraceCheckUtils]: 500: Hoare triple {36788#(<= ~counter~0 18)} ~cond := #in~cond; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,876 INFO L290 TraceCheckUtils]: 501: Hoare triple {36788#(<= ~counter~0 18)} assume !(0 == ~cond); {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,876 INFO L290 TraceCheckUtils]: 502: Hoare triple {36788#(<= ~counter~0 18)} assume true; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,877 INFO L284 TraceCheckUtils]: 503: Hoare quadruple {36788#(<= ~counter~0 18)} {36788#(<= ~counter~0 18)} #65#return; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,877 INFO L272 TraceCheckUtils]: 504: Hoare triple {36788#(<= ~counter~0 18)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,878 INFO L290 TraceCheckUtils]: 505: Hoare triple {36788#(<= ~counter~0 18)} ~cond := #in~cond; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,878 INFO L290 TraceCheckUtils]: 506: Hoare triple {36788#(<= ~counter~0 18)} assume !(0 == ~cond); {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,878 INFO L290 TraceCheckUtils]: 507: Hoare triple {36788#(<= ~counter~0 18)} assume true; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,879 INFO L284 TraceCheckUtils]: 508: Hoare quadruple {36788#(<= ~counter~0 18)} {36788#(<= ~counter~0 18)} #67#return; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,879 INFO L290 TraceCheckUtils]: 509: Hoare triple {36788#(<= ~counter~0 18)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:52,880 INFO L290 TraceCheckUtils]: 510: Hoare triple {36788#(<= ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,880 INFO L290 TraceCheckUtils]: 511: Hoare triple {36873#(<= ~counter~0 19)} assume !!(#t~post5 < 50);havoc #t~post5; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,881 INFO L272 TraceCheckUtils]: 512: Hoare triple {36873#(<= ~counter~0 19)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,881 INFO L290 TraceCheckUtils]: 513: Hoare triple {36873#(<= ~counter~0 19)} ~cond := #in~cond; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,882 INFO L290 TraceCheckUtils]: 514: Hoare triple {36873#(<= ~counter~0 19)} assume !(0 == ~cond); {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,882 INFO L290 TraceCheckUtils]: 515: Hoare triple {36873#(<= ~counter~0 19)} assume true; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,882 INFO L284 TraceCheckUtils]: 516: Hoare quadruple {36873#(<= ~counter~0 19)} {36873#(<= ~counter~0 19)} #59#return; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,883 INFO L272 TraceCheckUtils]: 517: Hoare triple {36873#(<= ~counter~0 19)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,883 INFO L290 TraceCheckUtils]: 518: Hoare triple {36873#(<= ~counter~0 19)} ~cond := #in~cond; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,883 INFO L290 TraceCheckUtils]: 519: Hoare triple {36873#(<= ~counter~0 19)} assume !(0 == ~cond); {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,884 INFO L290 TraceCheckUtils]: 520: Hoare triple {36873#(<= ~counter~0 19)} assume true; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,884 INFO L284 TraceCheckUtils]: 521: Hoare quadruple {36873#(<= ~counter~0 19)} {36873#(<= ~counter~0 19)} #61#return; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,885 INFO L272 TraceCheckUtils]: 522: Hoare triple {36873#(<= ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,885 INFO L290 TraceCheckUtils]: 523: Hoare triple {36873#(<= ~counter~0 19)} ~cond := #in~cond; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,885 INFO L290 TraceCheckUtils]: 524: Hoare triple {36873#(<= ~counter~0 19)} assume !(0 == ~cond); {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,886 INFO L290 TraceCheckUtils]: 525: Hoare triple {36873#(<= ~counter~0 19)} assume true; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,886 INFO L284 TraceCheckUtils]: 526: Hoare quadruple {36873#(<= ~counter~0 19)} {36873#(<= ~counter~0 19)} #63#return; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,887 INFO L272 TraceCheckUtils]: 527: Hoare triple {36873#(<= ~counter~0 19)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,887 INFO L290 TraceCheckUtils]: 528: Hoare triple {36873#(<= ~counter~0 19)} ~cond := #in~cond; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,887 INFO L290 TraceCheckUtils]: 529: Hoare triple {36873#(<= ~counter~0 19)} assume !(0 == ~cond); {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,887 INFO L290 TraceCheckUtils]: 530: Hoare triple {36873#(<= ~counter~0 19)} assume true; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,888 INFO L284 TraceCheckUtils]: 531: Hoare quadruple {36873#(<= ~counter~0 19)} {36873#(<= ~counter~0 19)} #65#return; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,888 INFO L272 TraceCheckUtils]: 532: Hoare triple {36873#(<= ~counter~0 19)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,889 INFO L290 TraceCheckUtils]: 533: Hoare triple {36873#(<= ~counter~0 19)} ~cond := #in~cond; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,889 INFO L290 TraceCheckUtils]: 534: Hoare triple {36873#(<= ~counter~0 19)} assume !(0 == ~cond); {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,889 INFO L290 TraceCheckUtils]: 535: Hoare triple {36873#(<= ~counter~0 19)} assume true; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,890 INFO L284 TraceCheckUtils]: 536: Hoare quadruple {36873#(<= ~counter~0 19)} {36873#(<= ~counter~0 19)} #67#return; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,890 INFO L290 TraceCheckUtils]: 537: Hoare triple {36873#(<= ~counter~0 19)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:52,891 INFO L290 TraceCheckUtils]: 538: Hoare triple {36873#(<= ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,892 INFO L290 TraceCheckUtils]: 539: Hoare triple {36958#(<= ~counter~0 20)} assume !!(#t~post5 < 50);havoc #t~post5; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,892 INFO L272 TraceCheckUtils]: 540: Hoare triple {36958#(<= ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,892 INFO L290 TraceCheckUtils]: 541: Hoare triple {36958#(<= ~counter~0 20)} ~cond := #in~cond; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,893 INFO L290 TraceCheckUtils]: 542: Hoare triple {36958#(<= ~counter~0 20)} assume !(0 == ~cond); {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,893 INFO L290 TraceCheckUtils]: 543: Hoare triple {36958#(<= ~counter~0 20)} assume true; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,893 INFO L284 TraceCheckUtils]: 544: Hoare quadruple {36958#(<= ~counter~0 20)} {36958#(<= ~counter~0 20)} #59#return; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,894 INFO L272 TraceCheckUtils]: 545: Hoare triple {36958#(<= ~counter~0 20)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,894 INFO L290 TraceCheckUtils]: 546: Hoare triple {36958#(<= ~counter~0 20)} ~cond := #in~cond; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,895 INFO L290 TraceCheckUtils]: 547: Hoare triple {36958#(<= ~counter~0 20)} assume !(0 == ~cond); {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,895 INFO L290 TraceCheckUtils]: 548: Hoare triple {36958#(<= ~counter~0 20)} assume true; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,895 INFO L284 TraceCheckUtils]: 549: Hoare quadruple {36958#(<= ~counter~0 20)} {36958#(<= ~counter~0 20)} #61#return; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,896 INFO L272 TraceCheckUtils]: 550: Hoare triple {36958#(<= ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,896 INFO L290 TraceCheckUtils]: 551: Hoare triple {36958#(<= ~counter~0 20)} ~cond := #in~cond; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,896 INFO L290 TraceCheckUtils]: 552: Hoare triple {36958#(<= ~counter~0 20)} assume !(0 == ~cond); {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,897 INFO L290 TraceCheckUtils]: 553: Hoare triple {36958#(<= ~counter~0 20)} assume true; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,897 INFO L284 TraceCheckUtils]: 554: Hoare quadruple {36958#(<= ~counter~0 20)} {36958#(<= ~counter~0 20)} #63#return; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,898 INFO L272 TraceCheckUtils]: 555: Hoare triple {36958#(<= ~counter~0 20)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,898 INFO L290 TraceCheckUtils]: 556: Hoare triple {36958#(<= ~counter~0 20)} ~cond := #in~cond; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,898 INFO L290 TraceCheckUtils]: 557: Hoare triple {36958#(<= ~counter~0 20)} assume !(0 == ~cond); {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,899 INFO L290 TraceCheckUtils]: 558: Hoare triple {36958#(<= ~counter~0 20)} assume true; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,899 INFO L284 TraceCheckUtils]: 559: Hoare quadruple {36958#(<= ~counter~0 20)} {36958#(<= ~counter~0 20)} #65#return; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,900 INFO L272 TraceCheckUtils]: 560: Hoare triple {36958#(<= ~counter~0 20)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,900 INFO L290 TraceCheckUtils]: 561: Hoare triple {36958#(<= ~counter~0 20)} ~cond := #in~cond; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,900 INFO L290 TraceCheckUtils]: 562: Hoare triple {36958#(<= ~counter~0 20)} assume !(0 == ~cond); {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,900 INFO L290 TraceCheckUtils]: 563: Hoare triple {36958#(<= ~counter~0 20)} assume true; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,901 INFO L284 TraceCheckUtils]: 564: Hoare quadruple {36958#(<= ~counter~0 20)} {36958#(<= ~counter~0 20)} #67#return; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,901 INFO L290 TraceCheckUtils]: 565: Hoare triple {36958#(<= ~counter~0 20)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:52,902 INFO L290 TraceCheckUtils]: 566: Hoare triple {36958#(<= ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,902 INFO L290 TraceCheckUtils]: 567: Hoare triple {37043#(<= ~counter~0 21)} assume !!(#t~post5 < 50);havoc #t~post5; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,903 INFO L272 TraceCheckUtils]: 568: Hoare triple {37043#(<= ~counter~0 21)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,903 INFO L290 TraceCheckUtils]: 569: Hoare triple {37043#(<= ~counter~0 21)} ~cond := #in~cond; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,904 INFO L290 TraceCheckUtils]: 570: Hoare triple {37043#(<= ~counter~0 21)} assume !(0 == ~cond); {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,904 INFO L290 TraceCheckUtils]: 571: Hoare triple {37043#(<= ~counter~0 21)} assume true; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,904 INFO L284 TraceCheckUtils]: 572: Hoare quadruple {37043#(<= ~counter~0 21)} {37043#(<= ~counter~0 21)} #59#return; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,905 INFO L272 TraceCheckUtils]: 573: Hoare triple {37043#(<= ~counter~0 21)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,905 INFO L290 TraceCheckUtils]: 574: Hoare triple {37043#(<= ~counter~0 21)} ~cond := #in~cond; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,906 INFO L290 TraceCheckUtils]: 575: Hoare triple {37043#(<= ~counter~0 21)} assume !(0 == ~cond); {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,906 INFO L290 TraceCheckUtils]: 576: Hoare triple {37043#(<= ~counter~0 21)} assume true; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,906 INFO L284 TraceCheckUtils]: 577: Hoare quadruple {37043#(<= ~counter~0 21)} {37043#(<= ~counter~0 21)} #61#return; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,907 INFO L272 TraceCheckUtils]: 578: Hoare triple {37043#(<= ~counter~0 21)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,907 INFO L290 TraceCheckUtils]: 579: Hoare triple {37043#(<= ~counter~0 21)} ~cond := #in~cond; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,907 INFO L290 TraceCheckUtils]: 580: Hoare triple {37043#(<= ~counter~0 21)} assume !(0 == ~cond); {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,908 INFO L290 TraceCheckUtils]: 581: Hoare triple {37043#(<= ~counter~0 21)} assume true; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,908 INFO L284 TraceCheckUtils]: 582: Hoare quadruple {37043#(<= ~counter~0 21)} {37043#(<= ~counter~0 21)} #63#return; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,909 INFO L272 TraceCheckUtils]: 583: Hoare triple {37043#(<= ~counter~0 21)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,909 INFO L290 TraceCheckUtils]: 584: Hoare triple {37043#(<= ~counter~0 21)} ~cond := #in~cond; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,909 INFO L290 TraceCheckUtils]: 585: Hoare triple {37043#(<= ~counter~0 21)} assume !(0 == ~cond); {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,910 INFO L290 TraceCheckUtils]: 586: Hoare triple {37043#(<= ~counter~0 21)} assume true; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,910 INFO L284 TraceCheckUtils]: 587: Hoare quadruple {37043#(<= ~counter~0 21)} {37043#(<= ~counter~0 21)} #65#return; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,911 INFO L272 TraceCheckUtils]: 588: Hoare triple {37043#(<= ~counter~0 21)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,911 INFO L290 TraceCheckUtils]: 589: Hoare triple {37043#(<= ~counter~0 21)} ~cond := #in~cond; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,911 INFO L290 TraceCheckUtils]: 590: Hoare triple {37043#(<= ~counter~0 21)} assume !(0 == ~cond); {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,912 INFO L290 TraceCheckUtils]: 591: Hoare triple {37043#(<= ~counter~0 21)} assume true; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,912 INFO L284 TraceCheckUtils]: 592: Hoare quadruple {37043#(<= ~counter~0 21)} {37043#(<= ~counter~0 21)} #67#return; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,912 INFO L290 TraceCheckUtils]: 593: Hoare triple {37043#(<= ~counter~0 21)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:52,914 INFO L290 TraceCheckUtils]: 594: Hoare triple {37043#(<= ~counter~0 21)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,914 INFO L290 TraceCheckUtils]: 595: Hoare triple {37128#(<= ~counter~0 22)} assume !!(#t~post5 < 50);havoc #t~post5; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,914 INFO L272 TraceCheckUtils]: 596: Hoare triple {37128#(<= ~counter~0 22)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,915 INFO L290 TraceCheckUtils]: 597: Hoare triple {37128#(<= ~counter~0 22)} ~cond := #in~cond; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,915 INFO L290 TraceCheckUtils]: 598: Hoare triple {37128#(<= ~counter~0 22)} assume !(0 == ~cond); {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,915 INFO L290 TraceCheckUtils]: 599: Hoare triple {37128#(<= ~counter~0 22)} assume true; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,916 INFO L284 TraceCheckUtils]: 600: Hoare quadruple {37128#(<= ~counter~0 22)} {37128#(<= ~counter~0 22)} #59#return; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,916 INFO L272 TraceCheckUtils]: 601: Hoare triple {37128#(<= ~counter~0 22)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,917 INFO L290 TraceCheckUtils]: 602: Hoare triple {37128#(<= ~counter~0 22)} ~cond := #in~cond; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,917 INFO L290 TraceCheckUtils]: 603: Hoare triple {37128#(<= ~counter~0 22)} assume !(0 == ~cond); {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,917 INFO L290 TraceCheckUtils]: 604: Hoare triple {37128#(<= ~counter~0 22)} assume true; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,918 INFO L284 TraceCheckUtils]: 605: Hoare quadruple {37128#(<= ~counter~0 22)} {37128#(<= ~counter~0 22)} #61#return; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,918 INFO L272 TraceCheckUtils]: 606: Hoare triple {37128#(<= ~counter~0 22)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,918 INFO L290 TraceCheckUtils]: 607: Hoare triple {37128#(<= ~counter~0 22)} ~cond := #in~cond; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,919 INFO L290 TraceCheckUtils]: 608: Hoare triple {37128#(<= ~counter~0 22)} assume !(0 == ~cond); {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,919 INFO L290 TraceCheckUtils]: 609: Hoare triple {37128#(<= ~counter~0 22)} assume true; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,919 INFO L284 TraceCheckUtils]: 610: Hoare quadruple {37128#(<= ~counter~0 22)} {37128#(<= ~counter~0 22)} #63#return; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,920 INFO L272 TraceCheckUtils]: 611: Hoare triple {37128#(<= ~counter~0 22)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,920 INFO L290 TraceCheckUtils]: 612: Hoare triple {37128#(<= ~counter~0 22)} ~cond := #in~cond; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,920 INFO L290 TraceCheckUtils]: 613: Hoare triple {37128#(<= ~counter~0 22)} assume !(0 == ~cond); {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,921 INFO L290 TraceCheckUtils]: 614: Hoare triple {37128#(<= ~counter~0 22)} assume true; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,921 INFO L284 TraceCheckUtils]: 615: Hoare quadruple {37128#(<= ~counter~0 22)} {37128#(<= ~counter~0 22)} #65#return; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,922 INFO L272 TraceCheckUtils]: 616: Hoare triple {37128#(<= ~counter~0 22)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,922 INFO L290 TraceCheckUtils]: 617: Hoare triple {37128#(<= ~counter~0 22)} ~cond := #in~cond; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,922 INFO L290 TraceCheckUtils]: 618: Hoare triple {37128#(<= ~counter~0 22)} assume !(0 == ~cond); {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,923 INFO L290 TraceCheckUtils]: 619: Hoare triple {37128#(<= ~counter~0 22)} assume true; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,923 INFO L284 TraceCheckUtils]: 620: Hoare quadruple {37128#(<= ~counter~0 22)} {37128#(<= ~counter~0 22)} #67#return; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,923 INFO L290 TraceCheckUtils]: 621: Hoare triple {37128#(<= ~counter~0 22)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:52,924 INFO L290 TraceCheckUtils]: 622: Hoare triple {37128#(<= ~counter~0 22)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,925 INFO L290 TraceCheckUtils]: 623: Hoare triple {37213#(<= ~counter~0 23)} assume !!(#t~post5 < 50);havoc #t~post5; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,925 INFO L272 TraceCheckUtils]: 624: Hoare triple {37213#(<= ~counter~0 23)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,926 INFO L290 TraceCheckUtils]: 625: Hoare triple {37213#(<= ~counter~0 23)} ~cond := #in~cond; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,926 INFO L290 TraceCheckUtils]: 626: Hoare triple {37213#(<= ~counter~0 23)} assume !(0 == ~cond); {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,926 INFO L290 TraceCheckUtils]: 627: Hoare triple {37213#(<= ~counter~0 23)} assume true; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,926 INFO L284 TraceCheckUtils]: 628: Hoare quadruple {37213#(<= ~counter~0 23)} {37213#(<= ~counter~0 23)} #59#return; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,927 INFO L272 TraceCheckUtils]: 629: Hoare triple {37213#(<= ~counter~0 23)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,927 INFO L290 TraceCheckUtils]: 630: Hoare triple {37213#(<= ~counter~0 23)} ~cond := #in~cond; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,927 INFO L290 TraceCheckUtils]: 631: Hoare triple {37213#(<= ~counter~0 23)} assume !(0 == ~cond); {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,928 INFO L290 TraceCheckUtils]: 632: Hoare triple {37213#(<= ~counter~0 23)} assume true; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,928 INFO L284 TraceCheckUtils]: 633: Hoare quadruple {37213#(<= ~counter~0 23)} {37213#(<= ~counter~0 23)} #61#return; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,929 INFO L272 TraceCheckUtils]: 634: Hoare triple {37213#(<= ~counter~0 23)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,929 INFO L290 TraceCheckUtils]: 635: Hoare triple {37213#(<= ~counter~0 23)} ~cond := #in~cond; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,929 INFO L290 TraceCheckUtils]: 636: Hoare triple {37213#(<= ~counter~0 23)} assume !(0 == ~cond); {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,929 INFO L290 TraceCheckUtils]: 637: Hoare triple {37213#(<= ~counter~0 23)} assume true; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,930 INFO L284 TraceCheckUtils]: 638: Hoare quadruple {37213#(<= ~counter~0 23)} {37213#(<= ~counter~0 23)} #63#return; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,930 INFO L272 TraceCheckUtils]: 639: Hoare triple {37213#(<= ~counter~0 23)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,931 INFO L290 TraceCheckUtils]: 640: Hoare triple {37213#(<= ~counter~0 23)} ~cond := #in~cond; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,931 INFO L290 TraceCheckUtils]: 641: Hoare triple {37213#(<= ~counter~0 23)} assume !(0 == ~cond); {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,931 INFO L290 TraceCheckUtils]: 642: Hoare triple {37213#(<= ~counter~0 23)} assume true; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,932 INFO L284 TraceCheckUtils]: 643: Hoare quadruple {37213#(<= ~counter~0 23)} {37213#(<= ~counter~0 23)} #65#return; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,932 INFO L272 TraceCheckUtils]: 644: Hoare triple {37213#(<= ~counter~0 23)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,932 INFO L290 TraceCheckUtils]: 645: Hoare triple {37213#(<= ~counter~0 23)} ~cond := #in~cond; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,932 INFO L290 TraceCheckUtils]: 646: Hoare triple {37213#(<= ~counter~0 23)} assume !(0 == ~cond); {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,933 INFO L290 TraceCheckUtils]: 647: Hoare triple {37213#(<= ~counter~0 23)} assume true; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,933 INFO L284 TraceCheckUtils]: 648: Hoare quadruple {37213#(<= ~counter~0 23)} {37213#(<= ~counter~0 23)} #67#return; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,933 INFO L290 TraceCheckUtils]: 649: Hoare triple {37213#(<= ~counter~0 23)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:52,934 INFO L290 TraceCheckUtils]: 650: Hoare triple {37213#(<= ~counter~0 23)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,935 INFO L290 TraceCheckUtils]: 651: Hoare triple {37298#(<= ~counter~0 24)} assume !!(#t~post5 < 50);havoc #t~post5; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,935 INFO L272 TraceCheckUtils]: 652: Hoare triple {37298#(<= ~counter~0 24)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,935 INFO L290 TraceCheckUtils]: 653: Hoare triple {37298#(<= ~counter~0 24)} ~cond := #in~cond; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,936 INFO L290 TraceCheckUtils]: 654: Hoare triple {37298#(<= ~counter~0 24)} assume !(0 == ~cond); {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,936 INFO L290 TraceCheckUtils]: 655: Hoare triple {37298#(<= ~counter~0 24)} assume true; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,936 INFO L284 TraceCheckUtils]: 656: Hoare quadruple {37298#(<= ~counter~0 24)} {37298#(<= ~counter~0 24)} #59#return; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,937 INFO L272 TraceCheckUtils]: 657: Hoare triple {37298#(<= ~counter~0 24)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,937 INFO L290 TraceCheckUtils]: 658: Hoare triple {37298#(<= ~counter~0 24)} ~cond := #in~cond; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,937 INFO L290 TraceCheckUtils]: 659: Hoare triple {37298#(<= ~counter~0 24)} assume !(0 == ~cond); {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,938 INFO L290 TraceCheckUtils]: 660: Hoare triple {37298#(<= ~counter~0 24)} assume true; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,938 INFO L284 TraceCheckUtils]: 661: Hoare quadruple {37298#(<= ~counter~0 24)} {37298#(<= ~counter~0 24)} #61#return; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,939 INFO L272 TraceCheckUtils]: 662: Hoare triple {37298#(<= ~counter~0 24)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,939 INFO L290 TraceCheckUtils]: 663: Hoare triple {37298#(<= ~counter~0 24)} ~cond := #in~cond; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,939 INFO L290 TraceCheckUtils]: 664: Hoare triple {37298#(<= ~counter~0 24)} assume !(0 == ~cond); {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,939 INFO L290 TraceCheckUtils]: 665: Hoare triple {37298#(<= ~counter~0 24)} assume true; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,940 INFO L284 TraceCheckUtils]: 666: Hoare quadruple {37298#(<= ~counter~0 24)} {37298#(<= ~counter~0 24)} #63#return; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,940 INFO L272 TraceCheckUtils]: 667: Hoare triple {37298#(<= ~counter~0 24)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,941 INFO L290 TraceCheckUtils]: 668: Hoare triple {37298#(<= ~counter~0 24)} ~cond := #in~cond; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,941 INFO L290 TraceCheckUtils]: 669: Hoare triple {37298#(<= ~counter~0 24)} assume !(0 == ~cond); {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,941 INFO L290 TraceCheckUtils]: 670: Hoare triple {37298#(<= ~counter~0 24)} assume true; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,942 INFO L284 TraceCheckUtils]: 671: Hoare quadruple {37298#(<= ~counter~0 24)} {37298#(<= ~counter~0 24)} #65#return; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,942 INFO L272 TraceCheckUtils]: 672: Hoare triple {37298#(<= ~counter~0 24)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,942 INFO L290 TraceCheckUtils]: 673: Hoare triple {37298#(<= ~counter~0 24)} ~cond := #in~cond; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,943 INFO L290 TraceCheckUtils]: 674: Hoare triple {37298#(<= ~counter~0 24)} assume !(0 == ~cond); {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,943 INFO L290 TraceCheckUtils]: 675: Hoare triple {37298#(<= ~counter~0 24)} assume true; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,943 INFO L284 TraceCheckUtils]: 676: Hoare quadruple {37298#(<= ~counter~0 24)} {37298#(<= ~counter~0 24)} #67#return; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,944 INFO L290 TraceCheckUtils]: 677: Hoare triple {37298#(<= ~counter~0 24)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:52,944 INFO L290 TraceCheckUtils]: 678: Hoare triple {37298#(<= ~counter~0 24)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,945 INFO L290 TraceCheckUtils]: 679: Hoare triple {37383#(<= ~counter~0 25)} assume !!(#t~post5 < 50);havoc #t~post5; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,945 INFO L272 TraceCheckUtils]: 680: Hoare triple {37383#(<= ~counter~0 25)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,945 INFO L290 TraceCheckUtils]: 681: Hoare triple {37383#(<= ~counter~0 25)} ~cond := #in~cond; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,946 INFO L290 TraceCheckUtils]: 682: Hoare triple {37383#(<= ~counter~0 25)} assume !(0 == ~cond); {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,946 INFO L290 TraceCheckUtils]: 683: Hoare triple {37383#(<= ~counter~0 25)} assume true; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,946 INFO L284 TraceCheckUtils]: 684: Hoare quadruple {37383#(<= ~counter~0 25)} {37383#(<= ~counter~0 25)} #59#return; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,947 INFO L272 TraceCheckUtils]: 685: Hoare triple {37383#(<= ~counter~0 25)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,947 INFO L290 TraceCheckUtils]: 686: Hoare triple {37383#(<= ~counter~0 25)} ~cond := #in~cond; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,947 INFO L290 TraceCheckUtils]: 687: Hoare triple {37383#(<= ~counter~0 25)} assume !(0 == ~cond); {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,948 INFO L290 TraceCheckUtils]: 688: Hoare triple {37383#(<= ~counter~0 25)} assume true; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,948 INFO L284 TraceCheckUtils]: 689: Hoare quadruple {37383#(<= ~counter~0 25)} {37383#(<= ~counter~0 25)} #61#return; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,948 INFO L272 TraceCheckUtils]: 690: Hoare triple {37383#(<= ~counter~0 25)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,949 INFO L290 TraceCheckUtils]: 691: Hoare triple {37383#(<= ~counter~0 25)} ~cond := #in~cond; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,949 INFO L290 TraceCheckUtils]: 692: Hoare triple {37383#(<= ~counter~0 25)} assume !(0 == ~cond); {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,949 INFO L290 TraceCheckUtils]: 693: Hoare triple {37383#(<= ~counter~0 25)} assume true; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,950 INFO L284 TraceCheckUtils]: 694: Hoare quadruple {37383#(<= ~counter~0 25)} {37383#(<= ~counter~0 25)} #63#return; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,950 INFO L272 TraceCheckUtils]: 695: Hoare triple {37383#(<= ~counter~0 25)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,950 INFO L290 TraceCheckUtils]: 696: Hoare triple {37383#(<= ~counter~0 25)} ~cond := #in~cond; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,951 INFO L290 TraceCheckUtils]: 697: Hoare triple {37383#(<= ~counter~0 25)} assume !(0 == ~cond); {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,951 INFO L290 TraceCheckUtils]: 698: Hoare triple {37383#(<= ~counter~0 25)} assume true; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,951 INFO L284 TraceCheckUtils]: 699: Hoare quadruple {37383#(<= ~counter~0 25)} {37383#(<= ~counter~0 25)} #65#return; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,952 INFO L272 TraceCheckUtils]: 700: Hoare triple {37383#(<= ~counter~0 25)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,952 INFO L290 TraceCheckUtils]: 701: Hoare triple {37383#(<= ~counter~0 25)} ~cond := #in~cond; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,952 INFO L290 TraceCheckUtils]: 702: Hoare triple {37383#(<= ~counter~0 25)} assume !(0 == ~cond); {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,953 INFO L290 TraceCheckUtils]: 703: Hoare triple {37383#(<= ~counter~0 25)} assume true; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,953 INFO L284 TraceCheckUtils]: 704: Hoare quadruple {37383#(<= ~counter~0 25)} {37383#(<= ~counter~0 25)} #67#return; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,953 INFO L290 TraceCheckUtils]: 705: Hoare triple {37383#(<= ~counter~0 25)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:52,954 INFO L290 TraceCheckUtils]: 706: Hoare triple {37383#(<= ~counter~0 25)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,954 INFO L290 TraceCheckUtils]: 707: Hoare triple {37468#(<= ~counter~0 26)} assume !!(#t~post5 < 50);havoc #t~post5; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,955 INFO L272 TraceCheckUtils]: 708: Hoare triple {37468#(<= ~counter~0 26)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,955 INFO L290 TraceCheckUtils]: 709: Hoare triple {37468#(<= ~counter~0 26)} ~cond := #in~cond; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,955 INFO L290 TraceCheckUtils]: 710: Hoare triple {37468#(<= ~counter~0 26)} assume !(0 == ~cond); {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,956 INFO L290 TraceCheckUtils]: 711: Hoare triple {37468#(<= ~counter~0 26)} assume true; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,956 INFO L284 TraceCheckUtils]: 712: Hoare quadruple {37468#(<= ~counter~0 26)} {37468#(<= ~counter~0 26)} #59#return; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,957 INFO L272 TraceCheckUtils]: 713: Hoare triple {37468#(<= ~counter~0 26)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,957 INFO L290 TraceCheckUtils]: 714: Hoare triple {37468#(<= ~counter~0 26)} ~cond := #in~cond; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,957 INFO L290 TraceCheckUtils]: 715: Hoare triple {37468#(<= ~counter~0 26)} assume !(0 == ~cond); {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,957 INFO L290 TraceCheckUtils]: 716: Hoare triple {37468#(<= ~counter~0 26)} assume true; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,958 INFO L284 TraceCheckUtils]: 717: Hoare quadruple {37468#(<= ~counter~0 26)} {37468#(<= ~counter~0 26)} #61#return; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,958 INFO L272 TraceCheckUtils]: 718: Hoare triple {37468#(<= ~counter~0 26)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,959 INFO L290 TraceCheckUtils]: 719: Hoare triple {37468#(<= ~counter~0 26)} ~cond := #in~cond; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,959 INFO L290 TraceCheckUtils]: 720: Hoare triple {37468#(<= ~counter~0 26)} assume !(0 == ~cond); {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,959 INFO L290 TraceCheckUtils]: 721: Hoare triple {37468#(<= ~counter~0 26)} assume true; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,959 INFO L284 TraceCheckUtils]: 722: Hoare quadruple {37468#(<= ~counter~0 26)} {37468#(<= ~counter~0 26)} #63#return; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,960 INFO L272 TraceCheckUtils]: 723: Hoare triple {37468#(<= ~counter~0 26)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,960 INFO L290 TraceCheckUtils]: 724: Hoare triple {37468#(<= ~counter~0 26)} ~cond := #in~cond; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,960 INFO L290 TraceCheckUtils]: 725: Hoare triple {37468#(<= ~counter~0 26)} assume !(0 == ~cond); {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,961 INFO L290 TraceCheckUtils]: 726: Hoare triple {37468#(<= ~counter~0 26)} assume true; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,961 INFO L284 TraceCheckUtils]: 727: Hoare quadruple {37468#(<= ~counter~0 26)} {37468#(<= ~counter~0 26)} #65#return; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,962 INFO L272 TraceCheckUtils]: 728: Hoare triple {37468#(<= ~counter~0 26)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,962 INFO L290 TraceCheckUtils]: 729: Hoare triple {37468#(<= ~counter~0 26)} ~cond := #in~cond; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,962 INFO L290 TraceCheckUtils]: 730: Hoare triple {37468#(<= ~counter~0 26)} assume !(0 == ~cond); {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,962 INFO L290 TraceCheckUtils]: 731: Hoare triple {37468#(<= ~counter~0 26)} assume true; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,963 INFO L284 TraceCheckUtils]: 732: Hoare quadruple {37468#(<= ~counter~0 26)} {37468#(<= ~counter~0 26)} #67#return; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,963 INFO L290 TraceCheckUtils]: 733: Hoare triple {37468#(<= ~counter~0 26)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:52,964 INFO L290 TraceCheckUtils]: 734: Hoare triple {37468#(<= ~counter~0 26)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,964 INFO L290 TraceCheckUtils]: 735: Hoare triple {37553#(<= ~counter~0 27)} assume !!(#t~post5 < 50);havoc #t~post5; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,965 INFO L272 TraceCheckUtils]: 736: Hoare triple {37553#(<= ~counter~0 27)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,965 INFO L290 TraceCheckUtils]: 737: Hoare triple {37553#(<= ~counter~0 27)} ~cond := #in~cond; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,965 INFO L290 TraceCheckUtils]: 738: Hoare triple {37553#(<= ~counter~0 27)} assume !(0 == ~cond); {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,966 INFO L290 TraceCheckUtils]: 739: Hoare triple {37553#(<= ~counter~0 27)} assume true; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,966 INFO L284 TraceCheckUtils]: 740: Hoare quadruple {37553#(<= ~counter~0 27)} {37553#(<= ~counter~0 27)} #59#return; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,966 INFO L272 TraceCheckUtils]: 741: Hoare triple {37553#(<= ~counter~0 27)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,967 INFO L290 TraceCheckUtils]: 742: Hoare triple {37553#(<= ~counter~0 27)} ~cond := #in~cond; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,967 INFO L290 TraceCheckUtils]: 743: Hoare triple {37553#(<= ~counter~0 27)} assume !(0 == ~cond); {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,967 INFO L290 TraceCheckUtils]: 744: Hoare triple {37553#(<= ~counter~0 27)} assume true; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,968 INFO L284 TraceCheckUtils]: 745: Hoare quadruple {37553#(<= ~counter~0 27)} {37553#(<= ~counter~0 27)} #61#return; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,968 INFO L272 TraceCheckUtils]: 746: Hoare triple {37553#(<= ~counter~0 27)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,971 INFO L290 TraceCheckUtils]: 747: Hoare triple {37553#(<= ~counter~0 27)} ~cond := #in~cond; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,972 INFO L290 TraceCheckUtils]: 748: Hoare triple {37553#(<= ~counter~0 27)} assume !(0 == ~cond); {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,972 INFO L290 TraceCheckUtils]: 749: Hoare triple {37553#(<= ~counter~0 27)} assume true; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,973 INFO L284 TraceCheckUtils]: 750: Hoare quadruple {37553#(<= ~counter~0 27)} {37553#(<= ~counter~0 27)} #63#return; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,973 INFO L272 TraceCheckUtils]: 751: Hoare triple {37553#(<= ~counter~0 27)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,974 INFO L290 TraceCheckUtils]: 752: Hoare triple {37553#(<= ~counter~0 27)} ~cond := #in~cond; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,974 INFO L290 TraceCheckUtils]: 753: Hoare triple {37553#(<= ~counter~0 27)} assume !(0 == ~cond); {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,974 INFO L290 TraceCheckUtils]: 754: Hoare triple {37553#(<= ~counter~0 27)} assume true; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,975 INFO L284 TraceCheckUtils]: 755: Hoare quadruple {37553#(<= ~counter~0 27)} {37553#(<= ~counter~0 27)} #65#return; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,976 INFO L272 TraceCheckUtils]: 756: Hoare triple {37553#(<= ~counter~0 27)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,976 INFO L290 TraceCheckUtils]: 757: Hoare triple {37553#(<= ~counter~0 27)} ~cond := #in~cond; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,976 INFO L290 TraceCheckUtils]: 758: Hoare triple {37553#(<= ~counter~0 27)} assume !(0 == ~cond); {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,977 INFO L290 TraceCheckUtils]: 759: Hoare triple {37553#(<= ~counter~0 27)} assume true; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,977 INFO L284 TraceCheckUtils]: 760: Hoare quadruple {37553#(<= ~counter~0 27)} {37553#(<= ~counter~0 27)} #67#return; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,978 INFO L290 TraceCheckUtils]: 761: Hoare triple {37553#(<= ~counter~0 27)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:52,979 INFO L290 TraceCheckUtils]: 762: Hoare triple {37553#(<= ~counter~0 27)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,979 INFO L290 TraceCheckUtils]: 763: Hoare triple {37638#(<= ~counter~0 28)} assume !!(#t~post5 < 50);havoc #t~post5; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,980 INFO L272 TraceCheckUtils]: 764: Hoare triple {37638#(<= ~counter~0 28)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,980 INFO L290 TraceCheckUtils]: 765: Hoare triple {37638#(<= ~counter~0 28)} ~cond := #in~cond; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,980 INFO L290 TraceCheckUtils]: 766: Hoare triple {37638#(<= ~counter~0 28)} assume !(0 == ~cond); {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,981 INFO L290 TraceCheckUtils]: 767: Hoare triple {37638#(<= ~counter~0 28)} assume true; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,981 INFO L284 TraceCheckUtils]: 768: Hoare quadruple {37638#(<= ~counter~0 28)} {37638#(<= ~counter~0 28)} #59#return; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,981 INFO L272 TraceCheckUtils]: 769: Hoare triple {37638#(<= ~counter~0 28)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,982 INFO L290 TraceCheckUtils]: 770: Hoare triple {37638#(<= ~counter~0 28)} ~cond := #in~cond; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,982 INFO L290 TraceCheckUtils]: 771: Hoare triple {37638#(<= ~counter~0 28)} assume !(0 == ~cond); {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,982 INFO L290 TraceCheckUtils]: 772: Hoare triple {37638#(<= ~counter~0 28)} assume true; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,983 INFO L284 TraceCheckUtils]: 773: Hoare quadruple {37638#(<= ~counter~0 28)} {37638#(<= ~counter~0 28)} #61#return; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,983 INFO L272 TraceCheckUtils]: 774: Hoare triple {37638#(<= ~counter~0 28)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,983 INFO L290 TraceCheckUtils]: 775: Hoare triple {37638#(<= ~counter~0 28)} ~cond := #in~cond; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,984 INFO L290 TraceCheckUtils]: 776: Hoare triple {37638#(<= ~counter~0 28)} assume !(0 == ~cond); {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,984 INFO L290 TraceCheckUtils]: 777: Hoare triple {37638#(<= ~counter~0 28)} assume true; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,984 INFO L284 TraceCheckUtils]: 778: Hoare quadruple {37638#(<= ~counter~0 28)} {37638#(<= ~counter~0 28)} #63#return; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,985 INFO L272 TraceCheckUtils]: 779: Hoare triple {37638#(<= ~counter~0 28)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,985 INFO L290 TraceCheckUtils]: 780: Hoare triple {37638#(<= ~counter~0 28)} ~cond := #in~cond; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,985 INFO L290 TraceCheckUtils]: 781: Hoare triple {37638#(<= ~counter~0 28)} assume !(0 == ~cond); {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,986 INFO L290 TraceCheckUtils]: 782: Hoare triple {37638#(<= ~counter~0 28)} assume true; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,986 INFO L284 TraceCheckUtils]: 783: Hoare quadruple {37638#(<= ~counter~0 28)} {37638#(<= ~counter~0 28)} #65#return; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,987 INFO L272 TraceCheckUtils]: 784: Hoare triple {37638#(<= ~counter~0 28)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:52,987 INFO L290 TraceCheckUtils]: 785: Hoare triple {37638#(<= ~counter~0 28)} ~cond := #in~cond; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:53,002 INFO L290 TraceCheckUtils]: 786: Hoare triple {37638#(<= ~counter~0 28)} assume !(0 == ~cond); {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:53,002 INFO L290 TraceCheckUtils]: 787: Hoare triple {37638#(<= ~counter~0 28)} assume true; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:53,003 INFO L284 TraceCheckUtils]: 788: Hoare quadruple {37638#(<= ~counter~0 28)} {37638#(<= ~counter~0 28)} #67#return; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:53,003 INFO L290 TraceCheckUtils]: 789: Hoare triple {37638#(<= ~counter~0 28)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:53,004 INFO L290 TraceCheckUtils]: 790: Hoare triple {37638#(<= ~counter~0 28)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,004 INFO L290 TraceCheckUtils]: 791: Hoare triple {37723#(<= ~counter~0 29)} assume !!(#t~post5 < 50);havoc #t~post5; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,005 INFO L272 TraceCheckUtils]: 792: Hoare triple {37723#(<= ~counter~0 29)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,005 INFO L290 TraceCheckUtils]: 793: Hoare triple {37723#(<= ~counter~0 29)} ~cond := #in~cond; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,005 INFO L290 TraceCheckUtils]: 794: Hoare triple {37723#(<= ~counter~0 29)} assume !(0 == ~cond); {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,006 INFO L290 TraceCheckUtils]: 795: Hoare triple {37723#(<= ~counter~0 29)} assume true; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,006 INFO L284 TraceCheckUtils]: 796: Hoare quadruple {37723#(<= ~counter~0 29)} {37723#(<= ~counter~0 29)} #59#return; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,006 INFO L272 TraceCheckUtils]: 797: Hoare triple {37723#(<= ~counter~0 29)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,007 INFO L290 TraceCheckUtils]: 798: Hoare triple {37723#(<= ~counter~0 29)} ~cond := #in~cond; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,007 INFO L290 TraceCheckUtils]: 799: Hoare triple {37723#(<= ~counter~0 29)} assume !(0 == ~cond); {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,007 INFO L290 TraceCheckUtils]: 800: Hoare triple {37723#(<= ~counter~0 29)} assume true; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,008 INFO L284 TraceCheckUtils]: 801: Hoare quadruple {37723#(<= ~counter~0 29)} {37723#(<= ~counter~0 29)} #61#return; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,008 INFO L272 TraceCheckUtils]: 802: Hoare triple {37723#(<= ~counter~0 29)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,008 INFO L290 TraceCheckUtils]: 803: Hoare triple {37723#(<= ~counter~0 29)} ~cond := #in~cond; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,008 INFO L290 TraceCheckUtils]: 804: Hoare triple {37723#(<= ~counter~0 29)} assume !(0 == ~cond); {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,009 INFO L290 TraceCheckUtils]: 805: Hoare triple {37723#(<= ~counter~0 29)} assume true; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,009 INFO L284 TraceCheckUtils]: 806: Hoare quadruple {37723#(<= ~counter~0 29)} {37723#(<= ~counter~0 29)} #63#return; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,010 INFO L272 TraceCheckUtils]: 807: Hoare triple {37723#(<= ~counter~0 29)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,010 INFO L290 TraceCheckUtils]: 808: Hoare triple {37723#(<= ~counter~0 29)} ~cond := #in~cond; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,010 INFO L290 TraceCheckUtils]: 809: Hoare triple {37723#(<= ~counter~0 29)} assume !(0 == ~cond); {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,010 INFO L290 TraceCheckUtils]: 810: Hoare triple {37723#(<= ~counter~0 29)} assume true; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,011 INFO L284 TraceCheckUtils]: 811: Hoare quadruple {37723#(<= ~counter~0 29)} {37723#(<= ~counter~0 29)} #65#return; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,011 INFO L272 TraceCheckUtils]: 812: Hoare triple {37723#(<= ~counter~0 29)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,011 INFO L290 TraceCheckUtils]: 813: Hoare triple {37723#(<= ~counter~0 29)} ~cond := #in~cond; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,012 INFO L290 TraceCheckUtils]: 814: Hoare triple {37723#(<= ~counter~0 29)} assume !(0 == ~cond); {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,012 INFO L290 TraceCheckUtils]: 815: Hoare triple {37723#(<= ~counter~0 29)} assume true; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,012 INFO L284 TraceCheckUtils]: 816: Hoare quadruple {37723#(<= ~counter~0 29)} {37723#(<= ~counter~0 29)} #67#return; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,013 INFO L290 TraceCheckUtils]: 817: Hoare triple {37723#(<= ~counter~0 29)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:53,014 INFO L290 TraceCheckUtils]: 818: Hoare triple {37723#(<= ~counter~0 29)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,014 INFO L290 TraceCheckUtils]: 819: Hoare triple {37808#(<= ~counter~0 30)} assume !!(#t~post5 < 50);havoc #t~post5; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,014 INFO L272 TraceCheckUtils]: 820: Hoare triple {37808#(<= ~counter~0 30)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,014 INFO L290 TraceCheckUtils]: 821: Hoare triple {37808#(<= ~counter~0 30)} ~cond := #in~cond; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,015 INFO L290 TraceCheckUtils]: 822: Hoare triple {37808#(<= ~counter~0 30)} assume !(0 == ~cond); {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,015 INFO L290 TraceCheckUtils]: 823: Hoare triple {37808#(<= ~counter~0 30)} assume true; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,015 INFO L284 TraceCheckUtils]: 824: Hoare quadruple {37808#(<= ~counter~0 30)} {37808#(<= ~counter~0 30)} #59#return; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,016 INFO L272 TraceCheckUtils]: 825: Hoare triple {37808#(<= ~counter~0 30)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,016 INFO L290 TraceCheckUtils]: 826: Hoare triple {37808#(<= ~counter~0 30)} ~cond := #in~cond; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,016 INFO L290 TraceCheckUtils]: 827: Hoare triple {37808#(<= ~counter~0 30)} assume !(0 == ~cond); {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,017 INFO L290 TraceCheckUtils]: 828: Hoare triple {37808#(<= ~counter~0 30)} assume true; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,017 INFO L284 TraceCheckUtils]: 829: Hoare quadruple {37808#(<= ~counter~0 30)} {37808#(<= ~counter~0 30)} #61#return; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,017 INFO L272 TraceCheckUtils]: 830: Hoare triple {37808#(<= ~counter~0 30)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,018 INFO L290 TraceCheckUtils]: 831: Hoare triple {37808#(<= ~counter~0 30)} ~cond := #in~cond; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,018 INFO L290 TraceCheckUtils]: 832: Hoare triple {37808#(<= ~counter~0 30)} assume !(0 == ~cond); {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,018 INFO L290 TraceCheckUtils]: 833: Hoare triple {37808#(<= ~counter~0 30)} assume true; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,019 INFO L284 TraceCheckUtils]: 834: Hoare quadruple {37808#(<= ~counter~0 30)} {37808#(<= ~counter~0 30)} #63#return; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,019 INFO L272 TraceCheckUtils]: 835: Hoare triple {37808#(<= ~counter~0 30)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,019 INFO L290 TraceCheckUtils]: 836: Hoare triple {37808#(<= ~counter~0 30)} ~cond := #in~cond; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,019 INFO L290 TraceCheckUtils]: 837: Hoare triple {37808#(<= ~counter~0 30)} assume !(0 == ~cond); {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,020 INFO L290 TraceCheckUtils]: 838: Hoare triple {37808#(<= ~counter~0 30)} assume true; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,020 INFO L284 TraceCheckUtils]: 839: Hoare quadruple {37808#(<= ~counter~0 30)} {37808#(<= ~counter~0 30)} #65#return; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,021 INFO L272 TraceCheckUtils]: 840: Hoare triple {37808#(<= ~counter~0 30)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,021 INFO L290 TraceCheckUtils]: 841: Hoare triple {37808#(<= ~counter~0 30)} ~cond := #in~cond; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,021 INFO L290 TraceCheckUtils]: 842: Hoare triple {37808#(<= ~counter~0 30)} assume !(0 == ~cond); {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,021 INFO L290 TraceCheckUtils]: 843: Hoare triple {37808#(<= ~counter~0 30)} assume true; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,022 INFO L284 TraceCheckUtils]: 844: Hoare quadruple {37808#(<= ~counter~0 30)} {37808#(<= ~counter~0 30)} #67#return; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,022 INFO L290 TraceCheckUtils]: 845: Hoare triple {37808#(<= ~counter~0 30)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:53,023 INFO L290 TraceCheckUtils]: 846: Hoare triple {37808#(<= ~counter~0 30)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,023 INFO L290 TraceCheckUtils]: 847: Hoare triple {37893#(<= ~counter~0 31)} assume !!(#t~post5 < 50);havoc #t~post5; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,024 INFO L272 TraceCheckUtils]: 848: Hoare triple {37893#(<= ~counter~0 31)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,024 INFO L290 TraceCheckUtils]: 849: Hoare triple {37893#(<= ~counter~0 31)} ~cond := #in~cond; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,024 INFO L290 TraceCheckUtils]: 850: Hoare triple {37893#(<= ~counter~0 31)} assume !(0 == ~cond); {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,024 INFO L290 TraceCheckUtils]: 851: Hoare triple {37893#(<= ~counter~0 31)} assume true; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,025 INFO L284 TraceCheckUtils]: 852: Hoare quadruple {37893#(<= ~counter~0 31)} {37893#(<= ~counter~0 31)} #59#return; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,025 INFO L272 TraceCheckUtils]: 853: Hoare triple {37893#(<= ~counter~0 31)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,026 INFO L290 TraceCheckUtils]: 854: Hoare triple {37893#(<= ~counter~0 31)} ~cond := #in~cond; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,026 INFO L290 TraceCheckUtils]: 855: Hoare triple {37893#(<= ~counter~0 31)} assume !(0 == ~cond); {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,026 INFO L290 TraceCheckUtils]: 856: Hoare triple {37893#(<= ~counter~0 31)} assume true; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,026 INFO L284 TraceCheckUtils]: 857: Hoare quadruple {37893#(<= ~counter~0 31)} {37893#(<= ~counter~0 31)} #61#return; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,027 INFO L272 TraceCheckUtils]: 858: Hoare triple {37893#(<= ~counter~0 31)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,027 INFO L290 TraceCheckUtils]: 859: Hoare triple {37893#(<= ~counter~0 31)} ~cond := #in~cond; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,027 INFO L290 TraceCheckUtils]: 860: Hoare triple {37893#(<= ~counter~0 31)} assume !(0 == ~cond); {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,028 INFO L290 TraceCheckUtils]: 861: Hoare triple {37893#(<= ~counter~0 31)} assume true; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,028 INFO L284 TraceCheckUtils]: 862: Hoare quadruple {37893#(<= ~counter~0 31)} {37893#(<= ~counter~0 31)} #63#return; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,028 INFO L272 TraceCheckUtils]: 863: Hoare triple {37893#(<= ~counter~0 31)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,029 INFO L290 TraceCheckUtils]: 864: Hoare triple {37893#(<= ~counter~0 31)} ~cond := #in~cond; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,029 INFO L290 TraceCheckUtils]: 865: Hoare triple {37893#(<= ~counter~0 31)} assume !(0 == ~cond); {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,029 INFO L290 TraceCheckUtils]: 866: Hoare triple {37893#(<= ~counter~0 31)} assume true; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,030 INFO L284 TraceCheckUtils]: 867: Hoare quadruple {37893#(<= ~counter~0 31)} {37893#(<= ~counter~0 31)} #65#return; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,030 INFO L272 TraceCheckUtils]: 868: Hoare triple {37893#(<= ~counter~0 31)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,030 INFO L290 TraceCheckUtils]: 869: Hoare triple {37893#(<= ~counter~0 31)} ~cond := #in~cond; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,031 INFO L290 TraceCheckUtils]: 870: Hoare triple {37893#(<= ~counter~0 31)} assume !(0 == ~cond); {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,031 INFO L290 TraceCheckUtils]: 871: Hoare triple {37893#(<= ~counter~0 31)} assume true; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,031 INFO L284 TraceCheckUtils]: 872: Hoare quadruple {37893#(<= ~counter~0 31)} {37893#(<= ~counter~0 31)} #67#return; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,032 INFO L290 TraceCheckUtils]: 873: Hoare triple {37893#(<= ~counter~0 31)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:53,033 INFO L290 TraceCheckUtils]: 874: Hoare triple {37893#(<= ~counter~0 31)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,033 INFO L290 TraceCheckUtils]: 875: Hoare triple {37978#(<= ~counter~0 32)} assume !!(#t~post5 < 50);havoc #t~post5; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,033 INFO L272 TraceCheckUtils]: 876: Hoare triple {37978#(<= ~counter~0 32)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,033 INFO L290 TraceCheckUtils]: 877: Hoare triple {37978#(<= ~counter~0 32)} ~cond := #in~cond; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,034 INFO L290 TraceCheckUtils]: 878: Hoare triple {37978#(<= ~counter~0 32)} assume !(0 == ~cond); {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,034 INFO L290 TraceCheckUtils]: 879: Hoare triple {37978#(<= ~counter~0 32)} assume true; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,034 INFO L284 TraceCheckUtils]: 880: Hoare quadruple {37978#(<= ~counter~0 32)} {37978#(<= ~counter~0 32)} #59#return; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,035 INFO L272 TraceCheckUtils]: 881: Hoare triple {37978#(<= ~counter~0 32)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,035 INFO L290 TraceCheckUtils]: 882: Hoare triple {37978#(<= ~counter~0 32)} ~cond := #in~cond; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,035 INFO L290 TraceCheckUtils]: 883: Hoare triple {37978#(<= ~counter~0 32)} assume !(0 == ~cond); {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,036 INFO L290 TraceCheckUtils]: 884: Hoare triple {37978#(<= ~counter~0 32)} assume true; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,036 INFO L284 TraceCheckUtils]: 885: Hoare quadruple {37978#(<= ~counter~0 32)} {37978#(<= ~counter~0 32)} #61#return; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,036 INFO L272 TraceCheckUtils]: 886: Hoare triple {37978#(<= ~counter~0 32)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,037 INFO L290 TraceCheckUtils]: 887: Hoare triple {37978#(<= ~counter~0 32)} ~cond := #in~cond; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,037 INFO L290 TraceCheckUtils]: 888: Hoare triple {37978#(<= ~counter~0 32)} assume !(0 == ~cond); {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,037 INFO L290 TraceCheckUtils]: 889: Hoare triple {37978#(<= ~counter~0 32)} assume true; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,038 INFO L284 TraceCheckUtils]: 890: Hoare quadruple {37978#(<= ~counter~0 32)} {37978#(<= ~counter~0 32)} #63#return; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,038 INFO L272 TraceCheckUtils]: 891: Hoare triple {37978#(<= ~counter~0 32)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,038 INFO L290 TraceCheckUtils]: 892: Hoare triple {37978#(<= ~counter~0 32)} ~cond := #in~cond; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,038 INFO L290 TraceCheckUtils]: 893: Hoare triple {37978#(<= ~counter~0 32)} assume !(0 == ~cond); {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,039 INFO L290 TraceCheckUtils]: 894: Hoare triple {37978#(<= ~counter~0 32)} assume true; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,039 INFO L284 TraceCheckUtils]: 895: Hoare quadruple {37978#(<= ~counter~0 32)} {37978#(<= ~counter~0 32)} #65#return; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,040 INFO L272 TraceCheckUtils]: 896: Hoare triple {37978#(<= ~counter~0 32)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,040 INFO L290 TraceCheckUtils]: 897: Hoare triple {37978#(<= ~counter~0 32)} ~cond := #in~cond; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,040 INFO L290 TraceCheckUtils]: 898: Hoare triple {37978#(<= ~counter~0 32)} assume !(0 == ~cond); {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,040 INFO L290 TraceCheckUtils]: 899: Hoare triple {37978#(<= ~counter~0 32)} assume true; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,041 INFO L284 TraceCheckUtils]: 900: Hoare quadruple {37978#(<= ~counter~0 32)} {37978#(<= ~counter~0 32)} #67#return; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,041 INFO L290 TraceCheckUtils]: 901: Hoare triple {37978#(<= ~counter~0 32)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:53,042 INFO L290 TraceCheckUtils]: 902: Hoare triple {37978#(<= ~counter~0 32)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,042 INFO L290 TraceCheckUtils]: 903: Hoare triple {38063#(<= ~counter~0 33)} assume !!(#t~post5 < 50);havoc #t~post5; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,043 INFO L272 TraceCheckUtils]: 904: Hoare triple {38063#(<= ~counter~0 33)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,043 INFO L290 TraceCheckUtils]: 905: Hoare triple {38063#(<= ~counter~0 33)} ~cond := #in~cond; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,043 INFO L290 TraceCheckUtils]: 906: Hoare triple {38063#(<= ~counter~0 33)} assume !(0 == ~cond); {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,043 INFO L290 TraceCheckUtils]: 907: Hoare triple {38063#(<= ~counter~0 33)} assume true; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,044 INFO L284 TraceCheckUtils]: 908: Hoare quadruple {38063#(<= ~counter~0 33)} {38063#(<= ~counter~0 33)} #59#return; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,044 INFO L272 TraceCheckUtils]: 909: Hoare triple {38063#(<= ~counter~0 33)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,045 INFO L290 TraceCheckUtils]: 910: Hoare triple {38063#(<= ~counter~0 33)} ~cond := #in~cond; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,045 INFO L290 TraceCheckUtils]: 911: Hoare triple {38063#(<= ~counter~0 33)} assume !(0 == ~cond); {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,045 INFO L290 TraceCheckUtils]: 912: Hoare triple {38063#(<= ~counter~0 33)} assume true; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,045 INFO L284 TraceCheckUtils]: 913: Hoare quadruple {38063#(<= ~counter~0 33)} {38063#(<= ~counter~0 33)} #61#return; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,046 INFO L272 TraceCheckUtils]: 914: Hoare triple {38063#(<= ~counter~0 33)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,046 INFO L290 TraceCheckUtils]: 915: Hoare triple {38063#(<= ~counter~0 33)} ~cond := #in~cond; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,046 INFO L290 TraceCheckUtils]: 916: Hoare triple {38063#(<= ~counter~0 33)} assume !(0 == ~cond); {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,047 INFO L290 TraceCheckUtils]: 917: Hoare triple {38063#(<= ~counter~0 33)} assume true; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,047 INFO L284 TraceCheckUtils]: 918: Hoare quadruple {38063#(<= ~counter~0 33)} {38063#(<= ~counter~0 33)} #63#return; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,047 INFO L272 TraceCheckUtils]: 919: Hoare triple {38063#(<= ~counter~0 33)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,048 INFO L290 TraceCheckUtils]: 920: Hoare triple {38063#(<= ~counter~0 33)} ~cond := #in~cond; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,048 INFO L290 TraceCheckUtils]: 921: Hoare triple {38063#(<= ~counter~0 33)} assume !(0 == ~cond); {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,048 INFO L290 TraceCheckUtils]: 922: Hoare triple {38063#(<= ~counter~0 33)} assume true; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,049 INFO L284 TraceCheckUtils]: 923: Hoare quadruple {38063#(<= ~counter~0 33)} {38063#(<= ~counter~0 33)} #65#return; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,049 INFO L272 TraceCheckUtils]: 924: Hoare triple {38063#(<= ~counter~0 33)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,049 INFO L290 TraceCheckUtils]: 925: Hoare triple {38063#(<= ~counter~0 33)} ~cond := #in~cond; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,050 INFO L290 TraceCheckUtils]: 926: Hoare triple {38063#(<= ~counter~0 33)} assume !(0 == ~cond); {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,050 INFO L290 TraceCheckUtils]: 927: Hoare triple {38063#(<= ~counter~0 33)} assume true; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,050 INFO L284 TraceCheckUtils]: 928: Hoare quadruple {38063#(<= ~counter~0 33)} {38063#(<= ~counter~0 33)} #67#return; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,051 INFO L290 TraceCheckUtils]: 929: Hoare triple {38063#(<= ~counter~0 33)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:53,052 INFO L290 TraceCheckUtils]: 930: Hoare triple {38063#(<= ~counter~0 33)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,052 INFO L290 TraceCheckUtils]: 931: Hoare triple {38148#(<= ~counter~0 34)} assume !!(#t~post5 < 50);havoc #t~post5; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,052 INFO L272 TraceCheckUtils]: 932: Hoare triple {38148#(<= ~counter~0 34)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,052 INFO L290 TraceCheckUtils]: 933: Hoare triple {38148#(<= ~counter~0 34)} ~cond := #in~cond; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,053 INFO L290 TraceCheckUtils]: 934: Hoare triple {38148#(<= ~counter~0 34)} assume !(0 == ~cond); {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,053 INFO L290 TraceCheckUtils]: 935: Hoare triple {38148#(<= ~counter~0 34)} assume true; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,053 INFO L284 TraceCheckUtils]: 936: Hoare quadruple {38148#(<= ~counter~0 34)} {38148#(<= ~counter~0 34)} #59#return; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,054 INFO L272 TraceCheckUtils]: 937: Hoare triple {38148#(<= ~counter~0 34)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,054 INFO L290 TraceCheckUtils]: 938: Hoare triple {38148#(<= ~counter~0 34)} ~cond := #in~cond; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,054 INFO L290 TraceCheckUtils]: 939: Hoare triple {38148#(<= ~counter~0 34)} assume !(0 == ~cond); {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,055 INFO L290 TraceCheckUtils]: 940: Hoare triple {38148#(<= ~counter~0 34)} assume true; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,055 INFO L284 TraceCheckUtils]: 941: Hoare quadruple {38148#(<= ~counter~0 34)} {38148#(<= ~counter~0 34)} #61#return; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,055 INFO L272 TraceCheckUtils]: 942: Hoare triple {38148#(<= ~counter~0 34)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,056 INFO L290 TraceCheckUtils]: 943: Hoare triple {38148#(<= ~counter~0 34)} ~cond := #in~cond; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,056 INFO L290 TraceCheckUtils]: 944: Hoare triple {38148#(<= ~counter~0 34)} assume !(0 == ~cond); {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,056 INFO L290 TraceCheckUtils]: 945: Hoare triple {38148#(<= ~counter~0 34)} assume true; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,057 INFO L284 TraceCheckUtils]: 946: Hoare quadruple {38148#(<= ~counter~0 34)} {38148#(<= ~counter~0 34)} #63#return; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,057 INFO L272 TraceCheckUtils]: 947: Hoare triple {38148#(<= ~counter~0 34)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,057 INFO L290 TraceCheckUtils]: 948: Hoare triple {38148#(<= ~counter~0 34)} ~cond := #in~cond; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,058 INFO L290 TraceCheckUtils]: 949: Hoare triple {38148#(<= ~counter~0 34)} assume !(0 == ~cond); {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,058 INFO L290 TraceCheckUtils]: 950: Hoare triple {38148#(<= ~counter~0 34)} assume true; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,058 INFO L284 TraceCheckUtils]: 951: Hoare quadruple {38148#(<= ~counter~0 34)} {38148#(<= ~counter~0 34)} #65#return; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,059 INFO L272 TraceCheckUtils]: 952: Hoare triple {38148#(<= ~counter~0 34)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,059 INFO L290 TraceCheckUtils]: 953: Hoare triple {38148#(<= ~counter~0 34)} ~cond := #in~cond; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,059 INFO L290 TraceCheckUtils]: 954: Hoare triple {38148#(<= ~counter~0 34)} assume !(0 == ~cond); {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,060 INFO L290 TraceCheckUtils]: 955: Hoare triple {38148#(<= ~counter~0 34)} assume true; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,060 INFO L284 TraceCheckUtils]: 956: Hoare quadruple {38148#(<= ~counter~0 34)} {38148#(<= ~counter~0 34)} #67#return; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,061 INFO L290 TraceCheckUtils]: 957: Hoare triple {38148#(<= ~counter~0 34)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:53,062 INFO L290 TraceCheckUtils]: 958: Hoare triple {38148#(<= ~counter~0 34)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,062 INFO L290 TraceCheckUtils]: 959: Hoare triple {38233#(<= ~counter~0 35)} assume !!(#t~post5 < 50);havoc #t~post5; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,063 INFO L272 TraceCheckUtils]: 960: Hoare triple {38233#(<= ~counter~0 35)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,063 INFO L290 TraceCheckUtils]: 961: Hoare triple {38233#(<= ~counter~0 35)} ~cond := #in~cond; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,063 INFO L290 TraceCheckUtils]: 962: Hoare triple {38233#(<= ~counter~0 35)} assume !(0 == ~cond); {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,064 INFO L290 TraceCheckUtils]: 963: Hoare triple {38233#(<= ~counter~0 35)} assume true; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,064 INFO L284 TraceCheckUtils]: 964: Hoare quadruple {38233#(<= ~counter~0 35)} {38233#(<= ~counter~0 35)} #59#return; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,065 INFO L272 TraceCheckUtils]: 965: Hoare triple {38233#(<= ~counter~0 35)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,065 INFO L290 TraceCheckUtils]: 966: Hoare triple {38233#(<= ~counter~0 35)} ~cond := #in~cond; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,065 INFO L290 TraceCheckUtils]: 967: Hoare triple {38233#(<= ~counter~0 35)} assume !(0 == ~cond); {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,066 INFO L290 TraceCheckUtils]: 968: Hoare triple {38233#(<= ~counter~0 35)} assume true; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,066 INFO L284 TraceCheckUtils]: 969: Hoare quadruple {38233#(<= ~counter~0 35)} {38233#(<= ~counter~0 35)} #61#return; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,067 INFO L272 TraceCheckUtils]: 970: Hoare triple {38233#(<= ~counter~0 35)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,067 INFO L290 TraceCheckUtils]: 971: Hoare triple {38233#(<= ~counter~0 35)} ~cond := #in~cond; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,068 INFO L290 TraceCheckUtils]: 972: Hoare triple {38233#(<= ~counter~0 35)} assume !(0 == ~cond); {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,068 INFO L290 TraceCheckUtils]: 973: Hoare triple {38233#(<= ~counter~0 35)} assume true; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,069 INFO L284 TraceCheckUtils]: 974: Hoare quadruple {38233#(<= ~counter~0 35)} {38233#(<= ~counter~0 35)} #63#return; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,069 INFO L272 TraceCheckUtils]: 975: Hoare triple {38233#(<= ~counter~0 35)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,070 INFO L290 TraceCheckUtils]: 976: Hoare triple {38233#(<= ~counter~0 35)} ~cond := #in~cond; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,070 INFO L290 TraceCheckUtils]: 977: Hoare triple {38233#(<= ~counter~0 35)} assume !(0 == ~cond); {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,070 INFO L290 TraceCheckUtils]: 978: Hoare triple {38233#(<= ~counter~0 35)} assume true; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,071 INFO L284 TraceCheckUtils]: 979: Hoare quadruple {38233#(<= ~counter~0 35)} {38233#(<= ~counter~0 35)} #65#return; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,072 INFO L272 TraceCheckUtils]: 980: Hoare triple {38233#(<= ~counter~0 35)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,072 INFO L290 TraceCheckUtils]: 981: Hoare triple {38233#(<= ~counter~0 35)} ~cond := #in~cond; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,072 INFO L290 TraceCheckUtils]: 982: Hoare triple {38233#(<= ~counter~0 35)} assume !(0 == ~cond); {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,073 INFO L290 TraceCheckUtils]: 983: Hoare triple {38233#(<= ~counter~0 35)} assume true; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,073 INFO L284 TraceCheckUtils]: 984: Hoare quadruple {38233#(<= ~counter~0 35)} {38233#(<= ~counter~0 35)} #67#return; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,074 INFO L290 TraceCheckUtils]: 985: Hoare triple {38233#(<= ~counter~0 35)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:53,075 INFO L290 TraceCheckUtils]: 986: Hoare triple {38233#(<= ~counter~0 35)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,075 INFO L290 TraceCheckUtils]: 987: Hoare triple {38318#(<= ~counter~0 36)} assume !!(#t~post5 < 50);havoc #t~post5; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,076 INFO L272 TraceCheckUtils]: 988: Hoare triple {38318#(<= ~counter~0 36)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,076 INFO L290 TraceCheckUtils]: 989: Hoare triple {38318#(<= ~counter~0 36)} ~cond := #in~cond; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,076 INFO L290 TraceCheckUtils]: 990: Hoare triple {38318#(<= ~counter~0 36)} assume !(0 == ~cond); {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,077 INFO L290 TraceCheckUtils]: 991: Hoare triple {38318#(<= ~counter~0 36)} assume true; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,077 INFO L284 TraceCheckUtils]: 992: Hoare quadruple {38318#(<= ~counter~0 36)} {38318#(<= ~counter~0 36)} #59#return; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,078 INFO L272 TraceCheckUtils]: 993: Hoare triple {38318#(<= ~counter~0 36)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,078 INFO L290 TraceCheckUtils]: 994: Hoare triple {38318#(<= ~counter~0 36)} ~cond := #in~cond; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,079 INFO L290 TraceCheckUtils]: 995: Hoare triple {38318#(<= ~counter~0 36)} assume !(0 == ~cond); {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,079 INFO L290 TraceCheckUtils]: 996: Hoare triple {38318#(<= ~counter~0 36)} assume true; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,080 INFO L284 TraceCheckUtils]: 997: Hoare quadruple {38318#(<= ~counter~0 36)} {38318#(<= ~counter~0 36)} #61#return; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,080 INFO L272 TraceCheckUtils]: 998: Hoare triple {38318#(<= ~counter~0 36)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,080 INFO L290 TraceCheckUtils]: 999: Hoare triple {38318#(<= ~counter~0 36)} ~cond := #in~cond; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,081 INFO L290 TraceCheckUtils]: 1,000: Hoare triple {38318#(<= ~counter~0 36)} assume !(0 == ~cond); {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,081 INFO L290 TraceCheckUtils]: 1,001: Hoare triple {38318#(<= ~counter~0 36)} assume true; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,082 INFO L284 TraceCheckUtils]: 1,002: Hoare quadruple {38318#(<= ~counter~0 36)} {38318#(<= ~counter~0 36)} #63#return; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,082 INFO L272 TraceCheckUtils]: 1,003: Hoare triple {38318#(<= ~counter~0 36)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,083 INFO L290 TraceCheckUtils]: 1,004: Hoare triple {38318#(<= ~counter~0 36)} ~cond := #in~cond; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,083 INFO L290 TraceCheckUtils]: 1,005: Hoare triple {38318#(<= ~counter~0 36)} assume !(0 == ~cond); {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,083 INFO L290 TraceCheckUtils]: 1,006: Hoare triple {38318#(<= ~counter~0 36)} assume true; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,084 INFO L284 TraceCheckUtils]: 1,007: Hoare quadruple {38318#(<= ~counter~0 36)} {38318#(<= ~counter~0 36)} #65#return; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,085 INFO L272 TraceCheckUtils]: 1,008: Hoare triple {38318#(<= ~counter~0 36)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,085 INFO L290 TraceCheckUtils]: 1,009: Hoare triple {38318#(<= ~counter~0 36)} ~cond := #in~cond; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,085 INFO L290 TraceCheckUtils]: 1,010: Hoare triple {38318#(<= ~counter~0 36)} assume !(0 == ~cond); {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,086 INFO L290 TraceCheckUtils]: 1,011: Hoare triple {38318#(<= ~counter~0 36)} assume true; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,086 INFO L284 TraceCheckUtils]: 1,012: Hoare quadruple {38318#(<= ~counter~0 36)} {38318#(<= ~counter~0 36)} #67#return; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,086 INFO L290 TraceCheckUtils]: 1,013: Hoare triple {38318#(<= ~counter~0 36)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:53,087 INFO L290 TraceCheckUtils]: 1,014: Hoare triple {38318#(<= ~counter~0 36)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,088 INFO L290 TraceCheckUtils]: 1,015: Hoare triple {38403#(<= ~counter~0 37)} assume !!(#t~post5 < 50);havoc #t~post5; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,088 INFO L272 TraceCheckUtils]: 1,016: Hoare triple {38403#(<= ~counter~0 37)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,089 INFO L290 TraceCheckUtils]: 1,017: Hoare triple {38403#(<= ~counter~0 37)} ~cond := #in~cond; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,089 INFO L290 TraceCheckUtils]: 1,018: Hoare triple {38403#(<= ~counter~0 37)} assume !(0 == ~cond); {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,089 INFO L290 TraceCheckUtils]: 1,019: Hoare triple {38403#(<= ~counter~0 37)} assume true; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,090 INFO L284 TraceCheckUtils]: 1,020: Hoare quadruple {38403#(<= ~counter~0 37)} {38403#(<= ~counter~0 37)} #59#return; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,090 INFO L272 TraceCheckUtils]: 1,021: Hoare triple {38403#(<= ~counter~0 37)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,091 INFO L290 TraceCheckUtils]: 1,022: Hoare triple {38403#(<= ~counter~0 37)} ~cond := #in~cond; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,091 INFO L290 TraceCheckUtils]: 1,023: Hoare triple {38403#(<= ~counter~0 37)} assume !(0 == ~cond); {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,091 INFO L290 TraceCheckUtils]: 1,024: Hoare triple {38403#(<= ~counter~0 37)} assume true; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,092 INFO L284 TraceCheckUtils]: 1,025: Hoare quadruple {38403#(<= ~counter~0 37)} {38403#(<= ~counter~0 37)} #61#return; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,093 INFO L272 TraceCheckUtils]: 1,026: Hoare triple {38403#(<= ~counter~0 37)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,093 INFO L290 TraceCheckUtils]: 1,027: Hoare triple {38403#(<= ~counter~0 37)} ~cond := #in~cond; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,093 INFO L290 TraceCheckUtils]: 1,028: Hoare triple {38403#(<= ~counter~0 37)} assume !(0 == ~cond); {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,094 INFO L290 TraceCheckUtils]: 1,029: Hoare triple {38403#(<= ~counter~0 37)} assume true; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,094 INFO L284 TraceCheckUtils]: 1,030: Hoare quadruple {38403#(<= ~counter~0 37)} {38403#(<= ~counter~0 37)} #63#return; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,095 INFO L272 TraceCheckUtils]: 1,031: Hoare triple {38403#(<= ~counter~0 37)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,095 INFO L290 TraceCheckUtils]: 1,032: Hoare triple {38403#(<= ~counter~0 37)} ~cond := #in~cond; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,095 INFO L290 TraceCheckUtils]: 1,033: Hoare triple {38403#(<= ~counter~0 37)} assume !(0 == ~cond); {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,096 INFO L290 TraceCheckUtils]: 1,034: Hoare triple {38403#(<= ~counter~0 37)} assume true; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,096 INFO L284 TraceCheckUtils]: 1,035: Hoare quadruple {38403#(<= ~counter~0 37)} {38403#(<= ~counter~0 37)} #65#return; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,097 INFO L272 TraceCheckUtils]: 1,036: Hoare triple {38403#(<= ~counter~0 37)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,097 INFO L290 TraceCheckUtils]: 1,037: Hoare triple {38403#(<= ~counter~0 37)} ~cond := #in~cond; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,098 INFO L290 TraceCheckUtils]: 1,038: Hoare triple {38403#(<= ~counter~0 37)} assume !(0 == ~cond); {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,098 INFO L290 TraceCheckUtils]: 1,039: Hoare triple {38403#(<= ~counter~0 37)} assume true; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,098 INFO L284 TraceCheckUtils]: 1,040: Hoare quadruple {38403#(<= ~counter~0 37)} {38403#(<= ~counter~0 37)} #67#return; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,099 INFO L290 TraceCheckUtils]: 1,041: Hoare triple {38403#(<= ~counter~0 37)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:53,100 INFO L290 TraceCheckUtils]: 1,042: Hoare triple {38403#(<= ~counter~0 37)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,100 INFO L290 TraceCheckUtils]: 1,043: Hoare triple {38488#(<= ~counter~0 38)} assume !!(#t~post5 < 50);havoc #t~post5; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,100 INFO L272 TraceCheckUtils]: 1,044: Hoare triple {38488#(<= ~counter~0 38)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,101 INFO L290 TraceCheckUtils]: 1,045: Hoare triple {38488#(<= ~counter~0 38)} ~cond := #in~cond; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,101 INFO L290 TraceCheckUtils]: 1,046: Hoare triple {38488#(<= ~counter~0 38)} assume !(0 == ~cond); {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,101 INFO L290 TraceCheckUtils]: 1,047: Hoare triple {38488#(<= ~counter~0 38)} assume true; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,101 INFO L284 TraceCheckUtils]: 1,048: Hoare quadruple {38488#(<= ~counter~0 38)} {38488#(<= ~counter~0 38)} #59#return; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,102 INFO L272 TraceCheckUtils]: 1,049: Hoare triple {38488#(<= ~counter~0 38)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,102 INFO L290 TraceCheckUtils]: 1,050: Hoare triple {38488#(<= ~counter~0 38)} ~cond := #in~cond; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,102 INFO L290 TraceCheckUtils]: 1,051: Hoare triple {38488#(<= ~counter~0 38)} assume !(0 == ~cond); {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,103 INFO L290 TraceCheckUtils]: 1,052: Hoare triple {38488#(<= ~counter~0 38)} assume true; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,103 INFO L284 TraceCheckUtils]: 1,053: Hoare quadruple {38488#(<= ~counter~0 38)} {38488#(<= ~counter~0 38)} #61#return; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,104 INFO L272 TraceCheckUtils]: 1,054: Hoare triple {38488#(<= ~counter~0 38)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,104 INFO L290 TraceCheckUtils]: 1,055: Hoare triple {38488#(<= ~counter~0 38)} ~cond := #in~cond; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,104 INFO L290 TraceCheckUtils]: 1,056: Hoare triple {38488#(<= ~counter~0 38)} assume !(0 == ~cond); {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,104 INFO L290 TraceCheckUtils]: 1,057: Hoare triple {38488#(<= ~counter~0 38)} assume true; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,105 INFO L284 TraceCheckUtils]: 1,058: Hoare quadruple {38488#(<= ~counter~0 38)} {38488#(<= ~counter~0 38)} #63#return; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,105 INFO L272 TraceCheckUtils]: 1,059: Hoare triple {38488#(<= ~counter~0 38)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,105 INFO L290 TraceCheckUtils]: 1,060: Hoare triple {38488#(<= ~counter~0 38)} ~cond := #in~cond; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,106 INFO L290 TraceCheckUtils]: 1,061: Hoare triple {38488#(<= ~counter~0 38)} assume !(0 == ~cond); {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,106 INFO L290 TraceCheckUtils]: 1,062: Hoare triple {38488#(<= ~counter~0 38)} assume true; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,106 INFO L284 TraceCheckUtils]: 1,063: Hoare quadruple {38488#(<= ~counter~0 38)} {38488#(<= ~counter~0 38)} #65#return; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,107 INFO L272 TraceCheckUtils]: 1,064: Hoare triple {38488#(<= ~counter~0 38)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,107 INFO L290 TraceCheckUtils]: 1,065: Hoare triple {38488#(<= ~counter~0 38)} ~cond := #in~cond; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,107 INFO L290 TraceCheckUtils]: 1,066: Hoare triple {38488#(<= ~counter~0 38)} assume !(0 == ~cond); {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,108 INFO L290 TraceCheckUtils]: 1,067: Hoare triple {38488#(<= ~counter~0 38)} assume true; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,108 INFO L284 TraceCheckUtils]: 1,068: Hoare quadruple {38488#(<= ~counter~0 38)} {38488#(<= ~counter~0 38)} #67#return; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,108 INFO L290 TraceCheckUtils]: 1,069: Hoare triple {38488#(<= ~counter~0 38)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:53,109 INFO L290 TraceCheckUtils]: 1,070: Hoare triple {38488#(<= ~counter~0 38)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,109 INFO L290 TraceCheckUtils]: 1,071: Hoare triple {38573#(<= ~counter~0 39)} assume !!(#t~post5 < 50);havoc #t~post5; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,110 INFO L272 TraceCheckUtils]: 1,072: Hoare triple {38573#(<= ~counter~0 39)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,110 INFO L290 TraceCheckUtils]: 1,073: Hoare triple {38573#(<= ~counter~0 39)} ~cond := #in~cond; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,110 INFO L290 TraceCheckUtils]: 1,074: Hoare triple {38573#(<= ~counter~0 39)} assume !(0 == ~cond); {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,110 INFO L290 TraceCheckUtils]: 1,075: Hoare triple {38573#(<= ~counter~0 39)} assume true; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,111 INFO L284 TraceCheckUtils]: 1,076: Hoare quadruple {38573#(<= ~counter~0 39)} {38573#(<= ~counter~0 39)} #59#return; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,111 INFO L272 TraceCheckUtils]: 1,077: Hoare triple {38573#(<= ~counter~0 39)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,111 INFO L290 TraceCheckUtils]: 1,078: Hoare triple {38573#(<= ~counter~0 39)} ~cond := #in~cond; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,112 INFO L290 TraceCheckUtils]: 1,079: Hoare triple {38573#(<= ~counter~0 39)} assume !(0 == ~cond); {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,112 INFO L290 TraceCheckUtils]: 1,080: Hoare triple {38573#(<= ~counter~0 39)} assume true; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,112 INFO L284 TraceCheckUtils]: 1,081: Hoare quadruple {38573#(<= ~counter~0 39)} {38573#(<= ~counter~0 39)} #61#return; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,113 INFO L272 TraceCheckUtils]: 1,082: Hoare triple {38573#(<= ~counter~0 39)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,113 INFO L290 TraceCheckUtils]: 1,083: Hoare triple {38573#(<= ~counter~0 39)} ~cond := #in~cond; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,113 INFO L290 TraceCheckUtils]: 1,084: Hoare triple {38573#(<= ~counter~0 39)} assume !(0 == ~cond); {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,114 INFO L290 TraceCheckUtils]: 1,085: Hoare triple {38573#(<= ~counter~0 39)} assume true; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,114 INFO L284 TraceCheckUtils]: 1,086: Hoare quadruple {38573#(<= ~counter~0 39)} {38573#(<= ~counter~0 39)} #63#return; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,115 INFO L272 TraceCheckUtils]: 1,087: Hoare triple {38573#(<= ~counter~0 39)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,115 INFO L290 TraceCheckUtils]: 1,088: Hoare triple {38573#(<= ~counter~0 39)} ~cond := #in~cond; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,115 INFO L290 TraceCheckUtils]: 1,089: Hoare triple {38573#(<= ~counter~0 39)} assume !(0 == ~cond); {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,115 INFO L290 TraceCheckUtils]: 1,090: Hoare triple {38573#(<= ~counter~0 39)} assume true; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,116 INFO L284 TraceCheckUtils]: 1,091: Hoare quadruple {38573#(<= ~counter~0 39)} {38573#(<= ~counter~0 39)} #65#return; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,116 INFO L272 TraceCheckUtils]: 1,092: Hoare triple {38573#(<= ~counter~0 39)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,116 INFO L290 TraceCheckUtils]: 1,093: Hoare triple {38573#(<= ~counter~0 39)} ~cond := #in~cond; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,117 INFO L290 TraceCheckUtils]: 1,094: Hoare triple {38573#(<= ~counter~0 39)} assume !(0 == ~cond); {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,117 INFO L290 TraceCheckUtils]: 1,095: Hoare triple {38573#(<= ~counter~0 39)} assume true; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,117 INFO L284 TraceCheckUtils]: 1,096: Hoare quadruple {38573#(<= ~counter~0 39)} {38573#(<= ~counter~0 39)} #67#return; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,118 INFO L290 TraceCheckUtils]: 1,097: Hoare triple {38573#(<= ~counter~0 39)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:53,119 INFO L290 TraceCheckUtils]: 1,098: Hoare triple {38573#(<= ~counter~0 39)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,119 INFO L290 TraceCheckUtils]: 1,099: Hoare triple {38658#(<= ~counter~0 40)} assume !!(#t~post5 < 50);havoc #t~post5; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,119 INFO L272 TraceCheckUtils]: 1,100: Hoare triple {38658#(<= ~counter~0 40)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,119 INFO L290 TraceCheckUtils]: 1,101: Hoare triple {38658#(<= ~counter~0 40)} ~cond := #in~cond; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,120 INFO L290 TraceCheckUtils]: 1,102: Hoare triple {38658#(<= ~counter~0 40)} assume !(0 == ~cond); {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,120 INFO L290 TraceCheckUtils]: 1,103: Hoare triple {38658#(<= ~counter~0 40)} assume true; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,120 INFO L284 TraceCheckUtils]: 1,104: Hoare quadruple {38658#(<= ~counter~0 40)} {38658#(<= ~counter~0 40)} #59#return; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,121 INFO L272 TraceCheckUtils]: 1,105: Hoare triple {38658#(<= ~counter~0 40)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,121 INFO L290 TraceCheckUtils]: 1,106: Hoare triple {38658#(<= ~counter~0 40)} ~cond := #in~cond; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,121 INFO L290 TraceCheckUtils]: 1,107: Hoare triple {38658#(<= ~counter~0 40)} assume !(0 == ~cond); {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,122 INFO L290 TraceCheckUtils]: 1,108: Hoare triple {38658#(<= ~counter~0 40)} assume true; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,122 INFO L284 TraceCheckUtils]: 1,109: Hoare quadruple {38658#(<= ~counter~0 40)} {38658#(<= ~counter~0 40)} #61#return; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,122 INFO L272 TraceCheckUtils]: 1,110: Hoare triple {38658#(<= ~counter~0 40)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,123 INFO L290 TraceCheckUtils]: 1,111: Hoare triple {38658#(<= ~counter~0 40)} ~cond := #in~cond; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,123 INFO L290 TraceCheckUtils]: 1,112: Hoare triple {38658#(<= ~counter~0 40)} assume !(0 == ~cond); {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,123 INFO L290 TraceCheckUtils]: 1,113: Hoare triple {38658#(<= ~counter~0 40)} assume true; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,124 INFO L284 TraceCheckUtils]: 1,114: Hoare quadruple {38658#(<= ~counter~0 40)} {38658#(<= ~counter~0 40)} #63#return; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,124 INFO L272 TraceCheckUtils]: 1,115: Hoare triple {38658#(<= ~counter~0 40)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,124 INFO L290 TraceCheckUtils]: 1,116: Hoare triple {38658#(<= ~counter~0 40)} ~cond := #in~cond; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,125 INFO L290 TraceCheckUtils]: 1,117: Hoare triple {38658#(<= ~counter~0 40)} assume !(0 == ~cond); {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,125 INFO L290 TraceCheckUtils]: 1,118: Hoare triple {38658#(<= ~counter~0 40)} assume true; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,125 INFO L284 TraceCheckUtils]: 1,119: Hoare quadruple {38658#(<= ~counter~0 40)} {38658#(<= ~counter~0 40)} #65#return; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,126 INFO L272 TraceCheckUtils]: 1,120: Hoare triple {38658#(<= ~counter~0 40)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,126 INFO L290 TraceCheckUtils]: 1,121: Hoare triple {38658#(<= ~counter~0 40)} ~cond := #in~cond; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,126 INFO L290 TraceCheckUtils]: 1,122: Hoare triple {38658#(<= ~counter~0 40)} assume !(0 == ~cond); {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,127 INFO L290 TraceCheckUtils]: 1,123: Hoare triple {38658#(<= ~counter~0 40)} assume true; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,127 INFO L284 TraceCheckUtils]: 1,124: Hoare quadruple {38658#(<= ~counter~0 40)} {38658#(<= ~counter~0 40)} #67#return; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,127 INFO L290 TraceCheckUtils]: 1,125: Hoare triple {38658#(<= ~counter~0 40)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:53,128 INFO L290 TraceCheckUtils]: 1,126: Hoare triple {38658#(<= ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,128 INFO L290 TraceCheckUtils]: 1,127: Hoare triple {38743#(<= ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,129 INFO L272 TraceCheckUtils]: 1,128: Hoare triple {38743#(<= ~counter~0 41)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,129 INFO L290 TraceCheckUtils]: 1,129: Hoare triple {38743#(<= ~counter~0 41)} ~cond := #in~cond; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,129 INFO L290 TraceCheckUtils]: 1,130: Hoare triple {38743#(<= ~counter~0 41)} assume !(0 == ~cond); {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,130 INFO L290 TraceCheckUtils]: 1,131: Hoare triple {38743#(<= ~counter~0 41)} assume true; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,130 INFO L284 TraceCheckUtils]: 1,132: Hoare quadruple {38743#(<= ~counter~0 41)} {38743#(<= ~counter~0 41)} #59#return; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,130 INFO L272 TraceCheckUtils]: 1,133: Hoare triple {38743#(<= ~counter~0 41)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,131 INFO L290 TraceCheckUtils]: 1,134: Hoare triple {38743#(<= ~counter~0 41)} ~cond := #in~cond; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,131 INFO L290 TraceCheckUtils]: 1,135: Hoare triple {38743#(<= ~counter~0 41)} assume !(0 == ~cond); {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,131 INFO L290 TraceCheckUtils]: 1,136: Hoare triple {38743#(<= ~counter~0 41)} assume true; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,132 INFO L284 TraceCheckUtils]: 1,137: Hoare quadruple {38743#(<= ~counter~0 41)} {38743#(<= ~counter~0 41)} #61#return; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,132 INFO L272 TraceCheckUtils]: 1,138: Hoare triple {38743#(<= ~counter~0 41)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,132 INFO L290 TraceCheckUtils]: 1,139: Hoare triple {38743#(<= ~counter~0 41)} ~cond := #in~cond; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,133 INFO L290 TraceCheckUtils]: 1,140: Hoare triple {38743#(<= ~counter~0 41)} assume !(0 == ~cond); {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,133 INFO L290 TraceCheckUtils]: 1,141: Hoare triple {38743#(<= ~counter~0 41)} assume true; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,133 INFO L284 TraceCheckUtils]: 1,142: Hoare quadruple {38743#(<= ~counter~0 41)} {38743#(<= ~counter~0 41)} #63#return; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,134 INFO L272 TraceCheckUtils]: 1,143: Hoare triple {38743#(<= ~counter~0 41)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,134 INFO L290 TraceCheckUtils]: 1,144: Hoare triple {38743#(<= ~counter~0 41)} ~cond := #in~cond; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,134 INFO L290 TraceCheckUtils]: 1,145: Hoare triple {38743#(<= ~counter~0 41)} assume !(0 == ~cond); {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,135 INFO L290 TraceCheckUtils]: 1,146: Hoare triple {38743#(<= ~counter~0 41)} assume true; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,135 INFO L284 TraceCheckUtils]: 1,147: Hoare quadruple {38743#(<= ~counter~0 41)} {38743#(<= ~counter~0 41)} #65#return; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,138 INFO L272 TraceCheckUtils]: 1,148: Hoare triple {38743#(<= ~counter~0 41)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,139 INFO L290 TraceCheckUtils]: 1,149: Hoare triple {38743#(<= ~counter~0 41)} ~cond := #in~cond; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,139 INFO L290 TraceCheckUtils]: 1,150: Hoare triple {38743#(<= ~counter~0 41)} assume !(0 == ~cond); {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,139 INFO L290 TraceCheckUtils]: 1,151: Hoare triple {38743#(<= ~counter~0 41)} assume true; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,140 INFO L284 TraceCheckUtils]: 1,152: Hoare quadruple {38743#(<= ~counter~0 41)} {38743#(<= ~counter~0 41)} #67#return; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,140 INFO L290 TraceCheckUtils]: 1,153: Hoare triple {38743#(<= ~counter~0 41)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:53,141 INFO L290 TraceCheckUtils]: 1,154: Hoare triple {38743#(<= ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,141 INFO L290 TraceCheckUtils]: 1,155: Hoare triple {38828#(<= ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,142 INFO L272 TraceCheckUtils]: 1,156: Hoare triple {38828#(<= ~counter~0 42)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,142 INFO L290 TraceCheckUtils]: 1,157: Hoare triple {38828#(<= ~counter~0 42)} ~cond := #in~cond; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,142 INFO L290 TraceCheckUtils]: 1,158: Hoare triple {38828#(<= ~counter~0 42)} assume !(0 == ~cond); {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,142 INFO L290 TraceCheckUtils]: 1,159: Hoare triple {38828#(<= ~counter~0 42)} assume true; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,143 INFO L284 TraceCheckUtils]: 1,160: Hoare quadruple {38828#(<= ~counter~0 42)} {38828#(<= ~counter~0 42)} #59#return; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,143 INFO L272 TraceCheckUtils]: 1,161: Hoare triple {38828#(<= ~counter~0 42)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,143 INFO L290 TraceCheckUtils]: 1,162: Hoare triple {38828#(<= ~counter~0 42)} ~cond := #in~cond; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,144 INFO L290 TraceCheckUtils]: 1,163: Hoare triple {38828#(<= ~counter~0 42)} assume !(0 == ~cond); {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,144 INFO L290 TraceCheckUtils]: 1,164: Hoare triple {38828#(<= ~counter~0 42)} assume true; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,144 INFO L284 TraceCheckUtils]: 1,165: Hoare quadruple {38828#(<= ~counter~0 42)} {38828#(<= ~counter~0 42)} #61#return; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,145 INFO L272 TraceCheckUtils]: 1,166: Hoare triple {38828#(<= ~counter~0 42)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,145 INFO L290 TraceCheckUtils]: 1,167: Hoare triple {38828#(<= ~counter~0 42)} ~cond := #in~cond; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,145 INFO L290 TraceCheckUtils]: 1,168: Hoare triple {38828#(<= ~counter~0 42)} assume !(0 == ~cond); {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,146 INFO L290 TraceCheckUtils]: 1,169: Hoare triple {38828#(<= ~counter~0 42)} assume true; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,146 INFO L284 TraceCheckUtils]: 1,170: Hoare quadruple {38828#(<= ~counter~0 42)} {38828#(<= ~counter~0 42)} #63#return; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,146 INFO L272 TraceCheckUtils]: 1,171: Hoare triple {38828#(<= ~counter~0 42)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,147 INFO L290 TraceCheckUtils]: 1,172: Hoare triple {38828#(<= ~counter~0 42)} ~cond := #in~cond; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,147 INFO L290 TraceCheckUtils]: 1,173: Hoare triple {38828#(<= ~counter~0 42)} assume !(0 == ~cond); {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,147 INFO L290 TraceCheckUtils]: 1,174: Hoare triple {38828#(<= ~counter~0 42)} assume true; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,148 INFO L284 TraceCheckUtils]: 1,175: Hoare quadruple {38828#(<= ~counter~0 42)} {38828#(<= ~counter~0 42)} #65#return; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,148 INFO L272 TraceCheckUtils]: 1,176: Hoare triple {38828#(<= ~counter~0 42)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,148 INFO L290 TraceCheckUtils]: 1,177: Hoare triple {38828#(<= ~counter~0 42)} ~cond := #in~cond; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,149 INFO L290 TraceCheckUtils]: 1,178: Hoare triple {38828#(<= ~counter~0 42)} assume !(0 == ~cond); {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,149 INFO L290 TraceCheckUtils]: 1,179: Hoare triple {38828#(<= ~counter~0 42)} assume true; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,149 INFO L284 TraceCheckUtils]: 1,180: Hoare quadruple {38828#(<= ~counter~0 42)} {38828#(<= ~counter~0 42)} #67#return; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,150 INFO L290 TraceCheckUtils]: 1,181: Hoare triple {38828#(<= ~counter~0 42)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:53,150 INFO L290 TraceCheckUtils]: 1,182: Hoare triple {38828#(<= ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,151 INFO L290 TraceCheckUtils]: 1,183: Hoare triple {38913#(<= ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,152 INFO L272 TraceCheckUtils]: 1,184: Hoare triple {38913#(<= ~counter~0 43)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,152 INFO L290 TraceCheckUtils]: 1,185: Hoare triple {38913#(<= ~counter~0 43)} ~cond := #in~cond; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,153 INFO L290 TraceCheckUtils]: 1,186: Hoare triple {38913#(<= ~counter~0 43)} assume !(0 == ~cond); {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,153 INFO L290 TraceCheckUtils]: 1,187: Hoare triple {38913#(<= ~counter~0 43)} assume true; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,154 INFO L284 TraceCheckUtils]: 1,188: Hoare quadruple {38913#(<= ~counter~0 43)} {38913#(<= ~counter~0 43)} #59#return; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,154 INFO L272 TraceCheckUtils]: 1,189: Hoare triple {38913#(<= ~counter~0 43)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,155 INFO L290 TraceCheckUtils]: 1,190: Hoare triple {38913#(<= ~counter~0 43)} ~cond := #in~cond; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,155 INFO L290 TraceCheckUtils]: 1,191: Hoare triple {38913#(<= ~counter~0 43)} assume !(0 == ~cond); {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,155 INFO L290 TraceCheckUtils]: 1,192: Hoare triple {38913#(<= ~counter~0 43)} assume true; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,156 INFO L284 TraceCheckUtils]: 1,193: Hoare quadruple {38913#(<= ~counter~0 43)} {38913#(<= ~counter~0 43)} #61#return; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,157 INFO L272 TraceCheckUtils]: 1,194: Hoare triple {38913#(<= ~counter~0 43)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,157 INFO L290 TraceCheckUtils]: 1,195: Hoare triple {38913#(<= ~counter~0 43)} ~cond := #in~cond; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,157 INFO L290 TraceCheckUtils]: 1,196: Hoare triple {38913#(<= ~counter~0 43)} assume !(0 == ~cond); {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,158 INFO L290 TraceCheckUtils]: 1,197: Hoare triple {38913#(<= ~counter~0 43)} assume true; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,158 INFO L284 TraceCheckUtils]: 1,198: Hoare quadruple {38913#(<= ~counter~0 43)} {38913#(<= ~counter~0 43)} #63#return; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,159 INFO L272 TraceCheckUtils]: 1,199: Hoare triple {38913#(<= ~counter~0 43)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,159 INFO L290 TraceCheckUtils]: 1,200: Hoare triple {38913#(<= ~counter~0 43)} ~cond := #in~cond; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,160 INFO L290 TraceCheckUtils]: 1,201: Hoare triple {38913#(<= ~counter~0 43)} assume !(0 == ~cond); {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,160 INFO L290 TraceCheckUtils]: 1,202: Hoare triple {38913#(<= ~counter~0 43)} assume true; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,161 INFO L284 TraceCheckUtils]: 1,203: Hoare quadruple {38913#(<= ~counter~0 43)} {38913#(<= ~counter~0 43)} #65#return; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,161 INFO L272 TraceCheckUtils]: 1,204: Hoare triple {38913#(<= ~counter~0 43)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,162 INFO L290 TraceCheckUtils]: 1,205: Hoare triple {38913#(<= ~counter~0 43)} ~cond := #in~cond; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,162 INFO L290 TraceCheckUtils]: 1,206: Hoare triple {38913#(<= ~counter~0 43)} assume !(0 == ~cond); {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,163 INFO L290 TraceCheckUtils]: 1,207: Hoare triple {38913#(<= ~counter~0 43)} assume true; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,163 INFO L284 TraceCheckUtils]: 1,208: Hoare quadruple {38913#(<= ~counter~0 43)} {38913#(<= ~counter~0 43)} #67#return; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,164 INFO L290 TraceCheckUtils]: 1,209: Hoare triple {38913#(<= ~counter~0 43)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:53,165 INFO L290 TraceCheckUtils]: 1,210: Hoare triple {38913#(<= ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,165 INFO L290 TraceCheckUtils]: 1,211: Hoare triple {38998#(<= ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,166 INFO L272 TraceCheckUtils]: 1,212: Hoare triple {38998#(<= ~counter~0 44)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,166 INFO L290 TraceCheckUtils]: 1,213: Hoare triple {38998#(<= ~counter~0 44)} ~cond := #in~cond; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,167 INFO L290 TraceCheckUtils]: 1,214: Hoare triple {38998#(<= ~counter~0 44)} assume !(0 == ~cond); {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,167 INFO L290 TraceCheckUtils]: 1,215: Hoare triple {38998#(<= ~counter~0 44)} assume true; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,168 INFO L284 TraceCheckUtils]: 1,216: Hoare quadruple {38998#(<= ~counter~0 44)} {38998#(<= ~counter~0 44)} #59#return; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,168 INFO L272 TraceCheckUtils]: 1,217: Hoare triple {38998#(<= ~counter~0 44)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,169 INFO L290 TraceCheckUtils]: 1,218: Hoare triple {38998#(<= ~counter~0 44)} ~cond := #in~cond; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,169 INFO L290 TraceCheckUtils]: 1,219: Hoare triple {38998#(<= ~counter~0 44)} assume !(0 == ~cond); {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,169 INFO L290 TraceCheckUtils]: 1,220: Hoare triple {38998#(<= ~counter~0 44)} assume true; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,170 INFO L284 TraceCheckUtils]: 1,221: Hoare quadruple {38998#(<= ~counter~0 44)} {38998#(<= ~counter~0 44)} #61#return; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,170 INFO L272 TraceCheckUtils]: 1,222: Hoare triple {38998#(<= ~counter~0 44)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,171 INFO L290 TraceCheckUtils]: 1,223: Hoare triple {38998#(<= ~counter~0 44)} ~cond := #in~cond; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,171 INFO L290 TraceCheckUtils]: 1,224: Hoare triple {38998#(<= ~counter~0 44)} assume !(0 == ~cond); {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,171 INFO L290 TraceCheckUtils]: 1,225: Hoare triple {38998#(<= ~counter~0 44)} assume true; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,172 INFO L284 TraceCheckUtils]: 1,226: Hoare quadruple {38998#(<= ~counter~0 44)} {38998#(<= ~counter~0 44)} #63#return; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,173 INFO L272 TraceCheckUtils]: 1,227: Hoare triple {38998#(<= ~counter~0 44)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,173 INFO L290 TraceCheckUtils]: 1,228: Hoare triple {38998#(<= ~counter~0 44)} ~cond := #in~cond; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,173 INFO L290 TraceCheckUtils]: 1,229: Hoare triple {38998#(<= ~counter~0 44)} assume !(0 == ~cond); {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,174 INFO L290 TraceCheckUtils]: 1,230: Hoare triple {38998#(<= ~counter~0 44)} assume true; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,174 INFO L284 TraceCheckUtils]: 1,231: Hoare quadruple {38998#(<= ~counter~0 44)} {38998#(<= ~counter~0 44)} #65#return; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,175 INFO L272 TraceCheckUtils]: 1,232: Hoare triple {38998#(<= ~counter~0 44)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,175 INFO L290 TraceCheckUtils]: 1,233: Hoare triple {38998#(<= ~counter~0 44)} ~cond := #in~cond; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,175 INFO L290 TraceCheckUtils]: 1,234: Hoare triple {38998#(<= ~counter~0 44)} assume !(0 == ~cond); {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,176 INFO L290 TraceCheckUtils]: 1,235: Hoare triple {38998#(<= ~counter~0 44)} assume true; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,176 INFO L284 TraceCheckUtils]: 1,236: Hoare quadruple {38998#(<= ~counter~0 44)} {38998#(<= ~counter~0 44)} #67#return; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,177 INFO L290 TraceCheckUtils]: 1,237: Hoare triple {38998#(<= ~counter~0 44)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:53,178 INFO L290 TraceCheckUtils]: 1,238: Hoare triple {38998#(<= ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,178 INFO L290 TraceCheckUtils]: 1,239: Hoare triple {39083#(<= ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,179 INFO L272 TraceCheckUtils]: 1,240: Hoare triple {39083#(<= ~counter~0 45)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,179 INFO L290 TraceCheckUtils]: 1,241: Hoare triple {39083#(<= ~counter~0 45)} ~cond := #in~cond; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,179 INFO L290 TraceCheckUtils]: 1,242: Hoare triple {39083#(<= ~counter~0 45)} assume !(0 == ~cond); {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,180 INFO L290 TraceCheckUtils]: 1,243: Hoare triple {39083#(<= ~counter~0 45)} assume true; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,180 INFO L284 TraceCheckUtils]: 1,244: Hoare quadruple {39083#(<= ~counter~0 45)} {39083#(<= ~counter~0 45)} #59#return; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,181 INFO L272 TraceCheckUtils]: 1,245: Hoare triple {39083#(<= ~counter~0 45)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,181 INFO L290 TraceCheckUtils]: 1,246: Hoare triple {39083#(<= ~counter~0 45)} ~cond := #in~cond; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,181 INFO L290 TraceCheckUtils]: 1,247: Hoare triple {39083#(<= ~counter~0 45)} assume !(0 == ~cond); {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,182 INFO L290 TraceCheckUtils]: 1,248: Hoare triple {39083#(<= ~counter~0 45)} assume true; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,182 INFO L284 TraceCheckUtils]: 1,249: Hoare quadruple {39083#(<= ~counter~0 45)} {39083#(<= ~counter~0 45)} #61#return; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,183 INFO L272 TraceCheckUtils]: 1,250: Hoare triple {39083#(<= ~counter~0 45)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,183 INFO L290 TraceCheckUtils]: 1,251: Hoare triple {39083#(<= ~counter~0 45)} ~cond := #in~cond; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,184 INFO L290 TraceCheckUtils]: 1,252: Hoare triple {39083#(<= ~counter~0 45)} assume !(0 == ~cond); {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,184 INFO L290 TraceCheckUtils]: 1,253: Hoare triple {39083#(<= ~counter~0 45)} assume true; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,184 INFO L284 TraceCheckUtils]: 1,254: Hoare quadruple {39083#(<= ~counter~0 45)} {39083#(<= ~counter~0 45)} #63#return; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,185 INFO L272 TraceCheckUtils]: 1,255: Hoare triple {39083#(<= ~counter~0 45)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,185 INFO L290 TraceCheckUtils]: 1,256: Hoare triple {39083#(<= ~counter~0 45)} ~cond := #in~cond; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,186 INFO L290 TraceCheckUtils]: 1,257: Hoare triple {39083#(<= ~counter~0 45)} assume !(0 == ~cond); {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,186 INFO L290 TraceCheckUtils]: 1,258: Hoare triple {39083#(<= ~counter~0 45)} assume true; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,187 INFO L284 TraceCheckUtils]: 1,259: Hoare quadruple {39083#(<= ~counter~0 45)} {39083#(<= ~counter~0 45)} #65#return; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,187 INFO L272 TraceCheckUtils]: 1,260: Hoare triple {39083#(<= ~counter~0 45)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,188 INFO L290 TraceCheckUtils]: 1,261: Hoare triple {39083#(<= ~counter~0 45)} ~cond := #in~cond; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,188 INFO L290 TraceCheckUtils]: 1,262: Hoare triple {39083#(<= ~counter~0 45)} assume !(0 == ~cond); {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,188 INFO L290 TraceCheckUtils]: 1,263: Hoare triple {39083#(<= ~counter~0 45)} assume true; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,189 INFO L284 TraceCheckUtils]: 1,264: Hoare quadruple {39083#(<= ~counter~0 45)} {39083#(<= ~counter~0 45)} #67#return; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,189 INFO L290 TraceCheckUtils]: 1,265: Hoare triple {39083#(<= ~counter~0 45)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:53,190 INFO L290 TraceCheckUtils]: 1,266: Hoare triple {39083#(<= ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,190 INFO L290 TraceCheckUtils]: 1,267: Hoare triple {39168#(<= ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,191 INFO L272 TraceCheckUtils]: 1,268: Hoare triple {39168#(<= ~counter~0 46)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,191 INFO L290 TraceCheckUtils]: 1,269: Hoare triple {39168#(<= ~counter~0 46)} ~cond := #in~cond; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,192 INFO L290 TraceCheckUtils]: 1,270: Hoare triple {39168#(<= ~counter~0 46)} assume !(0 == ~cond); {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,192 INFO L290 TraceCheckUtils]: 1,271: Hoare triple {39168#(<= ~counter~0 46)} assume true; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,193 INFO L284 TraceCheckUtils]: 1,272: Hoare quadruple {39168#(<= ~counter~0 46)} {39168#(<= ~counter~0 46)} #59#return; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,193 INFO L272 TraceCheckUtils]: 1,273: Hoare triple {39168#(<= ~counter~0 46)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,193 INFO L290 TraceCheckUtils]: 1,274: Hoare triple {39168#(<= ~counter~0 46)} ~cond := #in~cond; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,194 INFO L290 TraceCheckUtils]: 1,275: Hoare triple {39168#(<= ~counter~0 46)} assume !(0 == ~cond); {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,194 INFO L290 TraceCheckUtils]: 1,276: Hoare triple {39168#(<= ~counter~0 46)} assume true; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,195 INFO L284 TraceCheckUtils]: 1,277: Hoare quadruple {39168#(<= ~counter~0 46)} {39168#(<= ~counter~0 46)} #61#return; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,195 INFO L272 TraceCheckUtils]: 1,278: Hoare triple {39168#(<= ~counter~0 46)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,196 INFO L290 TraceCheckUtils]: 1,279: Hoare triple {39168#(<= ~counter~0 46)} ~cond := #in~cond; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,196 INFO L290 TraceCheckUtils]: 1,280: Hoare triple {39168#(<= ~counter~0 46)} assume !(0 == ~cond); {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,196 INFO L290 TraceCheckUtils]: 1,281: Hoare triple {39168#(<= ~counter~0 46)} assume true; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,197 INFO L284 TraceCheckUtils]: 1,282: Hoare quadruple {39168#(<= ~counter~0 46)} {39168#(<= ~counter~0 46)} #63#return; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,197 INFO L272 TraceCheckUtils]: 1,283: Hoare triple {39168#(<= ~counter~0 46)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,198 INFO L290 TraceCheckUtils]: 1,284: Hoare triple {39168#(<= ~counter~0 46)} ~cond := #in~cond; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,198 INFO L290 TraceCheckUtils]: 1,285: Hoare triple {39168#(<= ~counter~0 46)} assume !(0 == ~cond); {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,198 INFO L290 TraceCheckUtils]: 1,286: Hoare triple {39168#(<= ~counter~0 46)} assume true; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,199 INFO L284 TraceCheckUtils]: 1,287: Hoare quadruple {39168#(<= ~counter~0 46)} {39168#(<= ~counter~0 46)} #65#return; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,199 INFO L272 TraceCheckUtils]: 1,288: Hoare triple {39168#(<= ~counter~0 46)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,200 INFO L290 TraceCheckUtils]: 1,289: Hoare triple {39168#(<= ~counter~0 46)} ~cond := #in~cond; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,200 INFO L290 TraceCheckUtils]: 1,290: Hoare triple {39168#(<= ~counter~0 46)} assume !(0 == ~cond); {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,201 INFO L290 TraceCheckUtils]: 1,291: Hoare triple {39168#(<= ~counter~0 46)} assume true; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,201 INFO L284 TraceCheckUtils]: 1,292: Hoare quadruple {39168#(<= ~counter~0 46)} {39168#(<= ~counter~0 46)} #67#return; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,201 INFO L290 TraceCheckUtils]: 1,293: Hoare triple {39168#(<= ~counter~0 46)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:53,202 INFO L290 TraceCheckUtils]: 1,294: Hoare triple {39168#(<= ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39253#(<= |main_#t~post5| 46)} is VALID [2022-04-14 15:17:53,202 INFO L290 TraceCheckUtils]: 1,295: Hoare triple {39253#(<= |main_#t~post5| 46)} assume !(#t~post5 < 50);havoc #t~post5; {35320#false} is VALID [2022-04-14 15:17:53,202 INFO L272 TraceCheckUtils]: 1,296: Hoare triple {35320#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35320#false} is VALID [2022-04-14 15:17:53,202 INFO L290 TraceCheckUtils]: 1,297: Hoare triple {35320#false} ~cond := #in~cond; {35320#false} is VALID [2022-04-14 15:17:53,202 INFO L290 TraceCheckUtils]: 1,298: Hoare triple {35320#false} assume !(0 == ~cond); {35320#false} is VALID [2022-04-14 15:17:53,202 INFO L290 TraceCheckUtils]: 1,299: Hoare triple {35320#false} assume true; {35320#false} is VALID [2022-04-14 15:17:53,203 INFO L284 TraceCheckUtils]: 1,300: Hoare quadruple {35320#false} {35320#false} #69#return; {35320#false} is VALID [2022-04-14 15:17:53,203 INFO L272 TraceCheckUtils]: 1,301: Hoare triple {35320#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {35320#false} is VALID [2022-04-14 15:17:53,203 INFO L290 TraceCheckUtils]: 1,302: Hoare triple {35320#false} ~cond := #in~cond; {35320#false} is VALID [2022-04-14 15:17:53,203 INFO L290 TraceCheckUtils]: 1,303: Hoare triple {35320#false} assume 0 == ~cond; {35320#false} is VALID [2022-04-14 15:17:53,203 INFO L290 TraceCheckUtils]: 1,304: Hoare triple {35320#false} assume !false; {35320#false} is VALID [2022-04-14 15:17:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 1380 proven. 111872 refuted. 0 times theorem prover too weak. 1842 trivial. 0 not checked. [2022-04-14 15:17:53,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:17:57,382 INFO L290 TraceCheckUtils]: 1,304: Hoare triple {35320#false} assume !false; {35320#false} is VALID [2022-04-14 15:17:57,382 INFO L290 TraceCheckUtils]: 1,303: Hoare triple {35320#false} assume 0 == ~cond; {35320#false} is VALID [2022-04-14 15:17:57,382 INFO L290 TraceCheckUtils]: 1,302: Hoare triple {35320#false} ~cond := #in~cond; {35320#false} is VALID [2022-04-14 15:17:57,382 INFO L272 TraceCheckUtils]: 1,301: Hoare triple {35320#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {35320#false} is VALID [2022-04-14 15:17:57,383 INFO L284 TraceCheckUtils]: 1,300: Hoare quadruple {35319#true} {35320#false} #69#return; {35320#false} is VALID [2022-04-14 15:17:57,383 INFO L290 TraceCheckUtils]: 1,299: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,383 INFO L290 TraceCheckUtils]: 1,298: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,383 INFO L290 TraceCheckUtils]: 1,297: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,383 INFO L272 TraceCheckUtils]: 1,296: Hoare triple {35320#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,383 INFO L290 TraceCheckUtils]: 1,295: Hoare triple {39311#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {35320#false} is VALID [2022-04-14 15:17:57,383 INFO L290 TraceCheckUtils]: 1,294: Hoare triple {39315#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39311#(< |main_#t~post5| 50)} is VALID [2022-04-14 15:17:57,384 INFO L290 TraceCheckUtils]: 1,293: Hoare triple {39315#(< ~counter~0 50)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {39315#(< ~counter~0 50)} is VALID [2022-04-14 15:17:57,384 INFO L284 TraceCheckUtils]: 1,292: Hoare quadruple {35319#true} {39315#(< ~counter~0 50)} #67#return; {39315#(< ~counter~0 50)} is VALID [2022-04-14 15:17:57,384 INFO L290 TraceCheckUtils]: 1,291: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,384 INFO L290 TraceCheckUtils]: 1,290: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,384 INFO L290 TraceCheckUtils]: 1,289: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,384 INFO L272 TraceCheckUtils]: 1,288: Hoare triple {39315#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,385 INFO L284 TraceCheckUtils]: 1,287: Hoare quadruple {35319#true} {39315#(< ~counter~0 50)} #65#return; {39315#(< ~counter~0 50)} is VALID [2022-04-14 15:17:57,385 INFO L290 TraceCheckUtils]: 1,286: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,385 INFO L290 TraceCheckUtils]: 1,285: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,385 INFO L290 TraceCheckUtils]: 1,284: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,385 INFO L272 TraceCheckUtils]: 1,283: Hoare triple {39315#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,385 INFO L284 TraceCheckUtils]: 1,282: Hoare quadruple {35319#true} {39315#(< ~counter~0 50)} #63#return; {39315#(< ~counter~0 50)} is VALID [2022-04-14 15:17:57,385 INFO L290 TraceCheckUtils]: 1,281: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,386 INFO L290 TraceCheckUtils]: 1,280: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,386 INFO L290 TraceCheckUtils]: 1,279: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,386 INFO L272 TraceCheckUtils]: 1,278: Hoare triple {39315#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,386 INFO L284 TraceCheckUtils]: 1,277: Hoare quadruple {35319#true} {39315#(< ~counter~0 50)} #61#return; {39315#(< ~counter~0 50)} is VALID [2022-04-14 15:17:57,391 INFO L290 TraceCheckUtils]: 1,276: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,391 INFO L290 TraceCheckUtils]: 1,275: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,391 INFO L290 TraceCheckUtils]: 1,274: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,391 INFO L272 TraceCheckUtils]: 1,273: Hoare triple {39315#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,399 INFO L284 TraceCheckUtils]: 1,272: Hoare quadruple {35319#true} {39315#(< ~counter~0 50)} #59#return; {39315#(< ~counter~0 50)} is VALID [2022-04-14 15:17:57,399 INFO L290 TraceCheckUtils]: 1,271: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,399 INFO L290 TraceCheckUtils]: 1,270: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,400 INFO L290 TraceCheckUtils]: 1,269: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,400 INFO L272 TraceCheckUtils]: 1,268: Hoare triple {39315#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,400 INFO L290 TraceCheckUtils]: 1,267: Hoare triple {39315#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {39315#(< ~counter~0 50)} is VALID [2022-04-14 15:17:57,401 INFO L290 TraceCheckUtils]: 1,266: Hoare triple {39400#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39315#(< ~counter~0 50)} is VALID [2022-04-14 15:17:57,401 INFO L290 TraceCheckUtils]: 1,265: Hoare triple {39400#(< ~counter~0 49)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {39400#(< ~counter~0 49)} is VALID [2022-04-14 15:17:57,402 INFO L284 TraceCheckUtils]: 1,264: Hoare quadruple {35319#true} {39400#(< ~counter~0 49)} #67#return; {39400#(< ~counter~0 49)} is VALID [2022-04-14 15:17:57,402 INFO L290 TraceCheckUtils]: 1,263: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,402 INFO L290 TraceCheckUtils]: 1,262: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,402 INFO L290 TraceCheckUtils]: 1,261: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,402 INFO L272 TraceCheckUtils]: 1,260: Hoare triple {39400#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,403 INFO L284 TraceCheckUtils]: 1,259: Hoare quadruple {35319#true} {39400#(< ~counter~0 49)} #65#return; {39400#(< ~counter~0 49)} is VALID [2022-04-14 15:17:57,403 INFO L290 TraceCheckUtils]: 1,258: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,403 INFO L290 TraceCheckUtils]: 1,257: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,403 INFO L290 TraceCheckUtils]: 1,256: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,403 INFO L272 TraceCheckUtils]: 1,255: Hoare triple {39400#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,404 INFO L284 TraceCheckUtils]: 1,254: Hoare quadruple {35319#true} {39400#(< ~counter~0 49)} #63#return; {39400#(< ~counter~0 49)} is VALID [2022-04-14 15:17:57,404 INFO L290 TraceCheckUtils]: 1,253: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,404 INFO L290 TraceCheckUtils]: 1,252: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,404 INFO L290 TraceCheckUtils]: 1,251: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,404 INFO L272 TraceCheckUtils]: 1,250: Hoare triple {39400#(< ~counter~0 49)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,404 INFO L284 TraceCheckUtils]: 1,249: Hoare quadruple {35319#true} {39400#(< ~counter~0 49)} #61#return; {39400#(< ~counter~0 49)} is VALID [2022-04-14 15:17:57,405 INFO L290 TraceCheckUtils]: 1,248: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,405 INFO L290 TraceCheckUtils]: 1,247: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,405 INFO L290 TraceCheckUtils]: 1,246: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,405 INFO L272 TraceCheckUtils]: 1,245: Hoare triple {39400#(< ~counter~0 49)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,405 INFO L284 TraceCheckUtils]: 1,244: Hoare quadruple {35319#true} {39400#(< ~counter~0 49)} #59#return; {39400#(< ~counter~0 49)} is VALID [2022-04-14 15:17:57,405 INFO L290 TraceCheckUtils]: 1,243: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,405 INFO L290 TraceCheckUtils]: 1,242: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,405 INFO L290 TraceCheckUtils]: 1,241: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,405 INFO L272 TraceCheckUtils]: 1,240: Hoare triple {39400#(< ~counter~0 49)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,406 INFO L290 TraceCheckUtils]: 1,239: Hoare triple {39400#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {39400#(< ~counter~0 49)} is VALID [2022-04-14 15:17:57,406 INFO L290 TraceCheckUtils]: 1,238: Hoare triple {39485#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39400#(< ~counter~0 49)} is VALID [2022-04-14 15:17:57,407 INFO L290 TraceCheckUtils]: 1,237: Hoare triple {39485#(< ~counter~0 48)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {39485#(< ~counter~0 48)} is VALID [2022-04-14 15:17:57,407 INFO L284 TraceCheckUtils]: 1,236: Hoare quadruple {35319#true} {39485#(< ~counter~0 48)} #67#return; {39485#(< ~counter~0 48)} is VALID [2022-04-14 15:17:57,407 INFO L290 TraceCheckUtils]: 1,235: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,407 INFO L290 TraceCheckUtils]: 1,234: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,407 INFO L290 TraceCheckUtils]: 1,233: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,407 INFO L272 TraceCheckUtils]: 1,232: Hoare triple {39485#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,411 INFO L284 TraceCheckUtils]: 1,231: Hoare quadruple {35319#true} {39485#(< ~counter~0 48)} #65#return; {39485#(< ~counter~0 48)} is VALID [2022-04-14 15:17:57,411 INFO L290 TraceCheckUtils]: 1,230: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,411 INFO L290 TraceCheckUtils]: 1,229: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,412 INFO L290 TraceCheckUtils]: 1,228: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,412 INFO L272 TraceCheckUtils]: 1,227: Hoare triple {39485#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,412 INFO L284 TraceCheckUtils]: 1,226: Hoare quadruple {35319#true} {39485#(< ~counter~0 48)} #63#return; {39485#(< ~counter~0 48)} is VALID [2022-04-14 15:17:57,412 INFO L290 TraceCheckUtils]: 1,225: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,412 INFO L290 TraceCheckUtils]: 1,224: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,412 INFO L290 TraceCheckUtils]: 1,223: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,412 INFO L272 TraceCheckUtils]: 1,222: Hoare triple {39485#(< ~counter~0 48)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,413 INFO L284 TraceCheckUtils]: 1,221: Hoare quadruple {35319#true} {39485#(< ~counter~0 48)} #61#return; {39485#(< ~counter~0 48)} is VALID [2022-04-14 15:17:57,413 INFO L290 TraceCheckUtils]: 1,220: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,413 INFO L290 TraceCheckUtils]: 1,219: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,413 INFO L290 TraceCheckUtils]: 1,218: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,413 INFO L272 TraceCheckUtils]: 1,217: Hoare triple {39485#(< ~counter~0 48)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,414 INFO L284 TraceCheckUtils]: 1,216: Hoare quadruple {35319#true} {39485#(< ~counter~0 48)} #59#return; {39485#(< ~counter~0 48)} is VALID [2022-04-14 15:17:57,414 INFO L290 TraceCheckUtils]: 1,215: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,414 INFO L290 TraceCheckUtils]: 1,214: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,414 INFO L290 TraceCheckUtils]: 1,213: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,414 INFO L272 TraceCheckUtils]: 1,212: Hoare triple {39485#(< ~counter~0 48)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,415 INFO L290 TraceCheckUtils]: 1,211: Hoare triple {39485#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {39485#(< ~counter~0 48)} is VALID [2022-04-14 15:17:57,415 INFO L290 TraceCheckUtils]: 1,210: Hoare triple {39168#(<= ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39485#(< ~counter~0 48)} is VALID [2022-04-14 15:17:57,416 INFO L290 TraceCheckUtils]: 1,209: Hoare triple {39168#(<= ~counter~0 46)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:57,416 INFO L284 TraceCheckUtils]: 1,208: Hoare quadruple {35319#true} {39168#(<= ~counter~0 46)} #67#return; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:57,416 INFO L290 TraceCheckUtils]: 1,207: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,416 INFO L290 TraceCheckUtils]: 1,206: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,416 INFO L290 TraceCheckUtils]: 1,205: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,416 INFO L272 TraceCheckUtils]: 1,204: Hoare triple {39168#(<= ~counter~0 46)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,417 INFO L284 TraceCheckUtils]: 1,203: Hoare quadruple {35319#true} {39168#(<= ~counter~0 46)} #65#return; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:57,417 INFO L290 TraceCheckUtils]: 1,202: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,417 INFO L290 TraceCheckUtils]: 1,201: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,417 INFO L290 TraceCheckUtils]: 1,200: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,417 INFO L272 TraceCheckUtils]: 1,199: Hoare triple {39168#(<= ~counter~0 46)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,418 INFO L284 TraceCheckUtils]: 1,198: Hoare quadruple {35319#true} {39168#(<= ~counter~0 46)} #63#return; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:57,418 INFO L290 TraceCheckUtils]: 1,197: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,418 INFO L290 TraceCheckUtils]: 1,196: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,418 INFO L290 TraceCheckUtils]: 1,195: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,418 INFO L272 TraceCheckUtils]: 1,194: Hoare triple {39168#(<= ~counter~0 46)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,419 INFO L284 TraceCheckUtils]: 1,193: Hoare quadruple {35319#true} {39168#(<= ~counter~0 46)} #61#return; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:57,419 INFO L290 TraceCheckUtils]: 1,192: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,419 INFO L290 TraceCheckUtils]: 1,191: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,419 INFO L290 TraceCheckUtils]: 1,190: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,419 INFO L272 TraceCheckUtils]: 1,189: Hoare triple {39168#(<= ~counter~0 46)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,420 INFO L284 TraceCheckUtils]: 1,188: Hoare quadruple {35319#true} {39168#(<= ~counter~0 46)} #59#return; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:57,420 INFO L290 TraceCheckUtils]: 1,187: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,420 INFO L290 TraceCheckUtils]: 1,186: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,420 INFO L290 TraceCheckUtils]: 1,185: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,420 INFO L272 TraceCheckUtils]: 1,184: Hoare triple {39168#(<= ~counter~0 46)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,420 INFO L290 TraceCheckUtils]: 1,183: Hoare triple {39168#(<= ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:57,421 INFO L290 TraceCheckUtils]: 1,182: Hoare triple {39083#(<= ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39168#(<= ~counter~0 46)} is VALID [2022-04-14 15:17:57,421 INFO L290 TraceCheckUtils]: 1,181: Hoare triple {39083#(<= ~counter~0 45)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:57,422 INFO L284 TraceCheckUtils]: 1,180: Hoare quadruple {35319#true} {39083#(<= ~counter~0 45)} #67#return; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:57,422 INFO L290 TraceCheckUtils]: 1,179: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,422 INFO L290 TraceCheckUtils]: 1,178: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,422 INFO L290 TraceCheckUtils]: 1,177: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,422 INFO L272 TraceCheckUtils]: 1,176: Hoare triple {39083#(<= ~counter~0 45)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,423 INFO L284 TraceCheckUtils]: 1,175: Hoare quadruple {35319#true} {39083#(<= ~counter~0 45)} #65#return; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:57,423 INFO L290 TraceCheckUtils]: 1,174: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,423 INFO L290 TraceCheckUtils]: 1,173: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,423 INFO L290 TraceCheckUtils]: 1,172: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,423 INFO L272 TraceCheckUtils]: 1,171: Hoare triple {39083#(<= ~counter~0 45)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,423 INFO L284 TraceCheckUtils]: 1,170: Hoare quadruple {35319#true} {39083#(<= ~counter~0 45)} #63#return; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:57,423 INFO L290 TraceCheckUtils]: 1,169: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,424 INFO L290 TraceCheckUtils]: 1,168: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,424 INFO L290 TraceCheckUtils]: 1,167: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,424 INFO L272 TraceCheckUtils]: 1,166: Hoare triple {39083#(<= ~counter~0 45)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,424 INFO L284 TraceCheckUtils]: 1,165: Hoare quadruple {35319#true} {39083#(<= ~counter~0 45)} #61#return; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:57,424 INFO L290 TraceCheckUtils]: 1,164: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,424 INFO L290 TraceCheckUtils]: 1,163: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,424 INFO L290 TraceCheckUtils]: 1,162: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,424 INFO L272 TraceCheckUtils]: 1,161: Hoare triple {39083#(<= ~counter~0 45)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,425 INFO L284 TraceCheckUtils]: 1,160: Hoare quadruple {35319#true} {39083#(<= ~counter~0 45)} #59#return; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:57,425 INFO L290 TraceCheckUtils]: 1,159: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,425 INFO L290 TraceCheckUtils]: 1,158: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,425 INFO L290 TraceCheckUtils]: 1,157: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,425 INFO L272 TraceCheckUtils]: 1,156: Hoare triple {39083#(<= ~counter~0 45)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,426 INFO L290 TraceCheckUtils]: 1,155: Hoare triple {39083#(<= ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:57,426 INFO L290 TraceCheckUtils]: 1,154: Hoare triple {38998#(<= ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39083#(<= ~counter~0 45)} is VALID [2022-04-14 15:17:57,427 INFO L290 TraceCheckUtils]: 1,153: Hoare triple {38998#(<= ~counter~0 44)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:57,427 INFO L284 TraceCheckUtils]: 1,152: Hoare quadruple {35319#true} {38998#(<= ~counter~0 44)} #67#return; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:57,427 INFO L290 TraceCheckUtils]: 1,151: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,427 INFO L290 TraceCheckUtils]: 1,150: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,427 INFO L290 TraceCheckUtils]: 1,149: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,427 INFO L272 TraceCheckUtils]: 1,148: Hoare triple {38998#(<= ~counter~0 44)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,428 INFO L284 TraceCheckUtils]: 1,147: Hoare quadruple {35319#true} {38998#(<= ~counter~0 44)} #65#return; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:57,428 INFO L290 TraceCheckUtils]: 1,146: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,428 INFO L290 TraceCheckUtils]: 1,145: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,428 INFO L290 TraceCheckUtils]: 1,144: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,428 INFO L272 TraceCheckUtils]: 1,143: Hoare triple {38998#(<= ~counter~0 44)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,429 INFO L284 TraceCheckUtils]: 1,142: Hoare quadruple {35319#true} {38998#(<= ~counter~0 44)} #63#return; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:57,429 INFO L290 TraceCheckUtils]: 1,141: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,429 INFO L290 TraceCheckUtils]: 1,140: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,429 INFO L290 TraceCheckUtils]: 1,139: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,429 INFO L272 TraceCheckUtils]: 1,138: Hoare triple {38998#(<= ~counter~0 44)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,429 INFO L284 TraceCheckUtils]: 1,137: Hoare quadruple {35319#true} {38998#(<= ~counter~0 44)} #61#return; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:57,430 INFO L290 TraceCheckUtils]: 1,136: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,430 INFO L290 TraceCheckUtils]: 1,135: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,430 INFO L290 TraceCheckUtils]: 1,134: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,430 INFO L272 TraceCheckUtils]: 1,133: Hoare triple {38998#(<= ~counter~0 44)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,430 INFO L284 TraceCheckUtils]: 1,132: Hoare quadruple {35319#true} {38998#(<= ~counter~0 44)} #59#return; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:57,430 INFO L290 TraceCheckUtils]: 1,131: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,430 INFO L290 TraceCheckUtils]: 1,130: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,430 INFO L290 TraceCheckUtils]: 1,129: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,431 INFO L272 TraceCheckUtils]: 1,128: Hoare triple {38998#(<= ~counter~0 44)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,431 INFO L290 TraceCheckUtils]: 1,127: Hoare triple {38998#(<= ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:57,432 INFO L290 TraceCheckUtils]: 1,126: Hoare triple {38913#(<= ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38998#(<= ~counter~0 44)} is VALID [2022-04-14 15:17:57,432 INFO L290 TraceCheckUtils]: 1,125: Hoare triple {38913#(<= ~counter~0 43)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:57,432 INFO L284 TraceCheckUtils]: 1,124: Hoare quadruple {35319#true} {38913#(<= ~counter~0 43)} #67#return; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:57,432 INFO L290 TraceCheckUtils]: 1,123: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,432 INFO L290 TraceCheckUtils]: 1,122: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,433 INFO L290 TraceCheckUtils]: 1,121: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,433 INFO L272 TraceCheckUtils]: 1,120: Hoare triple {38913#(<= ~counter~0 43)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,433 INFO L284 TraceCheckUtils]: 1,119: Hoare quadruple {35319#true} {38913#(<= ~counter~0 43)} #65#return; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:57,433 INFO L290 TraceCheckUtils]: 1,118: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,433 INFO L290 TraceCheckUtils]: 1,117: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,433 INFO L290 TraceCheckUtils]: 1,116: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,433 INFO L272 TraceCheckUtils]: 1,115: Hoare triple {38913#(<= ~counter~0 43)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,434 INFO L284 TraceCheckUtils]: 1,114: Hoare quadruple {35319#true} {38913#(<= ~counter~0 43)} #63#return; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:57,434 INFO L290 TraceCheckUtils]: 1,113: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,434 INFO L290 TraceCheckUtils]: 1,112: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,434 INFO L290 TraceCheckUtils]: 1,111: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,434 INFO L272 TraceCheckUtils]: 1,110: Hoare triple {38913#(<= ~counter~0 43)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,435 INFO L284 TraceCheckUtils]: 1,109: Hoare quadruple {35319#true} {38913#(<= ~counter~0 43)} #61#return; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:57,435 INFO L290 TraceCheckUtils]: 1,108: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,435 INFO L290 TraceCheckUtils]: 1,107: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,435 INFO L290 TraceCheckUtils]: 1,106: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,435 INFO L272 TraceCheckUtils]: 1,105: Hoare triple {38913#(<= ~counter~0 43)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,435 INFO L284 TraceCheckUtils]: 1,104: Hoare quadruple {35319#true} {38913#(<= ~counter~0 43)} #59#return; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:57,436 INFO L290 TraceCheckUtils]: 1,103: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,436 INFO L290 TraceCheckUtils]: 1,102: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,436 INFO L290 TraceCheckUtils]: 1,101: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,436 INFO L272 TraceCheckUtils]: 1,100: Hoare triple {38913#(<= ~counter~0 43)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,436 INFO L290 TraceCheckUtils]: 1,099: Hoare triple {38913#(<= ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:57,437 INFO L290 TraceCheckUtils]: 1,098: Hoare triple {38828#(<= ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38913#(<= ~counter~0 43)} is VALID [2022-04-14 15:17:57,437 INFO L290 TraceCheckUtils]: 1,097: Hoare triple {38828#(<= ~counter~0 42)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:57,437 INFO L284 TraceCheckUtils]: 1,096: Hoare quadruple {35319#true} {38828#(<= ~counter~0 42)} #67#return; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:57,438 INFO L290 TraceCheckUtils]: 1,095: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,438 INFO L290 TraceCheckUtils]: 1,094: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,438 INFO L290 TraceCheckUtils]: 1,093: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,438 INFO L272 TraceCheckUtils]: 1,092: Hoare triple {38828#(<= ~counter~0 42)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,438 INFO L284 TraceCheckUtils]: 1,091: Hoare quadruple {35319#true} {38828#(<= ~counter~0 42)} #65#return; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:57,438 INFO L290 TraceCheckUtils]: 1,090: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,438 INFO L290 TraceCheckUtils]: 1,089: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,438 INFO L290 TraceCheckUtils]: 1,088: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,439 INFO L272 TraceCheckUtils]: 1,087: Hoare triple {38828#(<= ~counter~0 42)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,439 INFO L284 TraceCheckUtils]: 1,086: Hoare quadruple {35319#true} {38828#(<= ~counter~0 42)} #63#return; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:57,439 INFO L290 TraceCheckUtils]: 1,085: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,439 INFO L290 TraceCheckUtils]: 1,084: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,439 INFO L290 TraceCheckUtils]: 1,083: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,439 INFO L272 TraceCheckUtils]: 1,082: Hoare triple {38828#(<= ~counter~0 42)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,440 INFO L284 TraceCheckUtils]: 1,081: Hoare quadruple {35319#true} {38828#(<= ~counter~0 42)} #61#return; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:57,440 INFO L290 TraceCheckUtils]: 1,080: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,440 INFO L290 TraceCheckUtils]: 1,079: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,440 INFO L290 TraceCheckUtils]: 1,078: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,440 INFO L272 TraceCheckUtils]: 1,077: Hoare triple {38828#(<= ~counter~0 42)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,441 INFO L284 TraceCheckUtils]: 1,076: Hoare quadruple {35319#true} {38828#(<= ~counter~0 42)} #59#return; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:57,441 INFO L290 TraceCheckUtils]: 1,075: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,441 INFO L290 TraceCheckUtils]: 1,074: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,441 INFO L290 TraceCheckUtils]: 1,073: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,441 INFO L272 TraceCheckUtils]: 1,072: Hoare triple {38828#(<= ~counter~0 42)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,441 INFO L290 TraceCheckUtils]: 1,071: Hoare triple {38828#(<= ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:57,442 INFO L290 TraceCheckUtils]: 1,070: Hoare triple {38743#(<= ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38828#(<= ~counter~0 42)} is VALID [2022-04-14 15:17:57,442 INFO L290 TraceCheckUtils]: 1,069: Hoare triple {38743#(<= ~counter~0 41)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:57,443 INFO L284 TraceCheckUtils]: 1,068: Hoare quadruple {35319#true} {38743#(<= ~counter~0 41)} #67#return; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:57,443 INFO L290 TraceCheckUtils]: 1,067: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,443 INFO L290 TraceCheckUtils]: 1,066: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,443 INFO L290 TraceCheckUtils]: 1,065: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,443 INFO L272 TraceCheckUtils]: 1,064: Hoare triple {38743#(<= ~counter~0 41)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,443 INFO L284 TraceCheckUtils]: 1,063: Hoare quadruple {35319#true} {38743#(<= ~counter~0 41)} #65#return; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:57,443 INFO L290 TraceCheckUtils]: 1,062: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,444 INFO L290 TraceCheckUtils]: 1,061: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,444 INFO L290 TraceCheckUtils]: 1,060: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,444 INFO L272 TraceCheckUtils]: 1,059: Hoare triple {38743#(<= ~counter~0 41)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,444 INFO L284 TraceCheckUtils]: 1,058: Hoare quadruple {35319#true} {38743#(<= ~counter~0 41)} #63#return; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:57,444 INFO L290 TraceCheckUtils]: 1,057: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,444 INFO L290 TraceCheckUtils]: 1,056: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,444 INFO L290 TraceCheckUtils]: 1,055: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,444 INFO L272 TraceCheckUtils]: 1,054: Hoare triple {38743#(<= ~counter~0 41)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,445 INFO L284 TraceCheckUtils]: 1,053: Hoare quadruple {35319#true} {38743#(<= ~counter~0 41)} #61#return; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:57,445 INFO L290 TraceCheckUtils]: 1,052: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,445 INFO L290 TraceCheckUtils]: 1,051: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,445 INFO L290 TraceCheckUtils]: 1,050: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,445 INFO L272 TraceCheckUtils]: 1,049: Hoare triple {38743#(<= ~counter~0 41)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,446 INFO L284 TraceCheckUtils]: 1,048: Hoare quadruple {35319#true} {38743#(<= ~counter~0 41)} #59#return; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:57,446 INFO L290 TraceCheckUtils]: 1,047: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,446 INFO L290 TraceCheckUtils]: 1,046: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,446 INFO L290 TraceCheckUtils]: 1,045: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,446 INFO L272 TraceCheckUtils]: 1,044: Hoare triple {38743#(<= ~counter~0 41)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,446 INFO L290 TraceCheckUtils]: 1,043: Hoare triple {38743#(<= ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:57,447 INFO L290 TraceCheckUtils]: 1,042: Hoare triple {38658#(<= ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38743#(<= ~counter~0 41)} is VALID [2022-04-14 15:17:57,447 INFO L290 TraceCheckUtils]: 1,041: Hoare triple {38658#(<= ~counter~0 40)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:57,448 INFO L284 TraceCheckUtils]: 1,040: Hoare quadruple {35319#true} {38658#(<= ~counter~0 40)} #67#return; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:57,448 INFO L290 TraceCheckUtils]: 1,039: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,448 INFO L290 TraceCheckUtils]: 1,038: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,448 INFO L290 TraceCheckUtils]: 1,037: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,448 INFO L272 TraceCheckUtils]: 1,036: Hoare triple {38658#(<= ~counter~0 40)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,449 INFO L284 TraceCheckUtils]: 1,035: Hoare quadruple {35319#true} {38658#(<= ~counter~0 40)} #65#return; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:57,449 INFO L290 TraceCheckUtils]: 1,034: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,449 INFO L290 TraceCheckUtils]: 1,033: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,449 INFO L290 TraceCheckUtils]: 1,032: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,449 INFO L272 TraceCheckUtils]: 1,031: Hoare triple {38658#(<= ~counter~0 40)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,449 INFO L284 TraceCheckUtils]: 1,030: Hoare quadruple {35319#true} {38658#(<= ~counter~0 40)} #63#return; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:57,449 INFO L290 TraceCheckUtils]: 1,029: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,449 INFO L290 TraceCheckUtils]: 1,028: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,450 INFO L290 TraceCheckUtils]: 1,027: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,450 INFO L272 TraceCheckUtils]: 1,026: Hoare triple {38658#(<= ~counter~0 40)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,450 INFO L284 TraceCheckUtils]: 1,025: Hoare quadruple {35319#true} {38658#(<= ~counter~0 40)} #61#return; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:57,450 INFO L290 TraceCheckUtils]: 1,024: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,450 INFO L290 TraceCheckUtils]: 1,023: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,450 INFO L290 TraceCheckUtils]: 1,022: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,450 INFO L272 TraceCheckUtils]: 1,021: Hoare triple {38658#(<= ~counter~0 40)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,451 INFO L284 TraceCheckUtils]: 1,020: Hoare quadruple {35319#true} {38658#(<= ~counter~0 40)} #59#return; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:57,451 INFO L290 TraceCheckUtils]: 1,019: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,451 INFO L290 TraceCheckUtils]: 1,018: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,451 INFO L290 TraceCheckUtils]: 1,017: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,451 INFO L272 TraceCheckUtils]: 1,016: Hoare triple {38658#(<= ~counter~0 40)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,451 INFO L290 TraceCheckUtils]: 1,015: Hoare triple {38658#(<= ~counter~0 40)} assume !!(#t~post5 < 50);havoc #t~post5; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:57,452 INFO L290 TraceCheckUtils]: 1,014: Hoare triple {38573#(<= ~counter~0 39)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38658#(<= ~counter~0 40)} is VALID [2022-04-14 15:17:57,452 INFO L290 TraceCheckUtils]: 1,013: Hoare triple {38573#(<= ~counter~0 39)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:57,453 INFO L284 TraceCheckUtils]: 1,012: Hoare quadruple {35319#true} {38573#(<= ~counter~0 39)} #67#return; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:57,453 INFO L290 TraceCheckUtils]: 1,011: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,453 INFO L290 TraceCheckUtils]: 1,010: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,453 INFO L290 TraceCheckUtils]: 1,009: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,453 INFO L272 TraceCheckUtils]: 1,008: Hoare triple {38573#(<= ~counter~0 39)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,454 INFO L284 TraceCheckUtils]: 1,007: Hoare quadruple {35319#true} {38573#(<= ~counter~0 39)} #65#return; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:57,454 INFO L290 TraceCheckUtils]: 1,006: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,454 INFO L290 TraceCheckUtils]: 1,005: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,454 INFO L290 TraceCheckUtils]: 1,004: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,454 INFO L272 TraceCheckUtils]: 1,003: Hoare triple {38573#(<= ~counter~0 39)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,454 INFO L284 TraceCheckUtils]: 1,002: Hoare quadruple {35319#true} {38573#(<= ~counter~0 39)} #63#return; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:57,455 INFO L290 TraceCheckUtils]: 1,001: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,455 INFO L290 TraceCheckUtils]: 1,000: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,455 INFO L290 TraceCheckUtils]: 999: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,455 INFO L272 TraceCheckUtils]: 998: Hoare triple {38573#(<= ~counter~0 39)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,455 INFO L284 TraceCheckUtils]: 997: Hoare quadruple {35319#true} {38573#(<= ~counter~0 39)} #61#return; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:57,455 INFO L290 TraceCheckUtils]: 996: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,455 INFO L290 TraceCheckUtils]: 995: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,455 INFO L290 TraceCheckUtils]: 994: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,456 INFO L272 TraceCheckUtils]: 993: Hoare triple {38573#(<= ~counter~0 39)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,456 INFO L284 TraceCheckUtils]: 992: Hoare quadruple {35319#true} {38573#(<= ~counter~0 39)} #59#return; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:57,456 INFO L290 TraceCheckUtils]: 991: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,456 INFO L290 TraceCheckUtils]: 990: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,456 INFO L290 TraceCheckUtils]: 989: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,456 INFO L272 TraceCheckUtils]: 988: Hoare triple {38573#(<= ~counter~0 39)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,457 INFO L290 TraceCheckUtils]: 987: Hoare triple {38573#(<= ~counter~0 39)} assume !!(#t~post5 < 50);havoc #t~post5; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:57,457 INFO L290 TraceCheckUtils]: 986: Hoare triple {38488#(<= ~counter~0 38)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38573#(<= ~counter~0 39)} is VALID [2022-04-14 15:17:57,458 INFO L290 TraceCheckUtils]: 985: Hoare triple {38488#(<= ~counter~0 38)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:57,458 INFO L284 TraceCheckUtils]: 984: Hoare quadruple {35319#true} {38488#(<= ~counter~0 38)} #67#return; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:57,458 INFO L290 TraceCheckUtils]: 983: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,458 INFO L290 TraceCheckUtils]: 982: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,458 INFO L290 TraceCheckUtils]: 981: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,458 INFO L272 TraceCheckUtils]: 980: Hoare triple {38488#(<= ~counter~0 38)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,459 INFO L284 TraceCheckUtils]: 979: Hoare quadruple {35319#true} {38488#(<= ~counter~0 38)} #65#return; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:57,459 INFO L290 TraceCheckUtils]: 978: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,459 INFO L290 TraceCheckUtils]: 977: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,459 INFO L290 TraceCheckUtils]: 976: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,459 INFO L272 TraceCheckUtils]: 975: Hoare triple {38488#(<= ~counter~0 38)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,460 INFO L284 TraceCheckUtils]: 974: Hoare quadruple {35319#true} {38488#(<= ~counter~0 38)} #63#return; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:57,460 INFO L290 TraceCheckUtils]: 973: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,460 INFO L290 TraceCheckUtils]: 972: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,460 INFO L290 TraceCheckUtils]: 971: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,460 INFO L272 TraceCheckUtils]: 970: Hoare triple {38488#(<= ~counter~0 38)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,460 INFO L284 TraceCheckUtils]: 969: Hoare quadruple {35319#true} {38488#(<= ~counter~0 38)} #61#return; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:57,460 INFO L290 TraceCheckUtils]: 968: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,461 INFO L290 TraceCheckUtils]: 967: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,461 INFO L290 TraceCheckUtils]: 966: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,461 INFO L272 TraceCheckUtils]: 965: Hoare triple {38488#(<= ~counter~0 38)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,461 INFO L284 TraceCheckUtils]: 964: Hoare quadruple {35319#true} {38488#(<= ~counter~0 38)} #59#return; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:57,461 INFO L290 TraceCheckUtils]: 963: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,461 INFO L290 TraceCheckUtils]: 962: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,461 INFO L290 TraceCheckUtils]: 961: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,461 INFO L272 TraceCheckUtils]: 960: Hoare triple {38488#(<= ~counter~0 38)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,462 INFO L290 TraceCheckUtils]: 959: Hoare triple {38488#(<= ~counter~0 38)} assume !!(#t~post5 < 50);havoc #t~post5; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:57,462 INFO L290 TraceCheckUtils]: 958: Hoare triple {38403#(<= ~counter~0 37)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38488#(<= ~counter~0 38)} is VALID [2022-04-14 15:17:57,463 INFO L290 TraceCheckUtils]: 957: Hoare triple {38403#(<= ~counter~0 37)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:57,463 INFO L284 TraceCheckUtils]: 956: Hoare quadruple {35319#true} {38403#(<= ~counter~0 37)} #67#return; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:57,463 INFO L290 TraceCheckUtils]: 955: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,463 INFO L290 TraceCheckUtils]: 954: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,463 INFO L290 TraceCheckUtils]: 953: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,463 INFO L272 TraceCheckUtils]: 952: Hoare triple {38403#(<= ~counter~0 37)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,464 INFO L284 TraceCheckUtils]: 951: Hoare quadruple {35319#true} {38403#(<= ~counter~0 37)} #65#return; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:57,464 INFO L290 TraceCheckUtils]: 950: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,464 INFO L290 TraceCheckUtils]: 949: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,464 INFO L290 TraceCheckUtils]: 948: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,464 INFO L272 TraceCheckUtils]: 947: Hoare triple {38403#(<= ~counter~0 37)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,465 INFO L284 TraceCheckUtils]: 946: Hoare quadruple {35319#true} {38403#(<= ~counter~0 37)} #63#return; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:57,465 INFO L290 TraceCheckUtils]: 945: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,465 INFO L290 TraceCheckUtils]: 944: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,465 INFO L290 TraceCheckUtils]: 943: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,465 INFO L272 TraceCheckUtils]: 942: Hoare triple {38403#(<= ~counter~0 37)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,465 INFO L284 TraceCheckUtils]: 941: Hoare quadruple {35319#true} {38403#(<= ~counter~0 37)} #61#return; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:57,466 INFO L290 TraceCheckUtils]: 940: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,466 INFO L290 TraceCheckUtils]: 939: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,466 INFO L290 TraceCheckUtils]: 938: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,466 INFO L272 TraceCheckUtils]: 937: Hoare triple {38403#(<= ~counter~0 37)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,466 INFO L284 TraceCheckUtils]: 936: Hoare quadruple {35319#true} {38403#(<= ~counter~0 37)} #59#return; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:57,466 INFO L290 TraceCheckUtils]: 935: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,466 INFO L290 TraceCheckUtils]: 934: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,466 INFO L290 TraceCheckUtils]: 933: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,467 INFO L272 TraceCheckUtils]: 932: Hoare triple {38403#(<= ~counter~0 37)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,467 INFO L290 TraceCheckUtils]: 931: Hoare triple {38403#(<= ~counter~0 37)} assume !!(#t~post5 < 50);havoc #t~post5; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:57,468 INFO L290 TraceCheckUtils]: 930: Hoare triple {38318#(<= ~counter~0 36)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38403#(<= ~counter~0 37)} is VALID [2022-04-14 15:17:57,468 INFO L290 TraceCheckUtils]: 929: Hoare triple {38318#(<= ~counter~0 36)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:57,468 INFO L284 TraceCheckUtils]: 928: Hoare quadruple {35319#true} {38318#(<= ~counter~0 36)} #67#return; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:57,468 INFO L290 TraceCheckUtils]: 927: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,468 INFO L290 TraceCheckUtils]: 926: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,469 INFO L290 TraceCheckUtils]: 925: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,469 INFO L272 TraceCheckUtils]: 924: Hoare triple {38318#(<= ~counter~0 36)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,469 INFO L284 TraceCheckUtils]: 923: Hoare quadruple {35319#true} {38318#(<= ~counter~0 36)} #65#return; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:57,469 INFO L290 TraceCheckUtils]: 922: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,469 INFO L290 TraceCheckUtils]: 921: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,469 INFO L290 TraceCheckUtils]: 920: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,469 INFO L272 TraceCheckUtils]: 919: Hoare triple {38318#(<= ~counter~0 36)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,470 INFO L284 TraceCheckUtils]: 918: Hoare quadruple {35319#true} {38318#(<= ~counter~0 36)} #63#return; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:57,470 INFO L290 TraceCheckUtils]: 917: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,470 INFO L290 TraceCheckUtils]: 916: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,470 INFO L290 TraceCheckUtils]: 915: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,470 INFO L272 TraceCheckUtils]: 914: Hoare triple {38318#(<= ~counter~0 36)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,471 INFO L284 TraceCheckUtils]: 913: Hoare quadruple {35319#true} {38318#(<= ~counter~0 36)} #61#return; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:57,471 INFO L290 TraceCheckUtils]: 912: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,471 INFO L290 TraceCheckUtils]: 911: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,471 INFO L290 TraceCheckUtils]: 910: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,471 INFO L272 TraceCheckUtils]: 909: Hoare triple {38318#(<= ~counter~0 36)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,471 INFO L284 TraceCheckUtils]: 908: Hoare quadruple {35319#true} {38318#(<= ~counter~0 36)} #59#return; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:57,472 INFO L290 TraceCheckUtils]: 907: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,472 INFO L290 TraceCheckUtils]: 906: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,472 INFO L290 TraceCheckUtils]: 905: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,472 INFO L272 TraceCheckUtils]: 904: Hoare triple {38318#(<= ~counter~0 36)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,472 INFO L290 TraceCheckUtils]: 903: Hoare triple {38318#(<= ~counter~0 36)} assume !!(#t~post5 < 50);havoc #t~post5; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:57,473 INFO L290 TraceCheckUtils]: 902: Hoare triple {38233#(<= ~counter~0 35)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38318#(<= ~counter~0 36)} is VALID [2022-04-14 15:17:57,473 INFO L290 TraceCheckUtils]: 901: Hoare triple {38233#(<= ~counter~0 35)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:57,473 INFO L284 TraceCheckUtils]: 900: Hoare quadruple {35319#true} {38233#(<= ~counter~0 35)} #67#return; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:57,474 INFO L290 TraceCheckUtils]: 899: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,474 INFO L290 TraceCheckUtils]: 898: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,474 INFO L290 TraceCheckUtils]: 897: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,474 INFO L272 TraceCheckUtils]: 896: Hoare triple {38233#(<= ~counter~0 35)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,474 INFO L284 TraceCheckUtils]: 895: Hoare quadruple {35319#true} {38233#(<= ~counter~0 35)} #65#return; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:57,474 INFO L290 TraceCheckUtils]: 894: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,474 INFO L290 TraceCheckUtils]: 893: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,474 INFO L290 TraceCheckUtils]: 892: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,475 INFO L272 TraceCheckUtils]: 891: Hoare triple {38233#(<= ~counter~0 35)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,475 INFO L284 TraceCheckUtils]: 890: Hoare quadruple {35319#true} {38233#(<= ~counter~0 35)} #63#return; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:57,475 INFO L290 TraceCheckUtils]: 889: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,475 INFO L290 TraceCheckUtils]: 888: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,475 INFO L290 TraceCheckUtils]: 887: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,475 INFO L272 TraceCheckUtils]: 886: Hoare triple {38233#(<= ~counter~0 35)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,476 INFO L284 TraceCheckUtils]: 885: Hoare quadruple {35319#true} {38233#(<= ~counter~0 35)} #61#return; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:57,476 INFO L290 TraceCheckUtils]: 884: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,476 INFO L290 TraceCheckUtils]: 883: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,476 INFO L290 TraceCheckUtils]: 882: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,476 INFO L272 TraceCheckUtils]: 881: Hoare triple {38233#(<= ~counter~0 35)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,477 INFO L284 TraceCheckUtils]: 880: Hoare quadruple {35319#true} {38233#(<= ~counter~0 35)} #59#return; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:57,477 INFO L290 TraceCheckUtils]: 879: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,477 INFO L290 TraceCheckUtils]: 878: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,477 INFO L290 TraceCheckUtils]: 877: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,477 INFO L272 TraceCheckUtils]: 876: Hoare triple {38233#(<= ~counter~0 35)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,477 INFO L290 TraceCheckUtils]: 875: Hoare triple {38233#(<= ~counter~0 35)} assume !!(#t~post5 < 50);havoc #t~post5; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:57,478 INFO L290 TraceCheckUtils]: 874: Hoare triple {38148#(<= ~counter~0 34)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38233#(<= ~counter~0 35)} is VALID [2022-04-14 15:17:57,478 INFO L290 TraceCheckUtils]: 873: Hoare triple {38148#(<= ~counter~0 34)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:57,479 INFO L284 TraceCheckUtils]: 872: Hoare quadruple {35319#true} {38148#(<= ~counter~0 34)} #67#return; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:57,479 INFO L290 TraceCheckUtils]: 871: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,479 INFO L290 TraceCheckUtils]: 870: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,479 INFO L290 TraceCheckUtils]: 869: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,479 INFO L272 TraceCheckUtils]: 868: Hoare triple {38148#(<= ~counter~0 34)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,479 INFO L284 TraceCheckUtils]: 867: Hoare quadruple {35319#true} {38148#(<= ~counter~0 34)} #65#return; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:57,479 INFO L290 TraceCheckUtils]: 866: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,480 INFO L290 TraceCheckUtils]: 865: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,480 INFO L290 TraceCheckUtils]: 864: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,480 INFO L272 TraceCheckUtils]: 863: Hoare triple {38148#(<= ~counter~0 34)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,480 INFO L284 TraceCheckUtils]: 862: Hoare quadruple {35319#true} {38148#(<= ~counter~0 34)} #63#return; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:57,480 INFO L290 TraceCheckUtils]: 861: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,480 INFO L290 TraceCheckUtils]: 860: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,480 INFO L290 TraceCheckUtils]: 859: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,480 INFO L272 TraceCheckUtils]: 858: Hoare triple {38148#(<= ~counter~0 34)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,481 INFO L284 TraceCheckUtils]: 857: Hoare quadruple {35319#true} {38148#(<= ~counter~0 34)} #61#return; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:57,481 INFO L290 TraceCheckUtils]: 856: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,481 INFO L290 TraceCheckUtils]: 855: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,481 INFO L290 TraceCheckUtils]: 854: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,481 INFO L272 TraceCheckUtils]: 853: Hoare triple {38148#(<= ~counter~0 34)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,482 INFO L284 TraceCheckUtils]: 852: Hoare quadruple {35319#true} {38148#(<= ~counter~0 34)} #59#return; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:57,482 INFO L290 TraceCheckUtils]: 851: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,482 INFO L290 TraceCheckUtils]: 850: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,482 INFO L290 TraceCheckUtils]: 849: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,482 INFO L272 TraceCheckUtils]: 848: Hoare triple {38148#(<= ~counter~0 34)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,482 INFO L290 TraceCheckUtils]: 847: Hoare triple {38148#(<= ~counter~0 34)} assume !!(#t~post5 < 50);havoc #t~post5; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:57,483 INFO L290 TraceCheckUtils]: 846: Hoare triple {38063#(<= ~counter~0 33)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38148#(<= ~counter~0 34)} is VALID [2022-04-14 15:17:57,483 INFO L290 TraceCheckUtils]: 845: Hoare triple {38063#(<= ~counter~0 33)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:57,484 INFO L284 TraceCheckUtils]: 844: Hoare quadruple {35319#true} {38063#(<= ~counter~0 33)} #67#return; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:57,484 INFO L290 TraceCheckUtils]: 843: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,484 INFO L290 TraceCheckUtils]: 842: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,484 INFO L290 TraceCheckUtils]: 841: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,484 INFO L272 TraceCheckUtils]: 840: Hoare triple {38063#(<= ~counter~0 33)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,485 INFO L284 TraceCheckUtils]: 839: Hoare quadruple {35319#true} {38063#(<= ~counter~0 33)} #65#return; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:57,485 INFO L290 TraceCheckUtils]: 838: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,485 INFO L290 TraceCheckUtils]: 837: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,485 INFO L290 TraceCheckUtils]: 836: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,485 INFO L272 TraceCheckUtils]: 835: Hoare triple {38063#(<= ~counter~0 33)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,485 INFO L284 TraceCheckUtils]: 834: Hoare quadruple {35319#true} {38063#(<= ~counter~0 33)} #63#return; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:57,485 INFO L290 TraceCheckUtils]: 833: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,486 INFO L290 TraceCheckUtils]: 832: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,486 INFO L290 TraceCheckUtils]: 831: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,486 INFO L272 TraceCheckUtils]: 830: Hoare triple {38063#(<= ~counter~0 33)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,486 INFO L284 TraceCheckUtils]: 829: Hoare quadruple {35319#true} {38063#(<= ~counter~0 33)} #61#return; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:57,486 INFO L290 TraceCheckUtils]: 828: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,486 INFO L290 TraceCheckUtils]: 827: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,486 INFO L290 TraceCheckUtils]: 826: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,487 INFO L272 TraceCheckUtils]: 825: Hoare triple {38063#(<= ~counter~0 33)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,487 INFO L284 TraceCheckUtils]: 824: Hoare quadruple {35319#true} {38063#(<= ~counter~0 33)} #59#return; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:57,487 INFO L290 TraceCheckUtils]: 823: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,487 INFO L290 TraceCheckUtils]: 822: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,487 INFO L290 TraceCheckUtils]: 821: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,487 INFO L272 TraceCheckUtils]: 820: Hoare triple {38063#(<= ~counter~0 33)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,488 INFO L290 TraceCheckUtils]: 819: Hoare triple {38063#(<= ~counter~0 33)} assume !!(#t~post5 < 50);havoc #t~post5; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:57,488 INFO L290 TraceCheckUtils]: 818: Hoare triple {37978#(<= ~counter~0 32)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38063#(<= ~counter~0 33)} is VALID [2022-04-14 15:17:57,489 INFO L290 TraceCheckUtils]: 817: Hoare triple {37978#(<= ~counter~0 32)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:57,489 INFO L284 TraceCheckUtils]: 816: Hoare quadruple {35319#true} {37978#(<= ~counter~0 32)} #67#return; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:57,489 INFO L290 TraceCheckUtils]: 815: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,489 INFO L290 TraceCheckUtils]: 814: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,489 INFO L290 TraceCheckUtils]: 813: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,489 INFO L272 TraceCheckUtils]: 812: Hoare triple {37978#(<= ~counter~0 32)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,490 INFO L284 TraceCheckUtils]: 811: Hoare quadruple {35319#true} {37978#(<= ~counter~0 32)} #65#return; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:57,490 INFO L290 TraceCheckUtils]: 810: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,490 INFO L290 TraceCheckUtils]: 809: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,490 INFO L290 TraceCheckUtils]: 808: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,490 INFO L272 TraceCheckUtils]: 807: Hoare triple {37978#(<= ~counter~0 32)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,491 INFO L284 TraceCheckUtils]: 806: Hoare quadruple {35319#true} {37978#(<= ~counter~0 32)} #63#return; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:57,491 INFO L290 TraceCheckUtils]: 805: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,491 INFO L290 TraceCheckUtils]: 804: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,491 INFO L290 TraceCheckUtils]: 803: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,491 INFO L272 TraceCheckUtils]: 802: Hoare triple {37978#(<= ~counter~0 32)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,492 INFO L284 TraceCheckUtils]: 801: Hoare quadruple {35319#true} {37978#(<= ~counter~0 32)} #61#return; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:57,492 INFO L290 TraceCheckUtils]: 800: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,492 INFO L290 TraceCheckUtils]: 799: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,492 INFO L290 TraceCheckUtils]: 798: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,492 INFO L272 TraceCheckUtils]: 797: Hoare triple {37978#(<= ~counter~0 32)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,493 INFO L284 TraceCheckUtils]: 796: Hoare quadruple {35319#true} {37978#(<= ~counter~0 32)} #59#return; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:57,493 INFO L290 TraceCheckUtils]: 795: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,493 INFO L290 TraceCheckUtils]: 794: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,493 INFO L290 TraceCheckUtils]: 793: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,493 INFO L272 TraceCheckUtils]: 792: Hoare triple {37978#(<= ~counter~0 32)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,493 INFO L290 TraceCheckUtils]: 791: Hoare triple {37978#(<= ~counter~0 32)} assume !!(#t~post5 < 50);havoc #t~post5; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:57,494 INFO L290 TraceCheckUtils]: 790: Hoare triple {37893#(<= ~counter~0 31)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37978#(<= ~counter~0 32)} is VALID [2022-04-14 15:17:57,494 INFO L290 TraceCheckUtils]: 789: Hoare triple {37893#(<= ~counter~0 31)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:57,495 INFO L284 TraceCheckUtils]: 788: Hoare quadruple {35319#true} {37893#(<= ~counter~0 31)} #67#return; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:57,495 INFO L290 TraceCheckUtils]: 787: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,495 INFO L290 TraceCheckUtils]: 786: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,495 INFO L290 TraceCheckUtils]: 785: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,495 INFO L272 TraceCheckUtils]: 784: Hoare triple {37893#(<= ~counter~0 31)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,496 INFO L284 TraceCheckUtils]: 783: Hoare quadruple {35319#true} {37893#(<= ~counter~0 31)} #65#return; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:57,496 INFO L290 TraceCheckUtils]: 782: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,496 INFO L290 TraceCheckUtils]: 781: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,496 INFO L290 TraceCheckUtils]: 780: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,496 INFO L272 TraceCheckUtils]: 779: Hoare triple {37893#(<= ~counter~0 31)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,496 INFO L284 TraceCheckUtils]: 778: Hoare quadruple {35319#true} {37893#(<= ~counter~0 31)} #63#return; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:57,496 INFO L290 TraceCheckUtils]: 777: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,497 INFO L290 TraceCheckUtils]: 776: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,497 INFO L290 TraceCheckUtils]: 775: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,497 INFO L272 TraceCheckUtils]: 774: Hoare triple {37893#(<= ~counter~0 31)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,497 INFO L284 TraceCheckUtils]: 773: Hoare quadruple {35319#true} {37893#(<= ~counter~0 31)} #61#return; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:57,497 INFO L290 TraceCheckUtils]: 772: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,497 INFO L290 TraceCheckUtils]: 771: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,497 INFO L290 TraceCheckUtils]: 770: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,497 INFO L272 TraceCheckUtils]: 769: Hoare triple {37893#(<= ~counter~0 31)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,498 INFO L284 TraceCheckUtils]: 768: Hoare quadruple {35319#true} {37893#(<= ~counter~0 31)} #59#return; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:57,498 INFO L290 TraceCheckUtils]: 767: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,498 INFO L290 TraceCheckUtils]: 766: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,498 INFO L290 TraceCheckUtils]: 765: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,498 INFO L272 TraceCheckUtils]: 764: Hoare triple {37893#(<= ~counter~0 31)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,499 INFO L290 TraceCheckUtils]: 763: Hoare triple {37893#(<= ~counter~0 31)} assume !!(#t~post5 < 50);havoc #t~post5; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:57,499 INFO L290 TraceCheckUtils]: 762: Hoare triple {37808#(<= ~counter~0 30)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37893#(<= ~counter~0 31)} is VALID [2022-04-14 15:17:57,500 INFO L290 TraceCheckUtils]: 761: Hoare triple {37808#(<= ~counter~0 30)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:57,500 INFO L284 TraceCheckUtils]: 760: Hoare quadruple {35319#true} {37808#(<= ~counter~0 30)} #67#return; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:57,500 INFO L290 TraceCheckUtils]: 759: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,500 INFO L290 TraceCheckUtils]: 758: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,500 INFO L290 TraceCheckUtils]: 757: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,500 INFO L272 TraceCheckUtils]: 756: Hoare triple {37808#(<= ~counter~0 30)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,501 INFO L284 TraceCheckUtils]: 755: Hoare quadruple {35319#true} {37808#(<= ~counter~0 30)} #65#return; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:57,501 INFO L290 TraceCheckUtils]: 754: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,501 INFO L290 TraceCheckUtils]: 753: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,501 INFO L290 TraceCheckUtils]: 752: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,501 INFO L272 TraceCheckUtils]: 751: Hoare triple {37808#(<= ~counter~0 30)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,502 INFO L284 TraceCheckUtils]: 750: Hoare quadruple {35319#true} {37808#(<= ~counter~0 30)} #63#return; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:57,502 INFO L290 TraceCheckUtils]: 749: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,502 INFO L290 TraceCheckUtils]: 748: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,502 INFO L290 TraceCheckUtils]: 747: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,502 INFO L272 TraceCheckUtils]: 746: Hoare triple {37808#(<= ~counter~0 30)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,502 INFO L284 TraceCheckUtils]: 745: Hoare quadruple {35319#true} {37808#(<= ~counter~0 30)} #61#return; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:57,502 INFO L290 TraceCheckUtils]: 744: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,503 INFO L290 TraceCheckUtils]: 743: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,503 INFO L290 TraceCheckUtils]: 742: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,503 INFO L272 TraceCheckUtils]: 741: Hoare triple {37808#(<= ~counter~0 30)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,503 INFO L284 TraceCheckUtils]: 740: Hoare quadruple {35319#true} {37808#(<= ~counter~0 30)} #59#return; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:57,503 INFO L290 TraceCheckUtils]: 739: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,503 INFO L290 TraceCheckUtils]: 738: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,503 INFO L290 TraceCheckUtils]: 737: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,504 INFO L272 TraceCheckUtils]: 736: Hoare triple {37808#(<= ~counter~0 30)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,504 INFO L290 TraceCheckUtils]: 735: Hoare triple {37808#(<= ~counter~0 30)} assume !!(#t~post5 < 50);havoc #t~post5; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:57,504 INFO L290 TraceCheckUtils]: 734: Hoare triple {37723#(<= ~counter~0 29)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37808#(<= ~counter~0 30)} is VALID [2022-04-14 15:17:57,505 INFO L290 TraceCheckUtils]: 733: Hoare triple {37723#(<= ~counter~0 29)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:57,505 INFO L284 TraceCheckUtils]: 732: Hoare quadruple {35319#true} {37723#(<= ~counter~0 29)} #67#return; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:57,505 INFO L290 TraceCheckUtils]: 731: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,505 INFO L290 TraceCheckUtils]: 730: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,505 INFO L290 TraceCheckUtils]: 729: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,506 INFO L272 TraceCheckUtils]: 728: Hoare triple {37723#(<= ~counter~0 29)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,506 INFO L284 TraceCheckUtils]: 727: Hoare quadruple {35319#true} {37723#(<= ~counter~0 29)} #65#return; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:57,506 INFO L290 TraceCheckUtils]: 726: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,506 INFO L290 TraceCheckUtils]: 725: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,506 INFO L290 TraceCheckUtils]: 724: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,506 INFO L272 TraceCheckUtils]: 723: Hoare triple {37723#(<= ~counter~0 29)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,507 INFO L284 TraceCheckUtils]: 722: Hoare quadruple {35319#true} {37723#(<= ~counter~0 29)} #63#return; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:57,507 INFO L290 TraceCheckUtils]: 721: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,507 INFO L290 TraceCheckUtils]: 720: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,507 INFO L290 TraceCheckUtils]: 719: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,507 INFO L272 TraceCheckUtils]: 718: Hoare triple {37723#(<= ~counter~0 29)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,508 INFO L284 TraceCheckUtils]: 717: Hoare quadruple {35319#true} {37723#(<= ~counter~0 29)} #61#return; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:57,508 INFO L290 TraceCheckUtils]: 716: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,508 INFO L290 TraceCheckUtils]: 715: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,508 INFO L290 TraceCheckUtils]: 714: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,508 INFO L272 TraceCheckUtils]: 713: Hoare triple {37723#(<= ~counter~0 29)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,508 INFO L284 TraceCheckUtils]: 712: Hoare quadruple {35319#true} {37723#(<= ~counter~0 29)} #59#return; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:57,508 INFO L290 TraceCheckUtils]: 711: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,509 INFO L290 TraceCheckUtils]: 710: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,509 INFO L290 TraceCheckUtils]: 709: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,509 INFO L272 TraceCheckUtils]: 708: Hoare triple {37723#(<= ~counter~0 29)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,509 INFO L290 TraceCheckUtils]: 707: Hoare triple {37723#(<= ~counter~0 29)} assume !!(#t~post5 < 50);havoc #t~post5; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:57,510 INFO L290 TraceCheckUtils]: 706: Hoare triple {37638#(<= ~counter~0 28)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37723#(<= ~counter~0 29)} is VALID [2022-04-14 15:17:57,510 INFO L290 TraceCheckUtils]: 705: Hoare triple {37638#(<= ~counter~0 28)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:57,510 INFO L284 TraceCheckUtils]: 704: Hoare quadruple {35319#true} {37638#(<= ~counter~0 28)} #67#return; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:57,511 INFO L290 TraceCheckUtils]: 703: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,511 INFO L290 TraceCheckUtils]: 702: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,511 INFO L290 TraceCheckUtils]: 701: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,511 INFO L272 TraceCheckUtils]: 700: Hoare triple {37638#(<= ~counter~0 28)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,511 INFO L284 TraceCheckUtils]: 699: Hoare quadruple {35319#true} {37638#(<= ~counter~0 28)} #65#return; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:57,511 INFO L290 TraceCheckUtils]: 698: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,511 INFO L290 TraceCheckUtils]: 697: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,512 INFO L290 TraceCheckUtils]: 696: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,512 INFO L272 TraceCheckUtils]: 695: Hoare triple {37638#(<= ~counter~0 28)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,512 INFO L284 TraceCheckUtils]: 694: Hoare quadruple {35319#true} {37638#(<= ~counter~0 28)} #63#return; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:57,512 INFO L290 TraceCheckUtils]: 693: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,512 INFO L290 TraceCheckUtils]: 692: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,512 INFO L290 TraceCheckUtils]: 691: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,512 INFO L272 TraceCheckUtils]: 690: Hoare triple {37638#(<= ~counter~0 28)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,513 INFO L284 TraceCheckUtils]: 689: Hoare quadruple {35319#true} {37638#(<= ~counter~0 28)} #61#return; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:57,513 INFO L290 TraceCheckUtils]: 688: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,513 INFO L290 TraceCheckUtils]: 687: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,513 INFO L290 TraceCheckUtils]: 686: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,513 INFO L272 TraceCheckUtils]: 685: Hoare triple {37638#(<= ~counter~0 28)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,514 INFO L284 TraceCheckUtils]: 684: Hoare quadruple {35319#true} {37638#(<= ~counter~0 28)} #59#return; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:57,514 INFO L290 TraceCheckUtils]: 683: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,514 INFO L290 TraceCheckUtils]: 682: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,514 INFO L290 TraceCheckUtils]: 681: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,514 INFO L272 TraceCheckUtils]: 680: Hoare triple {37638#(<= ~counter~0 28)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,514 INFO L290 TraceCheckUtils]: 679: Hoare triple {37638#(<= ~counter~0 28)} assume !!(#t~post5 < 50);havoc #t~post5; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:57,515 INFO L290 TraceCheckUtils]: 678: Hoare triple {37553#(<= ~counter~0 27)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37638#(<= ~counter~0 28)} is VALID [2022-04-14 15:17:57,515 INFO L290 TraceCheckUtils]: 677: Hoare triple {37553#(<= ~counter~0 27)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:57,516 INFO L284 TraceCheckUtils]: 676: Hoare quadruple {35319#true} {37553#(<= ~counter~0 27)} #67#return; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:57,516 INFO L290 TraceCheckUtils]: 675: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,516 INFO L290 TraceCheckUtils]: 674: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,516 INFO L290 TraceCheckUtils]: 673: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,516 INFO L272 TraceCheckUtils]: 672: Hoare triple {37553#(<= ~counter~0 27)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,517 INFO L284 TraceCheckUtils]: 671: Hoare quadruple {35319#true} {37553#(<= ~counter~0 27)} #65#return; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:57,517 INFO L290 TraceCheckUtils]: 670: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,517 INFO L290 TraceCheckUtils]: 669: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,517 INFO L290 TraceCheckUtils]: 668: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,517 INFO L272 TraceCheckUtils]: 667: Hoare triple {37553#(<= ~counter~0 27)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,517 INFO L284 TraceCheckUtils]: 666: Hoare quadruple {35319#true} {37553#(<= ~counter~0 27)} #63#return; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:57,517 INFO L290 TraceCheckUtils]: 665: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,518 INFO L290 TraceCheckUtils]: 664: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,518 INFO L290 TraceCheckUtils]: 663: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,518 INFO L272 TraceCheckUtils]: 662: Hoare triple {37553#(<= ~counter~0 27)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,518 INFO L284 TraceCheckUtils]: 661: Hoare quadruple {35319#true} {37553#(<= ~counter~0 27)} #61#return; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:57,518 INFO L290 TraceCheckUtils]: 660: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,518 INFO L290 TraceCheckUtils]: 659: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,518 INFO L290 TraceCheckUtils]: 658: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,518 INFO L272 TraceCheckUtils]: 657: Hoare triple {37553#(<= ~counter~0 27)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,519 INFO L284 TraceCheckUtils]: 656: Hoare quadruple {35319#true} {37553#(<= ~counter~0 27)} #59#return; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:57,519 INFO L290 TraceCheckUtils]: 655: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,519 INFO L290 TraceCheckUtils]: 654: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,519 INFO L290 TraceCheckUtils]: 653: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,519 INFO L272 TraceCheckUtils]: 652: Hoare triple {37553#(<= ~counter~0 27)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,520 INFO L290 TraceCheckUtils]: 651: Hoare triple {37553#(<= ~counter~0 27)} assume !!(#t~post5 < 50);havoc #t~post5; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:57,520 INFO L290 TraceCheckUtils]: 650: Hoare triple {37468#(<= ~counter~0 26)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37553#(<= ~counter~0 27)} is VALID [2022-04-14 15:17:57,520 INFO L290 TraceCheckUtils]: 649: Hoare triple {37468#(<= ~counter~0 26)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:57,521 INFO L284 TraceCheckUtils]: 648: Hoare quadruple {35319#true} {37468#(<= ~counter~0 26)} #67#return; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:57,521 INFO L290 TraceCheckUtils]: 647: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,521 INFO L290 TraceCheckUtils]: 646: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,521 INFO L290 TraceCheckUtils]: 645: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,521 INFO L272 TraceCheckUtils]: 644: Hoare triple {37468#(<= ~counter~0 26)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,522 INFO L284 TraceCheckUtils]: 643: Hoare quadruple {35319#true} {37468#(<= ~counter~0 26)} #65#return; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:57,522 INFO L290 TraceCheckUtils]: 642: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,522 INFO L290 TraceCheckUtils]: 641: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,522 INFO L290 TraceCheckUtils]: 640: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,522 INFO L272 TraceCheckUtils]: 639: Hoare triple {37468#(<= ~counter~0 26)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,523 INFO L284 TraceCheckUtils]: 638: Hoare quadruple {35319#true} {37468#(<= ~counter~0 26)} #63#return; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:57,523 INFO L290 TraceCheckUtils]: 637: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,523 INFO L290 TraceCheckUtils]: 636: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,523 INFO L290 TraceCheckUtils]: 635: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,523 INFO L272 TraceCheckUtils]: 634: Hoare triple {37468#(<= ~counter~0 26)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,523 INFO L284 TraceCheckUtils]: 633: Hoare quadruple {35319#true} {37468#(<= ~counter~0 26)} #61#return; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:57,523 INFO L290 TraceCheckUtils]: 632: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,523 INFO L290 TraceCheckUtils]: 631: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,524 INFO L290 TraceCheckUtils]: 630: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,524 INFO L272 TraceCheckUtils]: 629: Hoare triple {37468#(<= ~counter~0 26)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,524 INFO L284 TraceCheckUtils]: 628: Hoare quadruple {35319#true} {37468#(<= ~counter~0 26)} #59#return; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:57,524 INFO L290 TraceCheckUtils]: 627: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,524 INFO L290 TraceCheckUtils]: 626: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,524 INFO L290 TraceCheckUtils]: 625: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,524 INFO L272 TraceCheckUtils]: 624: Hoare triple {37468#(<= ~counter~0 26)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,525 INFO L290 TraceCheckUtils]: 623: Hoare triple {37468#(<= ~counter~0 26)} assume !!(#t~post5 < 50);havoc #t~post5; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:57,525 INFO L290 TraceCheckUtils]: 622: Hoare triple {37383#(<= ~counter~0 25)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37468#(<= ~counter~0 26)} is VALID [2022-04-14 15:17:57,526 INFO L290 TraceCheckUtils]: 621: Hoare triple {37383#(<= ~counter~0 25)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:57,526 INFO L284 TraceCheckUtils]: 620: Hoare quadruple {35319#true} {37383#(<= ~counter~0 25)} #67#return; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:57,526 INFO L290 TraceCheckUtils]: 619: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,526 INFO L290 TraceCheckUtils]: 618: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,526 INFO L290 TraceCheckUtils]: 617: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,526 INFO L272 TraceCheckUtils]: 616: Hoare triple {37383#(<= ~counter~0 25)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,527 INFO L284 TraceCheckUtils]: 615: Hoare quadruple {35319#true} {37383#(<= ~counter~0 25)} #65#return; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:57,527 INFO L290 TraceCheckUtils]: 614: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,527 INFO L290 TraceCheckUtils]: 613: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,527 INFO L290 TraceCheckUtils]: 612: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,527 INFO L272 TraceCheckUtils]: 611: Hoare triple {37383#(<= ~counter~0 25)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,528 INFO L284 TraceCheckUtils]: 610: Hoare quadruple {35319#true} {37383#(<= ~counter~0 25)} #63#return; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:57,528 INFO L290 TraceCheckUtils]: 609: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,528 INFO L290 TraceCheckUtils]: 608: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,528 INFO L290 TraceCheckUtils]: 607: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,528 INFO L272 TraceCheckUtils]: 606: Hoare triple {37383#(<= ~counter~0 25)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,528 INFO L284 TraceCheckUtils]: 605: Hoare quadruple {35319#true} {37383#(<= ~counter~0 25)} #61#return; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:57,529 INFO L290 TraceCheckUtils]: 604: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,529 INFO L290 TraceCheckUtils]: 603: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,529 INFO L290 TraceCheckUtils]: 602: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,529 INFO L272 TraceCheckUtils]: 601: Hoare triple {37383#(<= ~counter~0 25)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,529 INFO L284 TraceCheckUtils]: 600: Hoare quadruple {35319#true} {37383#(<= ~counter~0 25)} #59#return; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:57,529 INFO L290 TraceCheckUtils]: 599: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,529 INFO L290 TraceCheckUtils]: 598: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,529 INFO L290 TraceCheckUtils]: 597: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,530 INFO L272 TraceCheckUtils]: 596: Hoare triple {37383#(<= ~counter~0 25)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,530 INFO L290 TraceCheckUtils]: 595: Hoare triple {37383#(<= ~counter~0 25)} assume !!(#t~post5 < 50);havoc #t~post5; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:57,530 INFO L290 TraceCheckUtils]: 594: Hoare triple {37298#(<= ~counter~0 24)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37383#(<= ~counter~0 25)} is VALID [2022-04-14 15:17:57,531 INFO L290 TraceCheckUtils]: 593: Hoare triple {37298#(<= ~counter~0 24)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:57,531 INFO L284 TraceCheckUtils]: 592: Hoare quadruple {35319#true} {37298#(<= ~counter~0 24)} #67#return; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:57,531 INFO L290 TraceCheckUtils]: 591: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,531 INFO L290 TraceCheckUtils]: 590: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,531 INFO L290 TraceCheckUtils]: 589: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,532 INFO L272 TraceCheckUtils]: 588: Hoare triple {37298#(<= ~counter~0 24)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,532 INFO L284 TraceCheckUtils]: 587: Hoare quadruple {35319#true} {37298#(<= ~counter~0 24)} #65#return; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:57,532 INFO L290 TraceCheckUtils]: 586: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,532 INFO L290 TraceCheckUtils]: 585: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,532 INFO L290 TraceCheckUtils]: 584: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,532 INFO L272 TraceCheckUtils]: 583: Hoare triple {37298#(<= ~counter~0 24)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,533 INFO L284 TraceCheckUtils]: 582: Hoare quadruple {35319#true} {37298#(<= ~counter~0 24)} #63#return; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:57,533 INFO L290 TraceCheckUtils]: 581: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,533 INFO L290 TraceCheckUtils]: 580: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,533 INFO L290 TraceCheckUtils]: 579: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,533 INFO L272 TraceCheckUtils]: 578: Hoare triple {37298#(<= ~counter~0 24)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,534 INFO L284 TraceCheckUtils]: 577: Hoare quadruple {35319#true} {37298#(<= ~counter~0 24)} #61#return; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:57,534 INFO L290 TraceCheckUtils]: 576: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,534 INFO L290 TraceCheckUtils]: 575: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,534 INFO L290 TraceCheckUtils]: 574: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,534 INFO L272 TraceCheckUtils]: 573: Hoare triple {37298#(<= ~counter~0 24)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,534 INFO L284 TraceCheckUtils]: 572: Hoare quadruple {35319#true} {37298#(<= ~counter~0 24)} #59#return; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:57,534 INFO L290 TraceCheckUtils]: 571: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,535 INFO L290 TraceCheckUtils]: 570: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,535 INFO L290 TraceCheckUtils]: 569: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,535 INFO L272 TraceCheckUtils]: 568: Hoare triple {37298#(<= ~counter~0 24)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,535 INFO L290 TraceCheckUtils]: 567: Hoare triple {37298#(<= ~counter~0 24)} assume !!(#t~post5 < 50);havoc #t~post5; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:57,536 INFO L290 TraceCheckUtils]: 566: Hoare triple {37213#(<= ~counter~0 23)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37298#(<= ~counter~0 24)} is VALID [2022-04-14 15:17:57,536 INFO L290 TraceCheckUtils]: 565: Hoare triple {37213#(<= ~counter~0 23)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:57,536 INFO L284 TraceCheckUtils]: 564: Hoare quadruple {35319#true} {37213#(<= ~counter~0 23)} #67#return; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:57,537 INFO L290 TraceCheckUtils]: 563: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,537 INFO L290 TraceCheckUtils]: 562: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,537 INFO L290 TraceCheckUtils]: 561: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,537 INFO L272 TraceCheckUtils]: 560: Hoare triple {37213#(<= ~counter~0 23)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,537 INFO L284 TraceCheckUtils]: 559: Hoare quadruple {35319#true} {37213#(<= ~counter~0 23)} #65#return; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:57,537 INFO L290 TraceCheckUtils]: 558: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,537 INFO L290 TraceCheckUtils]: 557: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,537 INFO L290 TraceCheckUtils]: 556: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,538 INFO L272 TraceCheckUtils]: 555: Hoare triple {37213#(<= ~counter~0 23)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,538 INFO L284 TraceCheckUtils]: 554: Hoare quadruple {35319#true} {37213#(<= ~counter~0 23)} #63#return; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:57,538 INFO L290 TraceCheckUtils]: 553: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,538 INFO L290 TraceCheckUtils]: 552: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,538 INFO L290 TraceCheckUtils]: 551: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,538 INFO L272 TraceCheckUtils]: 550: Hoare triple {37213#(<= ~counter~0 23)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,539 INFO L284 TraceCheckUtils]: 549: Hoare quadruple {35319#true} {37213#(<= ~counter~0 23)} #61#return; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:57,539 INFO L290 TraceCheckUtils]: 548: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,539 INFO L290 TraceCheckUtils]: 547: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,539 INFO L290 TraceCheckUtils]: 546: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,539 INFO L272 TraceCheckUtils]: 545: Hoare triple {37213#(<= ~counter~0 23)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,540 INFO L284 TraceCheckUtils]: 544: Hoare quadruple {35319#true} {37213#(<= ~counter~0 23)} #59#return; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:57,540 INFO L290 TraceCheckUtils]: 543: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,540 INFO L290 TraceCheckUtils]: 542: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,540 INFO L290 TraceCheckUtils]: 541: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,540 INFO L272 TraceCheckUtils]: 540: Hoare triple {37213#(<= ~counter~0 23)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,540 INFO L290 TraceCheckUtils]: 539: Hoare triple {37213#(<= ~counter~0 23)} assume !!(#t~post5 < 50);havoc #t~post5; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:57,541 INFO L290 TraceCheckUtils]: 538: Hoare triple {37128#(<= ~counter~0 22)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37213#(<= ~counter~0 23)} is VALID [2022-04-14 15:17:57,541 INFO L290 TraceCheckUtils]: 537: Hoare triple {37128#(<= ~counter~0 22)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:57,542 INFO L284 TraceCheckUtils]: 536: Hoare quadruple {35319#true} {37128#(<= ~counter~0 22)} #67#return; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:57,542 INFO L290 TraceCheckUtils]: 535: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,542 INFO L290 TraceCheckUtils]: 534: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,542 INFO L290 TraceCheckUtils]: 533: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,542 INFO L272 TraceCheckUtils]: 532: Hoare triple {37128#(<= ~counter~0 22)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,542 INFO L284 TraceCheckUtils]: 531: Hoare quadruple {35319#true} {37128#(<= ~counter~0 22)} #65#return; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:57,543 INFO L290 TraceCheckUtils]: 530: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,543 INFO L290 TraceCheckUtils]: 529: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,543 INFO L290 TraceCheckUtils]: 528: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,543 INFO L272 TraceCheckUtils]: 527: Hoare triple {37128#(<= ~counter~0 22)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,543 INFO L284 TraceCheckUtils]: 526: Hoare quadruple {35319#true} {37128#(<= ~counter~0 22)} #63#return; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:57,543 INFO L290 TraceCheckUtils]: 525: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,543 INFO L290 TraceCheckUtils]: 524: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,543 INFO L290 TraceCheckUtils]: 523: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,544 INFO L272 TraceCheckUtils]: 522: Hoare triple {37128#(<= ~counter~0 22)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,544 INFO L284 TraceCheckUtils]: 521: Hoare quadruple {35319#true} {37128#(<= ~counter~0 22)} #61#return; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:57,544 INFO L290 TraceCheckUtils]: 520: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,544 INFO L290 TraceCheckUtils]: 519: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,544 INFO L290 TraceCheckUtils]: 518: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,544 INFO L272 TraceCheckUtils]: 517: Hoare triple {37128#(<= ~counter~0 22)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,545 INFO L284 TraceCheckUtils]: 516: Hoare quadruple {35319#true} {37128#(<= ~counter~0 22)} #59#return; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:57,545 INFO L290 TraceCheckUtils]: 515: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,545 INFO L290 TraceCheckUtils]: 514: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,545 INFO L290 TraceCheckUtils]: 513: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,545 INFO L272 TraceCheckUtils]: 512: Hoare triple {37128#(<= ~counter~0 22)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,545 INFO L290 TraceCheckUtils]: 511: Hoare triple {37128#(<= ~counter~0 22)} assume !!(#t~post5 < 50);havoc #t~post5; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:57,546 INFO L290 TraceCheckUtils]: 510: Hoare triple {37043#(<= ~counter~0 21)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37128#(<= ~counter~0 22)} is VALID [2022-04-14 15:17:57,546 INFO L290 TraceCheckUtils]: 509: Hoare triple {37043#(<= ~counter~0 21)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:57,547 INFO L284 TraceCheckUtils]: 508: Hoare quadruple {35319#true} {37043#(<= ~counter~0 21)} #67#return; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:57,547 INFO L290 TraceCheckUtils]: 507: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,547 INFO L290 TraceCheckUtils]: 506: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,547 INFO L290 TraceCheckUtils]: 505: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,547 INFO L272 TraceCheckUtils]: 504: Hoare triple {37043#(<= ~counter~0 21)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,548 INFO L284 TraceCheckUtils]: 503: Hoare quadruple {35319#true} {37043#(<= ~counter~0 21)} #65#return; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:57,548 INFO L290 TraceCheckUtils]: 502: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,548 INFO L290 TraceCheckUtils]: 501: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,548 INFO L290 TraceCheckUtils]: 500: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,548 INFO L272 TraceCheckUtils]: 499: Hoare triple {37043#(<= ~counter~0 21)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,548 INFO L284 TraceCheckUtils]: 498: Hoare quadruple {35319#true} {37043#(<= ~counter~0 21)} #63#return; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:57,548 INFO L290 TraceCheckUtils]: 497: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,549 INFO L290 TraceCheckUtils]: 496: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,549 INFO L290 TraceCheckUtils]: 495: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,549 INFO L272 TraceCheckUtils]: 494: Hoare triple {37043#(<= ~counter~0 21)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,549 INFO L284 TraceCheckUtils]: 493: Hoare quadruple {35319#true} {37043#(<= ~counter~0 21)} #61#return; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:57,549 INFO L290 TraceCheckUtils]: 492: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,549 INFO L290 TraceCheckUtils]: 491: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,549 INFO L290 TraceCheckUtils]: 490: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,550 INFO L272 TraceCheckUtils]: 489: Hoare triple {37043#(<= ~counter~0 21)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,550 INFO L284 TraceCheckUtils]: 488: Hoare quadruple {35319#true} {37043#(<= ~counter~0 21)} #59#return; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:57,550 INFO L290 TraceCheckUtils]: 487: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,550 INFO L290 TraceCheckUtils]: 486: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,550 INFO L290 TraceCheckUtils]: 485: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,550 INFO L272 TraceCheckUtils]: 484: Hoare triple {37043#(<= ~counter~0 21)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,551 INFO L290 TraceCheckUtils]: 483: Hoare triple {37043#(<= ~counter~0 21)} assume !!(#t~post5 < 50);havoc #t~post5; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:57,551 INFO L290 TraceCheckUtils]: 482: Hoare triple {36958#(<= ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37043#(<= ~counter~0 21)} is VALID [2022-04-14 15:17:57,552 INFO L290 TraceCheckUtils]: 481: Hoare triple {36958#(<= ~counter~0 20)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:57,552 INFO L284 TraceCheckUtils]: 480: Hoare quadruple {35319#true} {36958#(<= ~counter~0 20)} #67#return; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:57,552 INFO L290 TraceCheckUtils]: 479: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,552 INFO L290 TraceCheckUtils]: 478: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,552 INFO L290 TraceCheckUtils]: 477: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,553 INFO L272 TraceCheckUtils]: 476: Hoare triple {36958#(<= ~counter~0 20)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,553 INFO L284 TraceCheckUtils]: 475: Hoare quadruple {35319#true} {36958#(<= ~counter~0 20)} #65#return; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:57,553 INFO L290 TraceCheckUtils]: 474: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,553 INFO L290 TraceCheckUtils]: 473: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,553 INFO L290 TraceCheckUtils]: 472: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,553 INFO L272 TraceCheckUtils]: 471: Hoare triple {36958#(<= ~counter~0 20)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,554 INFO L284 TraceCheckUtils]: 470: Hoare quadruple {35319#true} {36958#(<= ~counter~0 20)} #63#return; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:57,554 INFO L290 TraceCheckUtils]: 469: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,554 INFO L290 TraceCheckUtils]: 468: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,554 INFO L290 TraceCheckUtils]: 467: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,554 INFO L272 TraceCheckUtils]: 466: Hoare triple {36958#(<= ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,555 INFO L284 TraceCheckUtils]: 465: Hoare quadruple {35319#true} {36958#(<= ~counter~0 20)} #61#return; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:57,555 INFO L290 TraceCheckUtils]: 464: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,555 INFO L290 TraceCheckUtils]: 463: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,555 INFO L290 TraceCheckUtils]: 462: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,555 INFO L272 TraceCheckUtils]: 461: Hoare triple {36958#(<= ~counter~0 20)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,555 INFO L284 TraceCheckUtils]: 460: Hoare quadruple {35319#true} {36958#(<= ~counter~0 20)} #59#return; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:57,556 INFO L290 TraceCheckUtils]: 459: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,556 INFO L290 TraceCheckUtils]: 458: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,556 INFO L290 TraceCheckUtils]: 457: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,556 INFO L272 TraceCheckUtils]: 456: Hoare triple {36958#(<= ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,556 INFO L290 TraceCheckUtils]: 455: Hoare triple {36958#(<= ~counter~0 20)} assume !!(#t~post5 < 50);havoc #t~post5; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:57,557 INFO L290 TraceCheckUtils]: 454: Hoare triple {36873#(<= ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36958#(<= ~counter~0 20)} is VALID [2022-04-14 15:17:57,557 INFO L290 TraceCheckUtils]: 453: Hoare triple {36873#(<= ~counter~0 19)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:57,558 INFO L284 TraceCheckUtils]: 452: Hoare quadruple {35319#true} {36873#(<= ~counter~0 19)} #67#return; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:57,558 INFO L290 TraceCheckUtils]: 451: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,558 INFO L290 TraceCheckUtils]: 450: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,558 INFO L290 TraceCheckUtils]: 449: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,558 INFO L272 TraceCheckUtils]: 448: Hoare triple {36873#(<= ~counter~0 19)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,558 INFO L284 TraceCheckUtils]: 447: Hoare quadruple {35319#true} {36873#(<= ~counter~0 19)} #65#return; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:57,558 INFO L290 TraceCheckUtils]: 446: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,559 INFO L290 TraceCheckUtils]: 445: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,559 INFO L290 TraceCheckUtils]: 444: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,559 INFO L272 TraceCheckUtils]: 443: Hoare triple {36873#(<= ~counter~0 19)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,559 INFO L284 TraceCheckUtils]: 442: Hoare quadruple {35319#true} {36873#(<= ~counter~0 19)} #63#return; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:57,559 INFO L290 TraceCheckUtils]: 441: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,559 INFO L290 TraceCheckUtils]: 440: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,559 INFO L290 TraceCheckUtils]: 439: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,559 INFO L272 TraceCheckUtils]: 438: Hoare triple {36873#(<= ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,560 INFO L284 TraceCheckUtils]: 437: Hoare quadruple {35319#true} {36873#(<= ~counter~0 19)} #61#return; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:57,560 INFO L290 TraceCheckUtils]: 436: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,560 INFO L290 TraceCheckUtils]: 435: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,560 INFO L290 TraceCheckUtils]: 434: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,560 INFO L272 TraceCheckUtils]: 433: Hoare triple {36873#(<= ~counter~0 19)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,560 INFO L284 TraceCheckUtils]: 432: Hoare quadruple {35319#true} {36873#(<= ~counter~0 19)} #59#return; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:57,560 INFO L290 TraceCheckUtils]: 431: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,561 INFO L290 TraceCheckUtils]: 430: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,561 INFO L290 TraceCheckUtils]: 429: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,561 INFO L272 TraceCheckUtils]: 428: Hoare triple {36873#(<= ~counter~0 19)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,561 INFO L290 TraceCheckUtils]: 427: Hoare triple {36873#(<= ~counter~0 19)} assume !!(#t~post5 < 50);havoc #t~post5; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:57,562 INFO L290 TraceCheckUtils]: 426: Hoare triple {36788#(<= ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36873#(<= ~counter~0 19)} is VALID [2022-04-14 15:17:57,562 INFO L290 TraceCheckUtils]: 425: Hoare triple {36788#(<= ~counter~0 18)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:57,562 INFO L284 TraceCheckUtils]: 424: Hoare quadruple {35319#true} {36788#(<= ~counter~0 18)} #67#return; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:57,562 INFO L290 TraceCheckUtils]: 423: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,562 INFO L290 TraceCheckUtils]: 422: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,562 INFO L290 TraceCheckUtils]: 421: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,562 INFO L272 TraceCheckUtils]: 420: Hoare triple {36788#(<= ~counter~0 18)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,563 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {35319#true} {36788#(<= ~counter~0 18)} #65#return; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:57,563 INFO L290 TraceCheckUtils]: 418: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,563 INFO L290 TraceCheckUtils]: 417: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,563 INFO L290 TraceCheckUtils]: 416: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,563 INFO L272 TraceCheckUtils]: 415: Hoare triple {36788#(<= ~counter~0 18)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,564 INFO L284 TraceCheckUtils]: 414: Hoare quadruple {35319#true} {36788#(<= ~counter~0 18)} #63#return; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:57,564 INFO L290 TraceCheckUtils]: 413: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,564 INFO L290 TraceCheckUtils]: 412: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,564 INFO L290 TraceCheckUtils]: 411: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,564 INFO L272 TraceCheckUtils]: 410: Hoare triple {36788#(<= ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,564 INFO L284 TraceCheckUtils]: 409: Hoare quadruple {35319#true} {36788#(<= ~counter~0 18)} #61#return; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:57,564 INFO L290 TraceCheckUtils]: 408: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,564 INFO L290 TraceCheckUtils]: 407: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,564 INFO L290 TraceCheckUtils]: 406: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,564 INFO L272 TraceCheckUtils]: 405: Hoare triple {36788#(<= ~counter~0 18)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,565 INFO L284 TraceCheckUtils]: 404: Hoare quadruple {35319#true} {36788#(<= ~counter~0 18)} #59#return; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:57,565 INFO L290 TraceCheckUtils]: 403: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,565 INFO L290 TraceCheckUtils]: 402: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,565 INFO L290 TraceCheckUtils]: 401: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,565 INFO L272 TraceCheckUtils]: 400: Hoare triple {36788#(<= ~counter~0 18)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,565 INFO L290 TraceCheckUtils]: 399: Hoare triple {36788#(<= ~counter~0 18)} assume !!(#t~post5 < 50);havoc #t~post5; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:57,566 INFO L290 TraceCheckUtils]: 398: Hoare triple {36703#(<= ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36788#(<= ~counter~0 18)} is VALID [2022-04-14 15:17:57,566 INFO L290 TraceCheckUtils]: 397: Hoare triple {36703#(<= ~counter~0 17)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:57,567 INFO L284 TraceCheckUtils]: 396: Hoare quadruple {35319#true} {36703#(<= ~counter~0 17)} #67#return; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:57,567 INFO L290 TraceCheckUtils]: 395: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,567 INFO L290 TraceCheckUtils]: 394: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,567 INFO L290 TraceCheckUtils]: 393: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,567 INFO L272 TraceCheckUtils]: 392: Hoare triple {36703#(<= ~counter~0 17)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,567 INFO L284 TraceCheckUtils]: 391: Hoare quadruple {35319#true} {36703#(<= ~counter~0 17)} #65#return; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:57,567 INFO L290 TraceCheckUtils]: 390: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,568 INFO L290 TraceCheckUtils]: 389: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,568 INFO L290 TraceCheckUtils]: 388: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,568 INFO L272 TraceCheckUtils]: 387: Hoare triple {36703#(<= ~counter~0 17)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,568 INFO L284 TraceCheckUtils]: 386: Hoare quadruple {35319#true} {36703#(<= ~counter~0 17)} #63#return; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:57,568 INFO L290 TraceCheckUtils]: 385: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,568 INFO L290 TraceCheckUtils]: 384: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,568 INFO L290 TraceCheckUtils]: 383: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,569 INFO L272 TraceCheckUtils]: 382: Hoare triple {36703#(<= ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,569 INFO L284 TraceCheckUtils]: 381: Hoare quadruple {35319#true} {36703#(<= ~counter~0 17)} #61#return; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:57,569 INFO L290 TraceCheckUtils]: 380: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,569 INFO L290 TraceCheckUtils]: 379: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,569 INFO L290 TraceCheckUtils]: 378: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,569 INFO L272 TraceCheckUtils]: 377: Hoare triple {36703#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,570 INFO L284 TraceCheckUtils]: 376: Hoare quadruple {35319#true} {36703#(<= ~counter~0 17)} #59#return; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:57,570 INFO L290 TraceCheckUtils]: 375: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,570 INFO L290 TraceCheckUtils]: 374: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,570 INFO L290 TraceCheckUtils]: 373: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,570 INFO L272 TraceCheckUtils]: 372: Hoare triple {36703#(<= ~counter~0 17)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,570 INFO L290 TraceCheckUtils]: 371: Hoare triple {36703#(<= ~counter~0 17)} assume !!(#t~post5 < 50);havoc #t~post5; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:57,571 INFO L290 TraceCheckUtils]: 370: Hoare triple {36618#(<= ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36703#(<= ~counter~0 17)} is VALID [2022-04-14 15:17:57,571 INFO L290 TraceCheckUtils]: 369: Hoare triple {36618#(<= ~counter~0 16)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:57,572 INFO L284 TraceCheckUtils]: 368: Hoare quadruple {35319#true} {36618#(<= ~counter~0 16)} #67#return; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:57,572 INFO L290 TraceCheckUtils]: 367: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,572 INFO L290 TraceCheckUtils]: 366: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,572 INFO L290 TraceCheckUtils]: 365: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,572 INFO L272 TraceCheckUtils]: 364: Hoare triple {36618#(<= ~counter~0 16)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,573 INFO L284 TraceCheckUtils]: 363: Hoare quadruple {35319#true} {36618#(<= ~counter~0 16)} #65#return; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:57,573 INFO L290 TraceCheckUtils]: 362: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,573 INFO L290 TraceCheckUtils]: 361: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,573 INFO L290 TraceCheckUtils]: 360: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,573 INFO L272 TraceCheckUtils]: 359: Hoare triple {36618#(<= ~counter~0 16)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,573 INFO L284 TraceCheckUtils]: 358: Hoare quadruple {35319#true} {36618#(<= ~counter~0 16)} #63#return; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:57,573 INFO L290 TraceCheckUtils]: 357: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,574 INFO L290 TraceCheckUtils]: 356: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,574 INFO L290 TraceCheckUtils]: 355: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,574 INFO L272 TraceCheckUtils]: 354: Hoare triple {36618#(<= ~counter~0 16)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,574 INFO L284 TraceCheckUtils]: 353: Hoare quadruple {35319#true} {36618#(<= ~counter~0 16)} #61#return; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:57,574 INFO L290 TraceCheckUtils]: 352: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,574 INFO L290 TraceCheckUtils]: 351: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,574 INFO L290 TraceCheckUtils]: 350: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,574 INFO L272 TraceCheckUtils]: 349: Hoare triple {36618#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,575 INFO L284 TraceCheckUtils]: 348: Hoare quadruple {35319#true} {36618#(<= ~counter~0 16)} #59#return; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:57,575 INFO L290 TraceCheckUtils]: 347: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,575 INFO L290 TraceCheckUtils]: 346: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,575 INFO L290 TraceCheckUtils]: 345: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,575 INFO L272 TraceCheckUtils]: 344: Hoare triple {36618#(<= ~counter~0 16)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,576 INFO L290 TraceCheckUtils]: 343: Hoare triple {36618#(<= ~counter~0 16)} assume !!(#t~post5 < 50);havoc #t~post5; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:57,576 INFO L290 TraceCheckUtils]: 342: Hoare triple {36533#(<= ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36618#(<= ~counter~0 16)} is VALID [2022-04-14 15:17:57,576 INFO L290 TraceCheckUtils]: 341: Hoare triple {36533#(<= ~counter~0 15)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:57,577 INFO L284 TraceCheckUtils]: 340: Hoare quadruple {35319#true} {36533#(<= ~counter~0 15)} #67#return; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:57,577 INFO L290 TraceCheckUtils]: 339: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,577 INFO L290 TraceCheckUtils]: 338: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,577 INFO L290 TraceCheckUtils]: 337: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,577 INFO L272 TraceCheckUtils]: 336: Hoare triple {36533#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,578 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {35319#true} {36533#(<= ~counter~0 15)} #65#return; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:57,578 INFO L290 TraceCheckUtils]: 334: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,578 INFO L290 TraceCheckUtils]: 333: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,578 INFO L290 TraceCheckUtils]: 332: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,578 INFO L272 TraceCheckUtils]: 331: Hoare triple {36533#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,578 INFO L284 TraceCheckUtils]: 330: Hoare quadruple {35319#true} {36533#(<= ~counter~0 15)} #63#return; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:57,579 INFO L290 TraceCheckUtils]: 329: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,579 INFO L290 TraceCheckUtils]: 328: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,579 INFO L290 TraceCheckUtils]: 327: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,579 INFO L272 TraceCheckUtils]: 326: Hoare triple {36533#(<= ~counter~0 15)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,579 INFO L284 TraceCheckUtils]: 325: Hoare quadruple {35319#true} {36533#(<= ~counter~0 15)} #61#return; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:57,579 INFO L290 TraceCheckUtils]: 324: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,579 INFO L290 TraceCheckUtils]: 323: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,579 INFO L290 TraceCheckUtils]: 322: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,580 INFO L272 TraceCheckUtils]: 321: Hoare triple {36533#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,580 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {35319#true} {36533#(<= ~counter~0 15)} #59#return; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:57,580 INFO L290 TraceCheckUtils]: 319: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,580 INFO L290 TraceCheckUtils]: 318: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,580 INFO L290 TraceCheckUtils]: 317: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,580 INFO L272 TraceCheckUtils]: 316: Hoare triple {36533#(<= ~counter~0 15)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,581 INFO L290 TraceCheckUtils]: 315: Hoare triple {36533#(<= ~counter~0 15)} assume !!(#t~post5 < 50);havoc #t~post5; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:57,581 INFO L290 TraceCheckUtils]: 314: Hoare triple {36448#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36533#(<= ~counter~0 15)} is VALID [2022-04-14 15:17:57,581 INFO L290 TraceCheckUtils]: 313: Hoare triple {36448#(<= ~counter~0 14)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:57,582 INFO L284 TraceCheckUtils]: 312: Hoare quadruple {35319#true} {36448#(<= ~counter~0 14)} #67#return; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:57,582 INFO L290 TraceCheckUtils]: 311: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,582 INFO L290 TraceCheckUtils]: 310: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,582 INFO L290 TraceCheckUtils]: 309: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,582 INFO L272 TraceCheckUtils]: 308: Hoare triple {36448#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,583 INFO L284 TraceCheckUtils]: 307: Hoare quadruple {35319#true} {36448#(<= ~counter~0 14)} #65#return; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:57,583 INFO L290 TraceCheckUtils]: 306: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,583 INFO L290 TraceCheckUtils]: 305: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,583 INFO L290 TraceCheckUtils]: 304: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,583 INFO L272 TraceCheckUtils]: 303: Hoare triple {36448#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,584 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {35319#true} {36448#(<= ~counter~0 14)} #63#return; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:57,584 INFO L290 TraceCheckUtils]: 301: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,584 INFO L290 TraceCheckUtils]: 300: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,584 INFO L290 TraceCheckUtils]: 299: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,584 INFO L272 TraceCheckUtils]: 298: Hoare triple {36448#(<= ~counter~0 14)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,584 INFO L284 TraceCheckUtils]: 297: Hoare quadruple {35319#true} {36448#(<= ~counter~0 14)} #61#return; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:57,584 INFO L290 TraceCheckUtils]: 296: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,585 INFO L290 TraceCheckUtils]: 295: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,585 INFO L290 TraceCheckUtils]: 294: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,585 INFO L272 TraceCheckUtils]: 293: Hoare triple {36448#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,585 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {35319#true} {36448#(<= ~counter~0 14)} #59#return; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:57,585 INFO L290 TraceCheckUtils]: 291: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,585 INFO L290 TraceCheckUtils]: 290: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,585 INFO L290 TraceCheckUtils]: 289: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,585 INFO L272 TraceCheckUtils]: 288: Hoare triple {36448#(<= ~counter~0 14)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,586 INFO L290 TraceCheckUtils]: 287: Hoare triple {36448#(<= ~counter~0 14)} assume !!(#t~post5 < 50);havoc #t~post5; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:57,586 INFO L290 TraceCheckUtils]: 286: Hoare triple {36363#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36448#(<= ~counter~0 14)} is VALID [2022-04-14 15:17:57,587 INFO L290 TraceCheckUtils]: 285: Hoare triple {36363#(<= ~counter~0 13)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:57,587 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {35319#true} {36363#(<= ~counter~0 13)} #67#return; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:57,587 INFO L290 TraceCheckUtils]: 283: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,587 INFO L290 TraceCheckUtils]: 282: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,587 INFO L290 TraceCheckUtils]: 281: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,587 INFO L272 TraceCheckUtils]: 280: Hoare triple {36363#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,588 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {35319#true} {36363#(<= ~counter~0 13)} #65#return; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:57,588 INFO L290 TraceCheckUtils]: 278: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,588 INFO L290 TraceCheckUtils]: 277: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,588 INFO L290 TraceCheckUtils]: 276: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,588 INFO L272 TraceCheckUtils]: 275: Hoare triple {36363#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,589 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {35319#true} {36363#(<= ~counter~0 13)} #63#return; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:57,589 INFO L290 TraceCheckUtils]: 273: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,589 INFO L290 TraceCheckUtils]: 272: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,589 INFO L290 TraceCheckUtils]: 271: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,589 INFO L272 TraceCheckUtils]: 270: Hoare triple {36363#(<= ~counter~0 13)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,589 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {35319#true} {36363#(<= ~counter~0 13)} #61#return; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:57,590 INFO L290 TraceCheckUtils]: 268: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,590 INFO L290 TraceCheckUtils]: 267: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,590 INFO L290 TraceCheckUtils]: 266: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,590 INFO L272 TraceCheckUtils]: 265: Hoare triple {36363#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,590 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {35319#true} {36363#(<= ~counter~0 13)} #59#return; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:57,590 INFO L290 TraceCheckUtils]: 263: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,590 INFO L290 TraceCheckUtils]: 262: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,590 INFO L290 TraceCheckUtils]: 261: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,591 INFO L272 TraceCheckUtils]: 260: Hoare triple {36363#(<= ~counter~0 13)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,591 INFO L290 TraceCheckUtils]: 259: Hoare triple {36363#(<= ~counter~0 13)} assume !!(#t~post5 < 50);havoc #t~post5; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:57,591 INFO L290 TraceCheckUtils]: 258: Hoare triple {36278#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36363#(<= ~counter~0 13)} is VALID [2022-04-14 15:17:57,592 INFO L290 TraceCheckUtils]: 257: Hoare triple {36278#(<= ~counter~0 12)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:57,592 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {35319#true} {36278#(<= ~counter~0 12)} #67#return; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:57,592 INFO L290 TraceCheckUtils]: 255: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,592 INFO L290 TraceCheckUtils]: 254: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,592 INFO L290 TraceCheckUtils]: 253: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,593 INFO L272 TraceCheckUtils]: 252: Hoare triple {36278#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,593 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {35319#true} {36278#(<= ~counter~0 12)} #65#return; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:57,593 INFO L290 TraceCheckUtils]: 250: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,593 INFO L290 TraceCheckUtils]: 249: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,593 INFO L290 TraceCheckUtils]: 248: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,593 INFO L272 TraceCheckUtils]: 247: Hoare triple {36278#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,594 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {35319#true} {36278#(<= ~counter~0 12)} #63#return; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:57,594 INFO L290 TraceCheckUtils]: 245: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,594 INFO L290 TraceCheckUtils]: 244: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,594 INFO L290 TraceCheckUtils]: 243: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,594 INFO L272 TraceCheckUtils]: 242: Hoare triple {36278#(<= ~counter~0 12)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,595 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {35319#true} {36278#(<= ~counter~0 12)} #61#return; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:57,595 INFO L290 TraceCheckUtils]: 240: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,595 INFO L290 TraceCheckUtils]: 239: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,595 INFO L290 TraceCheckUtils]: 238: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,595 INFO L272 TraceCheckUtils]: 237: Hoare triple {36278#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,595 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {35319#true} {36278#(<= ~counter~0 12)} #59#return; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:57,596 INFO L290 TraceCheckUtils]: 235: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,596 INFO L290 TraceCheckUtils]: 234: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,596 INFO L290 TraceCheckUtils]: 233: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,596 INFO L272 TraceCheckUtils]: 232: Hoare triple {36278#(<= ~counter~0 12)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,596 INFO L290 TraceCheckUtils]: 231: Hoare triple {36278#(<= ~counter~0 12)} assume !!(#t~post5 < 50);havoc #t~post5; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:57,597 INFO L290 TraceCheckUtils]: 230: Hoare triple {36193#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36278#(<= ~counter~0 12)} is VALID [2022-04-14 15:17:57,597 INFO L290 TraceCheckUtils]: 229: Hoare triple {36193#(<= ~counter~0 11)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:57,597 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {35319#true} {36193#(<= ~counter~0 11)} #67#return; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:57,597 INFO L290 TraceCheckUtils]: 227: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,598 INFO L290 TraceCheckUtils]: 226: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,598 INFO L290 TraceCheckUtils]: 225: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,598 INFO L272 TraceCheckUtils]: 224: Hoare triple {36193#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,598 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {35319#true} {36193#(<= ~counter~0 11)} #65#return; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:57,598 INFO L290 TraceCheckUtils]: 222: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,598 INFO L290 TraceCheckUtils]: 221: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,598 INFO L290 TraceCheckUtils]: 220: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,598 INFO L272 TraceCheckUtils]: 219: Hoare triple {36193#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,599 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {35319#true} {36193#(<= ~counter~0 11)} #63#return; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:57,599 INFO L290 TraceCheckUtils]: 217: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,599 INFO L290 TraceCheckUtils]: 216: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,599 INFO L290 TraceCheckUtils]: 215: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,599 INFO L272 TraceCheckUtils]: 214: Hoare triple {36193#(<= ~counter~0 11)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,600 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {35319#true} {36193#(<= ~counter~0 11)} #61#return; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:57,600 INFO L290 TraceCheckUtils]: 212: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,600 INFO L290 TraceCheckUtils]: 211: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,600 INFO L290 TraceCheckUtils]: 210: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,600 INFO L272 TraceCheckUtils]: 209: Hoare triple {36193#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,600 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {35319#true} {36193#(<= ~counter~0 11)} #59#return; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:57,601 INFO L290 TraceCheckUtils]: 207: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,601 INFO L290 TraceCheckUtils]: 206: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,601 INFO L290 TraceCheckUtils]: 205: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,601 INFO L272 TraceCheckUtils]: 204: Hoare triple {36193#(<= ~counter~0 11)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,601 INFO L290 TraceCheckUtils]: 203: Hoare triple {36193#(<= ~counter~0 11)} assume !!(#t~post5 < 50);havoc #t~post5; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:57,602 INFO L290 TraceCheckUtils]: 202: Hoare triple {36108#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36193#(<= ~counter~0 11)} is VALID [2022-04-14 15:17:57,602 INFO L290 TraceCheckUtils]: 201: Hoare triple {36108#(<= ~counter~0 10)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:57,602 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {35319#true} {36108#(<= ~counter~0 10)} #67#return; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:57,603 INFO L290 TraceCheckUtils]: 199: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,603 INFO L290 TraceCheckUtils]: 198: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,603 INFO L290 TraceCheckUtils]: 197: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,603 INFO L272 TraceCheckUtils]: 196: Hoare triple {36108#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,603 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {35319#true} {36108#(<= ~counter~0 10)} #65#return; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:57,603 INFO L290 TraceCheckUtils]: 194: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,603 INFO L290 TraceCheckUtils]: 193: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,603 INFO L290 TraceCheckUtils]: 192: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,604 INFO L272 TraceCheckUtils]: 191: Hoare triple {36108#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,604 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {35319#true} {36108#(<= ~counter~0 10)} #63#return; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:57,604 INFO L290 TraceCheckUtils]: 189: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,604 INFO L290 TraceCheckUtils]: 188: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,604 INFO L290 TraceCheckUtils]: 187: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,604 INFO L272 TraceCheckUtils]: 186: Hoare triple {36108#(<= ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,605 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {35319#true} {36108#(<= ~counter~0 10)} #61#return; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:57,605 INFO L290 TraceCheckUtils]: 184: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,605 INFO L290 TraceCheckUtils]: 183: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,605 INFO L290 TraceCheckUtils]: 182: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,605 INFO L272 TraceCheckUtils]: 181: Hoare triple {36108#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,606 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {35319#true} {36108#(<= ~counter~0 10)} #59#return; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:57,606 INFO L290 TraceCheckUtils]: 179: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,606 INFO L290 TraceCheckUtils]: 178: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,606 INFO L290 TraceCheckUtils]: 177: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,606 INFO L272 TraceCheckUtils]: 176: Hoare triple {36108#(<= ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,606 INFO L290 TraceCheckUtils]: 175: Hoare triple {36108#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:57,607 INFO L290 TraceCheckUtils]: 174: Hoare triple {36023#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36108#(<= ~counter~0 10)} is VALID [2022-04-14 15:17:57,607 INFO L290 TraceCheckUtils]: 173: Hoare triple {36023#(<= ~counter~0 9)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:57,608 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {35319#true} {36023#(<= ~counter~0 9)} #67#return; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:57,608 INFO L290 TraceCheckUtils]: 171: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,608 INFO L290 TraceCheckUtils]: 170: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,608 INFO L290 TraceCheckUtils]: 169: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,608 INFO L272 TraceCheckUtils]: 168: Hoare triple {36023#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,608 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {35319#true} {36023#(<= ~counter~0 9)} #65#return; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:57,608 INFO L290 TraceCheckUtils]: 166: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,609 INFO L290 TraceCheckUtils]: 165: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,609 INFO L290 TraceCheckUtils]: 164: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,609 INFO L272 TraceCheckUtils]: 163: Hoare triple {36023#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,609 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {35319#true} {36023#(<= ~counter~0 9)} #63#return; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:57,609 INFO L290 TraceCheckUtils]: 161: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,609 INFO L290 TraceCheckUtils]: 160: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,609 INFO L290 TraceCheckUtils]: 159: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,609 INFO L272 TraceCheckUtils]: 158: Hoare triple {36023#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,610 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {35319#true} {36023#(<= ~counter~0 9)} #61#return; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:57,610 INFO L290 TraceCheckUtils]: 156: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,610 INFO L290 TraceCheckUtils]: 155: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,610 INFO L290 TraceCheckUtils]: 154: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,610 INFO L272 TraceCheckUtils]: 153: Hoare triple {36023#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,611 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {35319#true} {36023#(<= ~counter~0 9)} #59#return; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:57,611 INFO L290 TraceCheckUtils]: 151: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,611 INFO L290 TraceCheckUtils]: 150: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,611 INFO L290 TraceCheckUtils]: 149: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,611 INFO L272 TraceCheckUtils]: 148: Hoare triple {36023#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,611 INFO L290 TraceCheckUtils]: 147: Hoare triple {36023#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:57,612 INFO L290 TraceCheckUtils]: 146: Hoare triple {35938#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36023#(<= ~counter~0 9)} is VALID [2022-04-14 15:17:57,612 INFO L290 TraceCheckUtils]: 145: Hoare triple {35938#(<= ~counter~0 8)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:57,613 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {35319#true} {35938#(<= ~counter~0 8)} #67#return; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:57,613 INFO L290 TraceCheckUtils]: 143: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,613 INFO L290 TraceCheckUtils]: 142: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,613 INFO L290 TraceCheckUtils]: 141: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,613 INFO L272 TraceCheckUtils]: 140: Hoare triple {35938#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,614 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {35319#true} {35938#(<= ~counter~0 8)} #65#return; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:57,614 INFO L290 TraceCheckUtils]: 138: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,614 INFO L290 TraceCheckUtils]: 137: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,614 INFO L290 TraceCheckUtils]: 136: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,614 INFO L272 TraceCheckUtils]: 135: Hoare triple {35938#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,614 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {35319#true} {35938#(<= ~counter~0 8)} #63#return; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:57,614 INFO L290 TraceCheckUtils]: 133: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,614 INFO L290 TraceCheckUtils]: 132: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,615 INFO L290 TraceCheckUtils]: 131: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,615 INFO L272 TraceCheckUtils]: 130: Hoare triple {35938#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,615 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {35319#true} {35938#(<= ~counter~0 8)} #61#return; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:57,615 INFO L290 TraceCheckUtils]: 128: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,615 INFO L290 TraceCheckUtils]: 127: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,615 INFO L290 TraceCheckUtils]: 126: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,615 INFO L272 TraceCheckUtils]: 125: Hoare triple {35938#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,616 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {35319#true} {35938#(<= ~counter~0 8)} #59#return; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:57,616 INFO L290 TraceCheckUtils]: 123: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,616 INFO L290 TraceCheckUtils]: 122: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,616 INFO L290 TraceCheckUtils]: 121: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,616 INFO L272 TraceCheckUtils]: 120: Hoare triple {35938#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,616 INFO L290 TraceCheckUtils]: 119: Hoare triple {35938#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:57,617 INFO L290 TraceCheckUtils]: 118: Hoare triple {35853#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35938#(<= ~counter~0 8)} is VALID [2022-04-14 15:17:57,617 INFO L290 TraceCheckUtils]: 117: Hoare triple {35853#(<= ~counter~0 7)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:57,618 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {35319#true} {35853#(<= ~counter~0 7)} #67#return; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:57,618 INFO L290 TraceCheckUtils]: 115: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,618 INFO L290 TraceCheckUtils]: 114: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,618 INFO L290 TraceCheckUtils]: 113: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,618 INFO L272 TraceCheckUtils]: 112: Hoare triple {35853#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,619 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {35319#true} {35853#(<= ~counter~0 7)} #65#return; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:57,619 INFO L290 TraceCheckUtils]: 110: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,619 INFO L290 TraceCheckUtils]: 109: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,619 INFO L290 TraceCheckUtils]: 108: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,619 INFO L272 TraceCheckUtils]: 107: Hoare triple {35853#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,619 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {35319#true} {35853#(<= ~counter~0 7)} #63#return; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:57,620 INFO L290 TraceCheckUtils]: 105: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,620 INFO L290 TraceCheckUtils]: 104: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,620 INFO L290 TraceCheckUtils]: 103: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,620 INFO L272 TraceCheckUtils]: 102: Hoare triple {35853#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,620 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {35319#true} {35853#(<= ~counter~0 7)} #61#return; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:57,620 INFO L290 TraceCheckUtils]: 100: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,620 INFO L290 TraceCheckUtils]: 99: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,620 INFO L290 TraceCheckUtils]: 98: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,621 INFO L272 TraceCheckUtils]: 97: Hoare triple {35853#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,621 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {35319#true} {35853#(<= ~counter~0 7)} #59#return; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:57,621 INFO L290 TraceCheckUtils]: 95: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,621 INFO L290 TraceCheckUtils]: 94: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,621 INFO L290 TraceCheckUtils]: 93: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,621 INFO L272 TraceCheckUtils]: 92: Hoare triple {35853#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,622 INFO L290 TraceCheckUtils]: 91: Hoare triple {35853#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:57,622 INFO L290 TraceCheckUtils]: 90: Hoare triple {35768#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35853#(<= ~counter~0 7)} is VALID [2022-04-14 15:17:57,622 INFO L290 TraceCheckUtils]: 89: Hoare triple {35768#(<= ~counter~0 6)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:57,623 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {35319#true} {35768#(<= ~counter~0 6)} #67#return; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:57,623 INFO L290 TraceCheckUtils]: 87: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,623 INFO L290 TraceCheckUtils]: 86: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,623 INFO L290 TraceCheckUtils]: 85: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,623 INFO L272 TraceCheckUtils]: 84: Hoare triple {35768#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,624 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {35319#true} {35768#(<= ~counter~0 6)} #65#return; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:57,624 INFO L290 TraceCheckUtils]: 82: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,624 INFO L290 TraceCheckUtils]: 81: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,624 INFO L290 TraceCheckUtils]: 80: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,624 INFO L272 TraceCheckUtils]: 79: Hoare triple {35768#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,625 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {35319#true} {35768#(<= ~counter~0 6)} #63#return; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:57,625 INFO L290 TraceCheckUtils]: 77: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,625 INFO L290 TraceCheckUtils]: 76: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,625 INFO L290 TraceCheckUtils]: 75: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,625 INFO L272 TraceCheckUtils]: 74: Hoare triple {35768#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,625 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {35319#true} {35768#(<= ~counter~0 6)} #61#return; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:57,625 INFO L290 TraceCheckUtils]: 72: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,625 INFO L290 TraceCheckUtils]: 71: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,625 INFO L290 TraceCheckUtils]: 70: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,626 INFO L272 TraceCheckUtils]: 69: Hoare triple {35768#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,626 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {35319#true} {35768#(<= ~counter~0 6)} #59#return; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:57,626 INFO L290 TraceCheckUtils]: 67: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,626 INFO L290 TraceCheckUtils]: 66: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,626 INFO L290 TraceCheckUtils]: 65: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,626 INFO L272 TraceCheckUtils]: 64: Hoare triple {35768#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,626 INFO L290 TraceCheckUtils]: 63: Hoare triple {35768#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:57,627 INFO L290 TraceCheckUtils]: 62: Hoare triple {35683#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35768#(<= ~counter~0 6)} is VALID [2022-04-14 15:17:57,627 INFO L290 TraceCheckUtils]: 61: Hoare triple {35683#(<= ~counter~0 5)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:57,628 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {35319#true} {35683#(<= ~counter~0 5)} #67#return; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:57,628 INFO L290 TraceCheckUtils]: 59: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,628 INFO L290 TraceCheckUtils]: 58: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,628 INFO L290 TraceCheckUtils]: 57: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,628 INFO L272 TraceCheckUtils]: 56: Hoare triple {35683#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,628 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {35319#true} {35683#(<= ~counter~0 5)} #65#return; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:57,628 INFO L290 TraceCheckUtils]: 54: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,629 INFO L290 TraceCheckUtils]: 53: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,629 INFO L290 TraceCheckUtils]: 52: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,629 INFO L272 TraceCheckUtils]: 51: Hoare triple {35683#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,629 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {35319#true} {35683#(<= ~counter~0 5)} #63#return; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:57,629 INFO L290 TraceCheckUtils]: 49: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,629 INFO L290 TraceCheckUtils]: 48: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,629 INFO L290 TraceCheckUtils]: 47: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,629 INFO L272 TraceCheckUtils]: 46: Hoare triple {35683#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,630 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {35319#true} {35683#(<= ~counter~0 5)} #61#return; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:57,630 INFO L290 TraceCheckUtils]: 44: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,630 INFO L290 TraceCheckUtils]: 43: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,630 INFO L290 TraceCheckUtils]: 42: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,630 INFO L272 TraceCheckUtils]: 41: Hoare triple {35683#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,630 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35319#true} {35683#(<= ~counter~0 5)} #59#return; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:57,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,631 INFO L272 TraceCheckUtils]: 36: Hoare triple {35683#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {35683#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:57,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {35598#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35683#(<= ~counter~0 5)} is VALID [2022-04-14 15:17:57,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {35598#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:57,632 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {35319#true} {35598#(<= ~counter~0 4)} #67#return; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:57,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,632 INFO L272 TraceCheckUtils]: 28: Hoare triple {35598#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,633 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {35319#true} {35598#(<= ~counter~0 4)} #65#return; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:57,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,633 INFO L272 TraceCheckUtils]: 23: Hoare triple {35598#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,633 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35319#true} {35598#(<= ~counter~0 4)} #63#return; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:57,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,634 INFO L272 TraceCheckUtils]: 18: Hoare triple {35598#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,634 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35319#true} {35598#(<= ~counter~0 4)} #61#return; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:57,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,634 INFO L272 TraceCheckUtils]: 13: Hoare triple {35598#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,635 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35319#true} {35598#(<= ~counter~0 4)} #59#return; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:57,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {35319#true} assume true; {35319#true} is VALID [2022-04-14 15:17:57,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {35319#true} assume !(0 == ~cond); {35319#true} is VALID [2022-04-14 15:17:57,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {35319#true} ~cond := #in~cond; {35319#true} is VALID [2022-04-14 15:17:57,635 INFO L272 TraceCheckUtils]: 8: Hoare triple {35598#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35319#true} is VALID [2022-04-14 15:17:57,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {35598#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:57,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {35513#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35598#(<= ~counter~0 4)} is VALID [2022-04-14 15:17:57,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {35513#(<= ~counter~0 3)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:57,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {35513#(<= ~counter~0 3)} call #t~ret6 := main(); {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:57,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35513#(<= ~counter~0 3)} {35319#true} #81#return; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:57,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {35513#(<= ~counter~0 3)} assume true; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:57,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {35319#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; {35513#(<= ~counter~0 3)} is VALID [2022-04-14 15:17:57,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {35319#true} call ULTIMATE.init(); {35319#true} is VALID [2022-04-14 15:17:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 462 proven. 8372 refuted. 0 times theorem prover too weak. 106260 trivial. 0 not checked. [2022-04-14 15:17:57,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:17:57,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789412264] [2022-04-14 15:17:57,644 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:17:57,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169450477] [2022-04-14 15:17:57,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169450477] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:17:57,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:17:57,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 54 [2022-04-14 15:17:57,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827159321] [2022-04-14 15:17:57,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:17:57,648 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.611111111111111) internal successors, (303), 54 states have internal predecessors, (303), 52 states have call successors, (466), 49 states have call predecessors, (466), 49 states have return successors, (464), 51 states have call predecessors, (464), 51 states have call successors, (464) Word has length 1305