/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:12:31,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:12:31,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:12:31,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:12:31,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:12:31,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:12:31,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:12:31,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:12:31,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:12:31,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:12:31,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:12:31,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:12:31,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:12:31,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:12:31,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:12:31,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:12:31,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:12:31,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:12:31,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:12:31,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:12:31,384 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:12:31,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:12:31,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:12:31,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:12:31,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:12:31,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:12:31,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:12:31,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:12:31,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:12:31,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:12:31,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:12:31,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:12:31,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:12:31,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:12:31,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:12:31,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:12:31,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:12:31,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:12:31,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:12:31,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:12:31,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:12:31,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:12:31,401 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 11:12:31,410 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:12:31,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:12:31,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:12:31,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:12:31,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:12:31,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:12:31,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:12:31,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:12:31,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:12:31,412 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:12:31,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:12:31,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:12:31,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:12:31,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:12:31,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:12:31,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:12:31,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:12:31,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:12:31,413 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:12:31,413 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:12:31,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:12:31,413 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:12:31,413 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 11:12:31,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:12:31,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:12:31,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:12:31,574 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:12:31,574 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:12:31,575 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2022-04-28 11:12:31,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48260609b/5df8eefa6cd946c99b52fea2869a93cf/FLAG95b2d0290 [2022-04-28 11:12:31,959 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:12:31,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2022-04-28 11:12:31,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48260609b/5df8eefa6cd946c99b52fea2869a93cf/FLAG95b2d0290 [2022-04-28 11:12:31,986 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48260609b/5df8eefa6cd946c99b52fea2869a93cf [2022-04-28 11:12:31,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:12:31,989 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:12:31,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:12:31,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:12:31,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:12:31,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:12:31" (1/1) ... [2022-04-28 11:12:31,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d75a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:31, skipping insertion in model container [2022-04-28 11:12:31,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:12:31" (1/1) ... [2022-04-28 11:12:31,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:12:32,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:12:32,164 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_unwindbound10.c[588,601] [2022-04-28 11:12:32,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:12:32,201 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:12:32,209 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_unwindbound10.c[588,601] [2022-04-28 11:12:32,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:12:32,240 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:12:32,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:32 WrapperNode [2022-04-28 11:12:32,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:12:32,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:12:32,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:12:32,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:12:32,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:32" (1/1) ... [2022-04-28 11:12:32,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:32" (1/1) ... [2022-04-28 11:12:32,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:32" (1/1) ... [2022-04-28 11:12:32,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:32" (1/1) ... [2022-04-28 11:12:32,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:32" (1/1) ... [2022-04-28 11:12:32,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:32" (1/1) ... [2022-04-28 11:12:32,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:32" (1/1) ... [2022-04-28 11:12:32,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:12:32,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:12:32,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:12:32,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:12:32,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:32" (1/1) ... [2022-04-28 11:12:32,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:12:32,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:12:32,294 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-28 11:12:32,312 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-28 11:12:32,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:12:32,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:12:32,330 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:12:32,330 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:12:32,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:12:32,330 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:12:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:12:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:12:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:12:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:12:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-28 11:12:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:12:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:12:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:12:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:12:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:12:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:12:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:12:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:12:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:12:32,369 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:12:32,370 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:12:32,511 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:12:32,516 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:12:32,516 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 11:12:32,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:12:32 BoogieIcfgContainer [2022-04-28 11:12:32,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:12:32,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:12:32,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:12:32,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:12:32,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:12:31" (1/3) ... [2022-04-28 11:12:32,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17da6290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:12:32, skipping insertion in model container [2022-04-28 11:12:32,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:32" (2/3) ... [2022-04-28 11:12:32,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17da6290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:12:32, skipping insertion in model container [2022-04-28 11:12:32,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:12:32" (3/3) ... [2022-04-28 11:12:32,535 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound10.c [2022-04-28 11:12:32,543 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:12:32,544 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:12:32,604 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:12:32,609 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1ca051e8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d700a8e [2022-04-28 11:12:32,609 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:12:32,627 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-28 11:12:32,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 11:12:32,632 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:12:32,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:12:32,633 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:12:32,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:12:32,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-28 11:12:32,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:32,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [602575459] [2022-04-28 11:12:32,657 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:12:32,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 2 times [2022-04-28 11:12:32,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:12:32,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316536952] [2022-04-28 11:12:32,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:12:32,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:12:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:32,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:12:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:32,804 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-28 11:12:32,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 11:12:32,804 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-28 11:12:32,806 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-28 11:12:32,806 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-28 11:12:32,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 11:12:32,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-28 11:12:32,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-28 11:12:32,807 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-28 11:12:32,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-28 11:12:32,808 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-28 11:12:32,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 11:12:32,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 11:12:32,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 11:12:32,809 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-28 11:12:32,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:12:32,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316536952] [2022-04-28 11:12:32,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316536952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:32,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:32,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:12:32,813 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:12:32,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [602575459] [2022-04-28 11:12:32,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [602575459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:32,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:32,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:12:32,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35653651] [2022-04-28 11:12:32,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:12:32,819 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-28 11:12:32,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:12:32,822 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-28 11:12:32,838 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-28 11:12:32,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:12:32,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:32,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:12:32,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:12:32,858 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-28 11:12:33,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:33,050 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-28 11:12:33,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:12:33,050 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-28 11:12:33,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:12:33,051 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-28 11:12:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 11:12:33,059 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-28 11:12:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 11:12:33,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-28 11:12:33,156 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-28 11:12:33,162 INFO L225 Difference]: With dead ends: 57 [2022-04-28 11:12:33,162 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 11:12:33,164 INFO L412 NwaCegarLoop]: 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-28 11:12:33,166 INFO L413 NwaCegarLoop]: 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-28 11:12:33,167 INFO L414 NwaCegarLoop]: 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-28 11:12:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 11:12:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 11:12:33,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:12:33,186 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-28 11:12:33,186 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-28 11:12:33,186 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-28 11:12:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:33,190 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-28 11:12:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-28 11:12:33,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:33,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:33,191 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-28 11:12:33,192 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-28 11:12:33,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:33,195 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-28 11:12:33,195 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-28 11:12:33,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:33,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:33,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:12:33,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:12:33,196 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-28 11:12:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-28 11:12:33,199 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-28 11:12:33,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:12:33,199 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-28 11:12:33,199 INFO L496 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-28 11:12:33,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 37 transitions. [2022-04-28 11:12:33,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:12:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-28 11:12:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 11:12:33,230 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:12:33,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:12:33,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:12:33,230 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:12:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:12:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-28 11:12:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:33,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [52807889] [2022-04-28 11:12:33,231 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:12:33,232 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 2 times [2022-04-28 11:12:33,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:12:33,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84739619] [2022-04-28 11:12:33,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:12:33,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:12:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:33,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:12:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:33,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(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; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:12:33,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:12:33,314 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:12:33,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:12:33,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(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; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:12:33,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:12:33,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:12:33,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(= ~counter~0 0)} call #t~ret6 := main(); {267#(= ~counter~0 0)} is VALID [2022-04-28 11:12:33,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {267#(= ~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; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:12:33,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {268#(= |main_#t~post5| 0)} is VALID [2022-04-28 11:12:33,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {263#false} is VALID [2022-04-28 11:12:33,326 INFO L272 TraceCheckUtils]: 8: Hoare triple {263#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {263#false} is VALID [2022-04-28 11:12:33,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-28 11:12:33,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-28 11:12:33,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 11:12:33,327 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-28 11:12:33,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:12:33,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84739619] [2022-04-28 11:12:33,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84739619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:33,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:33,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:12:33,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:12:33,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [52807889] [2022-04-28 11:12:33,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [52807889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:33,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:33,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:12:33,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927001605] [2022-04-28 11:12:33,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:12:33,329 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-28 11:12:33,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:12:33,329 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-28 11:12:33,339 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-28 11:12:33,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:12:33,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:33,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:12:33,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:12:33,341 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-28 11:12:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:33,537 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-28 11:12:33,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:12:33,538 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-28 11:12:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:12:33,538 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-28 11:12:33,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-28 11:12:33,541 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-28 11:12:33,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-28 11:12:33,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-28 11:12:33,587 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-28 11:12:33,588 INFO L225 Difference]: With dead ends: 40 [2022-04-28 11:12:33,588 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 11:12:33,588 INFO L412 NwaCegarLoop]: 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-28 11:12:33,589 INFO L413 NwaCegarLoop]: 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-28 11:12:33,590 INFO L414 NwaCegarLoop]: 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-28 11:12:33,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 11:12:33,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 11:12:33,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:12:33,594 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-28 11:12:33,594 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-28 11:12:33,595 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-28 11:12:33,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:33,597 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-28 11:12:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:12:33,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:33,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:33,598 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-28 11:12:33,598 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-28 11:12:33,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:33,600 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-28 11:12:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:12:33,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:33,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:33,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:12:33,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:12:33,601 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-28 11:12:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-28 11:12:33,603 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-28 11:12:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:12:33,603 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-28 11:12:33,603 INFO L496 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-28 11:12:33,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-28 11:12:33,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:12:33,635 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:12:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 11:12:33,635 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:12:33,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:12:33,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 11:12:33,639 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:12:33,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:12:33,639 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-28 11:12:33,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:33,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1281635646] [2022-04-28 11:12:33,640 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:12:33,641 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 2 times [2022-04-28 11:12:33,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:12:33,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048019156] [2022-04-28 11:12:33,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:12:33,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:12:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:33,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:12:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:33,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {474#(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; {466#true} is VALID [2022-04-28 11:12:33,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-28 11:12:33,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-28 11:12:33,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:12:33,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#(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; {466#true} is VALID [2022-04-28 11:12:33,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-28 11:12:33,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-28 11:12:33,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret6 := main(); {466#true} is VALID [2022-04-28 11:12:33,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#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; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:12:33,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:12:33,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 10);havoc #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:12:33,749 INFO L272 TraceCheckUtils]: 8: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:33,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {473#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:12:33,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {467#false} is VALID [2022-04-28 11:12:33,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-04-28 11:12:33,753 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-28 11:12:33,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:12:33,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048019156] [2022-04-28 11:12:33,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048019156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:33,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:33,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:12:33,754 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:12:33,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1281635646] [2022-04-28 11:12:33,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1281635646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:33,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:33,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:12:33,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641168231] [2022-04-28 11:12:33,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:12:33,755 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-28 11:12:33,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:12:33,755 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-28 11:12:33,765 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-28 11:12:33,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:12:33,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:33,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:12:33,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:12:33,766 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-28 11:12:34,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:34,078 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-28 11:12:34,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:12:34,079 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-28 11:12:34,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:12:34,079 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-28 11:12:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 11:12:34,080 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-28 11:12:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 11:12:34,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-28 11:12:34,119 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-28 11:12:34,120 INFO L225 Difference]: With dead ends: 34 [2022-04-28 11:12:34,120 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 11:12:34,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:12:34,121 INFO L413 NwaCegarLoop]: 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-28 11:12:34,121 INFO L414 NwaCegarLoop]: 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-28 11:12:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 11:12:34,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 11:12:34,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:12:34,126 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-28 11:12:34,127 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-28 11:12:34,127 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-28 11:12:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:34,129 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 11:12:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:12:34,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:34,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:34,130 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-28 11:12:34,130 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-28 11:12:34,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:34,131 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 11:12:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:12:34,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:34,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:34,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:12:34,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:12:34,132 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-28 11:12:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 11:12:34,139 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-28 11:12:34,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:12:34,139 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 11:12:34,139 INFO L496 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-28 11:12:34,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 11:12:34,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:12:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:12:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:12:34,174 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:12:34,174 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:12:34,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 11:12:34,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:12:34,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:12:34,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-28 11:12:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:34,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1889456955] [2022-04-28 11:12:34,175 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:12:34,175 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 2 times [2022-04-28 11:12:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:12:34,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379160799] [2022-04-28 11:12:34,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:12:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:12:34,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:12:34,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1300675336] [2022-04-28 11:12:34,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:12:34,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:12:34,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:12:34,188 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-28 11:12:34,191 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-28 11:12:34,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:12:34,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:12:34,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:12:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:34,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:12:34,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2022-04-28 11:12:34,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {681#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; {681#true} is VALID [2022-04-28 11:12:34,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-28 11:12:34,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #81#return; {681#true} is VALID [2022-04-28 11:12:34,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2022-04-28 11:12:34,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {681#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; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:12:34,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:12:34,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:12:34,329 INFO L272 TraceCheckUtils]: 8: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {681#true} is VALID [2022-04-28 11:12:34,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#true} ~cond := #in~cond; {681#true} is VALID [2022-04-28 11:12:34,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(0 == ~cond); {681#true} is VALID [2022-04-28 11:12:34,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-28 11:12:34,330 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {681#true} {701#(and (= main_~n~0 0) (= main_~y~0 1))} #59#return; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:12:34,330 INFO L272 TraceCheckUtils]: 13: Hoare triple {701#(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)); {726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:12:34,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:34,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {682#false} is VALID [2022-04-28 11:12:34,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {682#false} assume !false; {682#false} is VALID [2022-04-28 11:12:34,331 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-28 11:12:34,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:12:34,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:12:34,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379160799] [2022-04-28 11:12:34,332 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:12:34,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300675336] [2022-04-28 11:12:34,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300675336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:34,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:34,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:12:34,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:12:34,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1889456955] [2022-04-28 11:12:34,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1889456955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:34,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:34,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:12:34,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179569683] [2022-04-28 11:12:34,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:12:34,333 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-28 11:12:34,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:12:34,333 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-28 11:12:34,344 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-28 11:12:34,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:12:34,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:34,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:12:34,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:12:34,345 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-28 11:12:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:34,570 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-28 11:12:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:12:34,570 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-28 11:12:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:12:34,570 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-28 11:12:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:12:34,572 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-28 11:12:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:12:34,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:12:34,640 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-28 11:12:34,642 INFO L225 Difference]: With dead ends: 50 [2022-04-28 11:12:34,642 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 11:12:34,642 INFO L412 NwaCegarLoop]: 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-28 11:12:34,643 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:12:34,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:12:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 11:12:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-28 11:12:34,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:12:34,659 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-28 11:12:34,659 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-28 11:12:34,659 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-28 11:12:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:34,661 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-28 11:12:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-28 11:12:34,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:34,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:34,662 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-28 11:12:34,663 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-28 11:12:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:34,665 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-28 11:12:34,665 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-28 11:12:34,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:34,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:34,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:12:34,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:12:34,666 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-28 11:12:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-28 11:12:34,667 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-28 11:12:34,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:12:34,667 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-28 11:12:34,668 INFO L496 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-28 11:12:34,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 49 transitions. [2022-04-28 11:12:34,715 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-28 11:12:34,715 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-28 11:12:34,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 11:12:34,717 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:12:34,717 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:12:34,733 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-28 11:12:34,933 WARN L477 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-28 11:12:34,933 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:12:34,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:12:34,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-28 11:12:34,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:34,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [92593725] [2022-04-28 11:12:34,934 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:12:34,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 2 times [2022-04-28 11:12:34,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:12:34,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991349569] [2022-04-28 11:12:34,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:12:34,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:12:34,942 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:12:34,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [38899585] [2022-04-28 11:12:34,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:12:34,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:12:34,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:12:34,944 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-28 11:12:34,945 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-28 11:12:34,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:12:34,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:12:34,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:12:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:34,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:12:35,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1010#true} is VALID [2022-04-28 11:12:35,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {1010#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; {1010#true} is VALID [2022-04-28 11:12:35,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:12:35,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #81#return; {1010#true} is VALID [2022-04-28 11:12:35,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret6 := main(); {1010#true} is VALID [2022-04-28 11:12:35,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {1010#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; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:12:35,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:12:35,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:12:35,066 INFO L272 TraceCheckUtils]: 8: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1010#true} is VALID [2022-04-28 11:12:35,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-28 11:12:35,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-28 11:12:35,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:12:35,068 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #59#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:12:35,068 INFO L272 TraceCheckUtils]: 13: Hoare triple {1030#(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)); {1010#true} is VALID [2022-04-28 11:12:35,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-28 11:12:35,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-28 11:12:35,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:12:35,072 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #61#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:12:35,072 INFO L272 TraceCheckUtils]: 18: Hoare triple {1030#(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)); {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:12:35,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:35,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1011#false} is VALID [2022-04-28 11:12:35,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2022-04-28 11:12:35,073 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-28 11:12:35,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:12:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:12:35,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991349569] [2022-04-28 11:12:35,074 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:12:35,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38899585] [2022-04-28 11:12:35,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38899585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:35,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:35,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:12:35,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:12:35,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [92593725] [2022-04-28 11:12:35,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [92593725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:35,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:35,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:12:35,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796068906] [2022-04-28 11:12:35,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:12:35,075 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-28 11:12:35,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:12:35,075 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-28 11:12:35,087 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-28 11:12:35,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:12:35,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:35,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:12:35,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:12:35,088 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-28 11:12:35,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:35,258 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 11:12:35,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:12:35,258 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-28 11:12:35,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:12:35,258 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-28 11:12:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:12:35,260 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-28 11:12:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:12:35,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:12:35,309 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-28 11:12:35,310 INFO L225 Difference]: With dead ends: 54 [2022-04-28 11:12:35,310 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 11:12:35,310 INFO L412 NwaCegarLoop]: 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-28 11:12:35,311 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:12:35,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:12:35,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 11:12:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-28 11:12:35,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:12:35,324 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-28 11:12:35,324 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-28 11:12:35,324 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-28 11:12:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:35,327 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:12:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:12:35,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:35,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:35,327 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-28 11:12:35,328 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-28 11:12:35,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:35,330 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:12:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:12:35,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:35,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:35,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:12:35,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:12:35,330 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-28 11:12:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-28 11:12:35,332 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-28 11:12:35,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:12:35,332 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-28 11:12:35,332 INFO L496 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-28 11:12:35,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 64 transitions. [2022-04-28 11:12:35,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:12:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-28 11:12:35,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 11:12:35,427 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:12:35,427 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:12:35,453 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-28 11:12:35,627 WARN L477 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-28 11:12:35,627 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:12:35,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:12:35,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-28 11:12:35,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:35,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [584334562] [2022-04-28 11:12:35,628 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:12:35,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 2 times [2022-04-28 11:12:35,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:12:35,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685472665] [2022-04-28 11:12:35,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:12:35,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:12:35,636 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:12:35,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [337981100] [2022-04-28 11:12:35,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:12:35,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:12:35,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:12:35,641 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-28 11:12:35,642 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-28 11:12:35,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:12:35,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:12:35,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:12:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:35,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:12:35,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {1390#true} call ULTIMATE.init(); {1390#true} is VALID [2022-04-28 11:12:35,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {1390#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; {1390#true} is VALID [2022-04-28 11:12:35,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:12:35,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#true} {1390#true} #81#return; {1390#true} is VALID [2022-04-28 11:12:35,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {1390#true} call #t~ret6 := main(); {1390#true} is VALID [2022-04-28 11:12:35,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {1390#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; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:12:35,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:12:35,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:12:35,805 INFO L272 TraceCheckUtils]: 8: Hoare triple {1410#(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)); {1390#true} is VALID [2022-04-28 11:12:35,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:12:35,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:12:35,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:12:35,806 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:12:35,806 INFO L272 TraceCheckUtils]: 13: Hoare triple {1410#(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)); {1390#true} is VALID [2022-04-28 11:12:35,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:12:35,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:12:35,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:12:35,807 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:12:35,807 INFO L272 TraceCheckUtils]: 18: Hoare triple {1410#(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)); {1390#true} is VALID [2022-04-28 11:12:35,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:12:35,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:12:35,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:12:35,809 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:12:35,810 INFO L272 TraceCheckUtils]: 23: Hoare triple {1410#(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)); {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:12:35,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:35,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {1469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1391#false} is VALID [2022-04-28 11:12:35,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {1391#false} assume !false; {1391#false} is VALID [2022-04-28 11:12:35,811 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-28 11:12:35,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:12:35,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:12:35,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685472665] [2022-04-28 11:12:35,811 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:12:35,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337981100] [2022-04-28 11:12:35,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337981100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:35,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:35,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:12:35,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:12:35,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [584334562] [2022-04-28 11:12:35,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [584334562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:35,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:35,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:12:35,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875048753] [2022-04-28 11:12:35,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:12:35,812 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-28 11:12:35,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:12:35,813 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-28 11:12:35,827 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-28 11:12:35,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:12:35,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:35,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:12:35,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:12:35,828 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-28 11:12:36,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:36,096 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-28 11:12:36,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:12:36,097 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-28 11:12:36,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:12:36,097 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-28 11:12:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:12:36,098 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-28 11:12:36,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:12:36,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:12:36,151 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-28 11:12:36,152 INFO L225 Difference]: With dead ends: 62 [2022-04-28 11:12:36,153 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 11:12:36,153 INFO L412 NwaCegarLoop]: 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-28 11:12:36,153 INFO L413 NwaCegarLoop]: 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-28 11:12:36,154 INFO L414 NwaCegarLoop]: 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-28 11:12:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 11:12:36,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 11:12:36,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:12:36,170 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-28 11:12:36,171 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-28 11:12:36,171 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-28 11:12:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:36,172 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-28 11:12:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:12:36,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:36,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:36,173 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-28 11:12:36,173 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-28 11:12:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:36,175 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-28 11:12:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:12:36,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:36,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:36,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:12:36,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:12:36,175 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-28 11:12:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-28 11:12:36,177 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-28 11:12:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:12:36,177 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-28 11:12:36,177 INFO L496 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-28 11:12:36,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-28 11:12:36,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:12:36,233 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:12:36,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 11:12:36,233 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:12:36,234 INFO L195 NwaCegarLoop]: 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-28 11:12:36,250 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-28 11:12:36,450 WARN L477 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-28 11:12:36,450 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:12:36,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:12:36,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-28 11:12:36,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:36,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [368775259] [2022-04-28 11:12:36,804 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:12:36,804 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:12:36,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 2 times [2022-04-28 11:12:36,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:12:36,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167741289] [2022-04-28 11:12:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:12:36,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:12:36,813 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:12:36,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1726175092] [2022-04-28 11:12:36,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:12:36,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:12:36,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:12:36,814 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-28 11:12:36,815 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-28 11:12:36,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:12:36,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:12:36,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:12:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:36,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:12:37,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-28 11:12:37,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {1801#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; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:12:37,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#(<= ~counter~0 0)} assume true; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:12:37,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#(<= ~counter~0 0)} {1801#true} #81#return; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:12:37,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {1809#(<= ~counter~0 0)} call #t~ret6 := main(); {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:12:37,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {1809#(<= ~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; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:12:37,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {1809#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,017 INFO L272 TraceCheckUtils]: 8: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,028 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #59#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,029 INFO L272 TraceCheckUtils]: 13: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,030 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #61#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,030 INFO L272 TraceCheckUtils]: 18: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,032 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #63#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,032 INFO L272 TraceCheckUtils]: 23: Hoare triple {1825#(<= ~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)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,034 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #65#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,034 INFO L272 TraceCheckUtils]: 28: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,035 INFO L290 TraceCheckUtils]: 30: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,035 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #67#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {1825#(<= ~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; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:12:37,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {1825#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1910#(<= |main_#t~post5| 1)} is VALID [2022-04-28 11:12:37,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {1910#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {1802#false} is VALID [2022-04-28 11:12:37,037 INFO L272 TraceCheckUtils]: 36: Hoare triple {1802#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1802#false} is VALID [2022-04-28 11:12:37,037 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:12:37,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {1802#false} assume !(0 == ~cond); {1802#false} is VALID [2022-04-28 11:12:37,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {1802#false} assume true; {1802#false} is VALID [2022-04-28 11:12:37,037 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1802#false} {1802#false} #69#return; {1802#false} is VALID [2022-04-28 11:12:37,037 INFO L272 TraceCheckUtils]: 41: Hoare triple {1802#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1802#false} is VALID [2022-04-28 11:12:37,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:12:37,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-28 11:12:37,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-28 11:12:37,037 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-28 11:12:37,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:12:37,211 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-28 11:12:37,211 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-28 11:12:37,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:12:37,212 INFO L272 TraceCheckUtils]: 41: Hoare triple {1802#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1802#false} is VALID [2022-04-28 11:12:37,212 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1801#true} {1802#false} #69#return; {1802#false} is VALID [2022-04-28 11:12:37,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:12:37,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:12:37,212 INFO L290 TraceCheckUtils]: 37: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:12:37,212 INFO L272 TraceCheckUtils]: 36: Hoare triple {1802#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:12:37,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {1968#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1802#false} is VALID [2022-04-28 11:12:37,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {1972#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1968#(< |main_#t~post5| 10)} is VALID [2022-04-28 11:12:37,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {1972#(< ~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; {1972#(< ~counter~0 10)} is VALID [2022-04-28 11:12:37,214 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1801#true} {1972#(< ~counter~0 10)} #67#return; {1972#(< ~counter~0 10)} is VALID [2022-04-28 11:12:37,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:12:37,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:12:37,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:12:37,215 INFO L272 TraceCheckUtils]: 28: Hoare triple {1972#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1801#true} is VALID [2022-04-28 11:12:37,216 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1801#true} {1972#(< ~counter~0 10)} #65#return; {1972#(< ~counter~0 10)} is VALID [2022-04-28 11:12:37,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:12:37,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:12:37,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:12:37,216 INFO L272 TraceCheckUtils]: 23: Hoare triple {1972#(< ~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)); {1801#true} is VALID [2022-04-28 11:12:37,217 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1801#true} {1972#(< ~counter~0 10)} #63#return; {1972#(< ~counter~0 10)} is VALID [2022-04-28 11:12:37,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:12:37,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:12:37,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:12:37,217 INFO L272 TraceCheckUtils]: 18: Hoare triple {1972#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:12:37,217 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1801#true} {1972#(< ~counter~0 10)} #61#return; {1972#(< ~counter~0 10)} is VALID [2022-04-28 11:12:37,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:12:37,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:12:37,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:12:37,218 INFO L272 TraceCheckUtils]: 13: Hoare triple {1972#(< ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1801#true} is VALID [2022-04-28 11:12:37,218 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1801#true} {1972#(< ~counter~0 10)} #59#return; {1972#(< ~counter~0 10)} is VALID [2022-04-28 11:12:37,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:12:37,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:12:37,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:12:37,218 INFO L272 TraceCheckUtils]: 8: Hoare triple {1972#(< ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:12:37,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {1972#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {1972#(< ~counter~0 10)} is VALID [2022-04-28 11:12:37,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {2057#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1972#(< ~counter~0 10)} is VALID [2022-04-28 11:12:37,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {2057#(< ~counter~0 9)} 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; {2057#(< ~counter~0 9)} is VALID [2022-04-28 11:12:37,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {2057#(< ~counter~0 9)} call #t~ret6 := main(); {2057#(< ~counter~0 9)} is VALID [2022-04-28 11:12:37,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2057#(< ~counter~0 9)} {1801#true} #81#return; {2057#(< ~counter~0 9)} is VALID [2022-04-28 11:12:37,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {2057#(< ~counter~0 9)} assume true; {2057#(< ~counter~0 9)} is VALID [2022-04-28 11:12:37,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {1801#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; {2057#(< ~counter~0 9)} is VALID [2022-04-28 11:12:37,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-28 11:12:37,221 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-28 11:12:37,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:12:37,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167741289] [2022-04-28 11:12:37,221 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:12:37,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726175092] [2022-04-28 11:12:37,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726175092] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:12:37,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:12:37,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 11:12:37,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:12:37,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [368775259] [2022-04-28 11:12:37,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [368775259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:37,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:37,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:12:37,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947283172] [2022-04-28 11:12:37,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:12:37,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:12:37,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:12:37,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:12:37,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:12:37,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:12:37,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:37,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:12:37,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:12:37,247 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:12:37,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:37,499 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-28 11:12:37,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:12:37,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:12:37,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:12:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:12:37,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-28 11:12:37,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:12:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-28 11:12:37,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-28 11:12:37,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:12:37,554 INFO L225 Difference]: With dead ends: 72 [2022-04-28 11:12:37,554 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 11:12:37,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:12:37,555 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:12:37,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:12:37,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 11:12:37,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 11:12:37,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:12:37,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:12:37,584 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:12:37,584 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:12:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:37,586 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-28 11:12:37,586 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:12:37,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:37,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:37,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-28 11:12:37,587 INFO L87 Difference]: Start difference. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-28 11:12:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:37,588 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-28 11:12:37,588 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:12:37,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:37,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:37,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:12:37,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:12:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:12:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-28 11:12:37,590 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 45 [2022-04-28 11:12:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:12:37,590 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-28 11:12:37,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:12:37,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-28 11:12:37,658 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-28 11:12:37,659 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:12:37,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 11:12:37,659 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:12:37,659 INFO L195 NwaCegarLoop]: 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-28 11:12:37,677 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-28 11:12:37,860 WARN L477 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-28 11:12:37,860 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:12:37,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:12:37,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-28 11:12:37,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:37,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1917086614] [2022-04-28 11:12:38,176 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:12:38,177 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:12:38,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 2 times [2022-04-28 11:12:38,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:12:38,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160779780] [2022-04-28 11:12:38,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:12:38,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:12:38,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:12:38,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1095669098] [2022-04-28 11:12:38,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:12:38,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:12:38,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:12:38,186 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-28 11:12:38,186 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-28 11:12:38,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:12:38,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:12:38,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:12:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:38,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:12:38,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-28 11:12:38,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#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; {2448#true} is VALID [2022-04-28 11:12:38,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:12:38,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-28 11:12:38,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-28 11:12:38,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#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; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:12:38,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:12:38,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:12:38,404 INFO L272 TraceCheckUtils]: 8: Hoare triple {2468#(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)); {2448#true} is VALID [2022-04-28 11:12:38,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:12:38,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:12:38,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:12:38,405 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:12:38,405 INFO L272 TraceCheckUtils]: 13: Hoare triple {2468#(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)); {2448#true} is VALID [2022-04-28 11:12:38,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:12:38,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:12:38,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:12:38,405 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:12:38,406 INFO L272 TraceCheckUtils]: 18: Hoare triple {2468#(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)); {2448#true} is VALID [2022-04-28 11:12:38,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:12:38,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:12:38,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:12:38,406 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:12:38,406 INFO L272 TraceCheckUtils]: 23: Hoare triple {2468#(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)); {2448#true} is VALID [2022-04-28 11:12:38,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:12:38,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:12:38,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:12:38,407 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:12:38,407 INFO L272 TraceCheckUtils]: 28: Hoare triple {2468#(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)); {2448#true} is VALID [2022-04-28 11:12:38,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:12:38,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:12:38,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:12:38,408 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:12:38,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {2468#(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; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:12:38,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:12:38,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:12:38,409 INFO L272 TraceCheckUtils]: 36: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:12:38,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:12:38,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:12:38,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:12:38,410 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2448#true} {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} #59#return; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:12:38,410 INFO L272 TraceCheckUtils]: 41: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:12:38,410 INFO L290 TraceCheckUtils]: 42: Hoare triple {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:38,411 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-28 11:12:38,411 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-28 11:12:38,411 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-28 11:12:38,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:12:38,583 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-28 11:12:38,584 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-28 11:12:38,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:38,587 INFO L272 TraceCheckUtils]: 41: Hoare triple {2598#(= (+ (* 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)); {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:12:38,587 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2448#true} {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #59#return; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:12:38,587 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:12:38,587 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:12:38,588 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:12:38,588 INFO L272 TraceCheckUtils]: 36: Hoare triple {2598#(= (+ (* 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)); {2448#true} is VALID [2022-04-28 11:12:38,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !!(#t~post5 < 10);havoc #t~post5; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:12:38,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:12:38,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:12:38,596 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #67#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:12:38,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:12:38,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:12:38,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:12:38,597 INFO L272 TraceCheckUtils]: 28: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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)); {2448#true} is VALID [2022-04-28 11:12:38,597 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #65#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:12:38,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:12:38,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:12:38,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:12:38,597 INFO L272 TraceCheckUtils]: 23: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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)); {2448#true} is VALID [2022-04-28 11:12:38,598 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #63#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:12:38,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:12:38,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:12:38,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:12:38,598 INFO L272 TraceCheckUtils]: 18: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:12:38,599 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #61#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:12:38,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:12:38,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:12:38,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:12:38,599 INFO L272 TraceCheckUtils]: 13: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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)); {2448#true} is VALID [2022-04-28 11:12:38,599 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #59#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:12:38,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:12:38,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:12:38,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:12:38,600 INFO L272 TraceCheckUtils]: 8: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:12:38,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:12:38,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:12:38,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#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; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:12:38,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-28 11:12:38,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-28 11:12:38,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:12:38,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#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; {2448#true} is VALID [2022-04-28 11:12:38,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-28 11:12:38,601 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-28 11:12:38,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:12:38,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160779780] [2022-04-28 11:12:38,602 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:12:38,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095669098] [2022-04-28 11:12:38,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095669098] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:12:38,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:12:38,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:12:38,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:12:38,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1917086614] [2022-04-28 11:12:38,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1917086614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:38,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:38,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:12:38,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105627848] [2022-04-28 11:12:38,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:12:38,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:12:38,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:12:38,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:12:38,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:12:38,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:12:38,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:38,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:12:38,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:12:38,625 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:12:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:38,992 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2022-04-28 11:12:38,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:12:38,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:12:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:12:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:12:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-28 11:12:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:12:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-28 11:12:38,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-28 11:12:39,055 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-28 11:12:39,057 INFO L225 Difference]: With dead ends: 78 [2022-04-28 11:12:39,057 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 11:12:39,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 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-28 11:12:39,058 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:12:39,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 167 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:12:39,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 11:12:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-04-28 11:12:39,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:12:39,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:12:39,096 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:12:39,097 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:12:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:39,099 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 11:12:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 11:12:39,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:39,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:39,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 76 states. [2022-04-28 11:12:39,100 INFO L87 Difference]: Start difference. First operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 76 states. [2022-04-28 11:12:39,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:39,102 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 11:12:39,102 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 11:12:39,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:39,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:39,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:12:39,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:12:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:12:39,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-04-28 11:12:39,104 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 45 [2022-04-28 11:12:39,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:12:39,104 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-04-28 11:12:39,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:12:39,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 77 transitions. [2022-04-28 11:12:39,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:12:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-28 11:12:39,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:12:39,171 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:12:39,171 INFO L195 NwaCegarLoop]: 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-28 11:12:39,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 11:12:39,379 WARN L477 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-28 11:12:39,379 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:12:39,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:12:39,379 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 3 times [2022-04-28 11:12:39,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:39,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1335088916] [2022-04-28 11:12:39,661 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:12:39,662 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:12:39,662 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 4 times [2022-04-28 11:12:39,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:12:39,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839973005] [2022-04-28 11:12:39,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:12:39,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:12:39,673 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:12:39,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1688366032] [2022-04-28 11:12:39,673 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:12:39,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:12:39,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:12:39,674 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-28 11:12:39,675 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-28 11:12:39,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:12:39,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:12:39,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 11:12:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:39,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:12:40,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-28 11:12:40,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {3167#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; {3167#true} is VALID [2022-04-28 11:12:40,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:12:40,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-28 11:12:40,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-28 11:12:40,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {3167#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; {3167#true} is VALID [2022-04-28 11:12:40,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3167#true} is VALID [2022-04-28 11:12:40,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 10);havoc #t~post5; {3167#true} is VALID [2022-04-28 11:12:40,303 INFO L272 TraceCheckUtils]: 8: Hoare triple {3167#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:12:40,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:12:40,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:12:40,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:12:40,303 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-28 11:12:40,303 INFO L272 TraceCheckUtils]: 13: Hoare triple {3167#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:12:40,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:40,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:40,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:40,304 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3167#true} #61#return; {3225#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:12:40,305 INFO L272 TraceCheckUtils]: 18: Hoare triple {3225#(= (+ (* 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)); {3167#true} is VALID [2022-04-28 11:12:40,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:40,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:40,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:40,306 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3225#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {3241#(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-28 11:12:40,306 INFO L272 TraceCheckUtils]: 23: Hoare triple {3241#(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)); {3167#true} is VALID [2022-04-28 11:12:40,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:40,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:40,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:40,307 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3241#(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; {3257#(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-28 11:12:40,308 INFO L272 TraceCheckUtils]: 28: Hoare triple {3257#(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)); {3167#true} is VALID [2022-04-28 11:12:40,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:12:40,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:12:40,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:12:40,308 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3167#true} {3257#(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; {3257#(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-28 11:12:42,310 WARN L290 TraceCheckUtils]: 33: Hoare triple {3257#(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; {3257#(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-28 11:12:42,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {3257#(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; {3257#(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-28 11:12:42,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {3257#(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 < 10);havoc #t~post5; {3257#(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-28 11:12:42,311 INFO L272 TraceCheckUtils]: 36: Hoare triple {3257#(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)); {3167#true} is VALID [2022-04-28 11:12:42,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:42,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:42,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:42,313 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3257#(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; {3241#(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-28 11:12:42,313 INFO L272 TraceCheckUtils]: 41: Hoare triple {3241#(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)); {3167#true} is VALID [2022-04-28 11:12:42,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:42,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:42,313 INFO L290 TraceCheckUtils]: 44: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:42,314 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3241#(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; {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:12:42,314 INFO L272 TraceCheckUtils]: 46: Hoare triple {3312#(= (* 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)); {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:12:42,315 INFO L290 TraceCheckUtils]: 47: Hoare triple {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:42,315 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-28 11:12:42,315 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-28 11:12:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 34 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-04-28 11:12:42,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:12:42,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-28 11:12:42,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-28 11:12:42,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:12:42,976 INFO L272 TraceCheckUtils]: 46: Hoare triple {3312#(= (* 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)); {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:12:42,977 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3339#(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; {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:12:42,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:42,977 INFO L290 TraceCheckUtils]: 43: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:42,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:12:42,978 INFO L272 TraceCheckUtils]: 41: Hoare triple {3339#(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)); {3167#true} is VALID [2022-04-28 11:12:42,978 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3356#(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; {3339#(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-28 11:12:42,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:42,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:42,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:12:42,979 INFO L272 TraceCheckUtils]: 36: Hoare triple {3356#(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)); {3167#true} is VALID [2022-04-28 11:12:42,979 INFO L290 TraceCheckUtils]: 35: Hoare triple {3356#(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 < 10);havoc #t~post5; {3356#(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-28 11:12:42,980 INFO L290 TraceCheckUtils]: 34: Hoare triple {3356#(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; {3356#(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-28 11:12:42,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {3356#(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; {3356#(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-28 11:12:42,986 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3167#true} {3356#(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; {3356#(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-28 11:12:42,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:12:42,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:12:42,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:12:42,987 INFO L272 TraceCheckUtils]: 28: Hoare triple {3356#(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)); {3167#true} is VALID [2022-04-28 11:12:42,990 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3167#true} #65#return; {3356#(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-28 11:12:42,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:42,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:12:42,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:12:42,991 INFO L272 TraceCheckUtils]: 23: Hoare triple {3167#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:12:42,991 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3167#true} {3167#true} #63#return; {3167#true} is VALID [2022-04-28 11:12:42,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:12:42,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:12:42,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:12:42,992 INFO L272 TraceCheckUtils]: 18: Hoare triple {3167#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:12:42,992 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3167#true} {3167#true} #61#return; {3167#true} is VALID [2022-04-28 11:12:42,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:12:42,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:12:42,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:12:42,992 INFO L272 TraceCheckUtils]: 13: Hoare triple {3167#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:12:42,992 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-28 11:12:42,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:12:42,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:12:42,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:12:42,992 INFO L272 TraceCheckUtils]: 8: Hoare triple {3167#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:12:42,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 10);havoc #t~post5; {3167#true} is VALID [2022-04-28 11:12:42,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3167#true} is VALID [2022-04-28 11:12:42,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {3167#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; {3167#true} is VALID [2022-04-28 11:12:42,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-28 11:12:42,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-28 11:12:42,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:12:42,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {3167#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; {3167#true} is VALID [2022-04-28 11:12:42,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-28 11:12:42,993 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 11:12:42,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:12:42,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839973005] [2022-04-28 11:12:42,993 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:12:42,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688366032] [2022-04-28 11:12:42,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688366032] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:12:42,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:12:42,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-28 11:12:42,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:12:42,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1335088916] [2022-04-28 11:12:42,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1335088916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:42,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:42,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:12:42,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510816029] [2022-04-28 11:12:42,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:12:42,995 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2022-04-28 11:12:42,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:12:42,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:12:45,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:12:45,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:12:45,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:45,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:12:45,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:12:45,024 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:12:50,889 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-28 11:12:52,908 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-28 11:12:55,069 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:12:57,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:12:59,113 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-28 11:13:01,115 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-28 11:13:03,150 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:13:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:03,519 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2022-04-28 11:13:03,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:13:03,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2022-04-28 11:13:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:13:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 11:13:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:13:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 11:13:03,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-28 11:13:05,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 41 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:05,618 INFO L225 Difference]: With dead ends: 72 [2022-04-28 11:13:05,618 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 11:13:05,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:13:05,619 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 23 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:05,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 84 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 15.2s Time] [2022-04-28 11:13:05,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 11:13:05,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 11:13:05,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:05,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:05,664 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:05,665 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:05,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:05,667 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-28 11:13:05,667 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-28 11:13:05,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:05,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:05,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 68 states. [2022-04-28 11:13:05,667 INFO L87 Difference]: Start difference. First operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 68 states. [2022-04-28 11:13:05,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:05,669 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-28 11:13:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-28 11:13:05,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:05,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:05,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:05,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:05,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-04-28 11:13:05,672 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 50 [2022-04-28 11:13:05,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:05,672 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-04-28 11:13:05,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:13:05,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 76 transitions. [2022-04-28 11:13:07,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-28 11:13:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 11:13:07,754 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:07,754 INFO L195 NwaCegarLoop]: 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-28 11:13:07,773 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-28 11:13:07,963 WARN L477 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-28 11:13:07,963 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:07,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:07,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-28 11:13:07,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:07,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [144899498] [2022-04-28 11:13:08,252 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:08,253 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:08,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 2 times [2022-04-28 11:13:08,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:08,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303129799] [2022-04-28 11:13:08,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:08,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:08,261 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:08,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [842653291] [2022-04-28 11:13:08,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:08,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:08,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:08,262 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-28 11:13:08,263 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-28 11:13:08,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:08,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:08,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 11:13:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:08,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:08,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {3899#true} call ULTIMATE.init(); {3899#true} is VALID [2022-04-28 11:13:08,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {3899#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; {3899#true} is VALID [2022-04-28 11:13:08,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:13:08,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3899#true} {3899#true} #81#return; {3899#true} is VALID [2022-04-28 11:13:08,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {3899#true} call #t~ret6 := main(); {3899#true} is VALID [2022-04-28 11:13:08,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {3899#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; {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:08,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {3919#(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; {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:08,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:08,769 INFO L272 TraceCheckUtils]: 8: Hoare triple {3919#(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)); {3899#true} is VALID [2022-04-28 11:13:08,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:13:08,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:13:08,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:13:08,770 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3899#true} {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:08,770 INFO L272 TraceCheckUtils]: 13: Hoare triple {3919#(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)); {3899#true} is VALID [2022-04-28 11:13:08,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:13:08,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:13:08,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:13:08,771 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3899#true} {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:08,771 INFO L272 TraceCheckUtils]: 18: Hoare triple {3919#(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)); {3899#true} is VALID [2022-04-28 11:13:08,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:13:08,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:13:08,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:13:08,772 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3899#true} {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:08,772 INFO L272 TraceCheckUtils]: 23: Hoare triple {3919#(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)); {3899#true} is VALID [2022-04-28 11:13:08,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:13:08,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:13:08,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:13:08,772 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3899#true} {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:08,772 INFO L272 TraceCheckUtils]: 28: Hoare triple {3919#(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)); {3899#true} is VALID [2022-04-28 11:13:08,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:13:08,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:13:08,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:13:08,777 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3899#true} {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:08,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {3919#(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; {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:08,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:08,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:08,779 INFO L272 TraceCheckUtils]: 36: Hoare triple {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3899#true} is VALID [2022-04-28 11:13:08,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:13:08,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:13:08,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:13:08,779 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3899#true} {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #59#return; {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:08,780 INFO L272 TraceCheckUtils]: 41: Hoare triple {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3899#true} is VALID [2022-04-28 11:13:08,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:13:08,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:13:08,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:13:08,780 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3899#true} {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #61#return; {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:08,780 INFO L272 TraceCheckUtils]: 46: Hoare triple {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3899#true} is VALID [2022-04-28 11:13:08,780 INFO L290 TraceCheckUtils]: 47: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:13:08,780 INFO L290 TraceCheckUtils]: 48: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:13:08,781 INFO L290 TraceCheckUtils]: 49: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:13:08,781 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3899#true} {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #63#return; {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:08,781 INFO L272 TraceCheckUtils]: 51: Hoare triple {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~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)); {3899#true} is VALID [2022-04-28 11:13:08,781 INFO L290 TraceCheckUtils]: 52: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:13:08,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:13:08,781 INFO L290 TraceCheckUtils]: 54: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:13:08,782 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3899#true} {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #65#return; {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:08,782 INFO L272 TraceCheckUtils]: 56: Hoare triple {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~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)); {3899#true} is VALID [2022-04-28 11:13:08,782 INFO L290 TraceCheckUtils]: 57: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:13:08,782 INFO L290 TraceCheckUtils]: 58: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:13:08,782 INFO L290 TraceCheckUtils]: 59: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:13:08,783 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3899#true} {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #67#return; {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:08,783 INFO L290 TraceCheckUtils]: 61: Hoare triple {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {4089#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:13:08,783 INFO L272 TraceCheckUtils]: 62: Hoare triple {4089#(and (= (+ main_~z~0 (- 6)) 6) (= 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)); {3899#true} is VALID [2022-04-28 11:13:08,784 INFO L290 TraceCheckUtils]: 63: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:13:08,784 INFO L290 TraceCheckUtils]: 64: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:13:08,784 INFO L290 TraceCheckUtils]: 65: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:13:08,784 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3899#true} {4089#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #69#return; {4089#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:13:08,785 INFO L272 TraceCheckUtils]: 67: Hoare triple {4089#(and (= (+ main_~z~0 (- 6)) 6) (= 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)); {4108#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:08,785 INFO L290 TraceCheckUtils]: 68: Hoare triple {4108#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4112#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:08,786 INFO L290 TraceCheckUtils]: 69: Hoare triple {4112#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3900#false} is VALID [2022-04-28 11:13:08,786 INFO L290 TraceCheckUtils]: 70: Hoare triple {3900#false} assume !false; {3900#false} is VALID [2022-04-28 11:13:08,786 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-28 11:13:08,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:09,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:09,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303129799] [2022-04-28 11:13:09,150 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:09,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842653291] [2022-04-28 11:13:09,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842653291] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:13:09,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:13:09,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:13:09,150 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:09,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [144899498] [2022-04-28 11:13:09,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [144899498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:09,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:09,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:13:09,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002112072] [2022-04-28 11:13:09,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:09,151 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 71 [2022-04-28 11:13:09,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:09,151 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:13:09,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:09,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:13:09,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:09,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:13:09,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:13:09,186 INFO L87 Difference]: Start difference. First operand 68 states and 76 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:13:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:09,683 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-04-28 11:13:09,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:13:09,683 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 71 [2022-04-28 11:13:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:09,683 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:13:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-28 11:13:09,685 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:13:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-28 11:13:09,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-04-28 11:13:09,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:09,762 INFO L225 Difference]: With dead ends: 86 [2022-04-28 11:13:09,762 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 11:13:09,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:13:09,762 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:09,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 163 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 11:13:09,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-04-28 11:13:09,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:09,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:13:09,832 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:13:09,832 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:13:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:09,833 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-04-28 11:13:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2022-04-28 11:13:09,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:09,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:09,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 84 states. [2022-04-28 11:13:09,834 INFO L87 Difference]: Start difference. First operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 84 states. [2022-04-28 11:13:09,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:09,836 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-04-28 11:13:09,836 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2022-04-28 11:13:09,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:09,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:09,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:09,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:13:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2022-04-28 11:13:09,838 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 71 [2022-04-28 11:13:09,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:09,838 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2022-04-28 11:13:09,838 INFO L496 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:13:09,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 94 transitions. [2022-04-28 11:13:11,765 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-28 11:13:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2022-04-28 11:13:11,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 11:13:11,766 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:11,766 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:11,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 11:13:11,975 WARN L477 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-28 11:13:11,976 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:11,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 3 times [2022-04-28 11:13:11,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:11,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [201155554] [2022-04-28 11:13:12,213 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:12,213 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:12,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 4 times [2022-04-28 11:13:12,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:12,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095582161] [2022-04-28 11:13:12,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:12,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:12,221 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:12,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1136795153] [2022-04-28 11:13:12,221 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:13:12,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:12,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:12,222 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-28 11:13:12,223 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-28 11:13:12,265 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:13:12,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:12,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:13:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:12,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:12,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {4746#true} call ULTIMATE.init(); {4746#true} is VALID [2022-04-28 11:13:12,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {4746#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; {4754#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:12,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {4754#(<= ~counter~0 0)} assume true; {4754#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:12,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4754#(<= ~counter~0 0)} {4746#true} #81#return; {4754#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:12,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {4754#(<= ~counter~0 0)} call #t~ret6 := main(); {4754#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:12,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {4754#(<= ~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; {4754#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:12,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {4754#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {4770#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,573 INFO L272 TraceCheckUtils]: 8: Hoare triple {4770#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {4770#(<= ~counter~0 1)} ~cond := #in~cond; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {4770#(<= ~counter~0 1)} assume !(0 == ~cond); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {4770#(<= ~counter~0 1)} assume true; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,575 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4770#(<= ~counter~0 1)} {4770#(<= ~counter~0 1)} #59#return; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,575 INFO L272 TraceCheckUtils]: 13: Hoare triple {4770#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {4770#(<= ~counter~0 1)} ~cond := #in~cond; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {4770#(<= ~counter~0 1)} assume !(0 == ~cond); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {4770#(<= ~counter~0 1)} assume true; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,577 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4770#(<= ~counter~0 1)} {4770#(<= ~counter~0 1)} #61#return; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,577 INFO L272 TraceCheckUtils]: 18: Hoare triple {4770#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {4770#(<= ~counter~0 1)} ~cond := #in~cond; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {4770#(<= ~counter~0 1)} assume !(0 == ~cond); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {4770#(<= ~counter~0 1)} assume true; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,578 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4770#(<= ~counter~0 1)} {4770#(<= ~counter~0 1)} #63#return; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,579 INFO L272 TraceCheckUtils]: 23: Hoare triple {4770#(<= ~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)); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {4770#(<= ~counter~0 1)} ~cond := #in~cond; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {4770#(<= ~counter~0 1)} assume !(0 == ~cond); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {4770#(<= ~counter~0 1)} assume true; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,580 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4770#(<= ~counter~0 1)} {4770#(<= ~counter~0 1)} #65#return; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,581 INFO L272 TraceCheckUtils]: 28: Hoare triple {4770#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {4770#(<= ~counter~0 1)} ~cond := #in~cond; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {4770#(<= ~counter~0 1)} assume !(0 == ~cond); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {4770#(<= ~counter~0 1)} assume true; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,582 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4770#(<= ~counter~0 1)} {4770#(<= ~counter~0 1)} #67#return; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {4770#(<= ~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; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:12,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {4770#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {4855#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,584 INFO L272 TraceCheckUtils]: 36: Hoare triple {4855#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {4855#(<= ~counter~0 2)} ~cond := #in~cond; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {4855#(<= ~counter~0 2)} assume !(0 == ~cond); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {4855#(<= ~counter~0 2)} assume true; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,585 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4855#(<= ~counter~0 2)} {4855#(<= ~counter~0 2)} #59#return; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,585 INFO L272 TraceCheckUtils]: 41: Hoare triple {4855#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {4855#(<= ~counter~0 2)} ~cond := #in~cond; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {4855#(<= ~counter~0 2)} assume !(0 == ~cond); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,586 INFO L290 TraceCheckUtils]: 44: Hoare triple {4855#(<= ~counter~0 2)} assume true; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,587 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4855#(<= ~counter~0 2)} {4855#(<= ~counter~0 2)} #61#return; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,587 INFO L272 TraceCheckUtils]: 46: Hoare triple {4855#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {4855#(<= ~counter~0 2)} ~cond := #in~cond; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {4855#(<= ~counter~0 2)} assume !(0 == ~cond); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,588 INFO L290 TraceCheckUtils]: 49: Hoare triple {4855#(<= ~counter~0 2)} assume true; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,588 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4855#(<= ~counter~0 2)} {4855#(<= ~counter~0 2)} #63#return; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,589 INFO L272 TraceCheckUtils]: 51: Hoare triple {4855#(<= ~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)); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,589 INFO L290 TraceCheckUtils]: 52: Hoare triple {4855#(<= ~counter~0 2)} ~cond := #in~cond; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,589 INFO L290 TraceCheckUtils]: 53: Hoare triple {4855#(<= ~counter~0 2)} assume !(0 == ~cond); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,590 INFO L290 TraceCheckUtils]: 54: Hoare triple {4855#(<= ~counter~0 2)} assume true; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,590 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4855#(<= ~counter~0 2)} {4855#(<= ~counter~0 2)} #65#return; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,591 INFO L272 TraceCheckUtils]: 56: Hoare triple {4855#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,591 INFO L290 TraceCheckUtils]: 57: Hoare triple {4855#(<= ~counter~0 2)} ~cond := #in~cond; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,591 INFO L290 TraceCheckUtils]: 58: Hoare triple {4855#(<= ~counter~0 2)} assume !(0 == ~cond); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,591 INFO L290 TraceCheckUtils]: 59: Hoare triple {4855#(<= ~counter~0 2)} assume true; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,592 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4855#(<= ~counter~0 2)} {4855#(<= ~counter~0 2)} #67#return; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,592 INFO L290 TraceCheckUtils]: 61: Hoare triple {4855#(<= ~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; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:12,592 INFO L290 TraceCheckUtils]: 62: Hoare triple {4855#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4940#(<= |main_#t~post5| 2)} is VALID [2022-04-28 11:13:12,593 INFO L290 TraceCheckUtils]: 63: Hoare triple {4940#(<= |main_#t~post5| 2)} assume !(#t~post5 < 10);havoc #t~post5; {4747#false} is VALID [2022-04-28 11:13:12,593 INFO L272 TraceCheckUtils]: 64: Hoare triple {4747#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4747#false} is VALID [2022-04-28 11:13:12,593 INFO L290 TraceCheckUtils]: 65: Hoare triple {4747#false} ~cond := #in~cond; {4747#false} is VALID [2022-04-28 11:13:12,593 INFO L290 TraceCheckUtils]: 66: Hoare triple {4747#false} assume !(0 == ~cond); {4747#false} is VALID [2022-04-28 11:13:12,593 INFO L290 TraceCheckUtils]: 67: Hoare triple {4747#false} assume true; {4747#false} is VALID [2022-04-28 11:13:12,593 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4747#false} {4747#false} #69#return; {4747#false} is VALID [2022-04-28 11:13:12,593 INFO L272 TraceCheckUtils]: 69: Hoare triple {4747#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4747#false} is VALID [2022-04-28 11:13:12,593 INFO L290 TraceCheckUtils]: 70: Hoare triple {4747#false} ~cond := #in~cond; {4747#false} is VALID [2022-04-28 11:13:12,593 INFO L290 TraceCheckUtils]: 71: Hoare triple {4747#false} assume 0 == ~cond; {4747#false} is VALID [2022-04-28 11:13:12,593 INFO L290 TraceCheckUtils]: 72: Hoare triple {4747#false} assume !false; {4747#false} is VALID [2022-04-28 11:13:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 60 proven. 112 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-04-28 11:13:12,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:12,837 INFO L290 TraceCheckUtils]: 72: Hoare triple {4747#false} assume !false; {4747#false} is VALID [2022-04-28 11:13:12,838 INFO L290 TraceCheckUtils]: 71: Hoare triple {4747#false} assume 0 == ~cond; {4747#false} is VALID [2022-04-28 11:13:12,838 INFO L290 TraceCheckUtils]: 70: Hoare triple {4747#false} ~cond := #in~cond; {4747#false} is VALID [2022-04-28 11:13:12,838 INFO L272 TraceCheckUtils]: 69: Hoare triple {4747#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4747#false} is VALID [2022-04-28 11:13:12,838 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4746#true} {4747#false} #69#return; {4747#false} is VALID [2022-04-28 11:13:12,838 INFO L290 TraceCheckUtils]: 67: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:13:12,838 INFO L290 TraceCheckUtils]: 66: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:13:12,838 INFO L290 TraceCheckUtils]: 65: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:13:12,838 INFO L272 TraceCheckUtils]: 64: Hoare triple {4747#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4746#true} is VALID [2022-04-28 11:13:12,851 INFO L290 TraceCheckUtils]: 63: Hoare triple {4998#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {4747#false} is VALID [2022-04-28 11:13:12,852 INFO L290 TraceCheckUtils]: 62: Hoare triple {5002#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4998#(< |main_#t~post5| 10)} is VALID [2022-04-28 11:13:12,852 INFO L290 TraceCheckUtils]: 61: Hoare triple {5002#(< ~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; {5002#(< ~counter~0 10)} is VALID [2022-04-28 11:13:12,852 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4746#true} {5002#(< ~counter~0 10)} #67#return; {5002#(< ~counter~0 10)} is VALID [2022-04-28 11:13:12,852 INFO L290 TraceCheckUtils]: 59: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:13:12,852 INFO L290 TraceCheckUtils]: 58: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:13:12,853 INFO L290 TraceCheckUtils]: 57: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:13:12,853 INFO L272 TraceCheckUtils]: 56: Hoare triple {5002#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4746#true} is VALID [2022-04-28 11:13:12,853 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4746#true} {5002#(< ~counter~0 10)} #65#return; {5002#(< ~counter~0 10)} is VALID [2022-04-28 11:13:12,853 INFO L290 TraceCheckUtils]: 54: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:13:12,853 INFO L290 TraceCheckUtils]: 53: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:13:12,853 INFO L290 TraceCheckUtils]: 52: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:13:12,853 INFO L272 TraceCheckUtils]: 51: Hoare triple {5002#(< ~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)); {4746#true} is VALID [2022-04-28 11:13:12,854 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4746#true} {5002#(< ~counter~0 10)} #63#return; {5002#(< ~counter~0 10)} is VALID [2022-04-28 11:13:12,854 INFO L290 TraceCheckUtils]: 49: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:13:12,854 INFO L290 TraceCheckUtils]: 48: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:13:12,854 INFO L290 TraceCheckUtils]: 47: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:13:12,854 INFO L272 TraceCheckUtils]: 46: Hoare triple {5002#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4746#true} is VALID [2022-04-28 11:13:12,856 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4746#true} {5002#(< ~counter~0 10)} #61#return; {5002#(< ~counter~0 10)} is VALID [2022-04-28 11:13:12,856 INFO L290 TraceCheckUtils]: 44: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:13:12,856 INFO L290 TraceCheckUtils]: 43: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:13:12,857 INFO L290 TraceCheckUtils]: 42: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:13:12,857 INFO L272 TraceCheckUtils]: 41: Hoare triple {5002#(< ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4746#true} is VALID [2022-04-28 11:13:12,857 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4746#true} {5002#(< ~counter~0 10)} #59#return; {5002#(< ~counter~0 10)} is VALID [2022-04-28 11:13:12,857 INFO L290 TraceCheckUtils]: 39: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:13:12,857 INFO L290 TraceCheckUtils]: 38: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:13:12,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:13:12,857 INFO L272 TraceCheckUtils]: 36: Hoare triple {5002#(< ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4746#true} is VALID [2022-04-28 11:13:12,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {5002#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {5002#(< ~counter~0 10)} is VALID [2022-04-28 11:13:12,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {5087#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5002#(< ~counter~0 10)} is VALID [2022-04-28 11:13:12,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {5087#(< ~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; {5087#(< ~counter~0 9)} is VALID [2022-04-28 11:13:12,859 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4746#true} {5087#(< ~counter~0 9)} #67#return; {5087#(< ~counter~0 9)} is VALID [2022-04-28 11:13:12,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:13:12,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:13:12,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:13:12,859 INFO L272 TraceCheckUtils]: 28: Hoare triple {5087#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4746#true} is VALID [2022-04-28 11:13:12,859 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4746#true} {5087#(< ~counter~0 9)} #65#return; {5087#(< ~counter~0 9)} is VALID [2022-04-28 11:13:12,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:13:12,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:13:12,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:13:12,860 INFO L272 TraceCheckUtils]: 23: Hoare triple {5087#(< ~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)); {4746#true} is VALID [2022-04-28 11:13:12,860 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4746#true} {5087#(< ~counter~0 9)} #63#return; {5087#(< ~counter~0 9)} is VALID [2022-04-28 11:13:12,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:13:12,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:13:12,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:13:12,860 INFO L272 TraceCheckUtils]: 18: Hoare triple {5087#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4746#true} is VALID [2022-04-28 11:13:12,861 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4746#true} {5087#(< ~counter~0 9)} #61#return; {5087#(< ~counter~0 9)} is VALID [2022-04-28 11:13:12,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:13:12,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:13:12,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:13:12,861 INFO L272 TraceCheckUtils]: 13: Hoare triple {5087#(< ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4746#true} is VALID [2022-04-28 11:13:12,861 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4746#true} {5087#(< ~counter~0 9)} #59#return; {5087#(< ~counter~0 9)} is VALID [2022-04-28 11:13:12,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:13:12,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:13:12,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:13:12,861 INFO L272 TraceCheckUtils]: 8: Hoare triple {5087#(< ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4746#true} is VALID [2022-04-28 11:13:12,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {5087#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {5087#(< ~counter~0 9)} is VALID [2022-04-28 11:13:12,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {5172#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5087#(< ~counter~0 9)} is VALID [2022-04-28 11:13:12,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {5172#(< ~counter~0 8)} 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; {5172#(< ~counter~0 8)} is VALID [2022-04-28 11:13:12,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {5172#(< ~counter~0 8)} call #t~ret6 := main(); {5172#(< ~counter~0 8)} is VALID [2022-04-28 11:13:12,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5172#(< ~counter~0 8)} {4746#true} #81#return; {5172#(< ~counter~0 8)} is VALID [2022-04-28 11:13:12,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {5172#(< ~counter~0 8)} assume true; {5172#(< ~counter~0 8)} is VALID [2022-04-28 11:13:12,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {4746#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; {5172#(< ~counter~0 8)} is VALID [2022-04-28 11:13:12,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {4746#true} call ULTIMATE.init(); {4746#true} is VALID [2022-04-28 11:13:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:13:12,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:12,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095582161] [2022-04-28 11:13:12,864 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:12,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136795153] [2022-04-28 11:13:12,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136795153] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:12,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:12,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 11:13:12,865 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:12,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [201155554] [2022-04-28 11:13:12,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [201155554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:12,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:12,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:13:12,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112881978] [2022-04-28 11:13:12,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:12,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 73 [2022-04-28 11:13:12,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:12,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:13:12,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:12,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:13:12,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:12,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:13:12,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:13:12,896 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:13:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:13,460 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2022-04-28 11:13:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:13:13,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 73 [2022-04-28 11:13:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:13:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-28 11:13:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:13:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-28 11:13:13,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 90 transitions. [2022-04-28 11:13:13,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:13,526 INFO L225 Difference]: With dead ends: 114 [2022-04-28 11:13:13,526 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 11:13:13,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:13:13,527 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:13,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 137 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:13:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 11:13:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-04-28 11:13:13,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:13,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 98 states, 57 states have (on average 1.087719298245614) internal successors, (62), 59 states have internal predecessors, (62), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:13:13,613 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 98 states, 57 states have (on average 1.087719298245614) internal successors, (62), 59 states have internal predecessors, (62), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:13:13,613 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 98 states, 57 states have (on average 1.087719298245614) internal successors, (62), 59 states have internal predecessors, (62), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:13:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:13,615 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-04-28 11:13:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-04-28 11:13:13,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:13,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:13,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 57 states have (on average 1.087719298245614) internal successors, (62), 59 states have internal predecessors, (62), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 100 states. [2022-04-28 11:13:13,616 INFO L87 Difference]: Start difference. First operand has 98 states, 57 states have (on average 1.087719298245614) internal successors, (62), 59 states have internal predecessors, (62), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 100 states. [2022-04-28 11:13:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:13,617 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-04-28 11:13:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-04-28 11:13:13,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:13,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:13,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:13,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.087719298245614) internal successors, (62), 59 states have internal predecessors, (62), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:13:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2022-04-28 11:13:13,619 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 73 [2022-04-28 11:13:13,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:13,621 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2022-04-28 11:13:13,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:13:13,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 109 transitions. [2022-04-28 11:13:15,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 108 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2022-04-28 11:13:15,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 11:13:15,756 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:15,756 INFO L195 NwaCegarLoop]: 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-28 11:13:15,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 11:13:15,967 WARN L477 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-28 11:13:15,967 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:15,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-28 11:13:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:15,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1146649270] [2022-04-28 11:13:16,195 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:16,195 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:16,195 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 2 times [2022-04-28 11:13:16,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:16,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762836503] [2022-04-28 11:13:16,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:16,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:16,202 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:16,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1194043437] [2022-04-28 11:13:16,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:16,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:16,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:16,203 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-28 11:13:16,204 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-28 11:13:16,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:16,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:16,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:13:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:16,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:16,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {5821#true} call ULTIMATE.init(); {5821#true} is VALID [2022-04-28 11:13:16,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {5821#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; {5821#true} is VALID [2022-04-28 11:13:16,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-28 11:13:16,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5821#true} {5821#true} #81#return; {5821#true} is VALID [2022-04-28 11:13:16,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {5821#true} call #t~ret6 := main(); {5821#true} is VALID [2022-04-28 11:13:16,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {5821#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; {5841#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:13:16,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {5841#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5841#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:13:16,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {5841#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(#t~post5 < 10);havoc #t~post5; {5841#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:13:16,825 INFO L272 TraceCheckUtils]: 8: Hoare triple {5841#(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)); {5821#true} is VALID [2022-04-28 11:13:16,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-28 11:13:16,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-28 11:13:16,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-28 11:13:16,826 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5821#true} {5841#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #59#return; {5841#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:13:16,826 INFO L272 TraceCheckUtils]: 13: Hoare triple {5841#(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)); {5821#true} is VALID [2022-04-28 11:13:16,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-28 11:13:16,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-28 11:13:16,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-28 11:13:16,827 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5821#true} {5841#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #61#return; {5841#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:13:16,827 INFO L272 TraceCheckUtils]: 18: Hoare triple {5841#(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)); {5821#true} is VALID [2022-04-28 11:13:16,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-28 11:13:16,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-28 11:13:16,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-28 11:13:16,827 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5821#true} {5841#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #63#return; {5841#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:13:16,827 INFO L272 TraceCheckUtils]: 23: Hoare triple {5841#(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)); {5821#true} is VALID [2022-04-28 11:13:16,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-28 11:13:16,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-28 11:13:16,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-28 11:13:16,828 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5821#true} {5841#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #65#return; {5841#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:13:16,828 INFO L272 TraceCheckUtils]: 28: Hoare triple {5841#(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)); {5821#true} is VALID [2022-04-28 11:13:16,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-28 11:13:16,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-28 11:13:16,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-28 11:13:16,829 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5821#true} {5841#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #67#return; {5841#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:13:16,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {5841#(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; {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:16,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:16,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:16,830 INFO L272 TraceCheckUtils]: 36: Hoare triple {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5821#true} is VALID [2022-04-28 11:13:16,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-28 11:13:16,831 INFO L290 TraceCheckUtils]: 38: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-28 11:13:16,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-28 11:13:16,831 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5821#true} {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #59#return; {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:16,831 INFO L272 TraceCheckUtils]: 41: Hoare triple {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~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)); {5821#true} is VALID [2022-04-28 11:13:16,831 INFO L290 TraceCheckUtils]: 42: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-28 11:13:16,831 INFO L290 TraceCheckUtils]: 43: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-28 11:13:16,831 INFO L290 TraceCheckUtils]: 44: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-28 11:13:16,832 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5821#true} {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #61#return; {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:16,832 INFO L272 TraceCheckUtils]: 46: Hoare triple {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~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)); {5821#true} is VALID [2022-04-28 11:13:16,832 INFO L290 TraceCheckUtils]: 47: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-28 11:13:16,832 INFO L290 TraceCheckUtils]: 48: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-28 11:13:16,832 INFO L290 TraceCheckUtils]: 49: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-28 11:13:16,833 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5821#true} {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #63#return; {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:16,833 INFO L272 TraceCheckUtils]: 51: Hoare triple {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~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)); {5821#true} is VALID [2022-04-28 11:13:16,833 INFO L290 TraceCheckUtils]: 52: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-28 11:13:16,833 INFO L290 TraceCheckUtils]: 53: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-28 11:13:16,833 INFO L290 TraceCheckUtils]: 54: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-28 11:13:16,834 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5821#true} {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #65#return; {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:16,834 INFO L272 TraceCheckUtils]: 56: Hoare triple {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~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)); {5821#true} is VALID [2022-04-28 11:13:16,834 INFO L290 TraceCheckUtils]: 57: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-28 11:13:16,834 INFO L290 TraceCheckUtils]: 58: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-28 11:13:16,834 INFO L290 TraceCheckUtils]: 59: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-28 11:13:16,834 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5821#true} {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #67#return; {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:16,835 INFO L290 TraceCheckUtils]: 61: Hoare triple {5926#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {6011#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:13:16,835 INFO L272 TraceCheckUtils]: 62: Hoare triple {6011#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5821#true} is VALID [2022-04-28 11:13:16,835 INFO L290 TraceCheckUtils]: 63: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-28 11:13:16,835 INFO L290 TraceCheckUtils]: 64: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-28 11:13:16,835 INFO L290 TraceCheckUtils]: 65: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-28 11:13:16,836 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5821#true} {6011#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (< main_~a~0 1))} #69#return; {6011#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:13:16,836 INFO L272 TraceCheckUtils]: 67: Hoare triple {6011#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~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)); {5821#true} is VALID [2022-04-28 11:13:16,836 INFO L290 TraceCheckUtils]: 68: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-28 11:13:16,836 INFO L290 TraceCheckUtils]: 69: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-28 11:13:16,836 INFO L290 TraceCheckUtils]: 70: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-28 11:13:16,836 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5821#true} {6011#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (< main_~a~0 1))} #71#return; {6011#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:13:16,837 INFO L272 TraceCheckUtils]: 72: Hoare triple {6011#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~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)); {6045#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:16,838 INFO L290 TraceCheckUtils]: 73: Hoare triple {6045#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6049#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:16,838 INFO L290 TraceCheckUtils]: 74: Hoare triple {6049#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5822#false} is VALID [2022-04-28 11:13:16,838 INFO L290 TraceCheckUtils]: 75: Hoare triple {5822#false} assume !false; {5822#false} is VALID [2022-04-28 11:13:16,838 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-28 11:13:16,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:21,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:21,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762836503] [2022-04-28 11:13:21,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:21,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194043437] [2022-04-28 11:13:21,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194043437] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:13:21,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:13:21,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:13:21,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:21,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1146649270] [2022-04-28 11:13:21,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1146649270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:21,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:21,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:13:21,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372917313] [2022-04-28 11:13:21,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:21,745 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-28 11:13:21,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:21,745 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-28 11:13:21,778 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-28 11:13:21,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:13:21,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:21,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:13:21,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:13:21,778 INFO L87 Difference]: Start difference. First operand 98 states and 109 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-28 11:13:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:22,283 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-04-28 11:13:22,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:13:22,283 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-28 11:13:22,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:22,283 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-28 11:13:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-28 11:13:22,285 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-28 11:13:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-28 11:13:22,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-04-28 11:13:22,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:22,347 INFO L225 Difference]: With dead ends: 104 [2022-04-28 11:13:22,347 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 11:13:22,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:13:22,348 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:22,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 184 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:22,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 11:13:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-28 11:13:22,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:22,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 25 states have call successors, (25), 17 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:13:22,436 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 25 states have call successors, (25), 17 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:13:22,436 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 25 states have call successors, (25), 17 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:13:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:22,438 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-04-28 11:13:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-04-28 11:13:22,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:22,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:22,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 25 states have call successors, (25), 17 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 100 states. [2022-04-28 11:13:22,439 INFO L87 Difference]: Start difference. First operand has 100 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 25 states have call successors, (25), 17 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 100 states. [2022-04-28 11:13:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:22,440 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-04-28 11:13:22,440 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-04-28 11:13:22,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:22,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:22,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:22,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 25 states have call successors, (25), 17 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:13:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2022-04-28 11:13:22,442 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 76 [2022-04-28 11:13:22,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:22,442 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2022-04-28 11:13:22,443 INFO L496 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-28 11:13:22,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 110 transitions. [2022-04-28 11:13:24,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 109 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-04-28 11:13:24,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 11:13:24,582 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:24,582 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 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, 1, 1] [2022-04-28 11:13:24,597 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-28 11:13:24,791 WARN L477 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-28 11:13:24,791 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:24,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:24,792 INFO L85 PathProgramCache]: Analyzing trace with hash 210840414, now seen corresponding path program 1 times [2022-04-28 11:13:24,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:24,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [994504057] [2022-04-28 11:13:25,040 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:25,041 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:25,041 INFO L85 PathProgramCache]: Analyzing trace with hash 210840414, now seen corresponding path program 2 times [2022-04-28 11:13:25,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:25,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55602781] [2022-04-28 11:13:25,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:25,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:25,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:25,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [710048240] [2022-04-28 11:13:25,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:25,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:25,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:25,055 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-28 11:13:25,083 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-28 11:13:25,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:25,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:25,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 11:13:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:25,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:31,756 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:13:32,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {6802#true} call ULTIMATE.init(); {6802#true} is VALID [2022-04-28 11:13:32,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {6802#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; {6802#true} is VALID [2022-04-28 11:13:32,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:13:32,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6802#true} {6802#true} #81#return; {6802#true} is VALID [2022-04-28 11:13:32,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {6802#true} call #t~ret6 := main(); {6802#true} is VALID [2022-04-28 11:13:32,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {6802#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; {6822#(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-28 11:13:32,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {6822#(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; {6822#(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-28 11:13:32,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {6822#(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 < 10);havoc #t~post5; {6822#(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-28 11:13:32,514 INFO L272 TraceCheckUtils]: 8: Hoare triple {6822#(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)); {6802#true} is VALID [2022-04-28 11:13:32,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:13:32,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:13:32,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:13:32,515 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6802#true} {6822#(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; {6822#(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-28 11:13:32,515 INFO L272 TraceCheckUtils]: 13: Hoare triple {6822#(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)); {6802#true} is VALID [2022-04-28 11:13:32,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:13:32,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:13:32,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:13:32,516 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6802#true} {6822#(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; {6822#(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-28 11:13:32,516 INFO L272 TraceCheckUtils]: 18: Hoare triple {6822#(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)); {6802#true} is VALID [2022-04-28 11:13:32,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:13:32,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:13:32,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:13:32,516 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6802#true} {6822#(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; {6822#(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-28 11:13:32,516 INFO L272 TraceCheckUtils]: 23: Hoare triple {6822#(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)); {6802#true} is VALID [2022-04-28 11:13:32,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:13:32,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:13:32,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:13:32,517 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6802#true} {6822#(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; {6822#(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-28 11:13:32,517 INFO L272 TraceCheckUtils]: 28: Hoare triple {6822#(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)); {6802#true} is VALID [2022-04-28 11:13:32,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:13:32,517 INFO L290 TraceCheckUtils]: 30: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:13:32,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:13:32,518 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6802#true} {6822#(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; {6822#(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-28 11:13:32,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {6822#(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; {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} is VALID [2022-04-28 11:13:32,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} is VALID [2022-04-28 11:13:32,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} assume !!(#t~post5 < 10);havoc #t~post5; {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} is VALID [2022-04-28 11:13:32,519 INFO L272 TraceCheckUtils]: 36: Hoare triple {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6802#true} is VALID [2022-04-28 11:13:32,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:13:32,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:13:32,519 INFO L290 TraceCheckUtils]: 39: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:13:32,520 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6802#true} {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} #59#return; {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} is VALID [2022-04-28 11:13:32,520 INFO L272 TraceCheckUtils]: 41: Hoare triple {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6802#true} is VALID [2022-04-28 11:13:32,520 INFO L290 TraceCheckUtils]: 42: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:13:32,520 INFO L290 TraceCheckUtils]: 43: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:13:32,520 INFO L290 TraceCheckUtils]: 44: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:13:32,521 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6802#true} {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} #61#return; {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} is VALID [2022-04-28 11:13:32,521 INFO L272 TraceCheckUtils]: 46: Hoare triple {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6802#true} is VALID [2022-04-28 11:13:32,521 INFO L290 TraceCheckUtils]: 47: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:13:32,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:13:32,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:13:32,521 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6802#true} {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} #63#return; {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} is VALID [2022-04-28 11:13:32,521 INFO L272 TraceCheckUtils]: 51: Hoare triple {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6802#true} is VALID [2022-04-28 11:13:32,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {6802#true} ~cond := #in~cond; {6965#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:32,522 INFO L290 TraceCheckUtils]: 53: Hoare triple {6965#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:32,522 INFO L290 TraceCheckUtils]: 54: Hoare triple {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:32,523 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} #65#return; {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} is VALID [2022-04-28 11:13:32,523 INFO L272 TraceCheckUtils]: 56: Hoare triple {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6802#true} is VALID [2022-04-28 11:13:32,523 INFO L290 TraceCheckUtils]: 57: Hoare triple {6802#true} ~cond := #in~cond; {6965#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:32,523 INFO L290 TraceCheckUtils]: 58: Hoare triple {6965#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:32,523 INFO L290 TraceCheckUtils]: 59: Hoare triple {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:32,524 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} #67#return; {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} is VALID [2022-04-28 11:13:32,525 INFO L290 TraceCheckUtils]: 61: Hoare triple {6907#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} assume !(~n~0 <= ~a~0); {6994#(and (= main_~z~0 12) (< main_~a~0 main_~n~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (<= 0 main_~a~0) (= main_~n~0 1))} is VALID [2022-04-28 11:13:32,525 INFO L272 TraceCheckUtils]: 62: Hoare triple {6994#(and (= main_~z~0 12) (< main_~a~0 main_~n~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (<= 0 main_~a~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6802#true} is VALID [2022-04-28 11:13:32,525 INFO L290 TraceCheckUtils]: 63: Hoare triple {6802#true} ~cond := #in~cond; {6965#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:32,525 INFO L290 TraceCheckUtils]: 64: Hoare triple {6965#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:32,526 INFO L290 TraceCheckUtils]: 65: Hoare triple {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:32,526 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} {6994#(and (= main_~z~0 12) (< main_~a~0 main_~n~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (<= 0 main_~a~0) (= main_~n~0 1))} #69#return; {7010#(and (= main_~z~0 12) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:13:32,526 INFO L272 TraceCheckUtils]: 67: Hoare triple {7010#(and (= main_~z~0 12) (= (+ 5 main_~y~0) main_~z~0) (= 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)); {6802#true} is VALID [2022-04-28 11:13:32,527 INFO L290 TraceCheckUtils]: 68: Hoare triple {6802#true} ~cond := #in~cond; {6965#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:32,527 INFO L290 TraceCheckUtils]: 69: Hoare triple {6965#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:32,527 INFO L290 TraceCheckUtils]: 70: Hoare triple {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:32,528 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} {7010#(and (= main_~z~0 12) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #71#return; {7026#(and (= (+ 5 main_~y~0) main_~z~0) (< (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0) 1) (= main_~x~0 1) (<= 0 (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0)) (= (mod (* (- 1) main_~z~0 main_~x~0) 6) 0))} is VALID [2022-04-28 11:13:32,528 INFO L272 TraceCheckUtils]: 72: Hoare triple {7026#(and (= (+ 5 main_~y~0) main_~z~0) (< (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0) 1) (= main_~x~0 1) (<= 0 (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0)) (= (mod (* (- 1) main_~z~0 main_~x~0) 6) 0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6802#true} is VALID [2022-04-28 11:13:32,528 INFO L290 TraceCheckUtils]: 73: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:13:32,529 INFO L290 TraceCheckUtils]: 74: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:13:32,529 INFO L290 TraceCheckUtils]: 75: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:13:32,529 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {6802#true} {7026#(and (= (+ 5 main_~y~0) main_~z~0) (< (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0) 1) (= main_~x~0 1) (<= 0 (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0)) (= (mod (* (- 1) main_~z~0 main_~x~0) 6) 0))} #73#return; {7026#(and (= (+ 5 main_~y~0) main_~z~0) (< (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0) 1) (= main_~x~0 1) (<= 0 (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0)) (= (mod (* (- 1) main_~z~0 main_~x~0) 6) 0))} is VALID [2022-04-28 11:13:32,535 INFO L272 TraceCheckUtils]: 77: Hoare triple {7026#(and (= (+ 5 main_~y~0) main_~z~0) (< (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0) 1) (= main_~x~0 1) (<= 0 (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0)) (= (mod (* (- 1) main_~z~0 main_~x~0) 6) 0))} call __VERIFIER_assert((if 0 == 2 * ~y~0 * ~y~0 - 3 * ~x~0 * ~z~0 - 18 * ~x~0 - 10 * ~y~0 + 3 * ~z~0 - 10 then 1 else 0)); {7045#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:32,535 INFO L290 TraceCheckUtils]: 78: Hoare triple {7045#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7049#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:32,535 INFO L290 TraceCheckUtils]: 79: Hoare triple {7049#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6803#false} is VALID [2022-04-28 11:13:32,535 INFO L290 TraceCheckUtils]: 80: Hoare triple {6803#false} assume !false; {6803#false} is VALID [2022-04-28 11:13:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 118 proven. 24 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-04-28 11:13:32,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:24,798 INFO L290 TraceCheckUtils]: 80: Hoare triple {6803#false} assume !false; {6803#false} is VALID [2022-04-28 11:14:24,799 INFO L290 TraceCheckUtils]: 79: Hoare triple {7049#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6803#false} is VALID [2022-04-28 11:14:24,799 INFO L290 TraceCheckUtils]: 78: Hoare triple {7045#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7049#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:24,800 INFO L272 TraceCheckUtils]: 77: Hoare triple {7065#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} call __VERIFIER_assert((if 0 == 2 * ~y~0 * ~y~0 - 3 * ~x~0 * ~z~0 - 18 * ~x~0 - 10 * ~y~0 + 3 * ~z~0 - 10 then 1 else 0)); {7045#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:24,800 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {6802#true} {7065#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} #73#return; {7065#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} is VALID [2022-04-28 11:14:24,800 INFO L290 TraceCheckUtils]: 75: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:14:24,800 INFO L290 TraceCheckUtils]: 74: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:14:24,800 INFO L290 TraceCheckUtils]: 73: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:14:24,800 INFO L272 TraceCheckUtils]: 72: Hoare triple {7065#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6802#true} is VALID [2022-04-28 11:14:24,801 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} {7084#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))))} #71#return; {7065#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} is VALID [2022-04-28 11:14:24,801 INFO L290 TraceCheckUtils]: 70: Hoare triple {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:24,802 INFO L290 TraceCheckUtils]: 69: Hoare triple {7094#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:24,802 INFO L290 TraceCheckUtils]: 68: Hoare triple {6802#true} ~cond := #in~cond; {7094#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:14:24,802 INFO L272 TraceCheckUtils]: 67: Hoare triple {7084#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6802#true} is VALID [2022-04-28 11:14:24,803 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} {7101#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))))} #69#return; {7084#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))))} is VALID [2022-04-28 11:14:24,803 INFO L290 TraceCheckUtils]: 65: Hoare triple {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:24,803 INFO L290 TraceCheckUtils]: 64: Hoare triple {7094#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:24,804 INFO L290 TraceCheckUtils]: 63: Hoare triple {6802#true} ~cond := #in~cond; {7094#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:14:24,804 INFO L272 TraceCheckUtils]: 62: Hoare triple {7101#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6802#true} is VALID [2022-04-28 11:14:24,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {7117#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (<= main_~n~0 main_~a~0))} assume !(~n~0 <= ~a~0); {7101#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))))} is VALID [2022-04-28 11:14:24,805 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} {7121#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (<= main_~n~0 main_~a~0) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #67#return; {7117#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:14:24,806 INFO L290 TraceCheckUtils]: 59: Hoare triple {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:24,806 INFO L290 TraceCheckUtils]: 58: Hoare triple {7094#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:24,806 INFO L290 TraceCheckUtils]: 57: Hoare triple {6802#true} ~cond := #in~cond; {7094#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:14:24,806 INFO L272 TraceCheckUtils]: 56: Hoare triple {7121#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (<= main_~n~0 main_~a~0) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6802#true} is VALID [2022-04-28 11:14:24,809 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} {6802#true} #65#return; {7121#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (<= main_~n~0 main_~a~0) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:24,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:24,810 INFO L290 TraceCheckUtils]: 53: Hoare triple {7094#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:24,810 INFO L290 TraceCheckUtils]: 52: Hoare triple {6802#true} ~cond := #in~cond; {7094#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:14:24,810 INFO L272 TraceCheckUtils]: 51: Hoare triple {6802#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6802#true} is VALID [2022-04-28 11:14:24,810 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6802#true} {6802#true} #63#return; {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L290 TraceCheckUtils]: 47: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L272 TraceCheckUtils]: 46: Hoare triple {6802#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6802#true} {6802#true} #61#return; {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L290 TraceCheckUtils]: 44: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L272 TraceCheckUtils]: 41: Hoare triple {6802#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6802#true} {6802#true} #59#return; {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L272 TraceCheckUtils]: 36: Hoare triple {6802#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {6802#true} assume !!(#t~post5 < 10);havoc #t~post5; {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {6802#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {6802#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; {6802#true} is VALID [2022-04-28 11:14:24,811 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6802#true} {6802#true} #67#return; {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L272 TraceCheckUtils]: 28: Hoare triple {6802#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6802#true} {6802#true} #65#return; {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L272 TraceCheckUtils]: 23: Hoare triple {6802#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6802#true} {6802#true} #63#return; {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L272 TraceCheckUtils]: 18: Hoare triple {6802#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6802#true} {6802#true} #61#return; {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:14:24,812 INFO L272 TraceCheckUtils]: 13: Hoare triple {6802#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6802#true} is VALID [2022-04-28 11:14:24,813 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6802#true} {6802#true} #59#return; {6802#true} is VALID [2022-04-28 11:14:24,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:14:24,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-28 11:14:24,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-28 11:14:24,813 INFO L272 TraceCheckUtils]: 8: Hoare triple {6802#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6802#true} is VALID [2022-04-28 11:14:24,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {6802#true} assume !!(#t~post5 < 10);havoc #t~post5; {6802#true} is VALID [2022-04-28 11:14:24,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {6802#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6802#true} is VALID [2022-04-28 11:14:24,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {6802#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; {6802#true} is VALID [2022-04-28 11:14:24,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {6802#true} call #t~ret6 := main(); {6802#true} is VALID [2022-04-28 11:14:24,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6802#true} {6802#true} #81#return; {6802#true} is VALID [2022-04-28 11:14:24,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-28 11:14:24,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {6802#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; {6802#true} is VALID [2022-04-28 11:14:24,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {6802#true} call ULTIMATE.init(); {6802#true} is VALID [2022-04-28 11:14:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 120 proven. 16 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-28 11:14:24,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:24,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55602781] [2022-04-28 11:14:24,814 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:24,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710048240] [2022-04-28 11:14:24,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710048240] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:24,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:24,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-04-28 11:14:24,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:24,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [994504057] [2022-04-28 11:14:24,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [994504057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:24,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:24,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 11:14:24,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612672072] [2022-04-28 11:14:24,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:24,815 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 81 [2022-04-28 11:14:24,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:24,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 11:14:24,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:24,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 11:14:24,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:24,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 11:14:24,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:14:24,885 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 11:14:27,679 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-28 11:14:28,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:28,171 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-04-28 11:14:28,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:14:28,172 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 81 [2022-04-28 11:14:28,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 11:14:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-28 11:14:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 11:14:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-28 11:14:28,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2022-04-28 11:14:28,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:28,252 INFO L225 Difference]: With dead ends: 102 [2022-04-28 11:14:28,252 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 11:14:28,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-04-28 11:14:28,253 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:28,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 107 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 281 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 11:14:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 11:14:28,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-28 11:14:28,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:28,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:28,350 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:28,350 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:28,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:28,352 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-04-28 11:14:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-04-28 11:14:28,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:28,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:28,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 86 states. [2022-04-28 11:14:28,352 INFO L87 Difference]: Start difference. First operand has 86 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 86 states. [2022-04-28 11:14:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:28,353 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-04-28 11:14:28,353 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-04-28 11:14:28,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:28,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:28,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:28,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:28,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2022-04-28 11:14:28,355 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 81 [2022-04-28 11:14:28,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:28,355 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2022-04-28 11:14:28,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 11:14:28,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 94 transitions. [2022-04-28 11:14:30,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 93 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-04-28 11:14:30,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 11:14:30,492 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:30,492 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 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] [2022-04-28 11:14:30,510 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-28 11:14:30,692 WARN L477 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-28 11:14:30,693 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:30,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:30,693 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 3 times [2022-04-28 11:14:30,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:30,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1343731568] [2022-04-28 11:14:30,917 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:30,917 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:30,917 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 4 times [2022-04-28 11:14:30,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:30,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831106475] [2022-04-28 11:14:30,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:30,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:30,925 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:30,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [921874397] [2022-04-28 11:14:30,925 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:14:30,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:30,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:30,929 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-28 11:14:30,929 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-28 11:14:31,043 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:14:31,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:31,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 11:14:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:31,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:31,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {7856#true} call ULTIMATE.init(); {7856#true} is VALID [2022-04-28 11:14:31,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {7856#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; {7856#true} is VALID [2022-04-28 11:14:31,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-28 11:14:31,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7856#true} {7856#true} #81#return; {7856#true} is VALID [2022-04-28 11:14:31,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {7856#true} call #t~ret6 := main(); {7856#true} is VALID [2022-04-28 11:14:31,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {7856#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; {7876#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:31,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {7876#(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; {7876#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:31,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {7876#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {7876#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:31,657 INFO L272 TraceCheckUtils]: 8: Hoare triple {7876#(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)); {7856#true} is VALID [2022-04-28 11:14:31,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-28 11:14:31,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-28 11:14:31,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-28 11:14:31,660 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7856#true} {7876#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {7876#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:31,660 INFO L272 TraceCheckUtils]: 13: Hoare triple {7876#(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)); {7856#true} is VALID [2022-04-28 11:14:31,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-28 11:14:31,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-28 11:14:31,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-28 11:14:31,661 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7856#true} {7876#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {7876#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:31,661 INFO L272 TraceCheckUtils]: 18: Hoare triple {7876#(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)); {7856#true} is VALID [2022-04-28 11:14:31,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-28 11:14:31,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-28 11:14:31,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-28 11:14:31,661 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7856#true} {7876#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {7876#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:31,662 INFO L272 TraceCheckUtils]: 23: Hoare triple {7876#(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)); {7856#true} is VALID [2022-04-28 11:14:31,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-28 11:14:31,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-28 11:14:31,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-28 11:14:31,663 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7856#true} {7876#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {7876#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:31,663 INFO L272 TraceCheckUtils]: 28: Hoare triple {7876#(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)); {7856#true} is VALID [2022-04-28 11:14:31,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-28 11:14:31,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-28 11:14:31,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-28 11:14:31,664 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7856#true} {7876#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {7876#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:31,664 INFO L290 TraceCheckUtils]: 33: Hoare triple {7876#(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; {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:31,665 INFO L290 TraceCheckUtils]: 34: Hoare triple {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:31,665 INFO L290 TraceCheckUtils]: 35: Hoare triple {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} assume !!(#t~post5 < 10);havoc #t~post5; {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:31,665 INFO L272 TraceCheckUtils]: 36: Hoare triple {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7856#true} is VALID [2022-04-28 11:14:31,665 INFO L290 TraceCheckUtils]: 37: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-28 11:14:31,665 INFO L290 TraceCheckUtils]: 38: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-28 11:14:31,665 INFO L290 TraceCheckUtils]: 39: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-28 11:14:31,666 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7856#true} {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #59#return; {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:31,666 INFO L272 TraceCheckUtils]: 41: Hoare triple {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= 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)); {7856#true} is VALID [2022-04-28 11:14:31,666 INFO L290 TraceCheckUtils]: 42: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-28 11:14:31,666 INFO L290 TraceCheckUtils]: 43: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-28 11:14:31,666 INFO L290 TraceCheckUtils]: 44: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-28 11:14:31,666 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7856#true} {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #61#return; {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:31,667 INFO L272 TraceCheckUtils]: 46: Hoare triple {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7856#true} is VALID [2022-04-28 11:14:31,667 INFO L290 TraceCheckUtils]: 47: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-28 11:14:31,667 INFO L290 TraceCheckUtils]: 48: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-28 11:14:31,667 INFO L290 TraceCheckUtils]: 49: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-28 11:14:31,667 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7856#true} {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #63#return; {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:31,667 INFO L272 TraceCheckUtils]: 51: Hoare triple {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= 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)); {7856#true} is VALID [2022-04-28 11:14:31,667 INFO L290 TraceCheckUtils]: 52: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-28 11:14:31,667 INFO L290 TraceCheckUtils]: 53: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-28 11:14:31,667 INFO L290 TraceCheckUtils]: 54: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-28 11:14:31,668 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7856#true} {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #65#return; {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:31,668 INFO L272 TraceCheckUtils]: 56: Hoare triple {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~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)); {7856#true} is VALID [2022-04-28 11:14:31,668 INFO L290 TraceCheckUtils]: 57: Hoare triple {7856#true} ~cond := #in~cond; {8034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:31,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {8034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:31,669 INFO L290 TraceCheckUtils]: 59: Hoare triple {8038#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:31,669 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8038#(not (= |__VERIFIER_assert_#in~cond| 0))} {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #67#return; {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:31,670 INFO L290 TraceCheckUtils]: 61: Hoare triple {7961#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~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; {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:14:31,670 INFO L290 TraceCheckUtils]: 62: Hoare triple {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:14:31,671 INFO L290 TraceCheckUtils]: 63: Hoare triple {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} assume !!(#t~post5 < 10);havoc #t~post5; {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:14:31,671 INFO L272 TraceCheckUtils]: 64: Hoare triple {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7856#true} is VALID [2022-04-28 11:14:31,671 INFO L290 TraceCheckUtils]: 65: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-28 11:14:31,671 INFO L290 TraceCheckUtils]: 66: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-28 11:14:31,671 INFO L290 TraceCheckUtils]: 67: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-28 11:14:31,671 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7856#true} {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #59#return; {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:14:31,671 INFO L272 TraceCheckUtils]: 69: Hoare triple {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7856#true} is VALID [2022-04-28 11:14:31,672 INFO L290 TraceCheckUtils]: 70: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-28 11:14:31,672 INFO L290 TraceCheckUtils]: 71: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-28 11:14:31,672 INFO L290 TraceCheckUtils]: 72: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-28 11:14:31,672 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7856#true} {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #61#return; {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:14:31,672 INFO L272 TraceCheckUtils]: 74: Hoare triple {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7856#true} is VALID [2022-04-28 11:14:31,672 INFO L290 TraceCheckUtils]: 75: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-28 11:14:31,672 INFO L290 TraceCheckUtils]: 76: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-28 11:14:31,672 INFO L290 TraceCheckUtils]: 77: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-28 11:14:31,673 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7856#true} {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #63#return; {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:14:31,673 INFO L272 TraceCheckUtils]: 79: Hoare triple {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~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)); {7856#true} is VALID [2022-04-28 11:14:31,673 INFO L290 TraceCheckUtils]: 80: Hoare triple {7856#true} ~cond := #in~cond; {8034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:31,674 INFO L290 TraceCheckUtils]: 81: Hoare triple {8034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:31,674 INFO L290 TraceCheckUtils]: 82: Hoare triple {8038#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:31,674 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {8038#(not (= |__VERIFIER_assert_#in~cond| 0))} {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #65#return; {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:14:31,675 INFO L272 TraceCheckUtils]: 84: Hoare triple {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7856#true} is VALID [2022-04-28 11:14:31,675 INFO L290 TraceCheckUtils]: 85: Hoare triple {7856#true} ~cond := #in~cond; {8034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:31,675 INFO L290 TraceCheckUtils]: 86: Hoare triple {8034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:31,675 INFO L290 TraceCheckUtils]: 87: Hoare triple {8038#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:31,676 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8038#(not (= |__VERIFIER_assert_#in~cond| 0))} {8048#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #67#return; {8130#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= main_~n~0 2) (= main_~x~0 8))} is VALID [2022-04-28 11:14:31,676 INFO L290 TraceCheckUtils]: 89: Hoare triple {8130#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= main_~n~0 2) (= main_~x~0 8))} assume !(~n~0 <= ~a~0); {8134#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:14:31,677 INFO L272 TraceCheckUtils]: 90: Hoare triple {8134#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7856#true} is VALID [2022-04-28 11:14:31,677 INFO L290 TraceCheckUtils]: 91: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-28 11:14:31,677 INFO L290 TraceCheckUtils]: 92: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-28 11:14:31,677 INFO L290 TraceCheckUtils]: 93: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-28 11:14:31,677 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7856#true} {8134#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #69#return; {8134#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:14:31,678 INFO L272 TraceCheckUtils]: 95: Hoare triple {8134#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {8153#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:31,678 INFO L290 TraceCheckUtils]: 96: Hoare triple {8153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:31,678 INFO L290 TraceCheckUtils]: 97: Hoare triple {8157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7857#false} is VALID [2022-04-28 11:14:31,679 INFO L290 TraceCheckUtils]: 98: Hoare triple {7857#false} assume !false; {7857#false} is VALID [2022-04-28 11:14:31,679 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 128 proven. 45 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-04-28 11:14:31,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:55,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:55,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831106475] [2022-04-28 11:14:55,747 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:55,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921874397] [2022-04-28 11:14:55,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921874397] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:14:55,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:14:55,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 11:14:55,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:55,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1343731568] [2022-04-28 11:14:55,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1343731568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:55,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:55,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 11:14:55,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368223730] [2022-04-28 11:14:55,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:55,748 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2022-04-28 11:14:55,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:55,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:55,797 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-28 11:14:55,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 11:14:55,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:55,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 11:14:55,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:14:55,797 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:57,053 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2022-04-28 11:14:57,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:14:57,053 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2022-04-28 11:14:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:57,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-28 11:14:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-28 11:14:57,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 85 transitions. [2022-04-28 11:14:57,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:57,144 INFO L225 Difference]: With dead ends: 110 [2022-04-28 11:14:57,144 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 11:14:57,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-04-28 11:14:57,145 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 15 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:57,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 11:14:57,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 11:14:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-28 11:14:57,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:57,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:57,249 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:57,249 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:57,250 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2022-04-28 11:14:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-04-28 11:14:57,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:57,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:57,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 100 states. [2022-04-28 11:14:57,251 INFO L87 Difference]: Start difference. First operand has 100 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 100 states. [2022-04-28 11:14:57,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:57,252 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2022-04-28 11:14:57,252 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-04-28 11:14:57,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:57,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:57,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:57,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2022-04-28 11:14:57,254 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 99 [2022-04-28 11:14:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:57,255 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2022-04-28 11:14:57,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:57,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 111 transitions. [2022-04-28 11:14:59,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 110 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:59,411 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-04-28 11:14:59,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 11:14:59,411 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:59,411 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:59,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 11:14:59,615 WARN L477 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-28 11:14:59,615 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:59,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 5 times [2022-04-28 11:14:59,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:59,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1498666277] [2022-04-28 11:14:59,900 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:59,900 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:59,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 6 times [2022-04-28 11:14:59,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:59,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740336198] [2022-04-28 11:14:59,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:59,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:59,908 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:59,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401605395] [2022-04-28 11:14:59,909 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:14:59,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:59,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:59,909 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-28 11:14:59,910 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-28 11:15:00,135 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:15:00,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:00,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 11:15:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:00,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:00,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {8912#true} call ULTIMATE.init(); {8912#true} is VALID [2022-04-28 11:15:00,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {8912#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; {8920#(<= ~counter~0 0)} is VALID [2022-04-28 11:15:00,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {8920#(<= ~counter~0 0)} assume true; {8920#(<= ~counter~0 0)} is VALID [2022-04-28 11:15:00,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8920#(<= ~counter~0 0)} {8912#true} #81#return; {8920#(<= ~counter~0 0)} is VALID [2022-04-28 11:15:00,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {8920#(<= ~counter~0 0)} call #t~ret6 := main(); {8920#(<= ~counter~0 0)} is VALID [2022-04-28 11:15:00,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {8920#(<= ~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; {8920#(<= ~counter~0 0)} is VALID [2022-04-28 11:15:00,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {8920#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {8936#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,471 INFO L272 TraceCheckUtils]: 8: Hoare triple {8936#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {8936#(<= ~counter~0 1)} ~cond := #in~cond; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {8936#(<= ~counter~0 1)} assume !(0 == ~cond); {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {8936#(<= ~counter~0 1)} assume true; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,473 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8936#(<= ~counter~0 1)} {8936#(<= ~counter~0 1)} #59#return; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,473 INFO L272 TraceCheckUtils]: 13: Hoare triple {8936#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {8936#(<= ~counter~0 1)} ~cond := #in~cond; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {8936#(<= ~counter~0 1)} assume !(0 == ~cond); {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {8936#(<= ~counter~0 1)} assume true; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,474 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8936#(<= ~counter~0 1)} {8936#(<= ~counter~0 1)} #61#return; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,474 INFO L272 TraceCheckUtils]: 18: Hoare triple {8936#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {8936#(<= ~counter~0 1)} ~cond := #in~cond; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {8936#(<= ~counter~0 1)} assume !(0 == ~cond); {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {8936#(<= ~counter~0 1)} assume true; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,476 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8936#(<= ~counter~0 1)} {8936#(<= ~counter~0 1)} #63#return; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,476 INFO L272 TraceCheckUtils]: 23: Hoare triple {8936#(<= ~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)); {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {8936#(<= ~counter~0 1)} ~cond := #in~cond; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {8936#(<= ~counter~0 1)} assume !(0 == ~cond); {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {8936#(<= ~counter~0 1)} assume true; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,477 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8936#(<= ~counter~0 1)} {8936#(<= ~counter~0 1)} #65#return; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,478 INFO L272 TraceCheckUtils]: 28: Hoare triple {8936#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {8936#(<= ~counter~0 1)} ~cond := #in~cond; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {8936#(<= ~counter~0 1)} assume !(0 == ~cond); {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {8936#(<= ~counter~0 1)} assume true; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,479 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8936#(<= ~counter~0 1)} {8936#(<= ~counter~0 1)} #67#return; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,479 INFO L290 TraceCheckUtils]: 33: Hoare triple {8936#(<= ~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; {8936#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:00,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {8936#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {9021#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,480 INFO L272 TraceCheckUtils]: 36: Hoare triple {9021#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,480 INFO L290 TraceCheckUtils]: 37: Hoare triple {9021#(<= ~counter~0 2)} ~cond := #in~cond; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {9021#(<= ~counter~0 2)} assume !(0 == ~cond); {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {9021#(<= ~counter~0 2)} assume true; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,481 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9021#(<= ~counter~0 2)} {9021#(<= ~counter~0 2)} #59#return; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,482 INFO L272 TraceCheckUtils]: 41: Hoare triple {9021#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,482 INFO L290 TraceCheckUtils]: 42: Hoare triple {9021#(<= ~counter~0 2)} ~cond := #in~cond; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,482 INFO L290 TraceCheckUtils]: 43: Hoare triple {9021#(<= ~counter~0 2)} assume !(0 == ~cond); {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,482 INFO L290 TraceCheckUtils]: 44: Hoare triple {9021#(<= ~counter~0 2)} assume true; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,483 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9021#(<= ~counter~0 2)} {9021#(<= ~counter~0 2)} #61#return; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,483 INFO L272 TraceCheckUtils]: 46: Hoare triple {9021#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,483 INFO L290 TraceCheckUtils]: 47: Hoare triple {9021#(<= ~counter~0 2)} ~cond := #in~cond; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,484 INFO L290 TraceCheckUtils]: 48: Hoare triple {9021#(<= ~counter~0 2)} assume !(0 == ~cond); {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,484 INFO L290 TraceCheckUtils]: 49: Hoare triple {9021#(<= ~counter~0 2)} assume true; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,484 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9021#(<= ~counter~0 2)} {9021#(<= ~counter~0 2)} #63#return; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,485 INFO L272 TraceCheckUtils]: 51: Hoare triple {9021#(<= ~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)); {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,485 INFO L290 TraceCheckUtils]: 52: Hoare triple {9021#(<= ~counter~0 2)} ~cond := #in~cond; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,485 INFO L290 TraceCheckUtils]: 53: Hoare triple {9021#(<= ~counter~0 2)} assume !(0 == ~cond); {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,485 INFO L290 TraceCheckUtils]: 54: Hoare triple {9021#(<= ~counter~0 2)} assume true; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,486 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9021#(<= ~counter~0 2)} {9021#(<= ~counter~0 2)} #65#return; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,486 INFO L272 TraceCheckUtils]: 56: Hoare triple {9021#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,486 INFO L290 TraceCheckUtils]: 57: Hoare triple {9021#(<= ~counter~0 2)} ~cond := #in~cond; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,487 INFO L290 TraceCheckUtils]: 58: Hoare triple {9021#(<= ~counter~0 2)} assume !(0 == ~cond); {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,487 INFO L290 TraceCheckUtils]: 59: Hoare triple {9021#(<= ~counter~0 2)} assume true; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,487 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9021#(<= ~counter~0 2)} {9021#(<= ~counter~0 2)} #67#return; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,488 INFO L290 TraceCheckUtils]: 61: Hoare triple {9021#(<= ~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; {9021#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:00,488 INFO L290 TraceCheckUtils]: 62: Hoare triple {9021#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,488 INFO L290 TraceCheckUtils]: 63: Hoare triple {9106#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,489 INFO L272 TraceCheckUtils]: 64: Hoare triple {9106#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,489 INFO L290 TraceCheckUtils]: 65: Hoare triple {9106#(<= ~counter~0 3)} ~cond := #in~cond; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,489 INFO L290 TraceCheckUtils]: 66: Hoare triple {9106#(<= ~counter~0 3)} assume !(0 == ~cond); {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,489 INFO L290 TraceCheckUtils]: 67: Hoare triple {9106#(<= ~counter~0 3)} assume true; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,490 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9106#(<= ~counter~0 3)} {9106#(<= ~counter~0 3)} #59#return; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,490 INFO L272 TraceCheckUtils]: 69: Hoare triple {9106#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,490 INFO L290 TraceCheckUtils]: 70: Hoare triple {9106#(<= ~counter~0 3)} ~cond := #in~cond; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,491 INFO L290 TraceCheckUtils]: 71: Hoare triple {9106#(<= ~counter~0 3)} assume !(0 == ~cond); {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,491 INFO L290 TraceCheckUtils]: 72: Hoare triple {9106#(<= ~counter~0 3)} assume true; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,491 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9106#(<= ~counter~0 3)} {9106#(<= ~counter~0 3)} #61#return; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,492 INFO L272 TraceCheckUtils]: 74: Hoare triple {9106#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,492 INFO L290 TraceCheckUtils]: 75: Hoare triple {9106#(<= ~counter~0 3)} ~cond := #in~cond; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,492 INFO L290 TraceCheckUtils]: 76: Hoare triple {9106#(<= ~counter~0 3)} assume !(0 == ~cond); {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,492 INFO L290 TraceCheckUtils]: 77: Hoare triple {9106#(<= ~counter~0 3)} assume true; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,493 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {9106#(<= ~counter~0 3)} {9106#(<= ~counter~0 3)} #63#return; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,493 INFO L272 TraceCheckUtils]: 79: Hoare triple {9106#(<= ~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)); {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,493 INFO L290 TraceCheckUtils]: 80: Hoare triple {9106#(<= ~counter~0 3)} ~cond := #in~cond; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,494 INFO L290 TraceCheckUtils]: 81: Hoare triple {9106#(<= ~counter~0 3)} assume !(0 == ~cond); {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,494 INFO L290 TraceCheckUtils]: 82: Hoare triple {9106#(<= ~counter~0 3)} assume true; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,494 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {9106#(<= ~counter~0 3)} {9106#(<= ~counter~0 3)} #65#return; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,495 INFO L272 TraceCheckUtils]: 84: Hoare triple {9106#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,495 INFO L290 TraceCheckUtils]: 85: Hoare triple {9106#(<= ~counter~0 3)} ~cond := #in~cond; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,495 INFO L290 TraceCheckUtils]: 86: Hoare triple {9106#(<= ~counter~0 3)} assume !(0 == ~cond); {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,496 INFO L290 TraceCheckUtils]: 87: Hoare triple {9106#(<= ~counter~0 3)} assume true; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,496 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9106#(<= ~counter~0 3)} {9106#(<= ~counter~0 3)} #67#return; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,496 INFO L290 TraceCheckUtils]: 89: Hoare triple {9106#(<= ~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; {9106#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:00,496 INFO L290 TraceCheckUtils]: 90: Hoare triple {9106#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9191#(<= |main_#t~post5| 3)} is VALID [2022-04-28 11:15:00,497 INFO L290 TraceCheckUtils]: 91: Hoare triple {9191#(<= |main_#t~post5| 3)} assume !(#t~post5 < 10);havoc #t~post5; {8913#false} is VALID [2022-04-28 11:15:00,497 INFO L272 TraceCheckUtils]: 92: Hoare triple {8913#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8913#false} is VALID [2022-04-28 11:15:00,497 INFO L290 TraceCheckUtils]: 93: Hoare triple {8913#false} ~cond := #in~cond; {8913#false} is VALID [2022-04-28 11:15:00,497 INFO L290 TraceCheckUtils]: 94: Hoare triple {8913#false} assume !(0 == ~cond); {8913#false} is VALID [2022-04-28 11:15:00,497 INFO L290 TraceCheckUtils]: 95: Hoare triple {8913#false} assume true; {8913#false} is VALID [2022-04-28 11:15:00,497 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {8913#false} {8913#false} #69#return; {8913#false} is VALID [2022-04-28 11:15:00,497 INFO L272 TraceCheckUtils]: 97: Hoare triple {8913#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {8913#false} is VALID [2022-04-28 11:15:00,497 INFO L290 TraceCheckUtils]: 98: Hoare triple {8913#false} ~cond := #in~cond; {8913#false} is VALID [2022-04-28 11:15:00,497 INFO L290 TraceCheckUtils]: 99: Hoare triple {8913#false} assume 0 == ~cond; {8913#false} is VALID [2022-04-28 11:15:00,497 INFO L290 TraceCheckUtils]: 100: Hoare triple {8913#false} assume !false; {8913#false} is VALID [2022-04-28 11:15:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 90 proven. 330 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-04-28 11:15:00,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:00,808 INFO L290 TraceCheckUtils]: 100: Hoare triple {8913#false} assume !false; {8913#false} is VALID [2022-04-28 11:15:00,808 INFO L290 TraceCheckUtils]: 99: Hoare triple {8913#false} assume 0 == ~cond; {8913#false} is VALID [2022-04-28 11:15:00,808 INFO L290 TraceCheckUtils]: 98: Hoare triple {8913#false} ~cond := #in~cond; {8913#false} is VALID [2022-04-28 11:15:00,809 INFO L272 TraceCheckUtils]: 97: Hoare triple {8913#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {8913#false} is VALID [2022-04-28 11:15:00,809 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {8912#true} {8913#false} #69#return; {8913#false} is VALID [2022-04-28 11:15:00,809 INFO L290 TraceCheckUtils]: 95: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 11:15:00,809 INFO L290 TraceCheckUtils]: 94: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 11:15:00,809 INFO L290 TraceCheckUtils]: 93: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 11:15:00,809 INFO L272 TraceCheckUtils]: 92: Hoare triple {8913#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8912#true} is VALID [2022-04-28 11:15:00,809 INFO L290 TraceCheckUtils]: 91: Hoare triple {9249#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {8913#false} is VALID [2022-04-28 11:15:00,809 INFO L290 TraceCheckUtils]: 90: Hoare triple {9253#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9249#(< |main_#t~post5| 10)} is VALID [2022-04-28 11:15:00,810 INFO L290 TraceCheckUtils]: 89: Hoare triple {9253#(< ~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; {9253#(< ~counter~0 10)} is VALID [2022-04-28 11:15:00,810 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8912#true} {9253#(< ~counter~0 10)} #67#return; {9253#(< ~counter~0 10)} is VALID [2022-04-28 11:15:00,810 INFO L290 TraceCheckUtils]: 87: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 11:15:00,810 INFO L290 TraceCheckUtils]: 86: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 11:15:00,810 INFO L290 TraceCheckUtils]: 85: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 11:15:00,810 INFO L272 TraceCheckUtils]: 84: Hoare triple {9253#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8912#true} is VALID [2022-04-28 11:15:00,811 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {8912#true} {9253#(< ~counter~0 10)} #65#return; {9253#(< ~counter~0 10)} is VALID [2022-04-28 11:15:00,811 INFO L290 TraceCheckUtils]: 82: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 11:15:00,811 INFO L290 TraceCheckUtils]: 81: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 11:15:00,811 INFO L290 TraceCheckUtils]: 80: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 11:15:00,811 INFO L272 TraceCheckUtils]: 79: Hoare triple {9253#(< ~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)); {8912#true} is VALID [2022-04-28 11:15:00,811 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {8912#true} {9253#(< ~counter~0 10)} #63#return; {9253#(< ~counter~0 10)} is VALID [2022-04-28 11:15:00,811 INFO L290 TraceCheckUtils]: 77: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 11:15:00,811 INFO L290 TraceCheckUtils]: 76: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 11:15:00,811 INFO L290 TraceCheckUtils]: 75: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 11:15:00,812 INFO L272 TraceCheckUtils]: 74: Hoare triple {9253#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8912#true} is VALID [2022-04-28 11:15:00,812 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8912#true} {9253#(< ~counter~0 10)} #61#return; {9253#(< ~counter~0 10)} is VALID [2022-04-28 11:15:00,812 INFO L290 TraceCheckUtils]: 72: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 11:15:00,812 INFO L290 TraceCheckUtils]: 71: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 11:15:00,812 INFO L290 TraceCheckUtils]: 70: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 11:15:00,812 INFO L272 TraceCheckUtils]: 69: Hoare triple {9253#(< ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8912#true} is VALID [2022-04-28 11:15:00,813 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8912#true} {9253#(< ~counter~0 10)} #59#return; {9253#(< ~counter~0 10)} is VALID [2022-04-28 11:15:00,813 INFO L290 TraceCheckUtils]: 67: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 11:15:00,813 INFO L290 TraceCheckUtils]: 66: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 11:15:00,813 INFO L290 TraceCheckUtils]: 65: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 11:15:00,813 INFO L272 TraceCheckUtils]: 64: Hoare triple {9253#(< ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8912#true} is VALID [2022-04-28 11:15:00,813 INFO L290 TraceCheckUtils]: 63: Hoare triple {9253#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {9253#(< ~counter~0 10)} is VALID [2022-04-28 11:15:00,813 INFO L290 TraceCheckUtils]: 62: Hoare triple {9338#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9253#(< ~counter~0 10)} is VALID [2022-04-28 11:15:00,814 INFO L290 TraceCheckUtils]: 61: Hoare triple {9338#(< ~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; {9338#(< ~counter~0 9)} is VALID [2022-04-28 11:15:00,814 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8912#true} {9338#(< ~counter~0 9)} #67#return; {9338#(< ~counter~0 9)} is VALID [2022-04-28 11:15:00,814 INFO L290 TraceCheckUtils]: 59: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 11:15:00,814 INFO L290 TraceCheckUtils]: 58: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 11:15:00,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 11:15:00,814 INFO L272 TraceCheckUtils]: 56: Hoare triple {9338#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8912#true} is VALID [2022-04-28 11:15:00,815 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8912#true} {9338#(< ~counter~0 9)} #65#return; {9338#(< ~counter~0 9)} is VALID [2022-04-28 11:15:00,815 INFO L290 TraceCheckUtils]: 54: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 11:15:00,815 INFO L290 TraceCheckUtils]: 53: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 11:15:00,815 INFO L290 TraceCheckUtils]: 52: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 11:15:00,815 INFO L272 TraceCheckUtils]: 51: Hoare triple {9338#(< ~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)); {8912#true} is VALID [2022-04-28 11:15:00,815 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8912#true} {9338#(< ~counter~0 9)} #63#return; {9338#(< ~counter~0 9)} is VALID [2022-04-28 11:15:00,815 INFO L290 TraceCheckUtils]: 49: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 11:15:00,815 INFO L290 TraceCheckUtils]: 48: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 11:15:00,816 INFO L290 TraceCheckUtils]: 47: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 11:15:00,816 INFO L272 TraceCheckUtils]: 46: Hoare triple {9338#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8912#true} is VALID [2022-04-28 11:15:00,816 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8912#true} {9338#(< ~counter~0 9)} #61#return; {9338#(< ~counter~0 9)} is VALID [2022-04-28 11:15:00,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 11:15:00,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 11:15:00,816 INFO L290 TraceCheckUtils]: 42: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 11:15:00,816 INFO L272 TraceCheckUtils]: 41: Hoare triple {9338#(< ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8912#true} is VALID [2022-04-28 11:15:00,817 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8912#true} {9338#(< ~counter~0 9)} #59#return; {9338#(< ~counter~0 9)} is VALID [2022-04-28 11:15:00,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 11:15:00,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 11:15:00,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 11:15:00,817 INFO L272 TraceCheckUtils]: 36: Hoare triple {9338#(< ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8912#true} is VALID [2022-04-28 11:15:00,817 INFO L290 TraceCheckUtils]: 35: Hoare triple {9338#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {9338#(< ~counter~0 9)} is VALID [2022-04-28 11:15:00,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {9423#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9338#(< ~counter~0 9)} is VALID [2022-04-28 11:15:00,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {9423#(< ~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; {9423#(< ~counter~0 8)} is VALID [2022-04-28 11:15:00,818 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8912#true} {9423#(< ~counter~0 8)} #67#return; {9423#(< ~counter~0 8)} is VALID [2022-04-28 11:15:00,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 11:15:00,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 11:15:00,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 11:15:00,818 INFO L272 TraceCheckUtils]: 28: Hoare triple {9423#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8912#true} is VALID [2022-04-28 11:15:00,819 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8912#true} {9423#(< ~counter~0 8)} #65#return; {9423#(< ~counter~0 8)} is VALID [2022-04-28 11:15:00,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 11:15:00,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 11:15:00,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 11:15:00,819 INFO L272 TraceCheckUtils]: 23: Hoare triple {9423#(< ~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)); {8912#true} is VALID [2022-04-28 11:15:00,819 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8912#true} {9423#(< ~counter~0 8)} #63#return; {9423#(< ~counter~0 8)} is VALID [2022-04-28 11:15:00,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 11:15:00,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 11:15:00,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 11:15:00,819 INFO L272 TraceCheckUtils]: 18: Hoare triple {9423#(< ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8912#true} is VALID [2022-04-28 11:15:00,820 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8912#true} {9423#(< ~counter~0 8)} #61#return; {9423#(< ~counter~0 8)} is VALID [2022-04-28 11:15:00,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 11:15:00,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 11:15:00,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 11:15:00,820 INFO L272 TraceCheckUtils]: 13: Hoare triple {9423#(< ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8912#true} is VALID [2022-04-28 11:15:00,820 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8912#true} {9423#(< ~counter~0 8)} #59#return; {9423#(< ~counter~0 8)} is VALID [2022-04-28 11:15:00,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 11:15:00,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 11:15:00,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 11:15:00,821 INFO L272 TraceCheckUtils]: 8: Hoare triple {9423#(< ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8912#true} is VALID [2022-04-28 11:15:00,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {9423#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {9423#(< ~counter~0 8)} is VALID [2022-04-28 11:15:00,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {9508#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9423#(< ~counter~0 8)} is VALID [2022-04-28 11:15:00,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {9508#(< ~counter~0 7)} 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; {9508#(< ~counter~0 7)} is VALID [2022-04-28 11:15:00,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {9508#(< ~counter~0 7)} call #t~ret6 := main(); {9508#(< ~counter~0 7)} is VALID [2022-04-28 11:15:00,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9508#(< ~counter~0 7)} {8912#true} #81#return; {9508#(< ~counter~0 7)} is VALID [2022-04-28 11:15:00,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {9508#(< ~counter~0 7)} assume true; {9508#(< ~counter~0 7)} is VALID [2022-04-28 11:15:00,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {8912#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; {9508#(< ~counter~0 7)} is VALID [2022-04-28 11:15:00,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {8912#true} call ULTIMATE.init(); {8912#true} is VALID [2022-04-28 11:15:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 11:15:00,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:00,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740336198] [2022-04-28 11:15:00,827 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:00,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401605395] [2022-04-28 11:15:00,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401605395] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:00,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:00,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 11:15:00,827 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:00,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1498666277] [2022-04-28 11:15:00,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1498666277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:00,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:00,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:15:00,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410929334] [2022-04-28 11:15:00,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:00,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 101 [2022-04-28 11:15:00,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:00,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:15:00,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:00,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:15:00,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:00,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:15:00,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:15:00,872 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:15:01,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:01,440 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2022-04-28 11:15:01,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:15:01,441 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 101 [2022-04-28 11:15:01,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:15:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-28 11:15:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:15:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-28 11:15:01,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2022-04-28 11:15:01,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:01,523 INFO L225 Difference]: With dead ends: 116 [2022-04-28 11:15:01,523 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 11:15:01,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:15:01,524 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:01,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 146 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:15:01,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 11:15:01,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-28 11:15:01,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:01,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 60 states have (on average 1.05) internal successors, (63), 61 states have internal predecessors, (63), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:01,652 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 60 states have (on average 1.05) internal successors, (63), 61 states have internal predecessors, (63), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:01,652 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 60 states have (on average 1.05) internal successors, (63), 61 states have internal predecessors, (63), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:01,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:01,654 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-04-28 11:15:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2022-04-28 11:15:01,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:01,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:01,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 60 states have (on average 1.05) internal successors, (63), 61 states have internal predecessors, (63), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 102 states. [2022-04-28 11:15:01,655 INFO L87 Difference]: Start difference. First operand has 102 states, 60 states have (on average 1.05) internal successors, (63), 61 states have internal predecessors, (63), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 102 states. [2022-04-28 11:15:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:01,656 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-04-28 11:15:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2022-04-28 11:15:01,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:01,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:01,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:01,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.05) internal successors, (63), 61 states have internal predecessors, (63), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2022-04-28 11:15:01,658 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 101 [2022-04-28 11:15:01,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:01,658 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2022-04-28 11:15:01,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:15:01,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 113 transitions. [2022-04-28 11:15:03,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 112 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2022-04-28 11:15:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-28 11:15:03,835 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:03,835 INFO L195 NwaCegarLoop]: 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-28 11:15:03,839 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-28 11:15:04,035 WARN L477 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-28 11:15:04,036 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:04,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash -813840784, now seen corresponding path program 5 times [2022-04-28 11:15:04,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:04,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1735898277] [2022-04-28 11:15:04,252 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:04,252 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:04,252 INFO L85 PathProgramCache]: Analyzing trace with hash -813840784, now seen corresponding path program 6 times [2022-04-28 11:15:04,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:04,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34004793] [2022-04-28 11:15:04,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:04,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:04,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:04,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [968363112] [2022-04-28 11:15:04,261 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:15:04,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:04,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:04,261 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-28 11:15:04,262 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-28 11:15:04,736 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:15:04,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:04,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 11:15:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:04,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:05,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {10175#true} call ULTIMATE.init(); {10175#true} is VALID [2022-04-28 11:15:05,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {10175#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; {10175#true} is VALID [2022-04-28 11:15:05,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10175#true} {10175#true} #81#return; {10175#true} is VALID [2022-04-28 11:15:05,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {10175#true} call #t~ret6 := main(); {10175#true} is VALID [2022-04-28 11:15:05,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {10175#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; {10175#true} is VALID [2022-04-28 11:15:05,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {10175#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10175#true} is VALID [2022-04-28 11:15:05,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {10175#true} assume !!(#t~post5 < 10);havoc #t~post5; {10175#true} is VALID [2022-04-28 11:15:05,362 INFO L272 TraceCheckUtils]: 8: Hoare triple {10175#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10175#true} is VALID [2022-04-28 11:15:05,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10175#true} {10175#true} #59#return; {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L272 TraceCheckUtils]: 13: Hoare triple {10175#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10175#true} {10175#true} #61#return; {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L272 TraceCheckUtils]: 18: Hoare triple {10175#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10175#true} {10175#true} #63#return; {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L272 TraceCheckUtils]: 23: Hoare triple {10175#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10175#true} {10175#true} #65#return; {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L272 TraceCheckUtils]: 28: Hoare triple {10175#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10175#true} is VALID [2022-04-28 11:15:05,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10175#true} {10175#true} #67#return; {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {10175#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; {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {10175#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {10175#true} assume !!(#t~post5 < 10);havoc #t~post5; {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L272 TraceCheckUtils]: 36: Hoare triple {10175#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L290 TraceCheckUtils]: 37: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L290 TraceCheckUtils]: 38: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10175#true} {10175#true} #59#return; {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L272 TraceCheckUtils]: 41: Hoare triple {10175#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L290 TraceCheckUtils]: 42: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L290 TraceCheckUtils]: 44: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10175#true} {10175#true} #61#return; {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L272 TraceCheckUtils]: 46: Hoare triple {10175#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10175#true} is VALID [2022-04-28 11:15:05,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L290 TraceCheckUtils]: 48: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L290 TraceCheckUtils]: 49: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10175#true} {10175#true} #63#return; {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L272 TraceCheckUtils]: 51: Hoare triple {10175#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L290 TraceCheckUtils]: 52: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L290 TraceCheckUtils]: 53: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L290 TraceCheckUtils]: 54: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10175#true} {10175#true} #65#return; {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L272 TraceCheckUtils]: 56: Hoare triple {10175#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L290 TraceCheckUtils]: 57: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L290 TraceCheckUtils]: 58: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L290 TraceCheckUtils]: 59: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10175#true} {10175#true} #67#return; {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L290 TraceCheckUtils]: 61: Hoare triple {10175#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; {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L290 TraceCheckUtils]: 62: Hoare triple {10175#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L290 TraceCheckUtils]: 63: Hoare triple {10175#true} assume !!(#t~post5 < 10);havoc #t~post5; {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L272 TraceCheckUtils]: 64: Hoare triple {10175#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10175#true} is VALID [2022-04-28 11:15:05,365 INFO L290 TraceCheckUtils]: 65: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L290 TraceCheckUtils]: 66: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L290 TraceCheckUtils]: 67: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10175#true} {10175#true} #59#return; {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L272 TraceCheckUtils]: 69: Hoare triple {10175#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L290 TraceCheckUtils]: 70: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L290 TraceCheckUtils]: 71: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L290 TraceCheckUtils]: 72: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10175#true} {10175#true} #61#return; {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L272 TraceCheckUtils]: 74: Hoare triple {10175#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L290 TraceCheckUtils]: 75: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L290 TraceCheckUtils]: 76: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L290 TraceCheckUtils]: 77: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10175#true} {10175#true} #63#return; {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L272 TraceCheckUtils]: 79: Hoare triple {10175#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L290 TraceCheckUtils]: 80: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L290 TraceCheckUtils]: 81: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L290 TraceCheckUtils]: 82: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {10175#true} {10175#true} #65#return; {10175#true} is VALID [2022-04-28 11:15:05,366 INFO L272 TraceCheckUtils]: 84: Hoare triple {10175#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10175#true} is VALID [2022-04-28 11:15:05,367 INFO L290 TraceCheckUtils]: 85: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,367 INFO L290 TraceCheckUtils]: 86: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,367 INFO L290 TraceCheckUtils]: 87: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,367 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10175#true} {10175#true} #67#return; {10175#true} is VALID [2022-04-28 11:15:05,368 INFO L290 TraceCheckUtils]: 89: Hoare triple {10175#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; {10447#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-28 11:15:05,368 INFO L290 TraceCheckUtils]: 90: Hoare triple {10447#(<= main_~n~0 (+ main_~a~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10447#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-28 11:15:05,368 INFO L290 TraceCheckUtils]: 91: Hoare triple {10447#(<= main_~n~0 (+ main_~a~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {10447#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-28 11:15:05,368 INFO L272 TraceCheckUtils]: 92: Hoare triple {10447#(<= main_~n~0 (+ main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10175#true} is VALID [2022-04-28 11:15:05,369 INFO L290 TraceCheckUtils]: 93: Hoare triple {10175#true} ~cond := #in~cond; {10460#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:05,369 INFO L290 TraceCheckUtils]: 94: Hoare triple {10460#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10464#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:05,369 INFO L290 TraceCheckUtils]: 95: Hoare triple {10464#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10464#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:05,370 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {10464#(not (= |__VERIFIER_assert_#in~cond| 0))} {10447#(<= main_~n~0 (+ main_~a~0 1))} #59#return; {10471#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:15:05,370 INFO L272 TraceCheckUtils]: 97: Hoare triple {10471#(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)); {10175#true} is VALID [2022-04-28 11:15:05,370 INFO L290 TraceCheckUtils]: 98: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,370 INFO L290 TraceCheckUtils]: 99: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,370 INFO L290 TraceCheckUtils]: 100: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,370 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10175#true} {10471#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #61#return; {10471#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:15:05,371 INFO L272 TraceCheckUtils]: 102: Hoare triple {10471#(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)); {10175#true} is VALID [2022-04-28 11:15:05,371 INFO L290 TraceCheckUtils]: 103: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,371 INFO L290 TraceCheckUtils]: 104: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,371 INFO L290 TraceCheckUtils]: 105: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,371 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {10175#true} {10471#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #63#return; {10471#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:15:05,371 INFO L272 TraceCheckUtils]: 107: Hoare triple {10471#(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)); {10175#true} is VALID [2022-04-28 11:15:05,371 INFO L290 TraceCheckUtils]: 108: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,371 INFO L290 TraceCheckUtils]: 109: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,371 INFO L290 TraceCheckUtils]: 110: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,372 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {10175#true} {10471#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #65#return; {10471#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:15:05,372 INFO L272 TraceCheckUtils]: 112: Hoare triple {10471#(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)); {10175#true} is VALID [2022-04-28 11:15:05,372 INFO L290 TraceCheckUtils]: 113: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,372 INFO L290 TraceCheckUtils]: 114: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,372 INFO L290 TraceCheckUtils]: 115: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,372 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {10175#true} {10471#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #67#return; {10471#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:15:05,373 INFO L290 TraceCheckUtils]: 117: Hoare triple {10471#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} assume !(~n~0 <= ~a~0); {10535#(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-28 11:15:05,373 INFO L272 TraceCheckUtils]: 118: Hoare triple {10535#(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)); {10175#true} is VALID [2022-04-28 11:15:05,373 INFO L290 TraceCheckUtils]: 119: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-28 11:15:05,373 INFO L290 TraceCheckUtils]: 120: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-28 11:15:05,374 INFO L290 TraceCheckUtils]: 121: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-28 11:15:05,374 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {10175#true} {10535#(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; {10535#(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-28 11:15:07,376 WARN L272 TraceCheckUtils]: 123: Hoare triple {10535#(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)); {10554#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-28 11:15:07,376 INFO L290 TraceCheckUtils]: 124: Hoare triple {10554#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10558#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:07,377 INFO L290 TraceCheckUtils]: 125: Hoare triple {10558#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10176#false} is VALID [2022-04-28 11:15:07,377 INFO L290 TraceCheckUtils]: 126: Hoare triple {10176#false} assume !false; {10176#false} is VALID [2022-04-28 11:15:07,377 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 110 proven. 16 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2022-04-28 11:15:07,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:09,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:09,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34004793] [2022-04-28 11:15:09,449 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:09,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968363112] [2022-04-28 11:15:09,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968363112] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:15:09,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:15:09,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 11:15:09,450 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:09,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1735898277] [2022-04-28 11:15:09,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1735898277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:09,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:09,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:15:09,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883902390] [2022-04-28 11:15:09,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:09,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 127 [2022-04-28 11:15:09,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:09,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:15:09,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:09,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:15:09,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:09,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:15:09,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=69, Unknown=1, NotChecked=0, Total=90 [2022-04-28 11:15:09,890 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:15:12,281 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 11:15:16,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:15:18,118 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-28 11:15:20,016 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:15:21,718 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:15:26,514 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-28 11:15:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:26,794 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-04-28 11:15:26,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:15:26,794 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 127 [2022-04-28 11:15:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:15:26,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-28 11:15:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:15:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-28 11:15:26,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2022-04-28 11:15:28,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:28,851 INFO L225 Difference]: With dead ends: 112 [2022-04-28 11:15:28,851 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 11:15:28,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2022-04-28 11:15:28,851 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 18 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:28,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 128 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 206 Invalid, 3 Unknown, 0 Unchecked, 11.9s Time] [2022-04-28 11:15:28,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 11:15:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2022-04-28 11:15:28,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:28,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 108 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 65 states have internal predecessors, (66), 28 states have call successors, (28), 17 states have call predecessors, (28), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:15:28,996 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 108 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 65 states have internal predecessors, (66), 28 states have call successors, (28), 17 states have call predecessors, (28), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:15:28,996 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 108 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 65 states have internal predecessors, (66), 28 states have call successors, (28), 17 states have call predecessors, (28), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:15:28,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:28,998 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2022-04-28 11:15:28,998 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2022-04-28 11:15:28,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:28,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:28,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 65 states have internal predecessors, (66), 28 states have call successors, (28), 17 states have call predecessors, (28), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 110 states. [2022-04-28 11:15:28,998 INFO L87 Difference]: Start difference. First operand has 108 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 65 states have internal predecessors, (66), 28 states have call successors, (28), 17 states have call predecessors, (28), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 110 states. [2022-04-28 11:15:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:29,000 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2022-04-28 11:15:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2022-04-28 11:15:29,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:29,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:29,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:29,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 65 states have internal predecessors, (66), 28 states have call successors, (28), 17 states have call predecessors, (28), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:15:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2022-04-28 11:15:29,002 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 127 [2022-04-28 11:15:29,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:29,002 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2022-04-28 11:15:29,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:15:29,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 120 transitions. [2022-04-28 11:15:31,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:31,640 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2022-04-28 11:15:31,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-28 11:15:31,640 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:31,641 INFO L195 NwaCegarLoop]: 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-28 11:15:31,648 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-28 11:15:31,841 WARN L477 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-28 11:15:31,841 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:31,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:31,841 INFO L85 PathProgramCache]: Analyzing trace with hash -167438485, now seen corresponding path program 7 times [2022-04-28 11:15:31,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:31,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1053430404] [2022-04-28 11:15:32,036 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:32,036 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:32,036 INFO L85 PathProgramCache]: Analyzing trace with hash -167438485, now seen corresponding path program 8 times [2022-04-28 11:15:32,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:32,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236834281] [2022-04-28 11:15:32,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:32,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:32,051 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:32,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1233120861] [2022-04-28 11:15:32,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:32,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:32,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:32,052 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-28 11:15:32,053 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-28 11:15:32,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:32,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:32,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 11:15:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:32,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:32,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {11246#true} call ULTIMATE.init(); {11246#true} is VALID [2022-04-28 11:15:32,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {11246#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; {11254#(<= ~counter~0 0)} is VALID [2022-04-28 11:15:32,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {11254#(<= ~counter~0 0)} assume true; {11254#(<= ~counter~0 0)} is VALID [2022-04-28 11:15:32,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11254#(<= ~counter~0 0)} {11246#true} #81#return; {11254#(<= ~counter~0 0)} is VALID [2022-04-28 11:15:32,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {11254#(<= ~counter~0 0)} call #t~ret6 := main(); {11254#(<= ~counter~0 0)} is VALID [2022-04-28 11:15:32,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {11254#(<= ~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; {11254#(<= ~counter~0 0)} is VALID [2022-04-28 11:15:32,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {11254#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {11270#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,542 INFO L272 TraceCheckUtils]: 8: Hoare triple {11270#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {11270#(<= ~counter~0 1)} ~cond := #in~cond; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {11270#(<= ~counter~0 1)} assume !(0 == ~cond); {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {11270#(<= ~counter~0 1)} assume true; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,543 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11270#(<= ~counter~0 1)} {11270#(<= ~counter~0 1)} #59#return; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,543 INFO L272 TraceCheckUtils]: 13: Hoare triple {11270#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {11270#(<= ~counter~0 1)} ~cond := #in~cond; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {11270#(<= ~counter~0 1)} assume !(0 == ~cond); {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {11270#(<= ~counter~0 1)} assume true; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,544 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11270#(<= ~counter~0 1)} {11270#(<= ~counter~0 1)} #61#return; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,545 INFO L272 TraceCheckUtils]: 18: Hoare triple {11270#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {11270#(<= ~counter~0 1)} ~cond := #in~cond; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {11270#(<= ~counter~0 1)} assume !(0 == ~cond); {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {11270#(<= ~counter~0 1)} assume true; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,546 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11270#(<= ~counter~0 1)} {11270#(<= ~counter~0 1)} #63#return; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,546 INFO L272 TraceCheckUtils]: 23: Hoare triple {11270#(<= ~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)); {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {11270#(<= ~counter~0 1)} ~cond := #in~cond; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {11270#(<= ~counter~0 1)} assume !(0 == ~cond); {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {11270#(<= ~counter~0 1)} assume true; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,548 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11270#(<= ~counter~0 1)} {11270#(<= ~counter~0 1)} #65#return; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,548 INFO L272 TraceCheckUtils]: 28: Hoare triple {11270#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {11270#(<= ~counter~0 1)} ~cond := #in~cond; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {11270#(<= ~counter~0 1)} assume !(0 == ~cond); {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {11270#(<= ~counter~0 1)} assume true; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,549 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11270#(<= ~counter~0 1)} {11270#(<= ~counter~0 1)} #67#return; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {11270#(<= ~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; {11270#(<= ~counter~0 1)} is VALID [2022-04-28 11:15:32,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {11270#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {11355#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,552 INFO L272 TraceCheckUtils]: 36: Hoare triple {11355#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,553 INFO L290 TraceCheckUtils]: 37: Hoare triple {11355#(<= ~counter~0 2)} ~cond := #in~cond; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {11355#(<= ~counter~0 2)} assume !(0 == ~cond); {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {11355#(<= ~counter~0 2)} assume true; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,553 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11355#(<= ~counter~0 2)} {11355#(<= ~counter~0 2)} #59#return; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,554 INFO L272 TraceCheckUtils]: 41: Hoare triple {11355#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,554 INFO L290 TraceCheckUtils]: 42: Hoare triple {11355#(<= ~counter~0 2)} ~cond := #in~cond; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,555 INFO L290 TraceCheckUtils]: 43: Hoare triple {11355#(<= ~counter~0 2)} assume !(0 == ~cond); {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,555 INFO L290 TraceCheckUtils]: 44: Hoare triple {11355#(<= ~counter~0 2)} assume true; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,556 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11355#(<= ~counter~0 2)} {11355#(<= ~counter~0 2)} #61#return; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,556 INFO L272 TraceCheckUtils]: 46: Hoare triple {11355#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,556 INFO L290 TraceCheckUtils]: 47: Hoare triple {11355#(<= ~counter~0 2)} ~cond := #in~cond; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,557 INFO L290 TraceCheckUtils]: 48: Hoare triple {11355#(<= ~counter~0 2)} assume !(0 == ~cond); {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,557 INFO L290 TraceCheckUtils]: 49: Hoare triple {11355#(<= ~counter~0 2)} assume true; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,557 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11355#(<= ~counter~0 2)} {11355#(<= ~counter~0 2)} #63#return; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,558 INFO L272 TraceCheckUtils]: 51: Hoare triple {11355#(<= ~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)); {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,558 INFO L290 TraceCheckUtils]: 52: Hoare triple {11355#(<= ~counter~0 2)} ~cond := #in~cond; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,558 INFO L290 TraceCheckUtils]: 53: Hoare triple {11355#(<= ~counter~0 2)} assume !(0 == ~cond); {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,559 INFO L290 TraceCheckUtils]: 54: Hoare triple {11355#(<= ~counter~0 2)} assume true; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,559 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11355#(<= ~counter~0 2)} {11355#(<= ~counter~0 2)} #65#return; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,559 INFO L272 TraceCheckUtils]: 56: Hoare triple {11355#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,560 INFO L290 TraceCheckUtils]: 57: Hoare triple {11355#(<= ~counter~0 2)} ~cond := #in~cond; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,560 INFO L290 TraceCheckUtils]: 58: Hoare triple {11355#(<= ~counter~0 2)} assume !(0 == ~cond); {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,560 INFO L290 TraceCheckUtils]: 59: Hoare triple {11355#(<= ~counter~0 2)} assume true; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,561 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11355#(<= ~counter~0 2)} {11355#(<= ~counter~0 2)} #67#return; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,561 INFO L290 TraceCheckUtils]: 61: Hoare triple {11355#(<= ~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; {11355#(<= ~counter~0 2)} is VALID [2022-04-28 11:15:32,561 INFO L290 TraceCheckUtils]: 62: Hoare triple {11355#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,562 INFO L290 TraceCheckUtils]: 63: Hoare triple {11440#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,562 INFO L272 TraceCheckUtils]: 64: Hoare triple {11440#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,562 INFO L290 TraceCheckUtils]: 65: Hoare triple {11440#(<= ~counter~0 3)} ~cond := #in~cond; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,563 INFO L290 TraceCheckUtils]: 66: Hoare triple {11440#(<= ~counter~0 3)} assume !(0 == ~cond); {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,563 INFO L290 TraceCheckUtils]: 67: Hoare triple {11440#(<= ~counter~0 3)} assume true; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,563 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11440#(<= ~counter~0 3)} {11440#(<= ~counter~0 3)} #59#return; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,564 INFO L272 TraceCheckUtils]: 69: Hoare triple {11440#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,564 INFO L290 TraceCheckUtils]: 70: Hoare triple {11440#(<= ~counter~0 3)} ~cond := #in~cond; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,564 INFO L290 TraceCheckUtils]: 71: Hoare triple {11440#(<= ~counter~0 3)} assume !(0 == ~cond); {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,565 INFO L290 TraceCheckUtils]: 72: Hoare triple {11440#(<= ~counter~0 3)} assume true; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,565 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11440#(<= ~counter~0 3)} {11440#(<= ~counter~0 3)} #61#return; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,565 INFO L272 TraceCheckUtils]: 74: Hoare triple {11440#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,566 INFO L290 TraceCheckUtils]: 75: Hoare triple {11440#(<= ~counter~0 3)} ~cond := #in~cond; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,566 INFO L290 TraceCheckUtils]: 76: Hoare triple {11440#(<= ~counter~0 3)} assume !(0 == ~cond); {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,566 INFO L290 TraceCheckUtils]: 77: Hoare triple {11440#(<= ~counter~0 3)} assume true; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,567 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {11440#(<= ~counter~0 3)} {11440#(<= ~counter~0 3)} #63#return; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,567 INFO L272 TraceCheckUtils]: 79: Hoare triple {11440#(<= ~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)); {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,567 INFO L290 TraceCheckUtils]: 80: Hoare triple {11440#(<= ~counter~0 3)} ~cond := #in~cond; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,568 INFO L290 TraceCheckUtils]: 81: Hoare triple {11440#(<= ~counter~0 3)} assume !(0 == ~cond); {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,568 INFO L290 TraceCheckUtils]: 82: Hoare triple {11440#(<= ~counter~0 3)} assume true; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,568 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {11440#(<= ~counter~0 3)} {11440#(<= ~counter~0 3)} #65#return; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,569 INFO L272 TraceCheckUtils]: 84: Hoare triple {11440#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,569 INFO L290 TraceCheckUtils]: 85: Hoare triple {11440#(<= ~counter~0 3)} ~cond := #in~cond; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,569 INFO L290 TraceCheckUtils]: 86: Hoare triple {11440#(<= ~counter~0 3)} assume !(0 == ~cond); {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,569 INFO L290 TraceCheckUtils]: 87: Hoare triple {11440#(<= ~counter~0 3)} assume true; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,570 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11440#(<= ~counter~0 3)} {11440#(<= ~counter~0 3)} #67#return; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,570 INFO L290 TraceCheckUtils]: 89: Hoare triple {11440#(<= ~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; {11440#(<= ~counter~0 3)} is VALID [2022-04-28 11:15:32,571 INFO L290 TraceCheckUtils]: 90: Hoare triple {11440#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,571 INFO L290 TraceCheckUtils]: 91: Hoare triple {11525#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,571 INFO L272 TraceCheckUtils]: 92: Hoare triple {11525#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,572 INFO L290 TraceCheckUtils]: 93: Hoare triple {11525#(<= ~counter~0 4)} ~cond := #in~cond; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,572 INFO L290 TraceCheckUtils]: 94: Hoare triple {11525#(<= ~counter~0 4)} assume !(0 == ~cond); {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,572 INFO L290 TraceCheckUtils]: 95: Hoare triple {11525#(<= ~counter~0 4)} assume true; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,572 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {11525#(<= ~counter~0 4)} {11525#(<= ~counter~0 4)} #59#return; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,573 INFO L272 TraceCheckUtils]: 97: Hoare triple {11525#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,573 INFO L290 TraceCheckUtils]: 98: Hoare triple {11525#(<= ~counter~0 4)} ~cond := #in~cond; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,573 INFO L290 TraceCheckUtils]: 99: Hoare triple {11525#(<= ~counter~0 4)} assume !(0 == ~cond); {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,574 INFO L290 TraceCheckUtils]: 100: Hoare triple {11525#(<= ~counter~0 4)} assume true; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,574 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11525#(<= ~counter~0 4)} {11525#(<= ~counter~0 4)} #61#return; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,574 INFO L272 TraceCheckUtils]: 102: Hoare triple {11525#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,575 INFO L290 TraceCheckUtils]: 103: Hoare triple {11525#(<= ~counter~0 4)} ~cond := #in~cond; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,575 INFO L290 TraceCheckUtils]: 104: Hoare triple {11525#(<= ~counter~0 4)} assume !(0 == ~cond); {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,575 INFO L290 TraceCheckUtils]: 105: Hoare triple {11525#(<= ~counter~0 4)} assume true; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,575 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {11525#(<= ~counter~0 4)} {11525#(<= ~counter~0 4)} #63#return; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,576 INFO L272 TraceCheckUtils]: 107: Hoare triple {11525#(<= ~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)); {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,576 INFO L290 TraceCheckUtils]: 108: Hoare triple {11525#(<= ~counter~0 4)} ~cond := #in~cond; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,576 INFO L290 TraceCheckUtils]: 109: Hoare triple {11525#(<= ~counter~0 4)} assume !(0 == ~cond); {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,577 INFO L290 TraceCheckUtils]: 110: Hoare triple {11525#(<= ~counter~0 4)} assume true; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,577 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {11525#(<= ~counter~0 4)} {11525#(<= ~counter~0 4)} #65#return; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,577 INFO L272 TraceCheckUtils]: 112: Hoare triple {11525#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,578 INFO L290 TraceCheckUtils]: 113: Hoare triple {11525#(<= ~counter~0 4)} ~cond := #in~cond; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,578 INFO L290 TraceCheckUtils]: 114: Hoare triple {11525#(<= ~counter~0 4)} assume !(0 == ~cond); {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,578 INFO L290 TraceCheckUtils]: 115: Hoare triple {11525#(<= ~counter~0 4)} assume true; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,578 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11525#(<= ~counter~0 4)} {11525#(<= ~counter~0 4)} #67#return; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,579 INFO L290 TraceCheckUtils]: 117: Hoare triple {11525#(<= ~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; {11525#(<= ~counter~0 4)} is VALID [2022-04-28 11:15:32,579 INFO L290 TraceCheckUtils]: 118: Hoare triple {11525#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11610#(<= |main_#t~post5| 4)} is VALID [2022-04-28 11:15:32,579 INFO L290 TraceCheckUtils]: 119: Hoare triple {11610#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {11247#false} is VALID [2022-04-28 11:15:32,579 INFO L272 TraceCheckUtils]: 120: Hoare triple {11247#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11247#false} is VALID [2022-04-28 11:15:32,579 INFO L290 TraceCheckUtils]: 121: Hoare triple {11247#false} ~cond := #in~cond; {11247#false} is VALID [2022-04-28 11:15:32,579 INFO L290 TraceCheckUtils]: 122: Hoare triple {11247#false} assume !(0 == ~cond); {11247#false} is VALID [2022-04-28 11:15:32,580 INFO L290 TraceCheckUtils]: 123: Hoare triple {11247#false} assume true; {11247#false} is VALID [2022-04-28 11:15:32,580 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {11247#false} {11247#false} #69#return; {11247#false} is VALID [2022-04-28 11:15:32,580 INFO L272 TraceCheckUtils]: 125: Hoare triple {11247#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {11247#false} is VALID [2022-04-28 11:15:32,580 INFO L290 TraceCheckUtils]: 126: Hoare triple {11247#false} ~cond := #in~cond; {11247#false} is VALID [2022-04-28 11:15:32,580 INFO L290 TraceCheckUtils]: 127: Hoare triple {11247#false} assume 0 == ~cond; {11247#false} is VALID [2022-04-28 11:15:32,580 INFO L290 TraceCheckUtils]: 128: Hoare triple {11247#false} assume !false; {11247#false} is VALID [2022-04-28 11:15:32,580 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-28 11:15:32,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:32,984 INFO L290 TraceCheckUtils]: 128: Hoare triple {11247#false} assume !false; {11247#false} is VALID [2022-04-28 11:15:32,984 INFO L290 TraceCheckUtils]: 127: Hoare triple {11247#false} assume 0 == ~cond; {11247#false} is VALID [2022-04-28 11:15:32,984 INFO L290 TraceCheckUtils]: 126: Hoare triple {11247#false} ~cond := #in~cond; {11247#false} is VALID [2022-04-28 11:15:32,984 INFO L272 TraceCheckUtils]: 125: Hoare triple {11247#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {11247#false} is VALID [2022-04-28 11:15:32,984 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {11246#true} {11247#false} #69#return; {11247#false} is VALID [2022-04-28 11:15:32,984 INFO L290 TraceCheckUtils]: 123: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,984 INFO L290 TraceCheckUtils]: 122: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,984 INFO L290 TraceCheckUtils]: 121: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,984 INFO L272 TraceCheckUtils]: 120: Hoare triple {11247#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:32,984 INFO L290 TraceCheckUtils]: 119: Hoare triple {11668#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {11247#false} is VALID [2022-04-28 11:15:32,985 INFO L290 TraceCheckUtils]: 118: Hoare triple {11672#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11668#(< |main_#t~post5| 10)} is VALID [2022-04-28 11:15:32,985 INFO L290 TraceCheckUtils]: 117: Hoare triple {11672#(< ~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; {11672#(< ~counter~0 10)} is VALID [2022-04-28 11:15:32,985 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11246#true} {11672#(< ~counter~0 10)} #67#return; {11672#(< ~counter~0 10)} is VALID [2022-04-28 11:15:32,985 INFO L290 TraceCheckUtils]: 115: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,986 INFO L290 TraceCheckUtils]: 114: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,986 INFO L290 TraceCheckUtils]: 113: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,986 INFO L272 TraceCheckUtils]: 112: Hoare triple {11672#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:32,986 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {11246#true} {11672#(< ~counter~0 10)} #65#return; {11672#(< ~counter~0 10)} is VALID [2022-04-28 11:15:32,986 INFO L290 TraceCheckUtils]: 110: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,986 INFO L290 TraceCheckUtils]: 109: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,986 INFO L290 TraceCheckUtils]: 108: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,986 INFO L272 TraceCheckUtils]: 107: Hoare triple {11672#(< ~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)); {11246#true} is VALID [2022-04-28 11:15:32,987 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {11246#true} {11672#(< ~counter~0 10)} #63#return; {11672#(< ~counter~0 10)} is VALID [2022-04-28 11:15:32,987 INFO L290 TraceCheckUtils]: 105: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,987 INFO L290 TraceCheckUtils]: 104: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,987 INFO L290 TraceCheckUtils]: 103: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,987 INFO L272 TraceCheckUtils]: 102: Hoare triple {11672#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:32,987 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11246#true} {11672#(< ~counter~0 10)} #61#return; {11672#(< ~counter~0 10)} is VALID [2022-04-28 11:15:32,987 INFO L290 TraceCheckUtils]: 100: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,987 INFO L290 TraceCheckUtils]: 99: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,987 INFO L290 TraceCheckUtils]: 98: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,987 INFO L272 TraceCheckUtils]: 97: Hoare triple {11672#(< ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:32,988 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {11246#true} {11672#(< ~counter~0 10)} #59#return; {11672#(< ~counter~0 10)} is VALID [2022-04-28 11:15:32,988 INFO L290 TraceCheckUtils]: 95: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,988 INFO L290 TraceCheckUtils]: 94: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,988 INFO L290 TraceCheckUtils]: 93: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,988 INFO L272 TraceCheckUtils]: 92: Hoare triple {11672#(< ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:32,988 INFO L290 TraceCheckUtils]: 91: Hoare triple {11672#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {11672#(< ~counter~0 10)} is VALID [2022-04-28 11:15:32,989 INFO L290 TraceCheckUtils]: 90: Hoare triple {11757#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11672#(< ~counter~0 10)} is VALID [2022-04-28 11:15:32,989 INFO L290 TraceCheckUtils]: 89: Hoare triple {11757#(< ~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; {11757#(< ~counter~0 9)} is VALID [2022-04-28 11:15:32,989 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11246#true} {11757#(< ~counter~0 9)} #67#return; {11757#(< ~counter~0 9)} is VALID [2022-04-28 11:15:32,990 INFO L290 TraceCheckUtils]: 87: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,990 INFO L290 TraceCheckUtils]: 86: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,990 INFO L290 TraceCheckUtils]: 85: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,990 INFO L272 TraceCheckUtils]: 84: Hoare triple {11757#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:32,990 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {11246#true} {11757#(< ~counter~0 9)} #65#return; {11757#(< ~counter~0 9)} is VALID [2022-04-28 11:15:32,990 INFO L290 TraceCheckUtils]: 82: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,990 INFO L290 TraceCheckUtils]: 81: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,990 INFO L290 TraceCheckUtils]: 80: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,990 INFO L272 TraceCheckUtils]: 79: Hoare triple {11757#(< ~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)); {11246#true} is VALID [2022-04-28 11:15:32,991 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {11246#true} {11757#(< ~counter~0 9)} #63#return; {11757#(< ~counter~0 9)} is VALID [2022-04-28 11:15:32,991 INFO L290 TraceCheckUtils]: 77: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,991 INFO L290 TraceCheckUtils]: 76: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,991 INFO L290 TraceCheckUtils]: 75: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,991 INFO L272 TraceCheckUtils]: 74: Hoare triple {11757#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:32,991 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11246#true} {11757#(< ~counter~0 9)} #61#return; {11757#(< ~counter~0 9)} is VALID [2022-04-28 11:15:32,991 INFO L290 TraceCheckUtils]: 72: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,991 INFO L290 TraceCheckUtils]: 71: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,991 INFO L290 TraceCheckUtils]: 70: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,991 INFO L272 TraceCheckUtils]: 69: Hoare triple {11757#(< ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:32,992 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11246#true} {11757#(< ~counter~0 9)} #59#return; {11757#(< ~counter~0 9)} is VALID [2022-04-28 11:15:32,992 INFO L290 TraceCheckUtils]: 67: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,992 INFO L290 TraceCheckUtils]: 66: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,992 INFO L290 TraceCheckUtils]: 65: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,992 INFO L272 TraceCheckUtils]: 64: Hoare triple {11757#(< ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:32,992 INFO L290 TraceCheckUtils]: 63: Hoare triple {11757#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {11757#(< ~counter~0 9)} is VALID [2022-04-28 11:15:32,993 INFO L290 TraceCheckUtils]: 62: Hoare triple {11842#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11757#(< ~counter~0 9)} is VALID [2022-04-28 11:15:32,993 INFO L290 TraceCheckUtils]: 61: Hoare triple {11842#(< ~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; {11842#(< ~counter~0 8)} is VALID [2022-04-28 11:15:32,993 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11246#true} {11842#(< ~counter~0 8)} #67#return; {11842#(< ~counter~0 8)} is VALID [2022-04-28 11:15:32,993 INFO L290 TraceCheckUtils]: 59: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,993 INFO L290 TraceCheckUtils]: 58: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,993 INFO L290 TraceCheckUtils]: 57: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,993 INFO L272 TraceCheckUtils]: 56: Hoare triple {11842#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:32,994 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11246#true} {11842#(< ~counter~0 8)} #65#return; {11842#(< ~counter~0 8)} is VALID [2022-04-28 11:15:32,994 INFO L290 TraceCheckUtils]: 54: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,994 INFO L290 TraceCheckUtils]: 53: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,994 INFO L290 TraceCheckUtils]: 52: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,994 INFO L272 TraceCheckUtils]: 51: Hoare triple {11842#(< ~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)); {11246#true} is VALID [2022-04-28 11:15:32,994 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11246#true} {11842#(< ~counter~0 8)} #63#return; {11842#(< ~counter~0 8)} is VALID [2022-04-28 11:15:32,995 INFO L290 TraceCheckUtils]: 49: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,995 INFO L290 TraceCheckUtils]: 47: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,995 INFO L272 TraceCheckUtils]: 46: Hoare triple {11842#(< ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:32,995 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11246#true} {11842#(< ~counter~0 8)} #61#return; {11842#(< ~counter~0 8)} is VALID [2022-04-28 11:15:32,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,995 INFO L290 TraceCheckUtils]: 42: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,995 INFO L272 TraceCheckUtils]: 41: Hoare triple {11842#(< ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:32,996 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11246#true} {11842#(< ~counter~0 8)} #59#return; {11842#(< ~counter~0 8)} is VALID [2022-04-28 11:15:32,996 INFO L290 TraceCheckUtils]: 39: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,996 INFO L290 TraceCheckUtils]: 38: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,996 INFO L272 TraceCheckUtils]: 36: Hoare triple {11842#(< ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:32,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {11842#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {11842#(< ~counter~0 8)} is VALID [2022-04-28 11:15:32,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {11927#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11842#(< ~counter~0 8)} is VALID [2022-04-28 11:15:32,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {11927#(< ~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; {11927#(< ~counter~0 7)} is VALID [2022-04-28 11:15:32,997 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11246#true} {11927#(< ~counter~0 7)} #67#return; {11927#(< ~counter~0 7)} is VALID [2022-04-28 11:15:32,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,997 INFO L272 TraceCheckUtils]: 28: Hoare triple {11927#(< ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:32,998 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11246#true} {11927#(< ~counter~0 7)} #65#return; {11927#(< ~counter~0 7)} is VALID [2022-04-28 11:15:32,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,998 INFO L272 TraceCheckUtils]: 23: Hoare triple {11927#(< ~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)); {11246#true} is VALID [2022-04-28 11:15:32,998 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11246#true} {11927#(< ~counter~0 7)} #63#return; {11927#(< ~counter~0 7)} is VALID [2022-04-28 11:15:32,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,999 INFO L272 TraceCheckUtils]: 18: Hoare triple {11927#(< ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:32,999 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11246#true} {11927#(< ~counter~0 7)} #61#return; {11927#(< ~counter~0 7)} is VALID [2022-04-28 11:15:32,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:32,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:32,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:32,999 INFO L272 TraceCheckUtils]: 13: Hoare triple {11927#(< ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:33,000 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11246#true} {11927#(< ~counter~0 7)} #59#return; {11927#(< ~counter~0 7)} is VALID [2022-04-28 11:15:33,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {11246#true} assume true; {11246#true} is VALID [2022-04-28 11:15:33,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {11246#true} assume !(0 == ~cond); {11246#true} is VALID [2022-04-28 11:15:33,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {11246#true} ~cond := #in~cond; {11246#true} is VALID [2022-04-28 11:15:33,000 INFO L272 TraceCheckUtils]: 8: Hoare triple {11927#(< ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11246#true} is VALID [2022-04-28 11:15:33,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {11927#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {11927#(< ~counter~0 7)} is VALID [2022-04-28 11:15:33,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {12012#(< ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11927#(< ~counter~0 7)} is VALID [2022-04-28 11:15:33,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {12012#(< ~counter~0 6)} 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; {12012#(< ~counter~0 6)} is VALID [2022-04-28 11:15:33,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {12012#(< ~counter~0 6)} call #t~ret6 := main(); {12012#(< ~counter~0 6)} is VALID [2022-04-28 11:15:33,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12012#(< ~counter~0 6)} {11246#true} #81#return; {12012#(< ~counter~0 6)} is VALID [2022-04-28 11:15:33,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {12012#(< ~counter~0 6)} assume true; {12012#(< ~counter~0 6)} is VALID [2022-04-28 11:15:33,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {11246#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; {12012#(< ~counter~0 6)} is VALID [2022-04-28 11:15:33,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {11246#true} call ULTIMATE.init(); {11246#true} is VALID [2022-04-28 11:15:33,002 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-28 11:15:33,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:33,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236834281] [2022-04-28 11:15:33,003 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:33,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233120861] [2022-04-28 11:15:33,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233120861] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:33,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:33,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 11:15:33,003 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:33,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1053430404] [2022-04-28 11:15:33,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1053430404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:33,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:33,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:15:33,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846223424] [2022-04-28 11:15:33,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:33,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 7 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 129 [2022-04-28 11:15:33,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:33,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 7 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-28 11:15:33,058 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-28 11:15:33,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:15:33,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:33,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:15:33,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:15:33,059 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 7 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-28 11:15:33,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:33,811 INFO L93 Difference]: Finished difference Result 152 states and 171 transitions. [2022-04-28 11:15:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:15:33,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 7 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 129 [2022-04-28 11:15:33,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:33,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 7 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-28 11:15:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2022-04-28 11:15:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 7 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-28 11:15:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2022-04-28 11:15:33,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 122 transitions. [2022-04-28 11:15:33,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:33,917 INFO L225 Difference]: With dead ends: 152 [2022-04-28 11:15:33,917 INFO L226 Difference]: Without dead ends: 138 [2022-04-28 11:15:33,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:15:33,918 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 16 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:33,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 162 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:15:33,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-28 11:15:34,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-04-28 11:15:34,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:34,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 136 states, 78 states have (on average 1.064102564102564) internal successors, (83), 81 states have internal predecessors, (83), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 11:15:34,073 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 136 states, 78 states have (on average 1.064102564102564) internal successors, (83), 81 states have internal predecessors, (83), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 11:15:34,073 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 136 states, 78 states have (on average 1.064102564102564) internal successors, (83), 81 states have internal predecessors, (83), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 11:15:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:34,075 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2022-04-28 11:15:34,075 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2022-04-28 11:15:34,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:34,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:34,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 78 states have (on average 1.064102564102564) internal successors, (83), 81 states have internal predecessors, (83), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand 138 states. [2022-04-28 11:15:34,076 INFO L87 Difference]: Start difference. First operand has 136 states, 78 states have (on average 1.064102564102564) internal successors, (83), 81 states have internal predecessors, (83), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand 138 states. [2022-04-28 11:15:34,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:34,077 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2022-04-28 11:15:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2022-04-28 11:15:34,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:34,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:34,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:34,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:34,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 78 states have (on average 1.064102564102564) internal successors, (83), 81 states have internal predecessors, (83), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 11:15:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2022-04-28 11:15:34,080 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 129 [2022-04-28 11:15:34,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:34,080 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2022-04-28 11:15:34,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 7 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-28 11:15:34,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 154 transitions. [2022-04-28 11:15:40,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 152 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2022-04-28 11:15:40,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 11:15:40,640 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:40,640 INFO L195 NwaCegarLoop]: 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-28 11:15:40,656 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-28 11:15:40,840 WARN L477 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-28 11:15:40,840 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:40,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:40,841 INFO L85 PathProgramCache]: Analyzing trace with hash 173938976, now seen corresponding path program 3 times [2022-04-28 11:15:40,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:40,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [5168169] [2022-04-28 11:15:41,092 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:41,092 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:41,092 INFO L85 PathProgramCache]: Analyzing trace with hash 173938976, now seen corresponding path program 4 times [2022-04-28 11:15:41,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:41,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254558846] [2022-04-28 11:15:41,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:41,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:41,103 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:41,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [25765941] [2022-04-28 11:15:41,103 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:15:41,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:41,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:41,104 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-28 11:15:41,105 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-28 11:15:42,415 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:15:42,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:42,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-28 11:15:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:42,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:16:17,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {12893#true} call ULTIMATE.init(); {12893#true} is VALID [2022-04-28 11:16:17,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {12893#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; {12893#true} is VALID [2022-04-28 11:16:17,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:17,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12893#true} {12893#true} #81#return; {12893#true} is VALID [2022-04-28 11:16:17,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {12893#true} call #t~ret6 := main(); {12893#true} is VALID [2022-04-28 11:16:17,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {12893#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; {12893#true} is VALID [2022-04-28 11:16:17,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {12893#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12893#true} is VALID [2022-04-28 11:16:17,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {12893#true} assume !!(#t~post5 < 10);havoc #t~post5; {12893#true} is VALID [2022-04-28 11:16:17,213 INFO L272 TraceCheckUtils]: 8: Hoare triple {12893#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:17,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:17,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:17,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:17,213 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12893#true} {12893#true} #59#return; {12893#true} is VALID [2022-04-28 11:16:17,213 INFO L272 TraceCheckUtils]: 13: Hoare triple {12893#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:17,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {12893#true} ~cond := #in~cond; {12940#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:17,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {12940#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:17,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:17,215 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} {12893#true} #61#return; {12951#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:16:17,215 INFO L272 TraceCheckUtils]: 18: Hoare triple {12951#(= (+ (* 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)); {12893#true} is VALID [2022-04-28 11:16:17,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {12893#true} ~cond := #in~cond; {12940#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:17,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {12940#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:17,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:17,216 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} {12951#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {12967#(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-28 11:16:17,216 INFO L272 TraceCheckUtils]: 23: Hoare triple {12967#(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)); {12893#true} is VALID [2022-04-28 11:16:17,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:17,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:17,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:17,217 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12893#true} {12967#(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; {12967#(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-28 11:16:17,217 INFO L272 TraceCheckUtils]: 28: Hoare triple {12967#(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)); {12893#true} is VALID [2022-04-28 11:16:17,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:17,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:17,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:17,217 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12893#true} {12967#(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; {12967#(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-28 11:16:17,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {12967#(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; {13001#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-28 11:16:17,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {13001#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ 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; {13001#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-28 11:16:17,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {13001#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} assume !!(#t~post5 < 10);havoc #t~post5; {13001#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-28 11:16:17,223 INFO L272 TraceCheckUtils]: 36: Hoare triple {13001#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~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)); {12893#true} is VALID [2022-04-28 11:16:17,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:17,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:17,224 INFO L290 TraceCheckUtils]: 39: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:17,224 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12893#true} {13001#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} #59#return; {13001#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-28 11:16:17,224 INFO L272 TraceCheckUtils]: 41: Hoare triple {13001#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ 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)); {12893#true} is VALID [2022-04-28 11:16:17,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {12893#true} ~cond := #in~cond; {12940#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:17,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {12940#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:17,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:17,225 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} {13001#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} #61#return; {13038#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ 5 main_~y~0 (* main_~n~0 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))} is VALID [2022-04-28 11:16:17,226 INFO L272 TraceCheckUtils]: 46: Hoare triple {13038#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ 5 main_~y~0 (* main_~n~0 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))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:17,226 INFO L290 TraceCheckUtils]: 47: Hoare triple {12893#true} ~cond := #in~cond; {12940#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:17,226 INFO L290 TraceCheckUtils]: 48: Hoare triple {12940#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:17,226 INFO L290 TraceCheckUtils]: 49: Hoare triple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:17,227 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} {13038#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ 5 main_~y~0 (* main_~n~0 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))} #63#return; {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:16:17,227 INFO L272 TraceCheckUtils]: 51: Hoare triple {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) 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)); {12893#true} is VALID [2022-04-28 11:16:17,227 INFO L290 TraceCheckUtils]: 52: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:17,227 INFO L290 TraceCheckUtils]: 53: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:17,227 INFO L290 TraceCheckUtils]: 54: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:17,228 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12893#true} {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #65#return; {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:16:17,228 INFO L272 TraceCheckUtils]: 56: Hoare triple {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:17,228 INFO L290 TraceCheckUtils]: 57: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:17,228 INFO L290 TraceCheckUtils]: 58: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:17,228 INFO L290 TraceCheckUtils]: 59: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:17,228 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12893#true} {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #67#return; {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:16:17,236 INFO L290 TraceCheckUtils]: 61: Hoare triple {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) 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; {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:16:17,237 INFO L290 TraceCheckUtils]: 62: Hoare triple {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:16:17,237 INFO L290 TraceCheckUtils]: 63: Hoare triple {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:16:17,237 INFO L272 TraceCheckUtils]: 64: Hoare triple {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 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)); {12893#true} is VALID [2022-04-28 11:16:17,237 INFO L290 TraceCheckUtils]: 65: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:17,237 INFO L290 TraceCheckUtils]: 66: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:17,237 INFO L290 TraceCheckUtils]: 67: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:17,238 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12893#true} {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #59#return; {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:16:17,238 INFO L272 TraceCheckUtils]: 69: Hoare triple {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 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)); {12893#true} is VALID [2022-04-28 11:16:17,238 INFO L290 TraceCheckUtils]: 70: Hoare triple {12893#true} ~cond := #in~cond; {12940#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:17,238 INFO L290 TraceCheckUtils]: 71: Hoare triple {12940#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:17,239 INFO L290 TraceCheckUtils]: 72: Hoare triple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:17,239 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #61#return; {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:16:17,239 INFO L272 TraceCheckUtils]: 74: Hoare triple {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 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)); {12893#true} is VALID [2022-04-28 11:16:17,239 INFO L290 TraceCheckUtils]: 75: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:17,239 INFO L290 TraceCheckUtils]: 76: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:17,239 INFO L290 TraceCheckUtils]: 77: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:17,240 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {12893#true} {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #63#return; {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:16:17,240 INFO L272 TraceCheckUtils]: 79: Hoare triple {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) 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)); {12893#true} is VALID [2022-04-28 11:16:17,240 INFO L290 TraceCheckUtils]: 80: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:17,240 INFO L290 TraceCheckUtils]: 81: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:17,240 INFO L290 TraceCheckUtils]: 82: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:17,240 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {12893#true} {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #65#return; {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:16:17,240 INFO L272 TraceCheckUtils]: 84: Hoare triple {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:17,241 INFO L290 TraceCheckUtils]: 85: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:17,241 INFO L290 TraceCheckUtils]: 86: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:17,241 INFO L290 TraceCheckUtils]: 87: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:17,244 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12893#true} {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #67#return; {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:16:17,247 INFO L290 TraceCheckUtils]: 89: Hoare triple {13054#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) 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; {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-28 11:16:17,248 INFO L290 TraceCheckUtils]: 90: Hoare triple {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-28 11:16:17,248 INFO L290 TraceCheckUtils]: 91: Hoare triple {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} assume !!(#t~post5 < 10);havoc #t~post5; {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-28 11:16:17,248 INFO L272 TraceCheckUtils]: 92: Hoare triple {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:17,248 INFO L290 TraceCheckUtils]: 93: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:17,248 INFO L290 TraceCheckUtils]: 94: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:17,248 INFO L290 TraceCheckUtils]: 95: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:17,249 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {12893#true} {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #59#return; {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-28 11:16:17,249 INFO L272 TraceCheckUtils]: 97: Hoare triple {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:17,249 INFO L290 TraceCheckUtils]: 98: Hoare triple {12893#true} ~cond := #in~cond; {12940#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:17,249 INFO L290 TraceCheckUtils]: 99: Hoare triple {12940#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:17,250 INFO L290 TraceCheckUtils]: 100: Hoare triple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:17,250 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #61#return; {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-28 11:16:17,250 INFO L272 TraceCheckUtils]: 102: Hoare triple {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:17,250 INFO L290 TraceCheckUtils]: 103: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:17,250 INFO L290 TraceCheckUtils]: 104: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:17,250 INFO L290 TraceCheckUtils]: 105: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:17,251 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {12893#true} {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #63#return; {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-28 11:16:17,251 INFO L272 TraceCheckUtils]: 107: Hoare triple {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:17,251 INFO L290 TraceCheckUtils]: 108: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:17,251 INFO L290 TraceCheckUtils]: 109: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:17,251 INFO L290 TraceCheckUtils]: 110: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:17,251 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {12893#true} {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #65#return; {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-28 11:16:17,252 INFO L272 TraceCheckUtils]: 112: Hoare triple {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:17,252 INFO L290 TraceCheckUtils]: 113: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:17,252 INFO L290 TraceCheckUtils]: 114: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:17,252 INFO L290 TraceCheckUtils]: 115: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:17,252 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {12893#true} {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #67#return; {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-28 11:16:17,253 INFO L290 TraceCheckUtils]: 117: Hoare triple {13172#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} assume !(~n~0 <= ~a~0); {13257#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (not (<= main_~n~0 main_~a~0)) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-28 11:16:17,253 INFO L272 TraceCheckUtils]: 118: Hoare triple {13257#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (not (<= main_~n~0 main_~a~0)) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:17,253 INFO L290 TraceCheckUtils]: 119: Hoare triple {12893#true} ~cond := #in~cond; {12940#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:17,253 INFO L290 TraceCheckUtils]: 120: Hoare triple {12940#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:17,253 INFO L290 TraceCheckUtils]: 121: Hoare triple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:17,614 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} {13257#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6))) (not (<= main_~n~0 main_~a~0)) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #69#return; {13273#(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)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:16:17,614 INFO L272 TraceCheckUtils]: 123: Hoare triple {13273#(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)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (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)); {12893#true} is VALID [2022-04-28 11:16:17,614 INFO L290 TraceCheckUtils]: 124: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:17,614 INFO L290 TraceCheckUtils]: 125: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:17,614 INFO L290 TraceCheckUtils]: 126: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:17,614 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {12893#true} {13273#(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)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} #71#return; {13273#(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)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:16:18,135 INFO L272 TraceCheckUtils]: 128: Hoare triple {13273#(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)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {13292#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:18,135 INFO L290 TraceCheckUtils]: 129: Hoare triple {13292#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13296#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:18,136 INFO L290 TraceCheckUtils]: 130: Hoare triple {13296#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12894#false} is VALID [2022-04-28 11:16:18,136 INFO L290 TraceCheckUtils]: 131: Hoare triple {12894#false} assume !false; {12894#false} is VALID [2022-04-28 11:16:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 189 proven. 215 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-04-28 11:16:18,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:34,054 INFO L290 TraceCheckUtils]: 131: Hoare triple {12894#false} assume !false; {12894#false} is VALID [2022-04-28 11:16:34,054 INFO L290 TraceCheckUtils]: 130: Hoare triple {13296#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12894#false} is VALID [2022-04-28 11:16:34,055 INFO L290 TraceCheckUtils]: 129: Hoare triple {13292#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13296#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:34,055 INFO L272 TraceCheckUtils]: 128: Hoare triple {13312#(= (+ (* 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)); {13292#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:34,056 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {12893#true} {13312#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #71#return; {13312#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:16:34,056 INFO L290 TraceCheckUtils]: 126: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,056 INFO L290 TraceCheckUtils]: 125: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,056 INFO L290 TraceCheckUtils]: 124: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,056 INFO L272 TraceCheckUtils]: 123: Hoare triple {13312#(= (+ (* 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)); {12893#true} is VALID [2022-04-28 11:16:34,056 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} {13331#(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; {13312#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:16:34,057 INFO L290 TraceCheckUtils]: 121: Hoare triple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:34,057 INFO L290 TraceCheckUtils]: 120: Hoare triple {13341#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:34,057 INFO L290 TraceCheckUtils]: 119: Hoare triple {12893#true} ~cond := #in~cond; {13341#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:16:34,057 INFO L272 TraceCheckUtils]: 118: Hoare triple {13331#(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)); {12893#true} is VALID [2022-04-28 11:16:34,058 INFO L290 TraceCheckUtils]: 117: Hoare triple {13348#(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); {13331#(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-28 11:16:34,058 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {12893#true} {13348#(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; {13348#(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-28 11:16:34,058 INFO L290 TraceCheckUtils]: 115: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,058 INFO L290 TraceCheckUtils]: 114: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,058 INFO L290 TraceCheckUtils]: 113: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,058 INFO L272 TraceCheckUtils]: 112: Hoare triple {13348#(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)); {12893#true} is VALID [2022-04-28 11:16:34,059 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {12893#true} {13348#(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; {13348#(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-28 11:16:34,059 INFO L290 TraceCheckUtils]: 110: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,059 INFO L290 TraceCheckUtils]: 109: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,059 INFO L290 TraceCheckUtils]: 108: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,059 INFO L272 TraceCheckUtils]: 107: Hoare triple {13348#(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)); {12893#true} is VALID [2022-04-28 11:16:34,059 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {12893#true} {13348#(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; {13348#(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-28 11:16:34,059 INFO L290 TraceCheckUtils]: 105: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,059 INFO L290 TraceCheckUtils]: 104: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,059 INFO L290 TraceCheckUtils]: 103: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,060 INFO L272 TraceCheckUtils]: 102: Hoare triple {13348#(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)); {12893#true} is VALID [2022-04-28 11:16:34,060 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} {13397#(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; {13348#(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-28 11:16:34,060 INFO L290 TraceCheckUtils]: 100: Hoare triple {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:34,061 INFO L290 TraceCheckUtils]: 99: Hoare triple {13341#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {12944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:34,061 INFO L290 TraceCheckUtils]: 98: Hoare triple {12893#true} ~cond := #in~cond; {13341#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:16:34,061 INFO L272 TraceCheckUtils]: 97: Hoare triple {13397#(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)); {12893#true} is VALID [2022-04-28 11:16:34,061 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {12893#true} {13397#(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; {13397#(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-28 11:16:34,061 INFO L290 TraceCheckUtils]: 95: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,062 INFO L290 TraceCheckUtils]: 94: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,062 INFO L290 TraceCheckUtils]: 93: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,062 INFO L272 TraceCheckUtils]: 92: Hoare triple {13397#(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)); {12893#true} is VALID [2022-04-28 11:16:34,062 INFO L290 TraceCheckUtils]: 91: Hoare triple {13397#(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 < 10);havoc #t~post5; {13397#(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-28 11:16:34,062 INFO L290 TraceCheckUtils]: 90: Hoare triple {13397#(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; {13397#(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-28 11:16:34,065 INFO L290 TraceCheckUtils]: 89: Hoare triple {12893#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; {13397#(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-28 11:16:34,066 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12893#true} {12893#true} #67#return; {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L290 TraceCheckUtils]: 87: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L290 TraceCheckUtils]: 86: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L290 TraceCheckUtils]: 85: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L272 TraceCheckUtils]: 84: Hoare triple {12893#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {12893#true} {12893#true} #65#return; {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L290 TraceCheckUtils]: 82: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L290 TraceCheckUtils]: 81: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L290 TraceCheckUtils]: 80: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L272 TraceCheckUtils]: 79: Hoare triple {12893#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {12893#true} {12893#true} #63#return; {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L290 TraceCheckUtils]: 77: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L290 TraceCheckUtils]: 76: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L290 TraceCheckUtils]: 75: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L272 TraceCheckUtils]: 74: Hoare triple {12893#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12893#true} {12893#true} #61#return; {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L290 TraceCheckUtils]: 72: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,066 INFO L290 TraceCheckUtils]: 71: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L290 TraceCheckUtils]: 70: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L272 TraceCheckUtils]: 69: Hoare triple {12893#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12893#true} {12893#true} #59#return; {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L290 TraceCheckUtils]: 67: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L290 TraceCheckUtils]: 66: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L290 TraceCheckUtils]: 65: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L272 TraceCheckUtils]: 64: Hoare triple {12893#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L290 TraceCheckUtils]: 63: Hoare triple {12893#true} assume !!(#t~post5 < 10);havoc #t~post5; {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L290 TraceCheckUtils]: 62: Hoare triple {12893#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L290 TraceCheckUtils]: 61: Hoare triple {12893#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; {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12893#true} {12893#true} #67#return; {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L290 TraceCheckUtils]: 59: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L290 TraceCheckUtils]: 58: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L290 TraceCheckUtils]: 57: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L272 TraceCheckUtils]: 56: Hoare triple {12893#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12893#true} {12893#true} #65#return; {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L290 TraceCheckUtils]: 52: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,067 INFO L272 TraceCheckUtils]: 51: Hoare triple {12893#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12893#true} {12893#true} #63#return; {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L290 TraceCheckUtils]: 48: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L290 TraceCheckUtils]: 47: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L272 TraceCheckUtils]: 46: Hoare triple {12893#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12893#true} {12893#true} #61#return; {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L290 TraceCheckUtils]: 43: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L272 TraceCheckUtils]: 41: Hoare triple {12893#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12893#true} {12893#true} #59#return; {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L272 TraceCheckUtils]: 36: Hoare triple {12893#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L290 TraceCheckUtils]: 35: Hoare triple {12893#true} assume !!(#t~post5 < 10);havoc #t~post5; {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L290 TraceCheckUtils]: 34: Hoare triple {12893#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L290 TraceCheckUtils]: 33: Hoare triple {12893#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; {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12893#true} {12893#true} #67#return; {12893#true} is VALID [2022-04-28 11:16:34,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L272 TraceCheckUtils]: 28: Hoare triple {12893#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12893#true} {12893#true} #65#return; {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L272 TraceCheckUtils]: 23: Hoare triple {12893#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12893#true} {12893#true} #63#return; {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L272 TraceCheckUtils]: 18: Hoare triple {12893#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12893#true} {12893#true} #61#return; {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L272 TraceCheckUtils]: 13: Hoare triple {12893#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12893#true} {12893#true} #59#return; {12893#true} is VALID [2022-04-28 11:16:34,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {12893#true} assume !(0 == ~cond); {12893#true} is VALID [2022-04-28 11:16:34,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {12893#true} ~cond := #in~cond; {12893#true} is VALID [2022-04-28 11:16:34,070 INFO L272 TraceCheckUtils]: 8: Hoare triple {12893#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12893#true} is VALID [2022-04-28 11:16:34,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {12893#true} assume !!(#t~post5 < 10);havoc #t~post5; {12893#true} is VALID [2022-04-28 11:16:34,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {12893#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12893#true} is VALID [2022-04-28 11:16:34,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {12893#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; {12893#true} is VALID [2022-04-28 11:16:34,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {12893#true} call #t~ret6 := main(); {12893#true} is VALID [2022-04-28 11:16:34,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12893#true} {12893#true} #81#return; {12893#true} is VALID [2022-04-28 11:16:34,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {12893#true} assume true; {12893#true} is VALID [2022-04-28 11:16:34,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {12893#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; {12893#true} is VALID [2022-04-28 11:16:34,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {12893#true} call ULTIMATE.init(); {12893#true} is VALID [2022-04-28 11:16:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 171 proven. 17 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2022-04-28 11:16:34,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:34,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254558846] [2022-04-28 11:16:34,071 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:34,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25765941] [2022-04-28 11:16:34,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25765941] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:16:34,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:16:34,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2022-04-28 11:16:34,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:34,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [5168169] [2022-04-28 11:16:34,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [5168169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:34,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:34,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:16:34,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195932711] [2022-04-28 11:16:34,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:34,072 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) Word has length 132 [2022-04-28 11:16:34,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:34,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-28 11:16:35,314 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-28 11:16:35,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:16:35,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:35,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:16:35,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-04-28 11:16:35,315 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-28 11:16:41,824 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:44,215 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:48,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:57,324 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:17:02,394 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:17:05,885 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:17:09,192 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:17:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:09,194 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2022-04-28 11:17:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:17:09,195 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) Word has length 132 [2022-04-28 11:17:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-28 11:17:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-28 11:17:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-28 11:17:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-28 11:17:09,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-04-28 11:17:11,317 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-28 11:17:11,319 INFO L225 Difference]: With dead ends: 144 [2022-04-28 11:17:11,319 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 11:17:11,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 245 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-04-28 11:17:11,320 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:11,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 106 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 222 Invalid, 1 Unknown, 0 Unchecked, 13.0s Time] [2022-04-28 11:17:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 11:17:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-28 11:17:11,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:11,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 18 states have call predecessors, (31), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:17:11,468 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 18 states have call predecessors, (31), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:17:11,468 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 18 states have call predecessors, (31), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:17:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:11,470 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2022-04-28 11:17:11,470 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2022-04-28 11:17:11,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:11,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:11,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 18 states have call predecessors, (31), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 118 states. [2022-04-28 11:17:11,470 INFO L87 Difference]: Start difference. First operand has 118 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 18 states have call predecessors, (31), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 118 states. [2022-04-28 11:17:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:11,472 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2022-04-28 11:17:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2022-04-28 11:17:11,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:11,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:11,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:11,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 18 states have call predecessors, (31), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:17:11,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2022-04-28 11:17:11,474 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 132 [2022-04-28 11:17:11,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:11,474 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2022-04-28 11:17:11,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-28 11:17:11,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 131 transitions. [2022-04-28 11:17:14,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 130 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2022-04-28 11:17:14,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-28 11:17:14,090 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:14,090 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 26, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:14,097 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-28 11:17:14,295 WARN L477 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-28 11:17:14,295 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:14,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2040587668, now seen corresponding path program 9 times [2022-04-28 11:17:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:14,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1052710418] [2022-04-28 11:17:14,505 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:14,505 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2040587668, now seen corresponding path program 10 times [2022-04-28 11:17:14,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:14,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495547703] [2022-04-28 11:17:14,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:14,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:14,515 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:14,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [499070079] [2022-04-28 11:17:14,516 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:17:14,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:14,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:14,516 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-28 11:17:14,517 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-28 11:17:14,584 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:17:14,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:14,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:17:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:14,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:15,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {14475#true} call ULTIMATE.init(); {14475#true} is VALID [2022-04-28 11:17:15,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {14475#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; {14483#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:15,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {14483#(<= ~counter~0 0)} assume true; {14483#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:15,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14483#(<= ~counter~0 0)} {14475#true} #81#return; {14483#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:15,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {14483#(<= ~counter~0 0)} call #t~ret6 := main(); {14483#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:15,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {14483#(<= ~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; {14483#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:15,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {14483#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {14499#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,113 INFO L272 TraceCheckUtils]: 8: Hoare triple {14499#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {14499#(<= ~counter~0 1)} ~cond := #in~cond; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {14499#(<= ~counter~0 1)} assume !(0 == ~cond); {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {14499#(<= ~counter~0 1)} assume true; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,114 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {14499#(<= ~counter~0 1)} {14499#(<= ~counter~0 1)} #59#return; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,114 INFO L272 TraceCheckUtils]: 13: Hoare triple {14499#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {14499#(<= ~counter~0 1)} ~cond := #in~cond; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {14499#(<= ~counter~0 1)} assume !(0 == ~cond); {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {14499#(<= ~counter~0 1)} assume true; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,115 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14499#(<= ~counter~0 1)} {14499#(<= ~counter~0 1)} #61#return; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,116 INFO L272 TraceCheckUtils]: 18: Hoare triple {14499#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {14499#(<= ~counter~0 1)} ~cond := #in~cond; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {14499#(<= ~counter~0 1)} assume !(0 == ~cond); {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {14499#(<= ~counter~0 1)} assume true; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,117 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14499#(<= ~counter~0 1)} {14499#(<= ~counter~0 1)} #63#return; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,117 INFO L272 TraceCheckUtils]: 23: Hoare triple {14499#(<= ~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)); {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {14499#(<= ~counter~0 1)} ~cond := #in~cond; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {14499#(<= ~counter~0 1)} assume !(0 == ~cond); {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {14499#(<= ~counter~0 1)} assume true; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,118 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14499#(<= ~counter~0 1)} {14499#(<= ~counter~0 1)} #65#return; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,118 INFO L272 TraceCheckUtils]: 28: Hoare triple {14499#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {14499#(<= ~counter~0 1)} ~cond := #in~cond; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {14499#(<= ~counter~0 1)} assume !(0 == ~cond); {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {14499#(<= ~counter~0 1)} assume true; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,120 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14499#(<= ~counter~0 1)} {14499#(<= ~counter~0 1)} #67#return; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {14499#(<= ~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; {14499#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:15,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {14499#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {14584#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,121 INFO L272 TraceCheckUtils]: 36: Hoare triple {14584#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {14584#(<= ~counter~0 2)} ~cond := #in~cond; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {14584#(<= ~counter~0 2)} assume !(0 == ~cond); {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {14584#(<= ~counter~0 2)} assume true; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,122 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {14584#(<= ~counter~0 2)} {14584#(<= ~counter~0 2)} #59#return; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,122 INFO L272 TraceCheckUtils]: 41: Hoare triple {14584#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {14584#(<= ~counter~0 2)} ~cond := #in~cond; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {14584#(<= ~counter~0 2)} assume !(0 == ~cond); {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,123 INFO L290 TraceCheckUtils]: 44: Hoare triple {14584#(<= ~counter~0 2)} assume true; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,123 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14584#(<= ~counter~0 2)} {14584#(<= ~counter~0 2)} #61#return; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,124 INFO L272 TraceCheckUtils]: 46: Hoare triple {14584#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,124 INFO L290 TraceCheckUtils]: 47: Hoare triple {14584#(<= ~counter~0 2)} ~cond := #in~cond; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,124 INFO L290 TraceCheckUtils]: 48: Hoare triple {14584#(<= ~counter~0 2)} assume !(0 == ~cond); {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,124 INFO L290 TraceCheckUtils]: 49: Hoare triple {14584#(<= ~counter~0 2)} assume true; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,125 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14584#(<= ~counter~0 2)} {14584#(<= ~counter~0 2)} #63#return; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,125 INFO L272 TraceCheckUtils]: 51: Hoare triple {14584#(<= ~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)); {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,125 INFO L290 TraceCheckUtils]: 52: Hoare triple {14584#(<= ~counter~0 2)} ~cond := #in~cond; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {14584#(<= ~counter~0 2)} assume !(0 == ~cond); {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {14584#(<= ~counter~0 2)} assume true; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,126 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14584#(<= ~counter~0 2)} {14584#(<= ~counter~0 2)} #65#return; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,127 INFO L272 TraceCheckUtils]: 56: Hoare triple {14584#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,127 INFO L290 TraceCheckUtils]: 57: Hoare triple {14584#(<= ~counter~0 2)} ~cond := #in~cond; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,127 INFO L290 TraceCheckUtils]: 58: Hoare triple {14584#(<= ~counter~0 2)} assume !(0 == ~cond); {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,127 INFO L290 TraceCheckUtils]: 59: Hoare triple {14584#(<= ~counter~0 2)} assume true; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,128 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14584#(<= ~counter~0 2)} {14584#(<= ~counter~0 2)} #67#return; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,128 INFO L290 TraceCheckUtils]: 61: Hoare triple {14584#(<= ~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; {14584#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:15,128 INFO L290 TraceCheckUtils]: 62: Hoare triple {14584#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,129 INFO L290 TraceCheckUtils]: 63: Hoare triple {14669#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,129 INFO L272 TraceCheckUtils]: 64: Hoare triple {14669#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,129 INFO L290 TraceCheckUtils]: 65: Hoare triple {14669#(<= ~counter~0 3)} ~cond := #in~cond; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,129 INFO L290 TraceCheckUtils]: 66: Hoare triple {14669#(<= ~counter~0 3)} assume !(0 == ~cond); {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,130 INFO L290 TraceCheckUtils]: 67: Hoare triple {14669#(<= ~counter~0 3)} assume true; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,130 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {14669#(<= ~counter~0 3)} {14669#(<= ~counter~0 3)} #59#return; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,130 INFO L272 TraceCheckUtils]: 69: Hoare triple {14669#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,131 INFO L290 TraceCheckUtils]: 70: Hoare triple {14669#(<= ~counter~0 3)} ~cond := #in~cond; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,131 INFO L290 TraceCheckUtils]: 71: Hoare triple {14669#(<= ~counter~0 3)} assume !(0 == ~cond); {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,131 INFO L290 TraceCheckUtils]: 72: Hoare triple {14669#(<= ~counter~0 3)} assume true; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,131 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {14669#(<= ~counter~0 3)} {14669#(<= ~counter~0 3)} #61#return; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,132 INFO L272 TraceCheckUtils]: 74: Hoare triple {14669#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,132 INFO L290 TraceCheckUtils]: 75: Hoare triple {14669#(<= ~counter~0 3)} ~cond := #in~cond; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,132 INFO L290 TraceCheckUtils]: 76: Hoare triple {14669#(<= ~counter~0 3)} assume !(0 == ~cond); {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,132 INFO L290 TraceCheckUtils]: 77: Hoare triple {14669#(<= ~counter~0 3)} assume true; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,133 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {14669#(<= ~counter~0 3)} {14669#(<= ~counter~0 3)} #63#return; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,133 INFO L272 TraceCheckUtils]: 79: Hoare triple {14669#(<= ~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)); {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,133 INFO L290 TraceCheckUtils]: 80: Hoare triple {14669#(<= ~counter~0 3)} ~cond := #in~cond; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,137 INFO L290 TraceCheckUtils]: 81: Hoare triple {14669#(<= ~counter~0 3)} assume !(0 == ~cond); {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,138 INFO L290 TraceCheckUtils]: 82: Hoare triple {14669#(<= ~counter~0 3)} assume true; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,138 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {14669#(<= ~counter~0 3)} {14669#(<= ~counter~0 3)} #65#return; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,139 INFO L272 TraceCheckUtils]: 84: Hoare triple {14669#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,139 INFO L290 TraceCheckUtils]: 85: Hoare triple {14669#(<= ~counter~0 3)} ~cond := #in~cond; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,140 INFO L290 TraceCheckUtils]: 86: Hoare triple {14669#(<= ~counter~0 3)} assume !(0 == ~cond); {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,140 INFO L290 TraceCheckUtils]: 87: Hoare triple {14669#(<= ~counter~0 3)} assume true; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,141 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {14669#(<= ~counter~0 3)} {14669#(<= ~counter~0 3)} #67#return; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,141 INFO L290 TraceCheckUtils]: 89: Hoare triple {14669#(<= ~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; {14669#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:15,141 INFO L290 TraceCheckUtils]: 90: Hoare triple {14669#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,142 INFO L290 TraceCheckUtils]: 91: Hoare triple {14754#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,142 INFO L272 TraceCheckUtils]: 92: Hoare triple {14754#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,142 INFO L290 TraceCheckUtils]: 93: Hoare triple {14754#(<= ~counter~0 4)} ~cond := #in~cond; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,142 INFO L290 TraceCheckUtils]: 94: Hoare triple {14754#(<= ~counter~0 4)} assume !(0 == ~cond); {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,143 INFO L290 TraceCheckUtils]: 95: Hoare triple {14754#(<= ~counter~0 4)} assume true; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,143 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {14754#(<= ~counter~0 4)} {14754#(<= ~counter~0 4)} #59#return; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,143 INFO L272 TraceCheckUtils]: 97: Hoare triple {14754#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,144 INFO L290 TraceCheckUtils]: 98: Hoare triple {14754#(<= ~counter~0 4)} ~cond := #in~cond; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,144 INFO L290 TraceCheckUtils]: 99: Hoare triple {14754#(<= ~counter~0 4)} assume !(0 == ~cond); {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,144 INFO L290 TraceCheckUtils]: 100: Hoare triple {14754#(<= ~counter~0 4)} assume true; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,144 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {14754#(<= ~counter~0 4)} {14754#(<= ~counter~0 4)} #61#return; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,145 INFO L272 TraceCheckUtils]: 102: Hoare triple {14754#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,145 INFO L290 TraceCheckUtils]: 103: Hoare triple {14754#(<= ~counter~0 4)} ~cond := #in~cond; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,145 INFO L290 TraceCheckUtils]: 104: Hoare triple {14754#(<= ~counter~0 4)} assume !(0 == ~cond); {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,146 INFO L290 TraceCheckUtils]: 105: Hoare triple {14754#(<= ~counter~0 4)} assume true; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,146 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {14754#(<= ~counter~0 4)} {14754#(<= ~counter~0 4)} #63#return; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,146 INFO L272 TraceCheckUtils]: 107: Hoare triple {14754#(<= ~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)); {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,147 INFO L290 TraceCheckUtils]: 108: Hoare triple {14754#(<= ~counter~0 4)} ~cond := #in~cond; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,147 INFO L290 TraceCheckUtils]: 109: Hoare triple {14754#(<= ~counter~0 4)} assume !(0 == ~cond); {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,147 INFO L290 TraceCheckUtils]: 110: Hoare triple {14754#(<= ~counter~0 4)} assume true; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,147 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {14754#(<= ~counter~0 4)} {14754#(<= ~counter~0 4)} #65#return; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,148 INFO L272 TraceCheckUtils]: 112: Hoare triple {14754#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,148 INFO L290 TraceCheckUtils]: 113: Hoare triple {14754#(<= ~counter~0 4)} ~cond := #in~cond; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,148 INFO L290 TraceCheckUtils]: 114: Hoare triple {14754#(<= ~counter~0 4)} assume !(0 == ~cond); {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,148 INFO L290 TraceCheckUtils]: 115: Hoare triple {14754#(<= ~counter~0 4)} assume true; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,149 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {14754#(<= ~counter~0 4)} {14754#(<= ~counter~0 4)} #67#return; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,149 INFO L290 TraceCheckUtils]: 117: Hoare triple {14754#(<= ~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; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,149 INFO L290 TraceCheckUtils]: 118: Hoare triple {14754#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,150 INFO L290 TraceCheckUtils]: 119: Hoare triple {14839#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,150 INFO L272 TraceCheckUtils]: 120: Hoare triple {14839#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,150 INFO L290 TraceCheckUtils]: 121: Hoare triple {14839#(<= ~counter~0 5)} ~cond := #in~cond; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,151 INFO L290 TraceCheckUtils]: 122: Hoare triple {14839#(<= ~counter~0 5)} assume !(0 == ~cond); {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,151 INFO L290 TraceCheckUtils]: 123: Hoare triple {14839#(<= ~counter~0 5)} assume true; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,151 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {14839#(<= ~counter~0 5)} {14839#(<= ~counter~0 5)} #59#return; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,152 INFO L272 TraceCheckUtils]: 125: Hoare triple {14839#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,152 INFO L290 TraceCheckUtils]: 126: Hoare triple {14839#(<= ~counter~0 5)} ~cond := #in~cond; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,152 INFO L290 TraceCheckUtils]: 127: Hoare triple {14839#(<= ~counter~0 5)} assume !(0 == ~cond); {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,152 INFO L290 TraceCheckUtils]: 128: Hoare triple {14839#(<= ~counter~0 5)} assume true; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,153 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {14839#(<= ~counter~0 5)} {14839#(<= ~counter~0 5)} #61#return; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,153 INFO L272 TraceCheckUtils]: 130: Hoare triple {14839#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,153 INFO L290 TraceCheckUtils]: 131: Hoare triple {14839#(<= ~counter~0 5)} ~cond := #in~cond; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,153 INFO L290 TraceCheckUtils]: 132: Hoare triple {14839#(<= ~counter~0 5)} assume !(0 == ~cond); {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,154 INFO L290 TraceCheckUtils]: 133: Hoare triple {14839#(<= ~counter~0 5)} assume true; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,154 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {14839#(<= ~counter~0 5)} {14839#(<= ~counter~0 5)} #63#return; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,154 INFO L272 TraceCheckUtils]: 135: Hoare triple {14839#(<= ~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)); {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,155 INFO L290 TraceCheckUtils]: 136: Hoare triple {14839#(<= ~counter~0 5)} ~cond := #in~cond; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,155 INFO L290 TraceCheckUtils]: 137: Hoare triple {14839#(<= ~counter~0 5)} assume !(0 == ~cond); {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,155 INFO L290 TraceCheckUtils]: 138: Hoare triple {14839#(<= ~counter~0 5)} assume true; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,155 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {14839#(<= ~counter~0 5)} {14839#(<= ~counter~0 5)} #65#return; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,156 INFO L272 TraceCheckUtils]: 140: Hoare triple {14839#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,156 INFO L290 TraceCheckUtils]: 141: Hoare triple {14839#(<= ~counter~0 5)} ~cond := #in~cond; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,156 INFO L290 TraceCheckUtils]: 142: Hoare triple {14839#(<= ~counter~0 5)} assume !(0 == ~cond); {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,157 INFO L290 TraceCheckUtils]: 143: Hoare triple {14839#(<= ~counter~0 5)} assume true; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,157 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {14839#(<= ~counter~0 5)} {14839#(<= ~counter~0 5)} #67#return; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,157 INFO L290 TraceCheckUtils]: 145: Hoare triple {14839#(<= ~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; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,157 INFO L290 TraceCheckUtils]: 146: Hoare triple {14839#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14924#(<= |main_#t~post5| 5)} is VALID [2022-04-28 11:17:15,158 INFO L290 TraceCheckUtils]: 147: Hoare triple {14924#(<= |main_#t~post5| 5)} assume !(#t~post5 < 10);havoc #t~post5; {14476#false} is VALID [2022-04-28 11:17:15,158 INFO L272 TraceCheckUtils]: 148: Hoare triple {14476#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14476#false} is VALID [2022-04-28 11:17:15,158 INFO L290 TraceCheckUtils]: 149: Hoare triple {14476#false} ~cond := #in~cond; {14476#false} is VALID [2022-04-28 11:17:15,158 INFO L290 TraceCheckUtils]: 150: Hoare triple {14476#false} assume !(0 == ~cond); {14476#false} is VALID [2022-04-28 11:17:15,158 INFO L290 TraceCheckUtils]: 151: Hoare triple {14476#false} assume true; {14476#false} is VALID [2022-04-28 11:17:15,158 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {14476#false} {14476#false} #69#return; {14476#false} is VALID [2022-04-28 11:17:15,158 INFO L272 TraceCheckUtils]: 153: Hoare triple {14476#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {14476#false} is VALID [2022-04-28 11:17:15,158 INFO L290 TraceCheckUtils]: 154: Hoare triple {14476#false} ~cond := #in~cond; {14476#false} is VALID [2022-04-28 11:17:15,158 INFO L290 TraceCheckUtils]: 155: Hoare triple {14476#false} assume 0 == ~cond; {14476#false} is VALID [2022-04-28 11:17:15,158 INFO L290 TraceCheckUtils]: 156: Hoare triple {14476#false} assume !false; {14476#false} is VALID [2022-04-28 11:17:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 150 proven. 1090 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-04-28 11:17:15,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:15,637 INFO L290 TraceCheckUtils]: 156: Hoare triple {14476#false} assume !false; {14476#false} is VALID [2022-04-28 11:17:15,637 INFO L290 TraceCheckUtils]: 155: Hoare triple {14476#false} assume 0 == ~cond; {14476#false} is VALID [2022-04-28 11:17:15,637 INFO L290 TraceCheckUtils]: 154: Hoare triple {14476#false} ~cond := #in~cond; {14476#false} is VALID [2022-04-28 11:17:15,637 INFO L272 TraceCheckUtils]: 153: Hoare triple {14476#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {14476#false} is VALID [2022-04-28 11:17:15,637 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {14475#true} {14476#false} #69#return; {14476#false} is VALID [2022-04-28 11:17:15,637 INFO L290 TraceCheckUtils]: 151: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,637 INFO L290 TraceCheckUtils]: 150: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,637 INFO L290 TraceCheckUtils]: 149: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,637 INFO L272 TraceCheckUtils]: 148: Hoare triple {14476#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,638 INFO L290 TraceCheckUtils]: 147: Hoare triple {14982#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {14476#false} is VALID [2022-04-28 11:17:15,638 INFO L290 TraceCheckUtils]: 146: Hoare triple {14986#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14982#(< |main_#t~post5| 10)} is VALID [2022-04-28 11:17:15,638 INFO L290 TraceCheckUtils]: 145: Hoare triple {14986#(< ~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; {14986#(< ~counter~0 10)} is VALID [2022-04-28 11:17:15,639 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {14475#true} {14986#(< ~counter~0 10)} #67#return; {14986#(< ~counter~0 10)} is VALID [2022-04-28 11:17:15,639 INFO L290 TraceCheckUtils]: 143: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,639 INFO L290 TraceCheckUtils]: 142: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,639 INFO L290 TraceCheckUtils]: 141: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,639 INFO L272 TraceCheckUtils]: 140: Hoare triple {14986#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,639 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {14475#true} {14986#(< ~counter~0 10)} #65#return; {14986#(< ~counter~0 10)} is VALID [2022-04-28 11:17:15,639 INFO L290 TraceCheckUtils]: 138: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,639 INFO L290 TraceCheckUtils]: 137: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,639 INFO L290 TraceCheckUtils]: 136: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,639 INFO L272 TraceCheckUtils]: 135: Hoare triple {14986#(< ~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)); {14475#true} is VALID [2022-04-28 11:17:15,640 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {14475#true} {14986#(< ~counter~0 10)} #63#return; {14986#(< ~counter~0 10)} is VALID [2022-04-28 11:17:15,640 INFO L290 TraceCheckUtils]: 133: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,640 INFO L290 TraceCheckUtils]: 132: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,640 INFO L290 TraceCheckUtils]: 131: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,640 INFO L272 TraceCheckUtils]: 130: Hoare triple {14986#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,640 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {14475#true} {14986#(< ~counter~0 10)} #61#return; {14986#(< ~counter~0 10)} is VALID [2022-04-28 11:17:15,640 INFO L290 TraceCheckUtils]: 128: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,640 INFO L290 TraceCheckUtils]: 127: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,641 INFO L290 TraceCheckUtils]: 126: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,641 INFO L272 TraceCheckUtils]: 125: Hoare triple {14986#(< ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,641 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {14475#true} {14986#(< ~counter~0 10)} #59#return; {14986#(< ~counter~0 10)} is VALID [2022-04-28 11:17:15,641 INFO L290 TraceCheckUtils]: 123: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,641 INFO L290 TraceCheckUtils]: 122: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,641 INFO L290 TraceCheckUtils]: 121: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,641 INFO L272 TraceCheckUtils]: 120: Hoare triple {14986#(< ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,641 INFO L290 TraceCheckUtils]: 119: Hoare triple {14986#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {14986#(< ~counter~0 10)} is VALID [2022-04-28 11:17:15,642 INFO L290 TraceCheckUtils]: 118: Hoare triple {15071#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14986#(< ~counter~0 10)} is VALID [2022-04-28 11:17:15,642 INFO L290 TraceCheckUtils]: 117: Hoare triple {15071#(< ~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; {15071#(< ~counter~0 9)} is VALID [2022-04-28 11:17:15,643 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {14475#true} {15071#(< ~counter~0 9)} #67#return; {15071#(< ~counter~0 9)} is VALID [2022-04-28 11:17:15,643 INFO L290 TraceCheckUtils]: 115: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,643 INFO L290 TraceCheckUtils]: 114: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,643 INFO L290 TraceCheckUtils]: 113: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,643 INFO L272 TraceCheckUtils]: 112: Hoare triple {15071#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,643 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {14475#true} {15071#(< ~counter~0 9)} #65#return; {15071#(< ~counter~0 9)} is VALID [2022-04-28 11:17:15,643 INFO L290 TraceCheckUtils]: 110: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,643 INFO L290 TraceCheckUtils]: 109: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,643 INFO L290 TraceCheckUtils]: 108: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,643 INFO L272 TraceCheckUtils]: 107: Hoare triple {15071#(< ~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)); {14475#true} is VALID [2022-04-28 11:17:15,644 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {14475#true} {15071#(< ~counter~0 9)} #63#return; {15071#(< ~counter~0 9)} is VALID [2022-04-28 11:17:15,644 INFO L290 TraceCheckUtils]: 105: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,644 INFO L290 TraceCheckUtils]: 104: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,644 INFO L290 TraceCheckUtils]: 103: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,644 INFO L272 TraceCheckUtils]: 102: Hoare triple {15071#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,644 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {14475#true} {15071#(< ~counter~0 9)} #61#return; {15071#(< ~counter~0 9)} is VALID [2022-04-28 11:17:15,644 INFO L290 TraceCheckUtils]: 100: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,644 INFO L290 TraceCheckUtils]: 99: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,645 INFO L290 TraceCheckUtils]: 98: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,645 INFO L272 TraceCheckUtils]: 97: Hoare triple {15071#(< ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,645 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {14475#true} {15071#(< ~counter~0 9)} #59#return; {15071#(< ~counter~0 9)} is VALID [2022-04-28 11:17:15,645 INFO L290 TraceCheckUtils]: 95: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,645 INFO L290 TraceCheckUtils]: 94: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,645 INFO L290 TraceCheckUtils]: 93: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,645 INFO L272 TraceCheckUtils]: 92: Hoare triple {15071#(< ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,645 INFO L290 TraceCheckUtils]: 91: Hoare triple {15071#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {15071#(< ~counter~0 9)} is VALID [2022-04-28 11:17:15,646 INFO L290 TraceCheckUtils]: 90: Hoare triple {15156#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15071#(< ~counter~0 9)} is VALID [2022-04-28 11:17:15,646 INFO L290 TraceCheckUtils]: 89: Hoare triple {15156#(< ~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; {15156#(< ~counter~0 8)} is VALID [2022-04-28 11:17:15,646 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {14475#true} {15156#(< ~counter~0 8)} #67#return; {15156#(< ~counter~0 8)} is VALID [2022-04-28 11:17:15,646 INFO L290 TraceCheckUtils]: 87: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,647 INFO L290 TraceCheckUtils]: 86: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,647 INFO L290 TraceCheckUtils]: 85: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,647 INFO L272 TraceCheckUtils]: 84: Hoare triple {15156#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,647 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {14475#true} {15156#(< ~counter~0 8)} #65#return; {15156#(< ~counter~0 8)} is VALID [2022-04-28 11:17:15,647 INFO L290 TraceCheckUtils]: 82: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,647 INFO L290 TraceCheckUtils]: 81: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,647 INFO L290 TraceCheckUtils]: 80: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,647 INFO L272 TraceCheckUtils]: 79: Hoare triple {15156#(< ~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)); {14475#true} is VALID [2022-04-28 11:17:15,648 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {14475#true} {15156#(< ~counter~0 8)} #63#return; {15156#(< ~counter~0 8)} is VALID [2022-04-28 11:17:15,648 INFO L290 TraceCheckUtils]: 77: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,648 INFO L290 TraceCheckUtils]: 76: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,648 INFO L290 TraceCheckUtils]: 75: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,648 INFO L272 TraceCheckUtils]: 74: Hoare triple {15156#(< ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,648 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {14475#true} {15156#(< ~counter~0 8)} #61#return; {15156#(< ~counter~0 8)} is VALID [2022-04-28 11:17:15,648 INFO L290 TraceCheckUtils]: 72: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,648 INFO L290 TraceCheckUtils]: 71: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,648 INFO L290 TraceCheckUtils]: 70: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,648 INFO L272 TraceCheckUtils]: 69: Hoare triple {15156#(< ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,649 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {14475#true} {15156#(< ~counter~0 8)} #59#return; {15156#(< ~counter~0 8)} is VALID [2022-04-28 11:17:15,649 INFO L290 TraceCheckUtils]: 67: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,649 INFO L290 TraceCheckUtils]: 66: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,649 INFO L290 TraceCheckUtils]: 65: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,649 INFO L272 TraceCheckUtils]: 64: Hoare triple {15156#(< ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,649 INFO L290 TraceCheckUtils]: 63: Hoare triple {15156#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {15156#(< ~counter~0 8)} is VALID [2022-04-28 11:17:15,650 INFO L290 TraceCheckUtils]: 62: Hoare triple {15241#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15156#(< ~counter~0 8)} is VALID [2022-04-28 11:17:15,650 INFO L290 TraceCheckUtils]: 61: Hoare triple {15241#(< ~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; {15241#(< ~counter~0 7)} is VALID [2022-04-28 11:17:15,650 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14475#true} {15241#(< ~counter~0 7)} #67#return; {15241#(< ~counter~0 7)} is VALID [2022-04-28 11:17:15,650 INFO L290 TraceCheckUtils]: 59: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,650 INFO L290 TraceCheckUtils]: 58: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,650 INFO L290 TraceCheckUtils]: 57: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,650 INFO L272 TraceCheckUtils]: 56: Hoare triple {15241#(< ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,651 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14475#true} {15241#(< ~counter~0 7)} #65#return; {15241#(< ~counter~0 7)} is VALID [2022-04-28 11:17:15,651 INFO L290 TraceCheckUtils]: 54: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,651 INFO L290 TraceCheckUtils]: 53: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,651 INFO L290 TraceCheckUtils]: 52: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,651 INFO L272 TraceCheckUtils]: 51: Hoare triple {15241#(< ~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)); {14475#true} is VALID [2022-04-28 11:17:15,651 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14475#true} {15241#(< ~counter~0 7)} #63#return; {15241#(< ~counter~0 7)} is VALID [2022-04-28 11:17:15,652 INFO L290 TraceCheckUtils]: 49: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,652 INFO L290 TraceCheckUtils]: 48: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,652 INFO L290 TraceCheckUtils]: 47: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,652 INFO L272 TraceCheckUtils]: 46: Hoare triple {15241#(< ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,652 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14475#true} {15241#(< ~counter~0 7)} #61#return; {15241#(< ~counter~0 7)} is VALID [2022-04-28 11:17:15,652 INFO L290 TraceCheckUtils]: 44: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,652 INFO L290 TraceCheckUtils]: 43: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,652 INFO L290 TraceCheckUtils]: 42: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,652 INFO L272 TraceCheckUtils]: 41: Hoare triple {15241#(< ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,653 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {14475#true} {15241#(< ~counter~0 7)} #59#return; {15241#(< ~counter~0 7)} is VALID [2022-04-28 11:17:15,653 INFO L290 TraceCheckUtils]: 39: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,653 INFO L272 TraceCheckUtils]: 36: Hoare triple {15241#(< ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {15241#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {15241#(< ~counter~0 7)} is VALID [2022-04-28 11:17:15,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {14839#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15241#(< ~counter~0 7)} is VALID [2022-04-28 11:17:15,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {14839#(<= ~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; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,654 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14475#true} {14839#(<= ~counter~0 5)} #67#return; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,654 INFO L272 TraceCheckUtils]: 28: Hoare triple {14839#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,655 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14475#true} {14839#(<= ~counter~0 5)} #65#return; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,655 INFO L272 TraceCheckUtils]: 23: Hoare triple {14839#(<= ~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)); {14475#true} is VALID [2022-04-28 11:17:15,655 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14475#true} {14839#(<= ~counter~0 5)} #63#return; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,655 INFO L272 TraceCheckUtils]: 18: Hoare triple {14839#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,656 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14475#true} {14839#(<= ~counter~0 5)} #61#return; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,656 INFO L272 TraceCheckUtils]: 13: Hoare triple {14839#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,656 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {14475#true} {14839#(<= ~counter~0 5)} #59#return; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {14475#true} assume true; {14475#true} is VALID [2022-04-28 11:17:15,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {14475#true} assume !(0 == ~cond); {14475#true} is VALID [2022-04-28 11:17:15,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {14475#true} ~cond := #in~cond; {14475#true} is VALID [2022-04-28 11:17:15,657 INFO L272 TraceCheckUtils]: 8: Hoare triple {14839#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14475#true} is VALID [2022-04-28 11:17:15,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {14839#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {14754#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14839#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:15,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {14754#(<= ~counter~0 4)} 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; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {14754#(<= ~counter~0 4)} call #t~ret6 := main(); {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14754#(<= ~counter~0 4)} {14475#true} #81#return; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {14754#(<= ~counter~0 4)} assume true; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {14475#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; {14754#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:15,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {14475#true} call ULTIMATE.init(); {14475#true} is VALID [2022-04-28 11:17:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 52 proven. 90 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2022-04-28 11:17:15,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:15,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495547703] [2022-04-28 11:17:15,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:15,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499070079] [2022-04-28 11:17:15,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499070079] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:17:15,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:17:15,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 11:17:15,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:15,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1052710418] [2022-04-28 11:17:15,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1052710418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:15,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:15,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:17:15,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888601502] [2022-04-28 11:17:15,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:15,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) Word has length 157 [2022-04-28 11:17:15,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:15,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2022-04-28 11:17:15,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:15,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:17:15,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:15,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:17:15,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:17:15,728 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2022-04-28 11:17:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:16,680 INFO L93 Difference]: Finished difference Result 148 states and 166 transitions. [2022-04-28 11:17:16,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 11:17:16,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) Word has length 157 [2022-04-28 11:17:16,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2022-04-28 11:17:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2022-04-28 11:17:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2022-04-28 11:17:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2022-04-28 11:17:16,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 127 transitions. [2022-04-28 11:17:16,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:16,798 INFO L225 Difference]: With dead ends: 148 [2022-04-28 11:17:16,798 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 11:17:16,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=206, Unknown=0, NotChecked=0, Total=342 [2022-04-28 11:17:16,798 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:16,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 202 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:17:16,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 11:17:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-04-28 11:17:16,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:16,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 134 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 79 states have internal predecessors, (80), 36 states have call successors, (36), 20 states have call predecessors, (36), 19 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 11:17:16,957 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 134 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 79 states have internal predecessors, (80), 36 states have call successors, (36), 20 states have call predecessors, (36), 19 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 11:17:16,958 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 134 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 79 states have internal predecessors, (80), 36 states have call successors, (36), 20 states have call predecessors, (36), 19 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 11:17:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:16,960 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2022-04-28 11:17:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2022-04-28 11:17:16,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:16,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:16,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 79 states have internal predecessors, (80), 36 states have call successors, (36), 20 states have call predecessors, (36), 19 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 134 states. [2022-04-28 11:17:16,961 INFO L87 Difference]: Start difference. First operand has 134 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 79 states have internal predecessors, (80), 36 states have call successors, (36), 20 states have call predecessors, (36), 19 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 134 states. [2022-04-28 11:17:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:16,962 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2022-04-28 11:17:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2022-04-28 11:17:16,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:16,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:16,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:16,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 79 states have internal predecessors, (80), 36 states have call successors, (36), 20 states have call predecessors, (36), 19 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 11:17:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2022-04-28 11:17:16,966 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 157 [2022-04-28 11:17:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:16,966 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2022-04-28 11:17:16,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2022-04-28 11:17:16,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 150 transitions. [2022-04-28 11:17:20,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 149 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2022-04-28 11:17:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-04-28 11:17:20,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:20,907 INFO L195 NwaCegarLoop]: trace histogram [32, 31, 31, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:20,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 11:17:21,107 WARN L477 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-28 11:17:21,107 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:21,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:21,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1100526531, now seen corresponding path program 11 times [2022-04-28 11:17:21,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:21,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [928707411] [2022-04-28 11:17:21,331 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:21,331 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:21,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1100526531, now seen corresponding path program 12 times [2022-04-28 11:17:21,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:21,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157330251] [2022-04-28 11:17:21,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:21,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:21,356 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:21,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652179327] [2022-04-28 11:17:21,356 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:17:21,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:21,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:21,357 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-28 11:17:21,358 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-28 11:17:22,069 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 11:17:22,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:22,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 11:17:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:22,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:22,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {16272#true} call ULTIMATE.init(); {16272#true} is VALID [2022-04-28 11:17:22,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {16272#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; {16280#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:22,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {16280#(<= ~counter~0 0)} assume true; {16280#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:22,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16280#(<= ~counter~0 0)} {16272#true} #81#return; {16280#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:22,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {16280#(<= ~counter~0 0)} call #t~ret6 := main(); {16280#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:22,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {16280#(<= ~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; {16280#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:22,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {16280#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {16296#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,702 INFO L272 TraceCheckUtils]: 8: Hoare triple {16296#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {16296#(<= ~counter~0 1)} ~cond := #in~cond; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {16296#(<= ~counter~0 1)} assume !(0 == ~cond); {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {16296#(<= ~counter~0 1)} assume true; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,703 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16296#(<= ~counter~0 1)} {16296#(<= ~counter~0 1)} #59#return; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,704 INFO L272 TraceCheckUtils]: 13: Hoare triple {16296#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {16296#(<= ~counter~0 1)} ~cond := #in~cond; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {16296#(<= ~counter~0 1)} assume !(0 == ~cond); {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {16296#(<= ~counter~0 1)} assume true; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,705 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16296#(<= ~counter~0 1)} {16296#(<= ~counter~0 1)} #61#return; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,705 INFO L272 TraceCheckUtils]: 18: Hoare triple {16296#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {16296#(<= ~counter~0 1)} ~cond := #in~cond; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {16296#(<= ~counter~0 1)} assume !(0 == ~cond); {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {16296#(<= ~counter~0 1)} assume true; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,706 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16296#(<= ~counter~0 1)} {16296#(<= ~counter~0 1)} #63#return; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,707 INFO L272 TraceCheckUtils]: 23: Hoare triple {16296#(<= ~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)); {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {16296#(<= ~counter~0 1)} ~cond := #in~cond; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {16296#(<= ~counter~0 1)} assume !(0 == ~cond); {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {16296#(<= ~counter~0 1)} assume true; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,708 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16296#(<= ~counter~0 1)} {16296#(<= ~counter~0 1)} #65#return; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,708 INFO L272 TraceCheckUtils]: 28: Hoare triple {16296#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {16296#(<= ~counter~0 1)} ~cond := #in~cond; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {16296#(<= ~counter~0 1)} assume !(0 == ~cond); {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {16296#(<= ~counter~0 1)} assume true; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,709 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16296#(<= ~counter~0 1)} {16296#(<= ~counter~0 1)} #67#return; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {16296#(<= ~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; {16296#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:22,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {16296#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {16381#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,711 INFO L272 TraceCheckUtils]: 36: Hoare triple {16381#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {16381#(<= ~counter~0 2)} ~cond := #in~cond; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {16381#(<= ~counter~0 2)} assume !(0 == ~cond); {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {16381#(<= ~counter~0 2)} assume true; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,712 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16381#(<= ~counter~0 2)} {16381#(<= ~counter~0 2)} #59#return; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,712 INFO L272 TraceCheckUtils]: 41: Hoare triple {16381#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {16381#(<= ~counter~0 2)} ~cond := #in~cond; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {16381#(<= ~counter~0 2)} assume !(0 == ~cond); {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {16381#(<= ~counter~0 2)} assume true; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,713 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16381#(<= ~counter~0 2)} {16381#(<= ~counter~0 2)} #61#return; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,713 INFO L272 TraceCheckUtils]: 46: Hoare triple {16381#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {16381#(<= ~counter~0 2)} ~cond := #in~cond; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,714 INFO L290 TraceCheckUtils]: 48: Hoare triple {16381#(<= ~counter~0 2)} assume !(0 == ~cond); {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,714 INFO L290 TraceCheckUtils]: 49: Hoare triple {16381#(<= ~counter~0 2)} assume true; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,715 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16381#(<= ~counter~0 2)} {16381#(<= ~counter~0 2)} #63#return; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,715 INFO L272 TraceCheckUtils]: 51: Hoare triple {16381#(<= ~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)); {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,715 INFO L290 TraceCheckUtils]: 52: Hoare triple {16381#(<= ~counter~0 2)} ~cond := #in~cond; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,716 INFO L290 TraceCheckUtils]: 53: Hoare triple {16381#(<= ~counter~0 2)} assume !(0 == ~cond); {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,716 INFO L290 TraceCheckUtils]: 54: Hoare triple {16381#(<= ~counter~0 2)} assume true; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,716 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16381#(<= ~counter~0 2)} {16381#(<= ~counter~0 2)} #65#return; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,717 INFO L272 TraceCheckUtils]: 56: Hoare triple {16381#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,717 INFO L290 TraceCheckUtils]: 57: Hoare triple {16381#(<= ~counter~0 2)} ~cond := #in~cond; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,717 INFO L290 TraceCheckUtils]: 58: Hoare triple {16381#(<= ~counter~0 2)} assume !(0 == ~cond); {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,717 INFO L290 TraceCheckUtils]: 59: Hoare triple {16381#(<= ~counter~0 2)} assume true; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,718 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16381#(<= ~counter~0 2)} {16381#(<= ~counter~0 2)} #67#return; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,718 INFO L290 TraceCheckUtils]: 61: Hoare triple {16381#(<= ~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; {16381#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:22,718 INFO L290 TraceCheckUtils]: 62: Hoare triple {16381#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,719 INFO L290 TraceCheckUtils]: 63: Hoare triple {16466#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,719 INFO L272 TraceCheckUtils]: 64: Hoare triple {16466#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,719 INFO L290 TraceCheckUtils]: 65: Hoare triple {16466#(<= ~counter~0 3)} ~cond := #in~cond; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,720 INFO L290 TraceCheckUtils]: 66: Hoare triple {16466#(<= ~counter~0 3)} assume !(0 == ~cond); {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,720 INFO L290 TraceCheckUtils]: 67: Hoare triple {16466#(<= ~counter~0 3)} assume true; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,720 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {16466#(<= ~counter~0 3)} {16466#(<= ~counter~0 3)} #59#return; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,721 INFO L272 TraceCheckUtils]: 69: Hoare triple {16466#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,721 INFO L290 TraceCheckUtils]: 70: Hoare triple {16466#(<= ~counter~0 3)} ~cond := #in~cond; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,721 INFO L290 TraceCheckUtils]: 71: Hoare triple {16466#(<= ~counter~0 3)} assume !(0 == ~cond); {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,721 INFO L290 TraceCheckUtils]: 72: Hoare triple {16466#(<= ~counter~0 3)} assume true; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,722 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16466#(<= ~counter~0 3)} {16466#(<= ~counter~0 3)} #61#return; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,722 INFO L272 TraceCheckUtils]: 74: Hoare triple {16466#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,722 INFO L290 TraceCheckUtils]: 75: Hoare triple {16466#(<= ~counter~0 3)} ~cond := #in~cond; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,723 INFO L290 TraceCheckUtils]: 76: Hoare triple {16466#(<= ~counter~0 3)} assume !(0 == ~cond); {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,723 INFO L290 TraceCheckUtils]: 77: Hoare triple {16466#(<= ~counter~0 3)} assume true; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,723 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {16466#(<= ~counter~0 3)} {16466#(<= ~counter~0 3)} #63#return; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,724 INFO L272 TraceCheckUtils]: 79: Hoare triple {16466#(<= ~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)); {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,724 INFO L290 TraceCheckUtils]: 80: Hoare triple {16466#(<= ~counter~0 3)} ~cond := #in~cond; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,724 INFO L290 TraceCheckUtils]: 81: Hoare triple {16466#(<= ~counter~0 3)} assume !(0 == ~cond); {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,724 INFO L290 TraceCheckUtils]: 82: Hoare triple {16466#(<= ~counter~0 3)} assume true; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,725 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {16466#(<= ~counter~0 3)} {16466#(<= ~counter~0 3)} #65#return; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,725 INFO L272 TraceCheckUtils]: 84: Hoare triple {16466#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,725 INFO L290 TraceCheckUtils]: 85: Hoare triple {16466#(<= ~counter~0 3)} ~cond := #in~cond; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,726 INFO L290 TraceCheckUtils]: 86: Hoare triple {16466#(<= ~counter~0 3)} assume !(0 == ~cond); {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,726 INFO L290 TraceCheckUtils]: 87: Hoare triple {16466#(<= ~counter~0 3)} assume true; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,726 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {16466#(<= ~counter~0 3)} {16466#(<= ~counter~0 3)} #67#return; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,727 INFO L290 TraceCheckUtils]: 89: Hoare triple {16466#(<= ~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; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:22,727 INFO L290 TraceCheckUtils]: 90: Hoare triple {16466#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,727 INFO L290 TraceCheckUtils]: 91: Hoare triple {16551#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,728 INFO L272 TraceCheckUtils]: 92: Hoare triple {16551#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,728 INFO L290 TraceCheckUtils]: 93: Hoare triple {16551#(<= ~counter~0 4)} ~cond := #in~cond; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,728 INFO L290 TraceCheckUtils]: 94: Hoare triple {16551#(<= ~counter~0 4)} assume !(0 == ~cond); {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,728 INFO L290 TraceCheckUtils]: 95: Hoare triple {16551#(<= ~counter~0 4)} assume true; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,729 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {16551#(<= ~counter~0 4)} {16551#(<= ~counter~0 4)} #59#return; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,729 INFO L272 TraceCheckUtils]: 97: Hoare triple {16551#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,729 INFO L290 TraceCheckUtils]: 98: Hoare triple {16551#(<= ~counter~0 4)} ~cond := #in~cond; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,730 INFO L290 TraceCheckUtils]: 99: Hoare triple {16551#(<= ~counter~0 4)} assume !(0 == ~cond); {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,730 INFO L290 TraceCheckUtils]: 100: Hoare triple {16551#(<= ~counter~0 4)} assume true; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,730 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {16551#(<= ~counter~0 4)} {16551#(<= ~counter~0 4)} #61#return; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,731 INFO L272 TraceCheckUtils]: 102: Hoare triple {16551#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,731 INFO L290 TraceCheckUtils]: 103: Hoare triple {16551#(<= ~counter~0 4)} ~cond := #in~cond; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,731 INFO L290 TraceCheckUtils]: 104: Hoare triple {16551#(<= ~counter~0 4)} assume !(0 == ~cond); {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,731 INFO L290 TraceCheckUtils]: 105: Hoare triple {16551#(<= ~counter~0 4)} assume true; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,732 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {16551#(<= ~counter~0 4)} {16551#(<= ~counter~0 4)} #63#return; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,732 INFO L272 TraceCheckUtils]: 107: Hoare triple {16551#(<= ~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)); {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,732 INFO L290 TraceCheckUtils]: 108: Hoare triple {16551#(<= ~counter~0 4)} ~cond := #in~cond; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,733 INFO L290 TraceCheckUtils]: 109: Hoare triple {16551#(<= ~counter~0 4)} assume !(0 == ~cond); {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,733 INFO L290 TraceCheckUtils]: 110: Hoare triple {16551#(<= ~counter~0 4)} assume true; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,733 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {16551#(<= ~counter~0 4)} {16551#(<= ~counter~0 4)} #65#return; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,734 INFO L272 TraceCheckUtils]: 112: Hoare triple {16551#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,734 INFO L290 TraceCheckUtils]: 113: Hoare triple {16551#(<= ~counter~0 4)} ~cond := #in~cond; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,734 INFO L290 TraceCheckUtils]: 114: Hoare triple {16551#(<= ~counter~0 4)} assume !(0 == ~cond); {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,734 INFO L290 TraceCheckUtils]: 115: Hoare triple {16551#(<= ~counter~0 4)} assume true; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,735 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {16551#(<= ~counter~0 4)} {16551#(<= ~counter~0 4)} #67#return; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,735 INFO L290 TraceCheckUtils]: 117: Hoare triple {16551#(<= ~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; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:22,735 INFO L290 TraceCheckUtils]: 118: Hoare triple {16551#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,736 INFO L290 TraceCheckUtils]: 119: Hoare triple {16636#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,736 INFO L272 TraceCheckUtils]: 120: Hoare triple {16636#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,736 INFO L290 TraceCheckUtils]: 121: Hoare triple {16636#(<= ~counter~0 5)} ~cond := #in~cond; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,736 INFO L290 TraceCheckUtils]: 122: Hoare triple {16636#(<= ~counter~0 5)} assume !(0 == ~cond); {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,737 INFO L290 TraceCheckUtils]: 123: Hoare triple {16636#(<= ~counter~0 5)} assume true; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,737 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {16636#(<= ~counter~0 5)} {16636#(<= ~counter~0 5)} #59#return; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,738 INFO L272 TraceCheckUtils]: 125: Hoare triple {16636#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,738 INFO L290 TraceCheckUtils]: 126: Hoare triple {16636#(<= ~counter~0 5)} ~cond := #in~cond; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,738 INFO L290 TraceCheckUtils]: 127: Hoare triple {16636#(<= ~counter~0 5)} assume !(0 == ~cond); {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,738 INFO L290 TraceCheckUtils]: 128: Hoare triple {16636#(<= ~counter~0 5)} assume true; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,739 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {16636#(<= ~counter~0 5)} {16636#(<= ~counter~0 5)} #61#return; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,739 INFO L272 TraceCheckUtils]: 130: Hoare triple {16636#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,739 INFO L290 TraceCheckUtils]: 131: Hoare triple {16636#(<= ~counter~0 5)} ~cond := #in~cond; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,739 INFO L290 TraceCheckUtils]: 132: Hoare triple {16636#(<= ~counter~0 5)} assume !(0 == ~cond); {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,740 INFO L290 TraceCheckUtils]: 133: Hoare triple {16636#(<= ~counter~0 5)} assume true; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,740 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {16636#(<= ~counter~0 5)} {16636#(<= ~counter~0 5)} #63#return; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,741 INFO L272 TraceCheckUtils]: 135: Hoare triple {16636#(<= ~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)); {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,741 INFO L290 TraceCheckUtils]: 136: Hoare triple {16636#(<= ~counter~0 5)} ~cond := #in~cond; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,741 INFO L290 TraceCheckUtils]: 137: Hoare triple {16636#(<= ~counter~0 5)} assume !(0 == ~cond); {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,741 INFO L290 TraceCheckUtils]: 138: Hoare triple {16636#(<= ~counter~0 5)} assume true; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,742 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {16636#(<= ~counter~0 5)} {16636#(<= ~counter~0 5)} #65#return; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,742 INFO L272 TraceCheckUtils]: 140: Hoare triple {16636#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,742 INFO L290 TraceCheckUtils]: 141: Hoare triple {16636#(<= ~counter~0 5)} ~cond := #in~cond; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,742 INFO L290 TraceCheckUtils]: 142: Hoare triple {16636#(<= ~counter~0 5)} assume !(0 == ~cond); {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,743 INFO L290 TraceCheckUtils]: 143: Hoare triple {16636#(<= ~counter~0 5)} assume true; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,743 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {16636#(<= ~counter~0 5)} {16636#(<= ~counter~0 5)} #67#return; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,743 INFO L290 TraceCheckUtils]: 145: Hoare triple {16636#(<= ~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; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:22,744 INFO L290 TraceCheckUtils]: 146: Hoare triple {16636#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,744 INFO L290 TraceCheckUtils]: 147: Hoare triple {16721#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,744 INFO L272 TraceCheckUtils]: 148: Hoare triple {16721#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,745 INFO L290 TraceCheckUtils]: 149: Hoare triple {16721#(<= ~counter~0 6)} ~cond := #in~cond; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,745 INFO L290 TraceCheckUtils]: 150: Hoare triple {16721#(<= ~counter~0 6)} assume !(0 == ~cond); {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,745 INFO L290 TraceCheckUtils]: 151: Hoare triple {16721#(<= ~counter~0 6)} assume true; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,745 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {16721#(<= ~counter~0 6)} {16721#(<= ~counter~0 6)} #59#return; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,746 INFO L272 TraceCheckUtils]: 153: Hoare triple {16721#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,746 INFO L290 TraceCheckUtils]: 154: Hoare triple {16721#(<= ~counter~0 6)} ~cond := #in~cond; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,746 INFO L290 TraceCheckUtils]: 155: Hoare triple {16721#(<= ~counter~0 6)} assume !(0 == ~cond); {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,747 INFO L290 TraceCheckUtils]: 156: Hoare triple {16721#(<= ~counter~0 6)} assume true; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,747 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {16721#(<= ~counter~0 6)} {16721#(<= ~counter~0 6)} #61#return; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,747 INFO L272 TraceCheckUtils]: 158: Hoare triple {16721#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,748 INFO L290 TraceCheckUtils]: 159: Hoare triple {16721#(<= ~counter~0 6)} ~cond := #in~cond; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,748 INFO L290 TraceCheckUtils]: 160: Hoare triple {16721#(<= ~counter~0 6)} assume !(0 == ~cond); {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,748 INFO L290 TraceCheckUtils]: 161: Hoare triple {16721#(<= ~counter~0 6)} assume true; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,749 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {16721#(<= ~counter~0 6)} {16721#(<= ~counter~0 6)} #63#return; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,749 INFO L272 TraceCheckUtils]: 163: Hoare triple {16721#(<= ~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)); {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,749 INFO L290 TraceCheckUtils]: 164: Hoare triple {16721#(<= ~counter~0 6)} ~cond := #in~cond; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,749 INFO L290 TraceCheckUtils]: 165: Hoare triple {16721#(<= ~counter~0 6)} assume !(0 == ~cond); {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,750 INFO L290 TraceCheckUtils]: 166: Hoare triple {16721#(<= ~counter~0 6)} assume true; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,750 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {16721#(<= ~counter~0 6)} {16721#(<= ~counter~0 6)} #65#return; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,750 INFO L272 TraceCheckUtils]: 168: Hoare triple {16721#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,751 INFO L290 TraceCheckUtils]: 169: Hoare triple {16721#(<= ~counter~0 6)} ~cond := #in~cond; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,751 INFO L290 TraceCheckUtils]: 170: Hoare triple {16721#(<= ~counter~0 6)} assume !(0 == ~cond); {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,751 INFO L290 TraceCheckUtils]: 171: Hoare triple {16721#(<= ~counter~0 6)} assume true; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,752 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {16721#(<= ~counter~0 6)} {16721#(<= ~counter~0 6)} #67#return; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,752 INFO L290 TraceCheckUtils]: 173: Hoare triple {16721#(<= ~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; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:22,752 INFO L290 TraceCheckUtils]: 174: Hoare triple {16721#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16806#(<= |main_#t~post5| 6)} is VALID [2022-04-28 11:17:22,752 INFO L290 TraceCheckUtils]: 175: Hoare triple {16806#(<= |main_#t~post5| 6)} assume !(#t~post5 < 10);havoc #t~post5; {16273#false} is VALID [2022-04-28 11:17:22,752 INFO L272 TraceCheckUtils]: 176: Hoare triple {16273#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16273#false} is VALID [2022-04-28 11:17:22,753 INFO L290 TraceCheckUtils]: 177: Hoare triple {16273#false} ~cond := #in~cond; {16273#false} is VALID [2022-04-28 11:17:22,753 INFO L290 TraceCheckUtils]: 178: Hoare triple {16273#false} assume !(0 == ~cond); {16273#false} is VALID [2022-04-28 11:17:22,753 INFO L290 TraceCheckUtils]: 179: Hoare triple {16273#false} assume true; {16273#false} is VALID [2022-04-28 11:17:22,753 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {16273#false} {16273#false} #69#return; {16273#false} is VALID [2022-04-28 11:17:22,753 INFO L272 TraceCheckUtils]: 181: Hoare triple {16273#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {16273#false} is VALID [2022-04-28 11:17:22,753 INFO L290 TraceCheckUtils]: 182: Hoare triple {16273#false} ~cond := #in~cond; {16273#false} is VALID [2022-04-28 11:17:22,753 INFO L290 TraceCheckUtils]: 183: Hoare triple {16273#false} assume 0 == ~cond; {16273#false} is VALID [2022-04-28 11:17:22,753 INFO L290 TraceCheckUtils]: 184: Hoare triple {16273#false} assume !false; {16273#false} is VALID [2022-04-28 11:17:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2054 backedges. 180 proven. 1632 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-04-28 11:17:22,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:23,303 INFO L290 TraceCheckUtils]: 184: Hoare triple {16273#false} assume !false; {16273#false} is VALID [2022-04-28 11:17:23,303 INFO L290 TraceCheckUtils]: 183: Hoare triple {16273#false} assume 0 == ~cond; {16273#false} is VALID [2022-04-28 11:17:23,303 INFO L290 TraceCheckUtils]: 182: Hoare triple {16273#false} ~cond := #in~cond; {16273#false} is VALID [2022-04-28 11:17:23,303 INFO L272 TraceCheckUtils]: 181: Hoare triple {16273#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {16273#false} is VALID [2022-04-28 11:17:23,303 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {16272#true} {16273#false} #69#return; {16273#false} is VALID [2022-04-28 11:17:23,303 INFO L290 TraceCheckUtils]: 179: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,303 INFO L290 TraceCheckUtils]: 178: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,303 INFO L290 TraceCheckUtils]: 177: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,304 INFO L272 TraceCheckUtils]: 176: Hoare triple {16273#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,304 INFO L290 TraceCheckUtils]: 175: Hoare triple {16864#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {16273#false} is VALID [2022-04-28 11:17:23,304 INFO L290 TraceCheckUtils]: 174: Hoare triple {16868#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16864#(< |main_#t~post5| 10)} is VALID [2022-04-28 11:17:23,304 INFO L290 TraceCheckUtils]: 173: Hoare triple {16868#(< ~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; {16868#(< ~counter~0 10)} is VALID [2022-04-28 11:17:23,305 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {16272#true} {16868#(< ~counter~0 10)} #67#return; {16868#(< ~counter~0 10)} is VALID [2022-04-28 11:17:23,305 INFO L290 TraceCheckUtils]: 171: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,305 INFO L290 TraceCheckUtils]: 170: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,305 INFO L290 TraceCheckUtils]: 169: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,305 INFO L272 TraceCheckUtils]: 168: Hoare triple {16868#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,305 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {16272#true} {16868#(< ~counter~0 10)} #65#return; {16868#(< ~counter~0 10)} is VALID [2022-04-28 11:17:23,305 INFO L290 TraceCheckUtils]: 166: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,306 INFO L290 TraceCheckUtils]: 165: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,306 INFO L290 TraceCheckUtils]: 164: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,306 INFO L272 TraceCheckUtils]: 163: Hoare triple {16868#(< ~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)); {16272#true} is VALID [2022-04-28 11:17:23,306 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {16272#true} {16868#(< ~counter~0 10)} #63#return; {16868#(< ~counter~0 10)} is VALID [2022-04-28 11:17:23,307 INFO L290 TraceCheckUtils]: 161: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,307 INFO L290 TraceCheckUtils]: 160: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,307 INFO L290 TraceCheckUtils]: 159: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,307 INFO L272 TraceCheckUtils]: 158: Hoare triple {16868#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,307 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {16272#true} {16868#(< ~counter~0 10)} #61#return; {16868#(< ~counter~0 10)} is VALID [2022-04-28 11:17:23,307 INFO L290 TraceCheckUtils]: 156: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,307 INFO L290 TraceCheckUtils]: 155: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,307 INFO L290 TraceCheckUtils]: 154: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,307 INFO L272 TraceCheckUtils]: 153: Hoare triple {16868#(< ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,308 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {16272#true} {16868#(< ~counter~0 10)} #59#return; {16868#(< ~counter~0 10)} is VALID [2022-04-28 11:17:23,308 INFO L290 TraceCheckUtils]: 151: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,308 INFO L290 TraceCheckUtils]: 150: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,308 INFO L290 TraceCheckUtils]: 149: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,308 INFO L272 TraceCheckUtils]: 148: Hoare triple {16868#(< ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,308 INFO L290 TraceCheckUtils]: 147: Hoare triple {16868#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {16868#(< ~counter~0 10)} is VALID [2022-04-28 11:17:23,309 INFO L290 TraceCheckUtils]: 146: Hoare triple {16953#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16868#(< ~counter~0 10)} is VALID [2022-04-28 11:17:23,309 INFO L290 TraceCheckUtils]: 145: Hoare triple {16953#(< ~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; {16953#(< ~counter~0 9)} is VALID [2022-04-28 11:17:23,310 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {16272#true} {16953#(< ~counter~0 9)} #67#return; {16953#(< ~counter~0 9)} is VALID [2022-04-28 11:17:23,310 INFO L290 TraceCheckUtils]: 143: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,310 INFO L290 TraceCheckUtils]: 142: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,310 INFO L290 TraceCheckUtils]: 141: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,310 INFO L272 TraceCheckUtils]: 140: Hoare triple {16953#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,310 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {16272#true} {16953#(< ~counter~0 9)} #65#return; {16953#(< ~counter~0 9)} is VALID [2022-04-28 11:17:23,310 INFO L290 TraceCheckUtils]: 138: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,311 INFO L290 TraceCheckUtils]: 137: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,311 INFO L290 TraceCheckUtils]: 136: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,311 INFO L272 TraceCheckUtils]: 135: Hoare triple {16953#(< ~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)); {16272#true} is VALID [2022-04-28 11:17:23,311 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {16272#true} {16953#(< ~counter~0 9)} #63#return; {16953#(< ~counter~0 9)} is VALID [2022-04-28 11:17:23,311 INFO L290 TraceCheckUtils]: 133: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,311 INFO L290 TraceCheckUtils]: 132: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,311 INFO L290 TraceCheckUtils]: 131: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,311 INFO L272 TraceCheckUtils]: 130: Hoare triple {16953#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,312 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {16272#true} {16953#(< ~counter~0 9)} #61#return; {16953#(< ~counter~0 9)} is VALID [2022-04-28 11:17:23,312 INFO L290 TraceCheckUtils]: 128: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,312 INFO L290 TraceCheckUtils]: 127: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,312 INFO L290 TraceCheckUtils]: 126: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,312 INFO L272 TraceCheckUtils]: 125: Hoare triple {16953#(< ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,312 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {16272#true} {16953#(< ~counter~0 9)} #59#return; {16953#(< ~counter~0 9)} is VALID [2022-04-28 11:17:23,312 INFO L290 TraceCheckUtils]: 123: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,312 INFO L290 TraceCheckUtils]: 122: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,312 INFO L290 TraceCheckUtils]: 121: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,312 INFO L272 TraceCheckUtils]: 120: Hoare triple {16953#(< ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,314 INFO L290 TraceCheckUtils]: 119: Hoare triple {16953#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {16953#(< ~counter~0 9)} is VALID [2022-04-28 11:17:23,315 INFO L290 TraceCheckUtils]: 118: Hoare triple {17038#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16953#(< ~counter~0 9)} is VALID [2022-04-28 11:17:23,315 INFO L290 TraceCheckUtils]: 117: Hoare triple {17038#(< ~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; {17038#(< ~counter~0 8)} is VALID [2022-04-28 11:17:23,316 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {16272#true} {17038#(< ~counter~0 8)} #67#return; {17038#(< ~counter~0 8)} is VALID [2022-04-28 11:17:23,316 INFO L290 TraceCheckUtils]: 115: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,316 INFO L290 TraceCheckUtils]: 114: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,316 INFO L290 TraceCheckUtils]: 113: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,316 INFO L272 TraceCheckUtils]: 112: Hoare triple {17038#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,316 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {16272#true} {17038#(< ~counter~0 8)} #65#return; {17038#(< ~counter~0 8)} is VALID [2022-04-28 11:17:23,316 INFO L290 TraceCheckUtils]: 110: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,316 INFO L290 TraceCheckUtils]: 109: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,316 INFO L290 TraceCheckUtils]: 108: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,316 INFO L272 TraceCheckUtils]: 107: Hoare triple {17038#(< ~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)); {16272#true} is VALID [2022-04-28 11:17:23,317 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {16272#true} {17038#(< ~counter~0 8)} #63#return; {17038#(< ~counter~0 8)} is VALID [2022-04-28 11:17:23,317 INFO L290 TraceCheckUtils]: 105: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,317 INFO L290 TraceCheckUtils]: 104: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,317 INFO L290 TraceCheckUtils]: 103: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,317 INFO L272 TraceCheckUtils]: 102: Hoare triple {17038#(< ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,317 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {16272#true} {17038#(< ~counter~0 8)} #61#return; {17038#(< ~counter~0 8)} is VALID [2022-04-28 11:17:23,317 INFO L290 TraceCheckUtils]: 100: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,318 INFO L290 TraceCheckUtils]: 99: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,318 INFO L290 TraceCheckUtils]: 98: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,318 INFO L272 TraceCheckUtils]: 97: Hoare triple {17038#(< ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,318 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {16272#true} {17038#(< ~counter~0 8)} #59#return; {17038#(< ~counter~0 8)} is VALID [2022-04-28 11:17:23,318 INFO L290 TraceCheckUtils]: 95: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,318 INFO L290 TraceCheckUtils]: 94: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,318 INFO L290 TraceCheckUtils]: 93: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,318 INFO L272 TraceCheckUtils]: 92: Hoare triple {17038#(< ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,318 INFO L290 TraceCheckUtils]: 91: Hoare triple {17038#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {17038#(< ~counter~0 8)} is VALID [2022-04-28 11:17:23,319 INFO L290 TraceCheckUtils]: 90: Hoare triple {16721#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17038#(< ~counter~0 8)} is VALID [2022-04-28 11:17:23,319 INFO L290 TraceCheckUtils]: 89: Hoare triple {16721#(<= ~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; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:23,320 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {16272#true} {16721#(<= ~counter~0 6)} #67#return; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:23,320 INFO L290 TraceCheckUtils]: 87: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,320 INFO L290 TraceCheckUtils]: 86: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,320 INFO L290 TraceCheckUtils]: 85: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,320 INFO L272 TraceCheckUtils]: 84: Hoare triple {16721#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,320 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {16272#true} {16721#(<= ~counter~0 6)} #65#return; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:23,320 INFO L290 TraceCheckUtils]: 82: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,320 INFO L290 TraceCheckUtils]: 81: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,320 INFO L290 TraceCheckUtils]: 80: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,320 INFO L272 TraceCheckUtils]: 79: Hoare triple {16721#(<= ~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)); {16272#true} is VALID [2022-04-28 11:17:23,321 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {16272#true} {16721#(<= ~counter~0 6)} #63#return; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:23,321 INFO L290 TraceCheckUtils]: 77: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,321 INFO L290 TraceCheckUtils]: 76: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,321 INFO L290 TraceCheckUtils]: 75: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,321 INFO L272 TraceCheckUtils]: 74: Hoare triple {16721#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,321 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16272#true} {16721#(<= ~counter~0 6)} #61#return; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:23,321 INFO L290 TraceCheckUtils]: 72: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,322 INFO L290 TraceCheckUtils]: 71: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,322 INFO L290 TraceCheckUtils]: 70: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,322 INFO L272 TraceCheckUtils]: 69: Hoare triple {16721#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,322 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {16272#true} {16721#(<= ~counter~0 6)} #59#return; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:23,322 INFO L290 TraceCheckUtils]: 67: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,322 INFO L290 TraceCheckUtils]: 66: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,322 INFO L290 TraceCheckUtils]: 65: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,322 INFO L272 TraceCheckUtils]: 64: Hoare triple {16721#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,322 INFO L290 TraceCheckUtils]: 63: Hoare triple {16721#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:23,323 INFO L290 TraceCheckUtils]: 62: Hoare triple {16636#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16721#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:23,323 INFO L290 TraceCheckUtils]: 61: Hoare triple {16636#(<= ~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; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:23,324 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16272#true} {16636#(<= ~counter~0 5)} #67#return; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:23,324 INFO L290 TraceCheckUtils]: 59: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,324 INFO L290 TraceCheckUtils]: 58: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,324 INFO L290 TraceCheckUtils]: 57: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,324 INFO L272 TraceCheckUtils]: 56: Hoare triple {16636#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,324 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16272#true} {16636#(<= ~counter~0 5)} #65#return; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:23,324 INFO L290 TraceCheckUtils]: 54: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,324 INFO L290 TraceCheckUtils]: 53: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,324 INFO L290 TraceCheckUtils]: 52: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,324 INFO L272 TraceCheckUtils]: 51: Hoare triple {16636#(<= ~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)); {16272#true} is VALID [2022-04-28 11:17:23,325 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16272#true} {16636#(<= ~counter~0 5)} #63#return; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:23,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,325 INFO L272 TraceCheckUtils]: 46: Hoare triple {16636#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,325 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16272#true} {16636#(<= ~counter~0 5)} #61#return; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:23,326 INFO L290 TraceCheckUtils]: 44: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,326 INFO L290 TraceCheckUtils]: 43: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,326 INFO L272 TraceCheckUtils]: 41: Hoare triple {16636#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,326 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16272#true} {16636#(<= ~counter~0 5)} #59#return; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:23,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,326 INFO L272 TraceCheckUtils]: 36: Hoare triple {16636#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {16636#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:23,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {16551#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16636#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:23,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {16551#(<= ~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; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:23,328 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16272#true} {16551#(<= ~counter~0 4)} #67#return; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:23,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,328 INFO L272 TraceCheckUtils]: 28: Hoare triple {16551#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,328 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16272#true} {16551#(<= ~counter~0 4)} #65#return; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:23,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,328 INFO L272 TraceCheckUtils]: 23: Hoare triple {16551#(<= ~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)); {16272#true} is VALID [2022-04-28 11:17:23,329 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16272#true} {16551#(<= ~counter~0 4)} #63#return; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:23,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,329 INFO L272 TraceCheckUtils]: 18: Hoare triple {16551#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,329 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16272#true} {16551#(<= ~counter~0 4)} #61#return; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:23,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,330 INFO L272 TraceCheckUtils]: 13: Hoare triple {16551#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,330 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16272#true} {16551#(<= ~counter~0 4)} #59#return; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:23,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {16272#true} assume true; {16272#true} is VALID [2022-04-28 11:17:23,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {16272#true} assume !(0 == ~cond); {16272#true} is VALID [2022-04-28 11:17:23,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {16272#true} ~cond := #in~cond; {16272#true} is VALID [2022-04-28 11:17:23,330 INFO L272 TraceCheckUtils]: 8: Hoare triple {16551#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16272#true} is VALID [2022-04-28 11:17:23,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {16551#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:23,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {16466#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16551#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:23,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {16466#(<= ~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; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:23,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {16466#(<= ~counter~0 3)} call #t~ret6 := main(); {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:23,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16466#(<= ~counter~0 3)} {16272#true} #81#return; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:23,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {16466#(<= ~counter~0 3)} assume true; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:23,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {16272#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; {16466#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:23,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {16272#true} call ULTIMATE.init(); {16272#true} is VALID [2022-04-28 11:17:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2054 backedges. 62 proven. 132 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2022-04-28 11:17:23,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:23,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157330251] [2022-04-28 11:17:23,333 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:23,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652179327] [2022-04-28 11:17:23,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652179327] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:17:23,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:17:23,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 11:17:23,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:23,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [928707411] [2022-04-28 11:17:23,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [928707411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:23,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:23,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:17:23,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336031527] [2022-04-28 11:17:23,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:23,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 9 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 185 [2022-04-28 11:17:23,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:23,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 9 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2022-04-28 11:17:23,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:23,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:17:23,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:23,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:17:23,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:17:23,430 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 9 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2022-04-28 11:17:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:24,565 INFO L93 Difference]: Finished difference Result 164 states and 185 transitions. [2022-04-28 11:17:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 11:17:24,565 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 9 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 185 [2022-04-28 11:17:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 9 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2022-04-28 11:17:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 143 transitions. [2022-04-28 11:17:24,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 9 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2022-04-28 11:17:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 143 transitions. [2022-04-28 11:17:24,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 143 transitions. [2022-04-28 11:17:24,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:24,697 INFO L225 Difference]: With dead ends: 164 [2022-04-28 11:17:24,697 INFO L226 Difference]: Without dead ends: 150 [2022-04-28 11:17:24,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-28 11:17:24,697 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:24,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 200 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:17:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-28 11:17:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-04-28 11:17:24,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:24,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 150 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 22 states have call predecessors, (41), 21 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-28 11:17:24,873 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 150 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 22 states have call predecessors, (41), 21 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-28 11:17:24,873 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 150 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 22 states have call predecessors, (41), 21 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-28 11:17:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:24,876 INFO L93 Difference]: Finished difference Result 150 states and 169 transitions. [2022-04-28 11:17:24,876 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2022-04-28 11:17:24,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:24,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:24,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 22 states have call predecessors, (41), 21 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 150 states. [2022-04-28 11:17:24,877 INFO L87 Difference]: Start difference. First operand has 150 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 22 states have call predecessors, (41), 21 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 150 states. [2022-04-28 11:17:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:24,878 INFO L93 Difference]: Finished difference Result 150 states and 169 transitions. [2022-04-28 11:17:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2022-04-28 11:17:24,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:24,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:24,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:24,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 22 states have call predecessors, (41), 21 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-28 11:17:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 169 transitions. [2022-04-28 11:17:24,881 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 169 transitions. Word has length 185 [2022-04-28 11:17:24,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:24,881 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 169 transitions. [2022-04-28 11:17:24,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 9 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2022-04-28 11:17:24,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 169 transitions. [2022-04-28 11:17:30,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 168 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:30,609 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2022-04-28 11:17:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-04-28 11:17:30,610 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:30,610 INFO L195 NwaCegarLoop]: trace histogram [37, 36, 36, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:30,617 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-28 11:17:30,817 WARN L477 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-28 11:17:30,818 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:30,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash -654931098, now seen corresponding path program 13 times [2022-04-28 11:17:30,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:30,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1410526374] [2022-04-28 11:17:31,039 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:31,040 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:31,040 INFO L85 PathProgramCache]: Analyzing trace with hash -654931098, now seen corresponding path program 14 times [2022-04-28 11:17:31,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:31,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57773855] [2022-04-28 11:17:31,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:31,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:31,058 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:31,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2033140503] [2022-04-28 11:17:31,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:17:31,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:31,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:31,059 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-28 11:17:31,061 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-28 11:17:31,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:17:31,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:31,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 11:17:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:31,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:31,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {18335#true} call ULTIMATE.init(); {18335#true} is VALID [2022-04-28 11:17:31,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {18335#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; {18343#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:31,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {18343#(<= ~counter~0 0)} assume true; {18343#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:31,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18343#(<= ~counter~0 0)} {18335#true} #81#return; {18343#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:31,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {18343#(<= ~counter~0 0)} call #t~ret6 := main(); {18343#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:31,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {18343#(<= ~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; {18343#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:31,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {18343#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {18359#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,906 INFO L272 TraceCheckUtils]: 8: Hoare triple {18359#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {18359#(<= ~counter~0 1)} ~cond := #in~cond; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {18359#(<= ~counter~0 1)} assume !(0 == ~cond); {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {18359#(<= ~counter~0 1)} assume true; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,907 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18359#(<= ~counter~0 1)} {18359#(<= ~counter~0 1)} #59#return; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,907 INFO L272 TraceCheckUtils]: 13: Hoare triple {18359#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {18359#(<= ~counter~0 1)} ~cond := #in~cond; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {18359#(<= ~counter~0 1)} assume !(0 == ~cond); {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {18359#(<= ~counter~0 1)} assume true; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,909 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18359#(<= ~counter~0 1)} {18359#(<= ~counter~0 1)} #61#return; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,909 INFO L272 TraceCheckUtils]: 18: Hoare triple {18359#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {18359#(<= ~counter~0 1)} ~cond := #in~cond; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {18359#(<= ~counter~0 1)} assume !(0 == ~cond); {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {18359#(<= ~counter~0 1)} assume true; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,910 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18359#(<= ~counter~0 1)} {18359#(<= ~counter~0 1)} #63#return; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,911 INFO L272 TraceCheckUtils]: 23: Hoare triple {18359#(<= ~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)); {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {18359#(<= ~counter~0 1)} ~cond := #in~cond; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {18359#(<= ~counter~0 1)} assume !(0 == ~cond); {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {18359#(<= ~counter~0 1)} assume true; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,912 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {18359#(<= ~counter~0 1)} {18359#(<= ~counter~0 1)} #65#return; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,912 INFO L272 TraceCheckUtils]: 28: Hoare triple {18359#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {18359#(<= ~counter~0 1)} ~cond := #in~cond; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {18359#(<= ~counter~0 1)} assume !(0 == ~cond); {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {18359#(<= ~counter~0 1)} assume true; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,913 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18359#(<= ~counter~0 1)} {18359#(<= ~counter~0 1)} #67#return; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {18359#(<= ~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; {18359#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:31,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {18359#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {18444#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,915 INFO L272 TraceCheckUtils]: 36: Hoare triple {18444#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {18444#(<= ~counter~0 2)} ~cond := #in~cond; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {18444#(<= ~counter~0 2)} assume !(0 == ~cond); {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {18444#(<= ~counter~0 2)} assume true; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,916 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18444#(<= ~counter~0 2)} {18444#(<= ~counter~0 2)} #59#return; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,916 INFO L272 TraceCheckUtils]: 41: Hoare triple {18444#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {18444#(<= ~counter~0 2)} ~cond := #in~cond; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {18444#(<= ~counter~0 2)} assume !(0 == ~cond); {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {18444#(<= ~counter~0 2)} assume true; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,917 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {18444#(<= ~counter~0 2)} {18444#(<= ~counter~0 2)} #61#return; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,918 INFO L272 TraceCheckUtils]: 46: Hoare triple {18444#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,918 INFO L290 TraceCheckUtils]: 47: Hoare triple {18444#(<= ~counter~0 2)} ~cond := #in~cond; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {18444#(<= ~counter~0 2)} assume !(0 == ~cond); {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {18444#(<= ~counter~0 2)} assume true; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,919 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18444#(<= ~counter~0 2)} {18444#(<= ~counter~0 2)} #63#return; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,919 INFO L272 TraceCheckUtils]: 51: Hoare triple {18444#(<= ~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)); {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,919 INFO L290 TraceCheckUtils]: 52: Hoare triple {18444#(<= ~counter~0 2)} ~cond := #in~cond; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,919 INFO L290 TraceCheckUtils]: 53: Hoare triple {18444#(<= ~counter~0 2)} assume !(0 == ~cond); {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,920 INFO L290 TraceCheckUtils]: 54: Hoare triple {18444#(<= ~counter~0 2)} assume true; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,920 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18444#(<= ~counter~0 2)} {18444#(<= ~counter~0 2)} #65#return; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,920 INFO L272 TraceCheckUtils]: 56: Hoare triple {18444#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,921 INFO L290 TraceCheckUtils]: 57: Hoare triple {18444#(<= ~counter~0 2)} ~cond := #in~cond; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,921 INFO L290 TraceCheckUtils]: 58: Hoare triple {18444#(<= ~counter~0 2)} assume !(0 == ~cond); {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,921 INFO L290 TraceCheckUtils]: 59: Hoare triple {18444#(<= ~counter~0 2)} assume true; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,922 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18444#(<= ~counter~0 2)} {18444#(<= ~counter~0 2)} #67#return; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,922 INFO L290 TraceCheckUtils]: 61: Hoare triple {18444#(<= ~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; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:31,922 INFO L290 TraceCheckUtils]: 62: Hoare triple {18444#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,922 INFO L290 TraceCheckUtils]: 63: Hoare triple {18529#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,923 INFO L272 TraceCheckUtils]: 64: Hoare triple {18529#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,923 INFO L290 TraceCheckUtils]: 65: Hoare triple {18529#(<= ~counter~0 3)} ~cond := #in~cond; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,923 INFO L290 TraceCheckUtils]: 66: Hoare triple {18529#(<= ~counter~0 3)} assume !(0 == ~cond); {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,923 INFO L290 TraceCheckUtils]: 67: Hoare triple {18529#(<= ~counter~0 3)} assume true; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,924 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18529#(<= ~counter~0 3)} {18529#(<= ~counter~0 3)} #59#return; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,924 INFO L272 TraceCheckUtils]: 69: Hoare triple {18529#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,924 INFO L290 TraceCheckUtils]: 70: Hoare triple {18529#(<= ~counter~0 3)} ~cond := #in~cond; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,925 INFO L290 TraceCheckUtils]: 71: Hoare triple {18529#(<= ~counter~0 3)} assume !(0 == ~cond); {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,925 INFO L290 TraceCheckUtils]: 72: Hoare triple {18529#(<= ~counter~0 3)} assume true; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,925 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {18529#(<= ~counter~0 3)} {18529#(<= ~counter~0 3)} #61#return; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,926 INFO L272 TraceCheckUtils]: 74: Hoare triple {18529#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,926 INFO L290 TraceCheckUtils]: 75: Hoare triple {18529#(<= ~counter~0 3)} ~cond := #in~cond; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,926 INFO L290 TraceCheckUtils]: 76: Hoare triple {18529#(<= ~counter~0 3)} assume !(0 == ~cond); {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,926 INFO L290 TraceCheckUtils]: 77: Hoare triple {18529#(<= ~counter~0 3)} assume true; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,927 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {18529#(<= ~counter~0 3)} {18529#(<= ~counter~0 3)} #63#return; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,927 INFO L272 TraceCheckUtils]: 79: Hoare triple {18529#(<= ~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)); {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,927 INFO L290 TraceCheckUtils]: 80: Hoare triple {18529#(<= ~counter~0 3)} ~cond := #in~cond; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,928 INFO L290 TraceCheckUtils]: 81: Hoare triple {18529#(<= ~counter~0 3)} assume !(0 == ~cond); {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,928 INFO L290 TraceCheckUtils]: 82: Hoare triple {18529#(<= ~counter~0 3)} assume true; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,928 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {18529#(<= ~counter~0 3)} {18529#(<= ~counter~0 3)} #65#return; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,929 INFO L272 TraceCheckUtils]: 84: Hoare triple {18529#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,929 INFO L290 TraceCheckUtils]: 85: Hoare triple {18529#(<= ~counter~0 3)} ~cond := #in~cond; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,929 INFO L290 TraceCheckUtils]: 86: Hoare triple {18529#(<= ~counter~0 3)} assume !(0 == ~cond); {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,929 INFO L290 TraceCheckUtils]: 87: Hoare triple {18529#(<= ~counter~0 3)} assume true; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,930 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {18529#(<= ~counter~0 3)} {18529#(<= ~counter~0 3)} #67#return; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,930 INFO L290 TraceCheckUtils]: 89: Hoare triple {18529#(<= ~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; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:31,930 INFO L290 TraceCheckUtils]: 90: Hoare triple {18529#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,931 INFO L290 TraceCheckUtils]: 91: Hoare triple {18614#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,931 INFO L272 TraceCheckUtils]: 92: Hoare triple {18614#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,931 INFO L290 TraceCheckUtils]: 93: Hoare triple {18614#(<= ~counter~0 4)} ~cond := #in~cond; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,931 INFO L290 TraceCheckUtils]: 94: Hoare triple {18614#(<= ~counter~0 4)} assume !(0 == ~cond); {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,932 INFO L290 TraceCheckUtils]: 95: Hoare triple {18614#(<= ~counter~0 4)} assume true; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,932 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {18614#(<= ~counter~0 4)} {18614#(<= ~counter~0 4)} #59#return; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,932 INFO L272 TraceCheckUtils]: 97: Hoare triple {18614#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,933 INFO L290 TraceCheckUtils]: 98: Hoare triple {18614#(<= ~counter~0 4)} ~cond := #in~cond; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,933 INFO L290 TraceCheckUtils]: 99: Hoare triple {18614#(<= ~counter~0 4)} assume !(0 == ~cond); {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,933 INFO L290 TraceCheckUtils]: 100: Hoare triple {18614#(<= ~counter~0 4)} assume true; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,933 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {18614#(<= ~counter~0 4)} {18614#(<= ~counter~0 4)} #61#return; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,934 INFO L272 TraceCheckUtils]: 102: Hoare triple {18614#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,934 INFO L290 TraceCheckUtils]: 103: Hoare triple {18614#(<= ~counter~0 4)} ~cond := #in~cond; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,934 INFO L290 TraceCheckUtils]: 104: Hoare triple {18614#(<= ~counter~0 4)} assume !(0 == ~cond); {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,935 INFO L290 TraceCheckUtils]: 105: Hoare triple {18614#(<= ~counter~0 4)} assume true; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,935 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {18614#(<= ~counter~0 4)} {18614#(<= ~counter~0 4)} #63#return; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,935 INFO L272 TraceCheckUtils]: 107: Hoare triple {18614#(<= ~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)); {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,936 INFO L290 TraceCheckUtils]: 108: Hoare triple {18614#(<= ~counter~0 4)} ~cond := #in~cond; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,936 INFO L290 TraceCheckUtils]: 109: Hoare triple {18614#(<= ~counter~0 4)} assume !(0 == ~cond); {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,936 INFO L290 TraceCheckUtils]: 110: Hoare triple {18614#(<= ~counter~0 4)} assume true; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,936 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {18614#(<= ~counter~0 4)} {18614#(<= ~counter~0 4)} #65#return; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,937 INFO L272 TraceCheckUtils]: 112: Hoare triple {18614#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,937 INFO L290 TraceCheckUtils]: 113: Hoare triple {18614#(<= ~counter~0 4)} ~cond := #in~cond; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,937 INFO L290 TraceCheckUtils]: 114: Hoare triple {18614#(<= ~counter~0 4)} assume !(0 == ~cond); {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,937 INFO L290 TraceCheckUtils]: 115: Hoare triple {18614#(<= ~counter~0 4)} assume true; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,938 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {18614#(<= ~counter~0 4)} {18614#(<= ~counter~0 4)} #67#return; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,938 INFO L290 TraceCheckUtils]: 117: Hoare triple {18614#(<= ~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; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:31,938 INFO L290 TraceCheckUtils]: 118: Hoare triple {18614#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,939 INFO L290 TraceCheckUtils]: 119: Hoare triple {18699#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,939 INFO L272 TraceCheckUtils]: 120: Hoare triple {18699#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,939 INFO L290 TraceCheckUtils]: 121: Hoare triple {18699#(<= ~counter~0 5)} ~cond := #in~cond; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,940 INFO L290 TraceCheckUtils]: 122: Hoare triple {18699#(<= ~counter~0 5)} assume !(0 == ~cond); {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,940 INFO L290 TraceCheckUtils]: 123: Hoare triple {18699#(<= ~counter~0 5)} assume true; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,940 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {18699#(<= ~counter~0 5)} {18699#(<= ~counter~0 5)} #59#return; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,941 INFO L272 TraceCheckUtils]: 125: Hoare triple {18699#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,941 INFO L290 TraceCheckUtils]: 126: Hoare triple {18699#(<= ~counter~0 5)} ~cond := #in~cond; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,941 INFO L290 TraceCheckUtils]: 127: Hoare triple {18699#(<= ~counter~0 5)} assume !(0 == ~cond); {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,941 INFO L290 TraceCheckUtils]: 128: Hoare triple {18699#(<= ~counter~0 5)} assume true; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,942 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {18699#(<= ~counter~0 5)} {18699#(<= ~counter~0 5)} #61#return; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,942 INFO L272 TraceCheckUtils]: 130: Hoare triple {18699#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,942 INFO L290 TraceCheckUtils]: 131: Hoare triple {18699#(<= ~counter~0 5)} ~cond := #in~cond; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,942 INFO L290 TraceCheckUtils]: 132: Hoare triple {18699#(<= ~counter~0 5)} assume !(0 == ~cond); {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,943 INFO L290 TraceCheckUtils]: 133: Hoare triple {18699#(<= ~counter~0 5)} assume true; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,943 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {18699#(<= ~counter~0 5)} {18699#(<= ~counter~0 5)} #63#return; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,943 INFO L272 TraceCheckUtils]: 135: Hoare triple {18699#(<= ~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)); {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,944 INFO L290 TraceCheckUtils]: 136: Hoare triple {18699#(<= ~counter~0 5)} ~cond := #in~cond; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,944 INFO L290 TraceCheckUtils]: 137: Hoare triple {18699#(<= ~counter~0 5)} assume !(0 == ~cond); {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,944 INFO L290 TraceCheckUtils]: 138: Hoare triple {18699#(<= ~counter~0 5)} assume true; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,945 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {18699#(<= ~counter~0 5)} {18699#(<= ~counter~0 5)} #65#return; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,945 INFO L272 TraceCheckUtils]: 140: Hoare triple {18699#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,945 INFO L290 TraceCheckUtils]: 141: Hoare triple {18699#(<= ~counter~0 5)} ~cond := #in~cond; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,945 INFO L290 TraceCheckUtils]: 142: Hoare triple {18699#(<= ~counter~0 5)} assume !(0 == ~cond); {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,946 INFO L290 TraceCheckUtils]: 143: Hoare triple {18699#(<= ~counter~0 5)} assume true; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,946 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {18699#(<= ~counter~0 5)} {18699#(<= ~counter~0 5)} #67#return; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,946 INFO L290 TraceCheckUtils]: 145: Hoare triple {18699#(<= ~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; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:31,947 INFO L290 TraceCheckUtils]: 146: Hoare triple {18699#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,947 INFO L290 TraceCheckUtils]: 147: Hoare triple {18784#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,947 INFO L272 TraceCheckUtils]: 148: Hoare triple {18784#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,947 INFO L290 TraceCheckUtils]: 149: Hoare triple {18784#(<= ~counter~0 6)} ~cond := #in~cond; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,948 INFO L290 TraceCheckUtils]: 150: Hoare triple {18784#(<= ~counter~0 6)} assume !(0 == ~cond); {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,948 INFO L290 TraceCheckUtils]: 151: Hoare triple {18784#(<= ~counter~0 6)} assume true; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,948 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {18784#(<= ~counter~0 6)} {18784#(<= ~counter~0 6)} #59#return; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,949 INFO L272 TraceCheckUtils]: 153: Hoare triple {18784#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,949 INFO L290 TraceCheckUtils]: 154: Hoare triple {18784#(<= ~counter~0 6)} ~cond := #in~cond; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,949 INFO L290 TraceCheckUtils]: 155: Hoare triple {18784#(<= ~counter~0 6)} assume !(0 == ~cond); {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,949 INFO L290 TraceCheckUtils]: 156: Hoare triple {18784#(<= ~counter~0 6)} assume true; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,950 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {18784#(<= ~counter~0 6)} {18784#(<= ~counter~0 6)} #61#return; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,950 INFO L272 TraceCheckUtils]: 158: Hoare triple {18784#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,950 INFO L290 TraceCheckUtils]: 159: Hoare triple {18784#(<= ~counter~0 6)} ~cond := #in~cond; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,951 INFO L290 TraceCheckUtils]: 160: Hoare triple {18784#(<= ~counter~0 6)} assume !(0 == ~cond); {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,951 INFO L290 TraceCheckUtils]: 161: Hoare triple {18784#(<= ~counter~0 6)} assume true; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,951 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {18784#(<= ~counter~0 6)} {18784#(<= ~counter~0 6)} #63#return; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,952 INFO L272 TraceCheckUtils]: 163: Hoare triple {18784#(<= ~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)); {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,952 INFO L290 TraceCheckUtils]: 164: Hoare triple {18784#(<= ~counter~0 6)} ~cond := #in~cond; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,952 INFO L290 TraceCheckUtils]: 165: Hoare triple {18784#(<= ~counter~0 6)} assume !(0 == ~cond); {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,952 INFO L290 TraceCheckUtils]: 166: Hoare triple {18784#(<= ~counter~0 6)} assume true; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,953 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {18784#(<= ~counter~0 6)} {18784#(<= ~counter~0 6)} #65#return; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,953 INFO L272 TraceCheckUtils]: 168: Hoare triple {18784#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,953 INFO L290 TraceCheckUtils]: 169: Hoare triple {18784#(<= ~counter~0 6)} ~cond := #in~cond; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,953 INFO L290 TraceCheckUtils]: 170: Hoare triple {18784#(<= ~counter~0 6)} assume !(0 == ~cond); {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,954 INFO L290 TraceCheckUtils]: 171: Hoare triple {18784#(<= ~counter~0 6)} assume true; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,954 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {18784#(<= ~counter~0 6)} {18784#(<= ~counter~0 6)} #67#return; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,954 INFO L290 TraceCheckUtils]: 173: Hoare triple {18784#(<= ~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; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:31,955 INFO L290 TraceCheckUtils]: 174: Hoare triple {18784#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,955 INFO L290 TraceCheckUtils]: 175: Hoare triple {18869#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,955 INFO L272 TraceCheckUtils]: 176: Hoare triple {18869#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,956 INFO L290 TraceCheckUtils]: 177: Hoare triple {18869#(<= ~counter~0 7)} ~cond := #in~cond; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,956 INFO L290 TraceCheckUtils]: 178: Hoare triple {18869#(<= ~counter~0 7)} assume !(0 == ~cond); {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,956 INFO L290 TraceCheckUtils]: 179: Hoare triple {18869#(<= ~counter~0 7)} assume true; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,956 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {18869#(<= ~counter~0 7)} {18869#(<= ~counter~0 7)} #59#return; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,957 INFO L272 TraceCheckUtils]: 181: Hoare triple {18869#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,957 INFO L290 TraceCheckUtils]: 182: Hoare triple {18869#(<= ~counter~0 7)} ~cond := #in~cond; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,957 INFO L290 TraceCheckUtils]: 183: Hoare triple {18869#(<= ~counter~0 7)} assume !(0 == ~cond); {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,958 INFO L290 TraceCheckUtils]: 184: Hoare triple {18869#(<= ~counter~0 7)} assume true; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,958 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {18869#(<= ~counter~0 7)} {18869#(<= ~counter~0 7)} #61#return; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,958 INFO L272 TraceCheckUtils]: 186: Hoare triple {18869#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,958 INFO L290 TraceCheckUtils]: 187: Hoare triple {18869#(<= ~counter~0 7)} ~cond := #in~cond; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,959 INFO L290 TraceCheckUtils]: 188: Hoare triple {18869#(<= ~counter~0 7)} assume !(0 == ~cond); {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,959 INFO L290 TraceCheckUtils]: 189: Hoare triple {18869#(<= ~counter~0 7)} assume true; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,959 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {18869#(<= ~counter~0 7)} {18869#(<= ~counter~0 7)} #63#return; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,960 INFO L272 TraceCheckUtils]: 191: Hoare triple {18869#(<= ~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)); {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,960 INFO L290 TraceCheckUtils]: 192: Hoare triple {18869#(<= ~counter~0 7)} ~cond := #in~cond; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,960 INFO L290 TraceCheckUtils]: 193: Hoare triple {18869#(<= ~counter~0 7)} assume !(0 == ~cond); {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,960 INFO L290 TraceCheckUtils]: 194: Hoare triple {18869#(<= ~counter~0 7)} assume true; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,961 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {18869#(<= ~counter~0 7)} {18869#(<= ~counter~0 7)} #65#return; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,967 INFO L272 TraceCheckUtils]: 196: Hoare triple {18869#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,967 INFO L290 TraceCheckUtils]: 197: Hoare triple {18869#(<= ~counter~0 7)} ~cond := #in~cond; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,968 INFO L290 TraceCheckUtils]: 198: Hoare triple {18869#(<= ~counter~0 7)} assume !(0 == ~cond); {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,969 INFO L290 TraceCheckUtils]: 199: Hoare triple {18869#(<= ~counter~0 7)} assume true; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,969 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {18869#(<= ~counter~0 7)} {18869#(<= ~counter~0 7)} #67#return; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,969 INFO L290 TraceCheckUtils]: 201: Hoare triple {18869#(<= ~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; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:31,970 INFO L290 TraceCheckUtils]: 202: Hoare triple {18869#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18954#(<= |main_#t~post5| 7)} is VALID [2022-04-28 11:17:31,971 INFO L290 TraceCheckUtils]: 203: Hoare triple {18954#(<= |main_#t~post5| 7)} assume !(#t~post5 < 10);havoc #t~post5; {18336#false} is VALID [2022-04-28 11:17:31,971 INFO L272 TraceCheckUtils]: 204: Hoare triple {18336#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18336#false} is VALID [2022-04-28 11:17:31,971 INFO L290 TraceCheckUtils]: 205: Hoare triple {18336#false} ~cond := #in~cond; {18336#false} is VALID [2022-04-28 11:17:31,971 INFO L290 TraceCheckUtils]: 206: Hoare triple {18336#false} assume !(0 == ~cond); {18336#false} is VALID [2022-04-28 11:17:31,971 INFO L290 TraceCheckUtils]: 207: Hoare triple {18336#false} assume true; {18336#false} is VALID [2022-04-28 11:17:31,971 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {18336#false} {18336#false} #69#return; {18336#false} is VALID [2022-04-28 11:17:31,971 INFO L272 TraceCheckUtils]: 209: Hoare triple {18336#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {18336#false} is VALID [2022-04-28 11:17:31,971 INFO L290 TraceCheckUtils]: 210: Hoare triple {18336#false} ~cond := #in~cond; {18336#false} is VALID [2022-04-28 11:17:31,971 INFO L290 TraceCheckUtils]: 211: Hoare triple {18336#false} assume 0 == ~cond; {18336#false} is VALID [2022-04-28 11:17:31,971 INFO L290 TraceCheckUtils]: 212: Hoare triple {18336#false} assume !false; {18336#false} is VALID [2022-04-28 11:17:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2774 backedges. 210 proven. 2282 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2022-04-28 11:17:31,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:32,595 INFO L290 TraceCheckUtils]: 212: Hoare triple {18336#false} assume !false; {18336#false} is VALID [2022-04-28 11:17:32,596 INFO L290 TraceCheckUtils]: 211: Hoare triple {18336#false} assume 0 == ~cond; {18336#false} is VALID [2022-04-28 11:17:32,596 INFO L290 TraceCheckUtils]: 210: Hoare triple {18336#false} ~cond := #in~cond; {18336#false} is VALID [2022-04-28 11:17:32,596 INFO L272 TraceCheckUtils]: 209: Hoare triple {18336#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {18336#false} is VALID [2022-04-28 11:17:32,596 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {18335#true} {18336#false} #69#return; {18336#false} is VALID [2022-04-28 11:17:32,596 INFO L290 TraceCheckUtils]: 207: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,596 INFO L290 TraceCheckUtils]: 206: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,596 INFO L290 TraceCheckUtils]: 205: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,596 INFO L272 TraceCheckUtils]: 204: Hoare triple {18336#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,596 INFO L290 TraceCheckUtils]: 203: Hoare triple {19012#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {18336#false} is VALID [2022-04-28 11:17:32,597 INFO L290 TraceCheckUtils]: 202: Hoare triple {19016#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19012#(< |main_#t~post5| 10)} is VALID [2022-04-28 11:17:32,597 INFO L290 TraceCheckUtils]: 201: Hoare triple {19016#(< ~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; {19016#(< ~counter~0 10)} is VALID [2022-04-28 11:17:32,597 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {18335#true} {19016#(< ~counter~0 10)} #67#return; {19016#(< ~counter~0 10)} is VALID [2022-04-28 11:17:32,597 INFO L290 TraceCheckUtils]: 199: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,597 INFO L290 TraceCheckUtils]: 198: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,597 INFO L290 TraceCheckUtils]: 197: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,597 INFO L272 TraceCheckUtils]: 196: Hoare triple {19016#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,598 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {18335#true} {19016#(< ~counter~0 10)} #65#return; {19016#(< ~counter~0 10)} is VALID [2022-04-28 11:17:32,598 INFO L290 TraceCheckUtils]: 194: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,598 INFO L290 TraceCheckUtils]: 193: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,598 INFO L290 TraceCheckUtils]: 192: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,598 INFO L272 TraceCheckUtils]: 191: Hoare triple {19016#(< ~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)); {18335#true} is VALID [2022-04-28 11:17:32,598 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {18335#true} {19016#(< ~counter~0 10)} #63#return; {19016#(< ~counter~0 10)} is VALID [2022-04-28 11:17:32,599 INFO L290 TraceCheckUtils]: 189: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,599 INFO L290 TraceCheckUtils]: 188: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,599 INFO L290 TraceCheckUtils]: 187: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,599 INFO L272 TraceCheckUtils]: 186: Hoare triple {19016#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,599 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {18335#true} {19016#(< ~counter~0 10)} #61#return; {19016#(< ~counter~0 10)} is VALID [2022-04-28 11:17:32,599 INFO L290 TraceCheckUtils]: 184: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,599 INFO L290 TraceCheckUtils]: 183: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,599 INFO L290 TraceCheckUtils]: 182: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,599 INFO L272 TraceCheckUtils]: 181: Hoare triple {19016#(< ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,600 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {18335#true} {19016#(< ~counter~0 10)} #59#return; {19016#(< ~counter~0 10)} is VALID [2022-04-28 11:17:32,600 INFO L290 TraceCheckUtils]: 179: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,600 INFO L290 TraceCheckUtils]: 178: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,600 INFO L290 TraceCheckUtils]: 177: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,600 INFO L272 TraceCheckUtils]: 176: Hoare triple {19016#(< ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,600 INFO L290 TraceCheckUtils]: 175: Hoare triple {19016#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {19016#(< ~counter~0 10)} is VALID [2022-04-28 11:17:32,601 INFO L290 TraceCheckUtils]: 174: Hoare triple {19101#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19016#(< ~counter~0 10)} is VALID [2022-04-28 11:17:32,601 INFO L290 TraceCheckUtils]: 173: Hoare triple {19101#(< ~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; {19101#(< ~counter~0 9)} is VALID [2022-04-28 11:17:32,601 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {18335#true} {19101#(< ~counter~0 9)} #67#return; {19101#(< ~counter~0 9)} is VALID [2022-04-28 11:17:32,601 INFO L290 TraceCheckUtils]: 171: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,602 INFO L290 TraceCheckUtils]: 170: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,602 INFO L290 TraceCheckUtils]: 169: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,602 INFO L272 TraceCheckUtils]: 168: Hoare triple {19101#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,602 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {18335#true} {19101#(< ~counter~0 9)} #65#return; {19101#(< ~counter~0 9)} is VALID [2022-04-28 11:17:32,602 INFO L290 TraceCheckUtils]: 166: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,602 INFO L290 TraceCheckUtils]: 165: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,602 INFO L290 TraceCheckUtils]: 164: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,602 INFO L272 TraceCheckUtils]: 163: Hoare triple {19101#(< ~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)); {18335#true} is VALID [2022-04-28 11:17:32,603 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {18335#true} {19101#(< ~counter~0 9)} #63#return; {19101#(< ~counter~0 9)} is VALID [2022-04-28 11:17:32,603 INFO L290 TraceCheckUtils]: 161: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,603 INFO L290 TraceCheckUtils]: 160: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,603 INFO L290 TraceCheckUtils]: 159: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,603 INFO L272 TraceCheckUtils]: 158: Hoare triple {19101#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,603 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {18335#true} {19101#(< ~counter~0 9)} #61#return; {19101#(< ~counter~0 9)} is VALID [2022-04-28 11:17:32,603 INFO L290 TraceCheckUtils]: 156: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,603 INFO L290 TraceCheckUtils]: 155: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,603 INFO L290 TraceCheckUtils]: 154: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,603 INFO L272 TraceCheckUtils]: 153: Hoare triple {19101#(< ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,604 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {18335#true} {19101#(< ~counter~0 9)} #59#return; {19101#(< ~counter~0 9)} is VALID [2022-04-28 11:17:32,604 INFO L290 TraceCheckUtils]: 151: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,604 INFO L290 TraceCheckUtils]: 150: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,604 INFO L290 TraceCheckUtils]: 149: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,604 INFO L272 TraceCheckUtils]: 148: Hoare triple {19101#(< ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,604 INFO L290 TraceCheckUtils]: 147: Hoare triple {19101#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {19101#(< ~counter~0 9)} is VALID [2022-04-28 11:17:32,605 INFO L290 TraceCheckUtils]: 146: Hoare triple {18869#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19101#(< ~counter~0 9)} is VALID [2022-04-28 11:17:32,605 INFO L290 TraceCheckUtils]: 145: Hoare triple {18869#(<= ~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; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:32,605 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {18335#true} {18869#(<= ~counter~0 7)} #67#return; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:32,605 INFO L290 TraceCheckUtils]: 143: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,606 INFO L290 TraceCheckUtils]: 142: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,606 INFO L290 TraceCheckUtils]: 141: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,606 INFO L272 TraceCheckUtils]: 140: Hoare triple {18869#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,606 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {18335#true} {18869#(<= ~counter~0 7)} #65#return; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:32,606 INFO L290 TraceCheckUtils]: 138: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,606 INFO L290 TraceCheckUtils]: 137: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,606 INFO L290 TraceCheckUtils]: 136: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,606 INFO L272 TraceCheckUtils]: 135: Hoare triple {18869#(<= ~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)); {18335#true} is VALID [2022-04-28 11:17:32,607 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {18335#true} {18869#(<= ~counter~0 7)} #63#return; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:32,607 INFO L290 TraceCheckUtils]: 133: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,607 INFO L290 TraceCheckUtils]: 132: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,607 INFO L290 TraceCheckUtils]: 131: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,607 INFO L272 TraceCheckUtils]: 130: Hoare triple {18869#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,607 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {18335#true} {18869#(<= ~counter~0 7)} #61#return; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:32,607 INFO L290 TraceCheckUtils]: 128: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,607 INFO L290 TraceCheckUtils]: 127: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,607 INFO L290 TraceCheckUtils]: 126: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,607 INFO L272 TraceCheckUtils]: 125: Hoare triple {18869#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,608 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {18335#true} {18869#(<= ~counter~0 7)} #59#return; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:32,608 INFO L290 TraceCheckUtils]: 123: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,608 INFO L290 TraceCheckUtils]: 122: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,608 INFO L290 TraceCheckUtils]: 121: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,608 INFO L272 TraceCheckUtils]: 120: Hoare triple {18869#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,608 INFO L290 TraceCheckUtils]: 119: Hoare triple {18869#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:32,609 INFO L290 TraceCheckUtils]: 118: Hoare triple {18784#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18869#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:32,609 INFO L290 TraceCheckUtils]: 117: Hoare triple {18784#(<= ~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; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:32,609 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {18335#true} {18784#(<= ~counter~0 6)} #67#return; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:32,609 INFO L290 TraceCheckUtils]: 115: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,609 INFO L290 TraceCheckUtils]: 114: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,610 INFO L290 TraceCheckUtils]: 113: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,610 INFO L272 TraceCheckUtils]: 112: Hoare triple {18784#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,610 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {18335#true} {18784#(<= ~counter~0 6)} #65#return; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:32,610 INFO L290 TraceCheckUtils]: 110: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,610 INFO L290 TraceCheckUtils]: 109: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,610 INFO L290 TraceCheckUtils]: 108: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,610 INFO L272 TraceCheckUtils]: 107: Hoare triple {18784#(<= ~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)); {18335#true} is VALID [2022-04-28 11:17:32,611 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {18335#true} {18784#(<= ~counter~0 6)} #63#return; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:32,611 INFO L290 TraceCheckUtils]: 105: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,611 INFO L290 TraceCheckUtils]: 104: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,611 INFO L290 TraceCheckUtils]: 103: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,611 INFO L272 TraceCheckUtils]: 102: Hoare triple {18784#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,611 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {18335#true} {18784#(<= ~counter~0 6)} #61#return; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:32,611 INFO L290 TraceCheckUtils]: 100: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,611 INFO L290 TraceCheckUtils]: 99: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,611 INFO L290 TraceCheckUtils]: 98: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,611 INFO L272 TraceCheckUtils]: 97: Hoare triple {18784#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,612 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {18335#true} {18784#(<= ~counter~0 6)} #59#return; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:32,612 INFO L290 TraceCheckUtils]: 95: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,612 INFO L290 TraceCheckUtils]: 94: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,612 INFO L290 TraceCheckUtils]: 93: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,612 INFO L272 TraceCheckUtils]: 92: Hoare triple {18784#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,612 INFO L290 TraceCheckUtils]: 91: Hoare triple {18784#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:32,613 INFO L290 TraceCheckUtils]: 90: Hoare triple {18699#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18784#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:32,613 INFO L290 TraceCheckUtils]: 89: Hoare triple {18699#(<= ~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; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:32,613 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {18335#true} {18699#(<= ~counter~0 5)} #67#return; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:32,613 INFO L290 TraceCheckUtils]: 87: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,613 INFO L290 TraceCheckUtils]: 86: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,613 INFO L290 TraceCheckUtils]: 85: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,614 INFO L272 TraceCheckUtils]: 84: Hoare triple {18699#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,614 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {18335#true} {18699#(<= ~counter~0 5)} #65#return; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:32,614 INFO L290 TraceCheckUtils]: 82: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,614 INFO L290 TraceCheckUtils]: 81: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,614 INFO L290 TraceCheckUtils]: 80: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,614 INFO L272 TraceCheckUtils]: 79: Hoare triple {18699#(<= ~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)); {18335#true} is VALID [2022-04-28 11:17:32,615 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {18335#true} {18699#(<= ~counter~0 5)} #63#return; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:32,615 INFO L290 TraceCheckUtils]: 77: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,615 INFO L290 TraceCheckUtils]: 76: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,615 INFO L290 TraceCheckUtils]: 75: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,615 INFO L272 TraceCheckUtils]: 74: Hoare triple {18699#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,615 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {18335#true} {18699#(<= ~counter~0 5)} #61#return; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:32,615 INFO L290 TraceCheckUtils]: 72: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,615 INFO L290 TraceCheckUtils]: 71: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,615 INFO L290 TraceCheckUtils]: 70: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,615 INFO L272 TraceCheckUtils]: 69: Hoare triple {18699#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,616 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18335#true} {18699#(<= ~counter~0 5)} #59#return; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:32,616 INFO L290 TraceCheckUtils]: 67: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,616 INFO L290 TraceCheckUtils]: 66: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,616 INFO L290 TraceCheckUtils]: 65: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,616 INFO L272 TraceCheckUtils]: 64: Hoare triple {18699#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,616 INFO L290 TraceCheckUtils]: 63: Hoare triple {18699#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:32,617 INFO L290 TraceCheckUtils]: 62: Hoare triple {18614#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18699#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:32,617 INFO L290 TraceCheckUtils]: 61: Hoare triple {18614#(<= ~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; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:32,617 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18335#true} {18614#(<= ~counter~0 4)} #67#return; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:32,617 INFO L290 TraceCheckUtils]: 59: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,617 INFO L290 TraceCheckUtils]: 58: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,617 INFO L290 TraceCheckUtils]: 57: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,618 INFO L272 TraceCheckUtils]: 56: Hoare triple {18614#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,618 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18335#true} {18614#(<= ~counter~0 4)} #65#return; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:32,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,618 INFO L290 TraceCheckUtils]: 53: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,618 INFO L272 TraceCheckUtils]: 51: Hoare triple {18614#(<= ~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)); {18335#true} is VALID [2022-04-28 11:17:32,619 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18335#true} {18614#(<= ~counter~0 4)} #63#return; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:32,619 INFO L290 TraceCheckUtils]: 49: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,619 INFO L290 TraceCheckUtils]: 48: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,619 INFO L290 TraceCheckUtils]: 47: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,619 INFO L272 TraceCheckUtils]: 46: Hoare triple {18614#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,619 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {18335#true} {18614#(<= ~counter~0 4)} #61#return; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:32,619 INFO L290 TraceCheckUtils]: 44: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,619 INFO L290 TraceCheckUtils]: 43: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,619 INFO L272 TraceCheckUtils]: 41: Hoare triple {18614#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,620 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18335#true} {18614#(<= ~counter~0 4)} #59#return; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:32,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,620 INFO L272 TraceCheckUtils]: 36: Hoare triple {18614#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {18614#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:32,621 INFO L290 TraceCheckUtils]: 34: Hoare triple {18529#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18614#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:32,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {18529#(<= ~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; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:32,621 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18335#true} {18529#(<= ~counter~0 3)} #67#return; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:32,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,622 INFO L272 TraceCheckUtils]: 28: Hoare triple {18529#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,622 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {18335#true} {18529#(<= ~counter~0 3)} #65#return; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:32,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,622 INFO L272 TraceCheckUtils]: 23: Hoare triple {18529#(<= ~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)); {18335#true} is VALID [2022-04-28 11:17:32,623 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18335#true} {18529#(<= ~counter~0 3)} #63#return; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:32,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,623 INFO L272 TraceCheckUtils]: 18: Hoare triple {18529#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,623 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18335#true} {18529#(<= ~counter~0 3)} #61#return; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:32,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,623 INFO L272 TraceCheckUtils]: 13: Hoare triple {18529#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,624 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18335#true} {18529#(<= ~counter~0 3)} #59#return; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:32,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {18335#true} assume true; {18335#true} is VALID [2022-04-28 11:17:32,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {18335#true} assume !(0 == ~cond); {18335#true} is VALID [2022-04-28 11:17:32,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {18335#true} ~cond := #in~cond; {18335#true} is VALID [2022-04-28 11:17:32,624 INFO L272 TraceCheckUtils]: 8: Hoare triple {18529#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18335#true} is VALID [2022-04-28 11:17:32,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {18529#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:32,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {18444#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18529#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:32,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {18444#(<= ~counter~0 2)} 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; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:32,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {18444#(<= ~counter~0 2)} call #t~ret6 := main(); {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:32,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18444#(<= ~counter~0 2)} {18335#true} #81#return; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:32,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {18444#(<= ~counter~0 2)} assume true; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:32,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {18335#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; {18444#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:32,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {18335#true} call ULTIMATE.init(); {18335#true} is VALID [2022-04-28 11:17:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2774 backedges. 72 proven. 182 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2022-04-28 11:17:32,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:32,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57773855] [2022-04-28 11:17:32,630 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:32,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033140503] [2022-04-28 11:17:32,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033140503] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:17:32,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:17:32,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-28 11:17:32,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:32,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1410526374] [2022-04-28 11:17:32,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1410526374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:32,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:32,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 11:17:32,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397271145] [2022-04-28 11:17:32,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:32,631 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 10 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) Word has length 213 [2022-04-28 11:17:32,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:32,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 10 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2022-04-28 11:17:32,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:32,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 11:17:32,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:32,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 11:17:32,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:17:32,732 INFO L87 Difference]: Start difference. First operand 150 states and 169 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 10 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2022-04-28 11:17:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:34,180 INFO L93 Difference]: Finished difference Result 180 states and 204 transitions. [2022-04-28 11:17:34,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 11:17:34,180 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 10 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) Word has length 213 [2022-04-28 11:17:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 10 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2022-04-28 11:17:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 159 transitions. [2022-04-28 11:17:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 10 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2022-04-28 11:17:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 159 transitions. [2022-04-28 11:17:34,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 159 transitions. [2022-04-28 11:17:34,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:34,306 INFO L225 Difference]: With dead ends: 180 [2022-04-28 11:17:34,306 INFO L226 Difference]: Without dead ends: 166 [2022-04-28 11:17:34,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 412 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2022-04-28 11:17:34,307 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 4 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:34,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 214 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:17:34,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-28 11:17:34,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-04-28 11:17:34,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:34,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 166 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 97 states have internal predecessors, (98), 46 states have call successors, (46), 24 states have call predecessors, (46), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 11:17:34,503 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 166 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 97 states have internal predecessors, (98), 46 states have call successors, (46), 24 states have call predecessors, (46), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 11:17:34,504 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 166 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 97 states have internal predecessors, (98), 46 states have call successors, (46), 24 states have call predecessors, (46), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 11:17:34,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:34,506 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2022-04-28 11:17:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 188 transitions. [2022-04-28 11:17:34,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:34,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:34,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 97 states have internal predecessors, (98), 46 states have call successors, (46), 24 states have call predecessors, (46), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 166 states. [2022-04-28 11:17:34,507 INFO L87 Difference]: Start difference. First operand has 166 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 97 states have internal predecessors, (98), 46 states have call successors, (46), 24 states have call predecessors, (46), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 166 states. [2022-04-28 11:17:34,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:34,508 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2022-04-28 11:17:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 188 transitions. [2022-04-28 11:17:34,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:34,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:34,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:34,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:34,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 97 states have internal predecessors, (98), 46 states have call successors, (46), 24 states have call predecessors, (46), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 11:17:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 188 transitions. [2022-04-28 11:17:34,511 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 188 transitions. Word has length 213 [2022-04-28 11:17:34,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:34,512 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 188 transitions. [2022-04-28 11:17:34,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 10 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2022-04-28 11:17:34,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 188 transitions. [2022-04-28 11:17:40,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 187 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 188 transitions. [2022-04-28 11:17:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-04-28 11:17:40,868 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:40,868 INFO L195 NwaCegarLoop]: trace histogram [42, 41, 41, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:40,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-28 11:17:41,083 WARN L477 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-28 11:17:41,083 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:41,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:41,084 INFO L85 PathProgramCache]: Analyzing trace with hash -569580785, now seen corresponding path program 15 times [2022-04-28 11:17:41,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:41,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1580595387] [2022-04-28 11:17:41,314 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:41,315 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:41,315 INFO L85 PathProgramCache]: Analyzing trace with hash -569580785, now seen corresponding path program 16 times [2022-04-28 11:17:41,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:41,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393657768] [2022-04-28 11:17:41,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:41,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:41,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:41,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2028856599] [2022-04-28 11:17:41,326 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:17:41,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:41,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:41,329 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-28 11:17:41,330 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-28 11:17:41,430 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:17:41,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:41,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 11:17:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:41,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:42,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {20664#true} call ULTIMATE.init(); {20664#true} is VALID [2022-04-28 11:17:42,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {20664#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; {20672#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:42,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {20672#(<= ~counter~0 0)} assume true; {20672#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:42,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20672#(<= ~counter~0 0)} {20664#true} #81#return; {20672#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:42,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {20672#(<= ~counter~0 0)} call #t~ret6 := main(); {20672#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:42,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {20672#(<= ~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; {20672#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:42,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {20672#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {20688#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,252 INFO L272 TraceCheckUtils]: 8: Hoare triple {20688#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {20688#(<= ~counter~0 1)} ~cond := #in~cond; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {20688#(<= ~counter~0 1)} assume !(0 == ~cond); {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {20688#(<= ~counter~0 1)} assume true; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,253 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20688#(<= ~counter~0 1)} {20688#(<= ~counter~0 1)} #59#return; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,254 INFO L272 TraceCheckUtils]: 13: Hoare triple {20688#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {20688#(<= ~counter~0 1)} ~cond := #in~cond; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {20688#(<= ~counter~0 1)} assume !(0 == ~cond); {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {20688#(<= ~counter~0 1)} assume true; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,255 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20688#(<= ~counter~0 1)} {20688#(<= ~counter~0 1)} #61#return; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,255 INFO L272 TraceCheckUtils]: 18: Hoare triple {20688#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {20688#(<= ~counter~0 1)} ~cond := #in~cond; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {20688#(<= ~counter~0 1)} assume !(0 == ~cond); {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {20688#(<= ~counter~0 1)} assume true; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,256 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20688#(<= ~counter~0 1)} {20688#(<= ~counter~0 1)} #63#return; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,256 INFO L272 TraceCheckUtils]: 23: Hoare triple {20688#(<= ~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)); {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {20688#(<= ~counter~0 1)} ~cond := #in~cond; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {20688#(<= ~counter~0 1)} assume !(0 == ~cond); {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {20688#(<= ~counter~0 1)} assume true; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,258 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20688#(<= ~counter~0 1)} {20688#(<= ~counter~0 1)} #65#return; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,258 INFO L272 TraceCheckUtils]: 28: Hoare triple {20688#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {20688#(<= ~counter~0 1)} ~cond := #in~cond; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {20688#(<= ~counter~0 1)} assume !(0 == ~cond); {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {20688#(<= ~counter~0 1)} assume true; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,259 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20688#(<= ~counter~0 1)} {20688#(<= ~counter~0 1)} #67#return; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {20688#(<= ~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; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:42,260 INFO L290 TraceCheckUtils]: 34: Hoare triple {20688#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,260 INFO L290 TraceCheckUtils]: 35: Hoare triple {20773#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,260 INFO L272 TraceCheckUtils]: 36: Hoare triple {20773#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,260 INFO L290 TraceCheckUtils]: 37: Hoare triple {20773#(<= ~counter~0 2)} ~cond := #in~cond; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,261 INFO L290 TraceCheckUtils]: 38: Hoare triple {20773#(<= ~counter~0 2)} assume !(0 == ~cond); {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,261 INFO L290 TraceCheckUtils]: 39: Hoare triple {20773#(<= ~counter~0 2)} assume true; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,261 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20773#(<= ~counter~0 2)} {20773#(<= ~counter~0 2)} #59#return; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,262 INFO L272 TraceCheckUtils]: 41: Hoare triple {20773#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,262 INFO L290 TraceCheckUtils]: 42: Hoare triple {20773#(<= ~counter~0 2)} ~cond := #in~cond; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,262 INFO L290 TraceCheckUtils]: 43: Hoare triple {20773#(<= ~counter~0 2)} assume !(0 == ~cond); {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,262 INFO L290 TraceCheckUtils]: 44: Hoare triple {20773#(<= ~counter~0 2)} assume true; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,263 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20773#(<= ~counter~0 2)} {20773#(<= ~counter~0 2)} #61#return; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,263 INFO L272 TraceCheckUtils]: 46: Hoare triple {20773#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,263 INFO L290 TraceCheckUtils]: 47: Hoare triple {20773#(<= ~counter~0 2)} ~cond := #in~cond; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,264 INFO L290 TraceCheckUtils]: 48: Hoare triple {20773#(<= ~counter~0 2)} assume !(0 == ~cond); {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,264 INFO L290 TraceCheckUtils]: 49: Hoare triple {20773#(<= ~counter~0 2)} assume true; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,264 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20773#(<= ~counter~0 2)} {20773#(<= ~counter~0 2)} #63#return; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,265 INFO L272 TraceCheckUtils]: 51: Hoare triple {20773#(<= ~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)); {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,265 INFO L290 TraceCheckUtils]: 52: Hoare triple {20773#(<= ~counter~0 2)} ~cond := #in~cond; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,265 INFO L290 TraceCheckUtils]: 53: Hoare triple {20773#(<= ~counter~0 2)} assume !(0 == ~cond); {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,265 INFO L290 TraceCheckUtils]: 54: Hoare triple {20773#(<= ~counter~0 2)} assume true; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,266 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20773#(<= ~counter~0 2)} {20773#(<= ~counter~0 2)} #65#return; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,266 INFO L272 TraceCheckUtils]: 56: Hoare triple {20773#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,266 INFO L290 TraceCheckUtils]: 57: Hoare triple {20773#(<= ~counter~0 2)} ~cond := #in~cond; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {20773#(<= ~counter~0 2)} assume !(0 == ~cond); {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,267 INFO L290 TraceCheckUtils]: 59: Hoare triple {20773#(<= ~counter~0 2)} assume true; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,267 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20773#(<= ~counter~0 2)} {20773#(<= ~counter~0 2)} #67#return; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,267 INFO L290 TraceCheckUtils]: 61: Hoare triple {20773#(<= ~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; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:42,268 INFO L290 TraceCheckUtils]: 62: Hoare triple {20773#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,268 INFO L290 TraceCheckUtils]: 63: Hoare triple {20858#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,268 INFO L272 TraceCheckUtils]: 64: Hoare triple {20858#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,269 INFO L290 TraceCheckUtils]: 65: Hoare triple {20858#(<= ~counter~0 3)} ~cond := #in~cond; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,269 INFO L290 TraceCheckUtils]: 66: Hoare triple {20858#(<= ~counter~0 3)} assume !(0 == ~cond); {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,269 INFO L290 TraceCheckUtils]: 67: Hoare triple {20858#(<= ~counter~0 3)} assume true; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,269 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {20858#(<= ~counter~0 3)} {20858#(<= ~counter~0 3)} #59#return; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,270 INFO L272 TraceCheckUtils]: 69: Hoare triple {20858#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,270 INFO L290 TraceCheckUtils]: 70: Hoare triple {20858#(<= ~counter~0 3)} ~cond := #in~cond; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,270 INFO L290 TraceCheckUtils]: 71: Hoare triple {20858#(<= ~counter~0 3)} assume !(0 == ~cond); {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,271 INFO L290 TraceCheckUtils]: 72: Hoare triple {20858#(<= ~counter~0 3)} assume true; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,271 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20858#(<= ~counter~0 3)} {20858#(<= ~counter~0 3)} #61#return; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,271 INFO L272 TraceCheckUtils]: 74: Hoare triple {20858#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,271 INFO L290 TraceCheckUtils]: 75: Hoare triple {20858#(<= ~counter~0 3)} ~cond := #in~cond; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,272 INFO L290 TraceCheckUtils]: 76: Hoare triple {20858#(<= ~counter~0 3)} assume !(0 == ~cond); {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,272 INFO L290 TraceCheckUtils]: 77: Hoare triple {20858#(<= ~counter~0 3)} assume true; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,272 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {20858#(<= ~counter~0 3)} {20858#(<= ~counter~0 3)} #63#return; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,273 INFO L272 TraceCheckUtils]: 79: Hoare triple {20858#(<= ~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)); {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,273 INFO L290 TraceCheckUtils]: 80: Hoare triple {20858#(<= ~counter~0 3)} ~cond := #in~cond; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,273 INFO L290 TraceCheckUtils]: 81: Hoare triple {20858#(<= ~counter~0 3)} assume !(0 == ~cond); {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,273 INFO L290 TraceCheckUtils]: 82: Hoare triple {20858#(<= ~counter~0 3)} assume true; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,274 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {20858#(<= ~counter~0 3)} {20858#(<= ~counter~0 3)} #65#return; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,274 INFO L272 TraceCheckUtils]: 84: Hoare triple {20858#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,274 INFO L290 TraceCheckUtils]: 85: Hoare triple {20858#(<= ~counter~0 3)} ~cond := #in~cond; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,275 INFO L290 TraceCheckUtils]: 86: Hoare triple {20858#(<= ~counter~0 3)} assume !(0 == ~cond); {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,275 INFO L290 TraceCheckUtils]: 87: Hoare triple {20858#(<= ~counter~0 3)} assume true; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,275 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {20858#(<= ~counter~0 3)} {20858#(<= ~counter~0 3)} #67#return; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,275 INFO L290 TraceCheckUtils]: 89: Hoare triple {20858#(<= ~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; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:42,276 INFO L290 TraceCheckUtils]: 90: Hoare triple {20858#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,276 INFO L290 TraceCheckUtils]: 91: Hoare triple {20943#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,276 INFO L272 TraceCheckUtils]: 92: Hoare triple {20943#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,277 INFO L290 TraceCheckUtils]: 93: Hoare triple {20943#(<= ~counter~0 4)} ~cond := #in~cond; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,277 INFO L290 TraceCheckUtils]: 94: Hoare triple {20943#(<= ~counter~0 4)} assume !(0 == ~cond); {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,277 INFO L290 TraceCheckUtils]: 95: Hoare triple {20943#(<= ~counter~0 4)} assume true; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,278 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {20943#(<= ~counter~0 4)} {20943#(<= ~counter~0 4)} #59#return; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,278 INFO L272 TraceCheckUtils]: 97: Hoare triple {20943#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,278 INFO L290 TraceCheckUtils]: 98: Hoare triple {20943#(<= ~counter~0 4)} ~cond := #in~cond; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,278 INFO L290 TraceCheckUtils]: 99: Hoare triple {20943#(<= ~counter~0 4)} assume !(0 == ~cond); {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,279 INFO L290 TraceCheckUtils]: 100: Hoare triple {20943#(<= ~counter~0 4)} assume true; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,279 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {20943#(<= ~counter~0 4)} {20943#(<= ~counter~0 4)} #61#return; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,279 INFO L272 TraceCheckUtils]: 102: Hoare triple {20943#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,280 INFO L290 TraceCheckUtils]: 103: Hoare triple {20943#(<= ~counter~0 4)} ~cond := #in~cond; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,280 INFO L290 TraceCheckUtils]: 104: Hoare triple {20943#(<= ~counter~0 4)} assume !(0 == ~cond); {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,280 INFO L290 TraceCheckUtils]: 105: Hoare triple {20943#(<= ~counter~0 4)} assume true; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,280 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20943#(<= ~counter~0 4)} {20943#(<= ~counter~0 4)} #63#return; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,281 INFO L272 TraceCheckUtils]: 107: Hoare triple {20943#(<= ~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)); {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,281 INFO L290 TraceCheckUtils]: 108: Hoare triple {20943#(<= ~counter~0 4)} ~cond := #in~cond; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,281 INFO L290 TraceCheckUtils]: 109: Hoare triple {20943#(<= ~counter~0 4)} assume !(0 == ~cond); {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,281 INFO L290 TraceCheckUtils]: 110: Hoare triple {20943#(<= ~counter~0 4)} assume true; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,282 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {20943#(<= ~counter~0 4)} {20943#(<= ~counter~0 4)} #65#return; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,282 INFO L272 TraceCheckUtils]: 112: Hoare triple {20943#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,282 INFO L290 TraceCheckUtils]: 113: Hoare triple {20943#(<= ~counter~0 4)} ~cond := #in~cond; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,283 INFO L290 TraceCheckUtils]: 114: Hoare triple {20943#(<= ~counter~0 4)} assume !(0 == ~cond); {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,283 INFO L290 TraceCheckUtils]: 115: Hoare triple {20943#(<= ~counter~0 4)} assume true; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,283 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {20943#(<= ~counter~0 4)} {20943#(<= ~counter~0 4)} #67#return; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,284 INFO L290 TraceCheckUtils]: 117: Hoare triple {20943#(<= ~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; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:42,284 INFO L290 TraceCheckUtils]: 118: Hoare triple {20943#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,284 INFO L290 TraceCheckUtils]: 119: Hoare triple {21028#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,285 INFO L272 TraceCheckUtils]: 120: Hoare triple {21028#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,285 INFO L290 TraceCheckUtils]: 121: Hoare triple {21028#(<= ~counter~0 5)} ~cond := #in~cond; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,285 INFO L290 TraceCheckUtils]: 122: Hoare triple {21028#(<= ~counter~0 5)} assume !(0 == ~cond); {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,285 INFO L290 TraceCheckUtils]: 123: Hoare triple {21028#(<= ~counter~0 5)} assume true; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,286 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {21028#(<= ~counter~0 5)} {21028#(<= ~counter~0 5)} #59#return; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,286 INFO L272 TraceCheckUtils]: 125: Hoare triple {21028#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,286 INFO L290 TraceCheckUtils]: 126: Hoare triple {21028#(<= ~counter~0 5)} ~cond := #in~cond; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,286 INFO L290 TraceCheckUtils]: 127: Hoare triple {21028#(<= ~counter~0 5)} assume !(0 == ~cond); {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,287 INFO L290 TraceCheckUtils]: 128: Hoare triple {21028#(<= ~counter~0 5)} assume true; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,287 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {21028#(<= ~counter~0 5)} {21028#(<= ~counter~0 5)} #61#return; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,287 INFO L272 TraceCheckUtils]: 130: Hoare triple {21028#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,288 INFO L290 TraceCheckUtils]: 131: Hoare triple {21028#(<= ~counter~0 5)} ~cond := #in~cond; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,288 INFO L290 TraceCheckUtils]: 132: Hoare triple {21028#(<= ~counter~0 5)} assume !(0 == ~cond); {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,288 INFO L290 TraceCheckUtils]: 133: Hoare triple {21028#(<= ~counter~0 5)} assume true; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,288 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {21028#(<= ~counter~0 5)} {21028#(<= ~counter~0 5)} #63#return; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,289 INFO L272 TraceCheckUtils]: 135: Hoare triple {21028#(<= ~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)); {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,289 INFO L290 TraceCheckUtils]: 136: Hoare triple {21028#(<= ~counter~0 5)} ~cond := #in~cond; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,289 INFO L290 TraceCheckUtils]: 137: Hoare triple {21028#(<= ~counter~0 5)} assume !(0 == ~cond); {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,290 INFO L290 TraceCheckUtils]: 138: Hoare triple {21028#(<= ~counter~0 5)} assume true; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,290 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {21028#(<= ~counter~0 5)} {21028#(<= ~counter~0 5)} #65#return; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,290 INFO L272 TraceCheckUtils]: 140: Hoare triple {21028#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,291 INFO L290 TraceCheckUtils]: 141: Hoare triple {21028#(<= ~counter~0 5)} ~cond := #in~cond; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,291 INFO L290 TraceCheckUtils]: 142: Hoare triple {21028#(<= ~counter~0 5)} assume !(0 == ~cond); {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,291 INFO L290 TraceCheckUtils]: 143: Hoare triple {21028#(<= ~counter~0 5)} assume true; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,291 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {21028#(<= ~counter~0 5)} {21028#(<= ~counter~0 5)} #67#return; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,292 INFO L290 TraceCheckUtils]: 145: Hoare triple {21028#(<= ~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; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:42,292 INFO L290 TraceCheckUtils]: 146: Hoare triple {21028#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,292 INFO L290 TraceCheckUtils]: 147: Hoare triple {21113#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,293 INFO L272 TraceCheckUtils]: 148: Hoare triple {21113#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,293 INFO L290 TraceCheckUtils]: 149: Hoare triple {21113#(<= ~counter~0 6)} ~cond := #in~cond; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,293 INFO L290 TraceCheckUtils]: 150: Hoare triple {21113#(<= ~counter~0 6)} assume !(0 == ~cond); {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,293 INFO L290 TraceCheckUtils]: 151: Hoare triple {21113#(<= ~counter~0 6)} assume true; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,294 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {21113#(<= ~counter~0 6)} {21113#(<= ~counter~0 6)} #59#return; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,294 INFO L272 TraceCheckUtils]: 153: Hoare triple {21113#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,295 INFO L290 TraceCheckUtils]: 154: Hoare triple {21113#(<= ~counter~0 6)} ~cond := #in~cond; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,295 INFO L290 TraceCheckUtils]: 155: Hoare triple {21113#(<= ~counter~0 6)} assume !(0 == ~cond); {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,296 INFO L290 TraceCheckUtils]: 156: Hoare triple {21113#(<= ~counter~0 6)} assume true; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,296 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {21113#(<= ~counter~0 6)} {21113#(<= ~counter~0 6)} #61#return; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,296 INFO L272 TraceCheckUtils]: 158: Hoare triple {21113#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,297 INFO L290 TraceCheckUtils]: 159: Hoare triple {21113#(<= ~counter~0 6)} ~cond := #in~cond; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,297 INFO L290 TraceCheckUtils]: 160: Hoare triple {21113#(<= ~counter~0 6)} assume !(0 == ~cond); {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,297 INFO L290 TraceCheckUtils]: 161: Hoare triple {21113#(<= ~counter~0 6)} assume true; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,298 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {21113#(<= ~counter~0 6)} {21113#(<= ~counter~0 6)} #63#return; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,298 INFO L272 TraceCheckUtils]: 163: Hoare triple {21113#(<= ~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)); {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,298 INFO L290 TraceCheckUtils]: 164: Hoare triple {21113#(<= ~counter~0 6)} ~cond := #in~cond; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,299 INFO L290 TraceCheckUtils]: 165: Hoare triple {21113#(<= ~counter~0 6)} assume !(0 == ~cond); {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,299 INFO L290 TraceCheckUtils]: 166: Hoare triple {21113#(<= ~counter~0 6)} assume true; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,299 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {21113#(<= ~counter~0 6)} {21113#(<= ~counter~0 6)} #65#return; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,300 INFO L272 TraceCheckUtils]: 168: Hoare triple {21113#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,300 INFO L290 TraceCheckUtils]: 169: Hoare triple {21113#(<= ~counter~0 6)} ~cond := #in~cond; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,300 INFO L290 TraceCheckUtils]: 170: Hoare triple {21113#(<= ~counter~0 6)} assume !(0 == ~cond); {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,300 INFO L290 TraceCheckUtils]: 171: Hoare triple {21113#(<= ~counter~0 6)} assume true; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,301 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {21113#(<= ~counter~0 6)} {21113#(<= ~counter~0 6)} #67#return; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,301 INFO L290 TraceCheckUtils]: 173: Hoare triple {21113#(<= ~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; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:42,302 INFO L290 TraceCheckUtils]: 174: Hoare triple {21113#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,302 INFO L290 TraceCheckUtils]: 175: Hoare triple {21198#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,302 INFO L272 TraceCheckUtils]: 176: Hoare triple {21198#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,303 INFO L290 TraceCheckUtils]: 177: Hoare triple {21198#(<= ~counter~0 7)} ~cond := #in~cond; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,303 INFO L290 TraceCheckUtils]: 178: Hoare triple {21198#(<= ~counter~0 7)} assume !(0 == ~cond); {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,303 INFO L290 TraceCheckUtils]: 179: Hoare triple {21198#(<= ~counter~0 7)} assume true; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,304 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {21198#(<= ~counter~0 7)} {21198#(<= ~counter~0 7)} #59#return; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,304 INFO L272 TraceCheckUtils]: 181: Hoare triple {21198#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,304 INFO L290 TraceCheckUtils]: 182: Hoare triple {21198#(<= ~counter~0 7)} ~cond := #in~cond; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,305 INFO L290 TraceCheckUtils]: 183: Hoare triple {21198#(<= ~counter~0 7)} assume !(0 == ~cond); {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,305 INFO L290 TraceCheckUtils]: 184: Hoare triple {21198#(<= ~counter~0 7)} assume true; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,305 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {21198#(<= ~counter~0 7)} {21198#(<= ~counter~0 7)} #61#return; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,306 INFO L272 TraceCheckUtils]: 186: Hoare triple {21198#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,306 INFO L290 TraceCheckUtils]: 187: Hoare triple {21198#(<= ~counter~0 7)} ~cond := #in~cond; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,306 INFO L290 TraceCheckUtils]: 188: Hoare triple {21198#(<= ~counter~0 7)} assume !(0 == ~cond); {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,306 INFO L290 TraceCheckUtils]: 189: Hoare triple {21198#(<= ~counter~0 7)} assume true; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,307 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {21198#(<= ~counter~0 7)} {21198#(<= ~counter~0 7)} #63#return; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,307 INFO L272 TraceCheckUtils]: 191: Hoare triple {21198#(<= ~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)); {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,308 INFO L290 TraceCheckUtils]: 192: Hoare triple {21198#(<= ~counter~0 7)} ~cond := #in~cond; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,308 INFO L290 TraceCheckUtils]: 193: Hoare triple {21198#(<= ~counter~0 7)} assume !(0 == ~cond); {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,308 INFO L290 TraceCheckUtils]: 194: Hoare triple {21198#(<= ~counter~0 7)} assume true; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,308 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {21198#(<= ~counter~0 7)} {21198#(<= ~counter~0 7)} #65#return; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,309 INFO L272 TraceCheckUtils]: 196: Hoare triple {21198#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,309 INFO L290 TraceCheckUtils]: 197: Hoare triple {21198#(<= ~counter~0 7)} ~cond := #in~cond; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,309 INFO L290 TraceCheckUtils]: 198: Hoare triple {21198#(<= ~counter~0 7)} assume !(0 == ~cond); {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,310 INFO L290 TraceCheckUtils]: 199: Hoare triple {21198#(<= ~counter~0 7)} assume true; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,310 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {21198#(<= ~counter~0 7)} {21198#(<= ~counter~0 7)} #67#return; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,310 INFO L290 TraceCheckUtils]: 201: Hoare triple {21198#(<= ~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; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:42,311 INFO L290 TraceCheckUtils]: 202: Hoare triple {21198#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,311 INFO L290 TraceCheckUtils]: 203: Hoare triple {21283#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,312 INFO L272 TraceCheckUtils]: 204: Hoare triple {21283#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,312 INFO L290 TraceCheckUtils]: 205: Hoare triple {21283#(<= ~counter~0 8)} ~cond := #in~cond; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,312 INFO L290 TraceCheckUtils]: 206: Hoare triple {21283#(<= ~counter~0 8)} assume !(0 == ~cond); {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,312 INFO L290 TraceCheckUtils]: 207: Hoare triple {21283#(<= ~counter~0 8)} assume true; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,313 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {21283#(<= ~counter~0 8)} {21283#(<= ~counter~0 8)} #59#return; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,313 INFO L272 TraceCheckUtils]: 209: Hoare triple {21283#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,313 INFO L290 TraceCheckUtils]: 210: Hoare triple {21283#(<= ~counter~0 8)} ~cond := #in~cond; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,314 INFO L290 TraceCheckUtils]: 211: Hoare triple {21283#(<= ~counter~0 8)} assume !(0 == ~cond); {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,314 INFO L290 TraceCheckUtils]: 212: Hoare triple {21283#(<= ~counter~0 8)} assume true; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,314 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {21283#(<= ~counter~0 8)} {21283#(<= ~counter~0 8)} #61#return; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,315 INFO L272 TraceCheckUtils]: 214: Hoare triple {21283#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,315 INFO L290 TraceCheckUtils]: 215: Hoare triple {21283#(<= ~counter~0 8)} ~cond := #in~cond; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,315 INFO L290 TraceCheckUtils]: 216: Hoare triple {21283#(<= ~counter~0 8)} assume !(0 == ~cond); {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,315 INFO L290 TraceCheckUtils]: 217: Hoare triple {21283#(<= ~counter~0 8)} assume true; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,316 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {21283#(<= ~counter~0 8)} {21283#(<= ~counter~0 8)} #63#return; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,316 INFO L272 TraceCheckUtils]: 219: Hoare triple {21283#(<= ~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)); {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,316 INFO L290 TraceCheckUtils]: 220: Hoare triple {21283#(<= ~counter~0 8)} ~cond := #in~cond; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,317 INFO L290 TraceCheckUtils]: 221: Hoare triple {21283#(<= ~counter~0 8)} assume !(0 == ~cond); {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,317 INFO L290 TraceCheckUtils]: 222: Hoare triple {21283#(<= ~counter~0 8)} assume true; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,317 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {21283#(<= ~counter~0 8)} {21283#(<= ~counter~0 8)} #65#return; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,318 INFO L272 TraceCheckUtils]: 224: Hoare triple {21283#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,318 INFO L290 TraceCheckUtils]: 225: Hoare triple {21283#(<= ~counter~0 8)} ~cond := #in~cond; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,318 INFO L290 TraceCheckUtils]: 226: Hoare triple {21283#(<= ~counter~0 8)} assume !(0 == ~cond); {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,318 INFO L290 TraceCheckUtils]: 227: Hoare triple {21283#(<= ~counter~0 8)} assume true; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,319 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {21283#(<= ~counter~0 8)} {21283#(<= ~counter~0 8)} #67#return; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,319 INFO L290 TraceCheckUtils]: 229: Hoare triple {21283#(<= ~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; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:42,319 INFO L290 TraceCheckUtils]: 230: Hoare triple {21283#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21368#(<= |main_#t~post5| 8)} is VALID [2022-04-28 11:17:42,320 INFO L290 TraceCheckUtils]: 231: Hoare triple {21368#(<= |main_#t~post5| 8)} assume !(#t~post5 < 10);havoc #t~post5; {20665#false} is VALID [2022-04-28 11:17:42,320 INFO L272 TraceCheckUtils]: 232: Hoare triple {20665#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20665#false} is VALID [2022-04-28 11:17:42,320 INFO L290 TraceCheckUtils]: 233: Hoare triple {20665#false} ~cond := #in~cond; {20665#false} is VALID [2022-04-28 11:17:42,320 INFO L290 TraceCheckUtils]: 234: Hoare triple {20665#false} assume !(0 == ~cond); {20665#false} is VALID [2022-04-28 11:17:42,320 INFO L290 TraceCheckUtils]: 235: Hoare triple {20665#false} assume true; {20665#false} is VALID [2022-04-28 11:17:42,320 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {20665#false} {20665#false} #69#return; {20665#false} is VALID [2022-04-28 11:17:42,320 INFO L272 TraceCheckUtils]: 237: Hoare triple {20665#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {20665#false} is VALID [2022-04-28 11:17:42,320 INFO L290 TraceCheckUtils]: 238: Hoare triple {20665#false} ~cond := #in~cond; {20665#false} is VALID [2022-04-28 11:17:42,320 INFO L290 TraceCheckUtils]: 239: Hoare triple {20665#false} assume 0 == ~cond; {20665#false} is VALID [2022-04-28 11:17:42,320 INFO L290 TraceCheckUtils]: 240: Hoare triple {20665#false} assume !false; {20665#false} is VALID [2022-04-28 11:17:42,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3602 backedges. 240 proven. 3040 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2022-04-28 11:17:42,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:43,022 INFO L290 TraceCheckUtils]: 240: Hoare triple {20665#false} assume !false; {20665#false} is VALID [2022-04-28 11:17:43,022 INFO L290 TraceCheckUtils]: 239: Hoare triple {20665#false} assume 0 == ~cond; {20665#false} is VALID [2022-04-28 11:17:43,022 INFO L290 TraceCheckUtils]: 238: Hoare triple {20665#false} ~cond := #in~cond; {20665#false} is VALID [2022-04-28 11:17:43,022 INFO L272 TraceCheckUtils]: 237: Hoare triple {20665#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {20665#false} is VALID [2022-04-28 11:17:43,022 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {20664#true} {20665#false} #69#return; {20665#false} is VALID [2022-04-28 11:17:43,022 INFO L290 TraceCheckUtils]: 235: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,022 INFO L290 TraceCheckUtils]: 234: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,022 INFO L290 TraceCheckUtils]: 233: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,022 INFO L272 TraceCheckUtils]: 232: Hoare triple {20665#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,023 INFO L290 TraceCheckUtils]: 231: Hoare triple {21426#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {20665#false} is VALID [2022-04-28 11:17:43,023 INFO L290 TraceCheckUtils]: 230: Hoare triple {21430#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21426#(< |main_#t~post5| 10)} is VALID [2022-04-28 11:17:43,023 INFO L290 TraceCheckUtils]: 229: Hoare triple {21430#(< ~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; {21430#(< ~counter~0 10)} is VALID [2022-04-28 11:17:43,024 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {20664#true} {21430#(< ~counter~0 10)} #67#return; {21430#(< ~counter~0 10)} is VALID [2022-04-28 11:17:43,024 INFO L290 TraceCheckUtils]: 227: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,024 INFO L290 TraceCheckUtils]: 226: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,024 INFO L290 TraceCheckUtils]: 225: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,024 INFO L272 TraceCheckUtils]: 224: Hoare triple {21430#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,024 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {20664#true} {21430#(< ~counter~0 10)} #65#return; {21430#(< ~counter~0 10)} is VALID [2022-04-28 11:17:43,024 INFO L290 TraceCheckUtils]: 222: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,024 INFO L290 TraceCheckUtils]: 221: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,024 INFO L290 TraceCheckUtils]: 220: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,024 INFO L272 TraceCheckUtils]: 219: Hoare triple {21430#(< ~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)); {20664#true} is VALID [2022-04-28 11:17:43,025 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {20664#true} {21430#(< ~counter~0 10)} #63#return; {21430#(< ~counter~0 10)} is VALID [2022-04-28 11:17:43,025 INFO L290 TraceCheckUtils]: 217: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,025 INFO L290 TraceCheckUtils]: 216: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,025 INFO L290 TraceCheckUtils]: 215: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,025 INFO L272 TraceCheckUtils]: 214: Hoare triple {21430#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,025 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {20664#true} {21430#(< ~counter~0 10)} #61#return; {21430#(< ~counter~0 10)} is VALID [2022-04-28 11:17:43,025 INFO L290 TraceCheckUtils]: 212: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,025 INFO L290 TraceCheckUtils]: 211: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,026 INFO L290 TraceCheckUtils]: 210: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,026 INFO L272 TraceCheckUtils]: 209: Hoare triple {21430#(< ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,026 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {20664#true} {21430#(< ~counter~0 10)} #59#return; {21430#(< ~counter~0 10)} is VALID [2022-04-28 11:17:43,026 INFO L290 TraceCheckUtils]: 207: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,026 INFO L290 TraceCheckUtils]: 206: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,026 INFO L290 TraceCheckUtils]: 205: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,026 INFO L272 TraceCheckUtils]: 204: Hoare triple {21430#(< ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,026 INFO L290 TraceCheckUtils]: 203: Hoare triple {21430#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {21430#(< ~counter~0 10)} is VALID [2022-04-28 11:17:43,027 INFO L290 TraceCheckUtils]: 202: Hoare triple {21283#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21430#(< ~counter~0 10)} is VALID [2022-04-28 11:17:43,027 INFO L290 TraceCheckUtils]: 201: Hoare triple {21283#(<= ~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; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:43,028 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {20664#true} {21283#(<= ~counter~0 8)} #67#return; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:43,028 INFO L290 TraceCheckUtils]: 199: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,028 INFO L290 TraceCheckUtils]: 198: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,028 INFO L290 TraceCheckUtils]: 197: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,028 INFO L272 TraceCheckUtils]: 196: Hoare triple {21283#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,028 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {20664#true} {21283#(<= ~counter~0 8)} #65#return; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:43,028 INFO L290 TraceCheckUtils]: 194: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,028 INFO L290 TraceCheckUtils]: 193: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,028 INFO L290 TraceCheckUtils]: 192: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,029 INFO L272 TraceCheckUtils]: 191: Hoare triple {21283#(<= ~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)); {20664#true} is VALID [2022-04-28 11:17:43,029 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {20664#true} {21283#(<= ~counter~0 8)} #63#return; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:43,029 INFO L290 TraceCheckUtils]: 189: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,029 INFO L290 TraceCheckUtils]: 188: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,029 INFO L290 TraceCheckUtils]: 187: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,029 INFO L272 TraceCheckUtils]: 186: Hoare triple {21283#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,029 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {20664#true} {21283#(<= ~counter~0 8)} #61#return; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:43,030 INFO L290 TraceCheckUtils]: 184: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,030 INFO L290 TraceCheckUtils]: 183: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,030 INFO L290 TraceCheckUtils]: 182: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,030 INFO L272 TraceCheckUtils]: 181: Hoare triple {21283#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,030 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {20664#true} {21283#(<= ~counter~0 8)} #59#return; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:43,030 INFO L290 TraceCheckUtils]: 179: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,030 INFO L290 TraceCheckUtils]: 178: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,030 INFO L290 TraceCheckUtils]: 177: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,030 INFO L272 TraceCheckUtils]: 176: Hoare triple {21283#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,030 INFO L290 TraceCheckUtils]: 175: Hoare triple {21283#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:43,031 INFO L290 TraceCheckUtils]: 174: Hoare triple {21198#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21283#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:43,031 INFO L290 TraceCheckUtils]: 173: Hoare triple {21198#(<= ~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; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:43,040 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {20664#true} {21198#(<= ~counter~0 7)} #67#return; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:43,040 INFO L290 TraceCheckUtils]: 171: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,040 INFO L290 TraceCheckUtils]: 170: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,040 INFO L290 TraceCheckUtils]: 169: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,040 INFO L272 TraceCheckUtils]: 168: Hoare triple {21198#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,040 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {20664#true} {21198#(<= ~counter~0 7)} #65#return; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:43,040 INFO L290 TraceCheckUtils]: 166: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,041 INFO L290 TraceCheckUtils]: 165: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,041 INFO L290 TraceCheckUtils]: 164: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,041 INFO L272 TraceCheckUtils]: 163: Hoare triple {21198#(<= ~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)); {20664#true} is VALID [2022-04-28 11:17:43,041 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {20664#true} {21198#(<= ~counter~0 7)} #63#return; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:43,041 INFO L290 TraceCheckUtils]: 161: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,041 INFO L290 TraceCheckUtils]: 160: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,041 INFO L290 TraceCheckUtils]: 159: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,041 INFO L272 TraceCheckUtils]: 158: Hoare triple {21198#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,042 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {20664#true} {21198#(<= ~counter~0 7)} #61#return; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:43,042 INFO L290 TraceCheckUtils]: 156: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,042 INFO L290 TraceCheckUtils]: 155: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,042 INFO L290 TraceCheckUtils]: 154: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,042 INFO L272 TraceCheckUtils]: 153: Hoare triple {21198#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,042 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {20664#true} {21198#(<= ~counter~0 7)} #59#return; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:43,042 INFO L290 TraceCheckUtils]: 151: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,042 INFO L290 TraceCheckUtils]: 150: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,042 INFO L290 TraceCheckUtils]: 149: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,042 INFO L272 TraceCheckUtils]: 148: Hoare triple {21198#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,043 INFO L290 TraceCheckUtils]: 147: Hoare triple {21198#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:43,043 INFO L290 TraceCheckUtils]: 146: Hoare triple {21113#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21198#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:43,044 INFO L290 TraceCheckUtils]: 145: Hoare triple {21113#(<= ~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; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:43,044 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {20664#true} {21113#(<= ~counter~0 6)} #67#return; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:43,044 INFO L290 TraceCheckUtils]: 143: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,044 INFO L290 TraceCheckUtils]: 142: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,044 INFO L290 TraceCheckUtils]: 141: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,044 INFO L272 TraceCheckUtils]: 140: Hoare triple {21113#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,045 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {20664#true} {21113#(<= ~counter~0 6)} #65#return; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:43,045 INFO L290 TraceCheckUtils]: 138: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,045 INFO L290 TraceCheckUtils]: 137: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,045 INFO L290 TraceCheckUtils]: 136: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,045 INFO L272 TraceCheckUtils]: 135: Hoare triple {21113#(<= ~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)); {20664#true} is VALID [2022-04-28 11:17:43,055 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {20664#true} {21113#(<= ~counter~0 6)} #63#return; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:43,055 INFO L290 TraceCheckUtils]: 133: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,055 INFO L290 TraceCheckUtils]: 132: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,055 INFO L290 TraceCheckUtils]: 131: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,055 INFO L272 TraceCheckUtils]: 130: Hoare triple {21113#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,056 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {20664#true} {21113#(<= ~counter~0 6)} #61#return; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:43,056 INFO L290 TraceCheckUtils]: 128: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,056 INFO L290 TraceCheckUtils]: 127: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,056 INFO L290 TraceCheckUtils]: 126: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,056 INFO L272 TraceCheckUtils]: 125: Hoare triple {21113#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,056 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {20664#true} {21113#(<= ~counter~0 6)} #59#return; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:43,056 INFO L290 TraceCheckUtils]: 123: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,056 INFO L290 TraceCheckUtils]: 122: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,056 INFO L290 TraceCheckUtils]: 121: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,056 INFO L272 TraceCheckUtils]: 120: Hoare triple {21113#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,057 INFO L290 TraceCheckUtils]: 119: Hoare triple {21113#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:43,057 INFO L290 TraceCheckUtils]: 118: Hoare triple {21028#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21113#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:43,058 INFO L290 TraceCheckUtils]: 117: Hoare triple {21028#(<= ~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; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:43,058 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {20664#true} {21028#(<= ~counter~0 5)} #67#return; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:43,058 INFO L290 TraceCheckUtils]: 115: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,058 INFO L290 TraceCheckUtils]: 114: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,058 INFO L290 TraceCheckUtils]: 113: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,058 INFO L272 TraceCheckUtils]: 112: Hoare triple {21028#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,059 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {20664#true} {21028#(<= ~counter~0 5)} #65#return; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:43,059 INFO L290 TraceCheckUtils]: 110: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,059 INFO L290 TraceCheckUtils]: 109: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,059 INFO L290 TraceCheckUtils]: 108: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,059 INFO L272 TraceCheckUtils]: 107: Hoare triple {21028#(<= ~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)); {20664#true} is VALID [2022-04-28 11:17:43,059 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20664#true} {21028#(<= ~counter~0 5)} #63#return; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:43,060 INFO L290 TraceCheckUtils]: 105: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,060 INFO L290 TraceCheckUtils]: 104: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,060 INFO L290 TraceCheckUtils]: 103: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,060 INFO L272 TraceCheckUtils]: 102: Hoare triple {21028#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,060 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {20664#true} {21028#(<= ~counter~0 5)} #61#return; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:43,060 INFO L290 TraceCheckUtils]: 100: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,060 INFO L290 TraceCheckUtils]: 99: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,060 INFO L290 TraceCheckUtils]: 98: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,060 INFO L272 TraceCheckUtils]: 97: Hoare triple {21028#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,061 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {20664#true} {21028#(<= ~counter~0 5)} #59#return; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:43,061 INFO L290 TraceCheckUtils]: 95: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,061 INFO L290 TraceCheckUtils]: 94: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,061 INFO L290 TraceCheckUtils]: 93: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,061 INFO L272 TraceCheckUtils]: 92: Hoare triple {21028#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,061 INFO L290 TraceCheckUtils]: 91: Hoare triple {21028#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:43,062 INFO L290 TraceCheckUtils]: 90: Hoare triple {20943#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21028#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:43,062 INFO L290 TraceCheckUtils]: 89: Hoare triple {20943#(<= ~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; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:43,063 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {20664#true} {20943#(<= ~counter~0 4)} #67#return; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:43,063 INFO L290 TraceCheckUtils]: 87: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,063 INFO L290 TraceCheckUtils]: 86: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,063 INFO L290 TraceCheckUtils]: 85: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,063 INFO L272 TraceCheckUtils]: 84: Hoare triple {20943#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,063 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {20664#true} {20943#(<= ~counter~0 4)} #65#return; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:43,063 INFO L290 TraceCheckUtils]: 82: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,063 INFO L290 TraceCheckUtils]: 81: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,063 INFO L290 TraceCheckUtils]: 80: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,063 INFO L272 TraceCheckUtils]: 79: Hoare triple {20943#(<= ~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)); {20664#true} is VALID [2022-04-28 11:17:43,064 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {20664#true} {20943#(<= ~counter~0 4)} #63#return; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:43,064 INFO L290 TraceCheckUtils]: 77: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,064 INFO L290 TraceCheckUtils]: 76: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,064 INFO L290 TraceCheckUtils]: 75: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,064 INFO L272 TraceCheckUtils]: 74: Hoare triple {20943#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,065 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20664#true} {20943#(<= ~counter~0 4)} #61#return; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:43,065 INFO L290 TraceCheckUtils]: 72: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,065 INFO L290 TraceCheckUtils]: 71: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,065 INFO L290 TraceCheckUtils]: 70: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,065 INFO L272 TraceCheckUtils]: 69: Hoare triple {20943#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,065 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {20664#true} {20943#(<= ~counter~0 4)} #59#return; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:43,065 INFO L290 TraceCheckUtils]: 67: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,065 INFO L290 TraceCheckUtils]: 66: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,065 INFO L290 TraceCheckUtils]: 65: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,066 INFO L272 TraceCheckUtils]: 64: Hoare triple {20943#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,066 INFO L290 TraceCheckUtils]: 63: Hoare triple {20943#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:43,066 INFO L290 TraceCheckUtils]: 62: Hoare triple {20858#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20943#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:43,067 INFO L290 TraceCheckUtils]: 61: Hoare triple {20858#(<= ~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; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:43,067 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20664#true} {20858#(<= ~counter~0 3)} #67#return; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:43,067 INFO L290 TraceCheckUtils]: 59: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,067 INFO L290 TraceCheckUtils]: 58: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,067 INFO L290 TraceCheckUtils]: 57: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,067 INFO L272 TraceCheckUtils]: 56: Hoare triple {20858#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,068 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20664#true} {20858#(<= ~counter~0 3)} #65#return; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:43,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,068 INFO L290 TraceCheckUtils]: 53: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,068 INFO L290 TraceCheckUtils]: 52: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,068 INFO L272 TraceCheckUtils]: 51: Hoare triple {20858#(<= ~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)); {20664#true} is VALID [2022-04-28 11:17:43,068 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20664#true} {20858#(<= ~counter~0 3)} #63#return; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:43,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,068 INFO L290 TraceCheckUtils]: 48: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,068 INFO L290 TraceCheckUtils]: 47: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,069 INFO L272 TraceCheckUtils]: 46: Hoare triple {20858#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,069 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20664#true} {20858#(<= ~counter~0 3)} #61#return; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:43,069 INFO L290 TraceCheckUtils]: 44: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,069 INFO L290 TraceCheckUtils]: 43: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,069 INFO L290 TraceCheckUtils]: 42: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,069 INFO L272 TraceCheckUtils]: 41: Hoare triple {20858#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,069 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20664#true} {20858#(<= ~counter~0 3)} #59#return; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:43,069 INFO L290 TraceCheckUtils]: 39: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,070 INFO L290 TraceCheckUtils]: 38: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,070 INFO L290 TraceCheckUtils]: 37: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,070 INFO L272 TraceCheckUtils]: 36: Hoare triple {20858#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,070 INFO L290 TraceCheckUtils]: 35: Hoare triple {20858#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:43,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {20773#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20858#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:43,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {20773#(<= ~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; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:43,071 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20664#true} {20773#(<= ~counter~0 2)} #67#return; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:43,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,071 INFO L272 TraceCheckUtils]: 28: Hoare triple {20773#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,071 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20664#true} {20773#(<= ~counter~0 2)} #65#return; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:43,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,072 INFO L272 TraceCheckUtils]: 23: Hoare triple {20773#(<= ~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)); {20664#true} is VALID [2022-04-28 11:17:43,072 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20664#true} {20773#(<= ~counter~0 2)} #63#return; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:43,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,072 INFO L272 TraceCheckUtils]: 18: Hoare triple {20773#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,073 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20664#true} {20773#(<= ~counter~0 2)} #61#return; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:43,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,073 INFO L272 TraceCheckUtils]: 13: Hoare triple {20773#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,073 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20664#true} {20773#(<= ~counter~0 2)} #59#return; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:43,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {20664#true} assume true; {20664#true} is VALID [2022-04-28 11:17:43,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {20664#true} assume !(0 == ~cond); {20664#true} is VALID [2022-04-28 11:17:43,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {20664#true} ~cond := #in~cond; {20664#true} is VALID [2022-04-28 11:17:43,074 INFO L272 TraceCheckUtils]: 8: Hoare triple {20773#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20664#true} is VALID [2022-04-28 11:17:43,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {20773#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:43,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {20688#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20773#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:43,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {20688#(<= ~counter~0 1)} 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; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:43,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {20688#(<= ~counter~0 1)} call #t~ret6 := main(); {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:43,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20688#(<= ~counter~0 1)} {20664#true} #81#return; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:43,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {20688#(<= ~counter~0 1)} assume true; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:43,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {20664#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; {20688#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:43,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {20664#true} call ULTIMATE.init(); {20664#true} is VALID [2022-04-28 11:17:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3602 backedges. 82 proven. 240 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2022-04-28 11:17:43,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:43,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393657768] [2022-04-28 11:17:43,083 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:43,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028856599] [2022-04-28 11:17:43,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028856599] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:17:43,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:17:43,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-28 11:17:43,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:43,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1580595387] [2022-04-28 11:17:43,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1580595387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:43,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:43,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 11:17:43,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987843335] [2022-04-28 11:17:43,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:43,084 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 11 states have call successors, (44), 11 states have call predecessors, (44), 10 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) Word has length 241 [2022-04-28 11:17:43,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:43,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 11 states have call successors, (44), 11 states have call predecessors, (44), 10 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2022-04-28 11:17:43,203 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-28 11:17:43,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 11:17:43,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:43,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 11:17:43,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:17:43,204 INFO L87 Difference]: Start difference. First operand 166 states and 188 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 11 states have call successors, (44), 11 states have call predecessors, (44), 10 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2022-04-28 11:17:44,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:44,585 INFO L93 Difference]: Finished difference Result 196 states and 223 transitions. [2022-04-28 11:17:44,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 11:17:44,585 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 11 states have call successors, (44), 11 states have call predecessors, (44), 10 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) Word has length 241 [2022-04-28 11:17:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 11 states have call successors, (44), 11 states have call predecessors, (44), 10 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2022-04-28 11:17:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 175 transitions. [2022-04-28 11:17:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 11 states have call successors, (44), 11 states have call predecessors, (44), 10 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2022-04-28 11:17:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 175 transitions. [2022-04-28 11:17:44,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 175 transitions. [2022-04-28 11:17:44,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:44,740 INFO L225 Difference]: With dead ends: 196 [2022-04-28 11:17:44,740 INFO L226 Difference]: Without dead ends: 182 [2022-04-28 11:17:44,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 468 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=287, Unknown=0, NotChecked=0, Total=462 [2022-04-28 11:17:44,741 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 6 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:44,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 228 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:17:44,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-28 11:17:44,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-04-28 11:17:44,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:44,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 182 states, 105 states have (on average 1.019047619047619) internal successors, (107), 106 states have internal predecessors, (107), 51 states have call successors, (51), 26 states have call predecessors, (51), 25 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-28 11:17:44,938 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 182 states, 105 states have (on average 1.019047619047619) internal successors, (107), 106 states have internal predecessors, (107), 51 states have call successors, (51), 26 states have call predecessors, (51), 25 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-28 11:17:44,938 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 182 states, 105 states have (on average 1.019047619047619) internal successors, (107), 106 states have internal predecessors, (107), 51 states have call successors, (51), 26 states have call predecessors, (51), 25 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-28 11:17:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:44,940 INFO L93 Difference]: Finished difference Result 182 states and 207 transitions. [2022-04-28 11:17:44,941 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 207 transitions. [2022-04-28 11:17:44,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:44,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:44,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 105 states have (on average 1.019047619047619) internal successors, (107), 106 states have internal predecessors, (107), 51 states have call successors, (51), 26 states have call predecessors, (51), 25 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand 182 states. [2022-04-28 11:17:44,941 INFO L87 Difference]: Start difference. First operand has 182 states, 105 states have (on average 1.019047619047619) internal successors, (107), 106 states have internal predecessors, (107), 51 states have call successors, (51), 26 states have call predecessors, (51), 25 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand 182 states. [2022-04-28 11:17:44,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:44,943 INFO L93 Difference]: Finished difference Result 182 states and 207 transitions. [2022-04-28 11:17:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 207 transitions. [2022-04-28 11:17:44,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:44,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:44,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:44,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:44,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 105 states have (on average 1.019047619047619) internal successors, (107), 106 states have internal predecessors, (107), 51 states have call successors, (51), 26 states have call predecessors, (51), 25 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-28 11:17:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 207 transitions. [2022-04-28 11:17:44,947 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 207 transitions. Word has length 241 [2022-04-28 11:17:44,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:44,947 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 207 transitions. [2022-04-28 11:17:44,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 11 states have call successors, (44), 11 states have call predecessors, (44), 10 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2022-04-28 11:17:44,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 207 transitions. [2022-04-28 11:17:57,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 203 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:57,497 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 207 transitions. [2022-04-28 11:17:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-04-28 11:17:57,498 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:57,498 INFO L195 NwaCegarLoop]: trace histogram [47, 46, 46, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:57,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 11:17:57,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:57,715 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:57,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1921553208, now seen corresponding path program 17 times [2022-04-28 11:17:57,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:57,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1127624250] [2022-04-28 11:17:57,947 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:57,947 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:57,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1921553208, now seen corresponding path program 18 times [2022-04-28 11:17:57,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:57,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859229799] [2022-04-28 11:17:57,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:57,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:57,968 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:57,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [988360389] [2022-04-28 11:17:57,968 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:17:57,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:57,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:57,969 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:57,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 11:17:58,521 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-28 11:17:58,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:58,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 11:17:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:58,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:59,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {23259#true} call ULTIMATE.init(); {23259#true} is VALID [2022-04-28 11:17:59,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {23259#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; {23267#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:59,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {23267#(<= ~counter~0 0)} assume true; {23267#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:59,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23267#(<= ~counter~0 0)} {23259#true} #81#return; {23267#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:59,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {23267#(<= ~counter~0 0)} call #t~ret6 := main(); {23267#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:59,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {23267#(<= ~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; {23267#(<= ~counter~0 0)} is VALID [2022-04-28 11:17:59,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {23267#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {23283#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,454 INFO L272 TraceCheckUtils]: 8: Hoare triple {23283#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {23283#(<= ~counter~0 1)} ~cond := #in~cond; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {23283#(<= ~counter~0 1)} assume !(0 == ~cond); {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {23283#(<= ~counter~0 1)} assume true; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,455 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {23283#(<= ~counter~0 1)} {23283#(<= ~counter~0 1)} #59#return; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,456 INFO L272 TraceCheckUtils]: 13: Hoare triple {23283#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {23283#(<= ~counter~0 1)} ~cond := #in~cond; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {23283#(<= ~counter~0 1)} assume !(0 == ~cond); {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {23283#(<= ~counter~0 1)} assume true; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,457 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {23283#(<= ~counter~0 1)} {23283#(<= ~counter~0 1)} #61#return; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,457 INFO L272 TraceCheckUtils]: 18: Hoare triple {23283#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {23283#(<= ~counter~0 1)} ~cond := #in~cond; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {23283#(<= ~counter~0 1)} assume !(0 == ~cond); {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {23283#(<= ~counter~0 1)} assume true; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,458 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {23283#(<= ~counter~0 1)} {23283#(<= ~counter~0 1)} #63#return; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,459 INFO L272 TraceCheckUtils]: 23: Hoare triple {23283#(<= ~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)); {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {23283#(<= ~counter~0 1)} ~cond := #in~cond; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {23283#(<= ~counter~0 1)} assume !(0 == ~cond); {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {23283#(<= ~counter~0 1)} assume true; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,460 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {23283#(<= ~counter~0 1)} {23283#(<= ~counter~0 1)} #65#return; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,460 INFO L272 TraceCheckUtils]: 28: Hoare triple {23283#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {23283#(<= ~counter~0 1)} ~cond := #in~cond; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {23283#(<= ~counter~0 1)} assume !(0 == ~cond); {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {23283#(<= ~counter~0 1)} assume true; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,461 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23283#(<= ~counter~0 1)} {23283#(<= ~counter~0 1)} #67#return; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {23283#(<= ~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; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:17:59,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {23283#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {23368#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,462 INFO L272 TraceCheckUtils]: 36: Hoare triple {23368#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {23368#(<= ~counter~0 2)} ~cond := #in~cond; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {23368#(<= ~counter~0 2)} assume !(0 == ~cond); {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,463 INFO L290 TraceCheckUtils]: 39: Hoare triple {23368#(<= ~counter~0 2)} assume true; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,464 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {23368#(<= ~counter~0 2)} {23368#(<= ~counter~0 2)} #59#return; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,464 INFO L272 TraceCheckUtils]: 41: Hoare triple {23368#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {23368#(<= ~counter~0 2)} ~cond := #in~cond; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,464 INFO L290 TraceCheckUtils]: 43: Hoare triple {23368#(<= ~counter~0 2)} assume !(0 == ~cond); {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,465 INFO L290 TraceCheckUtils]: 44: Hoare triple {23368#(<= ~counter~0 2)} assume true; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,465 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {23368#(<= ~counter~0 2)} {23368#(<= ~counter~0 2)} #61#return; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,465 INFO L272 TraceCheckUtils]: 46: Hoare triple {23368#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,466 INFO L290 TraceCheckUtils]: 47: Hoare triple {23368#(<= ~counter~0 2)} ~cond := #in~cond; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {23368#(<= ~counter~0 2)} assume !(0 == ~cond); {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {23368#(<= ~counter~0 2)} assume true; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,466 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23368#(<= ~counter~0 2)} {23368#(<= ~counter~0 2)} #63#return; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,467 INFO L272 TraceCheckUtils]: 51: Hoare triple {23368#(<= ~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)); {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,467 INFO L290 TraceCheckUtils]: 52: Hoare triple {23368#(<= ~counter~0 2)} ~cond := #in~cond; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,467 INFO L290 TraceCheckUtils]: 53: Hoare triple {23368#(<= ~counter~0 2)} assume !(0 == ~cond); {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,467 INFO L290 TraceCheckUtils]: 54: Hoare triple {23368#(<= ~counter~0 2)} assume true; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,470 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23368#(<= ~counter~0 2)} {23368#(<= ~counter~0 2)} #65#return; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,470 INFO L272 TraceCheckUtils]: 56: Hoare triple {23368#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,471 INFO L290 TraceCheckUtils]: 57: Hoare triple {23368#(<= ~counter~0 2)} ~cond := #in~cond; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,471 INFO L290 TraceCheckUtils]: 58: Hoare triple {23368#(<= ~counter~0 2)} assume !(0 == ~cond); {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,471 INFO L290 TraceCheckUtils]: 59: Hoare triple {23368#(<= ~counter~0 2)} assume true; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,472 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {23368#(<= ~counter~0 2)} {23368#(<= ~counter~0 2)} #67#return; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,472 INFO L290 TraceCheckUtils]: 61: Hoare triple {23368#(<= ~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; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:17:59,472 INFO L290 TraceCheckUtils]: 62: Hoare triple {23368#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,473 INFO L290 TraceCheckUtils]: 63: Hoare triple {23453#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,473 INFO L272 TraceCheckUtils]: 64: Hoare triple {23453#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,473 INFO L290 TraceCheckUtils]: 65: Hoare triple {23453#(<= ~counter~0 3)} ~cond := #in~cond; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,473 INFO L290 TraceCheckUtils]: 66: Hoare triple {23453#(<= ~counter~0 3)} assume !(0 == ~cond); {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,474 INFO L290 TraceCheckUtils]: 67: Hoare triple {23453#(<= ~counter~0 3)} assume true; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,474 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {23453#(<= ~counter~0 3)} {23453#(<= ~counter~0 3)} #59#return; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,474 INFO L272 TraceCheckUtils]: 69: Hoare triple {23453#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,475 INFO L290 TraceCheckUtils]: 70: Hoare triple {23453#(<= ~counter~0 3)} ~cond := #in~cond; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,475 INFO L290 TraceCheckUtils]: 71: Hoare triple {23453#(<= ~counter~0 3)} assume !(0 == ~cond); {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,475 INFO L290 TraceCheckUtils]: 72: Hoare triple {23453#(<= ~counter~0 3)} assume true; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,475 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {23453#(<= ~counter~0 3)} {23453#(<= ~counter~0 3)} #61#return; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,476 INFO L272 TraceCheckUtils]: 74: Hoare triple {23453#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,476 INFO L290 TraceCheckUtils]: 75: Hoare triple {23453#(<= ~counter~0 3)} ~cond := #in~cond; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,476 INFO L290 TraceCheckUtils]: 76: Hoare triple {23453#(<= ~counter~0 3)} assume !(0 == ~cond); {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,476 INFO L290 TraceCheckUtils]: 77: Hoare triple {23453#(<= ~counter~0 3)} assume true; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,477 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {23453#(<= ~counter~0 3)} {23453#(<= ~counter~0 3)} #63#return; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,477 INFO L272 TraceCheckUtils]: 79: Hoare triple {23453#(<= ~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)); {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,477 INFO L290 TraceCheckUtils]: 80: Hoare triple {23453#(<= ~counter~0 3)} ~cond := #in~cond; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,478 INFO L290 TraceCheckUtils]: 81: Hoare triple {23453#(<= ~counter~0 3)} assume !(0 == ~cond); {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,478 INFO L290 TraceCheckUtils]: 82: Hoare triple {23453#(<= ~counter~0 3)} assume true; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,478 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {23453#(<= ~counter~0 3)} {23453#(<= ~counter~0 3)} #65#return; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,479 INFO L272 TraceCheckUtils]: 84: Hoare triple {23453#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,479 INFO L290 TraceCheckUtils]: 85: Hoare triple {23453#(<= ~counter~0 3)} ~cond := #in~cond; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,479 INFO L290 TraceCheckUtils]: 86: Hoare triple {23453#(<= ~counter~0 3)} assume !(0 == ~cond); {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,479 INFO L290 TraceCheckUtils]: 87: Hoare triple {23453#(<= ~counter~0 3)} assume true; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,480 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {23453#(<= ~counter~0 3)} {23453#(<= ~counter~0 3)} #67#return; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,480 INFO L290 TraceCheckUtils]: 89: Hoare triple {23453#(<= ~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; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:17:59,480 INFO L290 TraceCheckUtils]: 90: Hoare triple {23453#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,481 INFO L290 TraceCheckUtils]: 91: Hoare triple {23538#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,481 INFO L272 TraceCheckUtils]: 92: Hoare triple {23538#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,481 INFO L290 TraceCheckUtils]: 93: Hoare triple {23538#(<= ~counter~0 4)} ~cond := #in~cond; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,482 INFO L290 TraceCheckUtils]: 94: Hoare triple {23538#(<= ~counter~0 4)} assume !(0 == ~cond); {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,482 INFO L290 TraceCheckUtils]: 95: Hoare triple {23538#(<= ~counter~0 4)} assume true; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,482 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {23538#(<= ~counter~0 4)} {23538#(<= ~counter~0 4)} #59#return; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,482 INFO L272 TraceCheckUtils]: 97: Hoare triple {23538#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,483 INFO L290 TraceCheckUtils]: 98: Hoare triple {23538#(<= ~counter~0 4)} ~cond := #in~cond; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,483 INFO L290 TraceCheckUtils]: 99: Hoare triple {23538#(<= ~counter~0 4)} assume !(0 == ~cond); {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,483 INFO L290 TraceCheckUtils]: 100: Hoare triple {23538#(<= ~counter~0 4)} assume true; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,484 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {23538#(<= ~counter~0 4)} {23538#(<= ~counter~0 4)} #61#return; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,484 INFO L272 TraceCheckUtils]: 102: Hoare triple {23538#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,484 INFO L290 TraceCheckUtils]: 103: Hoare triple {23538#(<= ~counter~0 4)} ~cond := #in~cond; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,484 INFO L290 TraceCheckUtils]: 104: Hoare triple {23538#(<= ~counter~0 4)} assume !(0 == ~cond); {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,485 INFO L290 TraceCheckUtils]: 105: Hoare triple {23538#(<= ~counter~0 4)} assume true; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,485 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {23538#(<= ~counter~0 4)} {23538#(<= ~counter~0 4)} #63#return; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,485 INFO L272 TraceCheckUtils]: 107: Hoare triple {23538#(<= ~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)); {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,486 INFO L290 TraceCheckUtils]: 108: Hoare triple {23538#(<= ~counter~0 4)} ~cond := #in~cond; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,486 INFO L290 TraceCheckUtils]: 109: Hoare triple {23538#(<= ~counter~0 4)} assume !(0 == ~cond); {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,486 INFO L290 TraceCheckUtils]: 110: Hoare triple {23538#(<= ~counter~0 4)} assume true; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,486 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {23538#(<= ~counter~0 4)} {23538#(<= ~counter~0 4)} #65#return; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,487 INFO L272 TraceCheckUtils]: 112: Hoare triple {23538#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,487 INFO L290 TraceCheckUtils]: 113: Hoare triple {23538#(<= ~counter~0 4)} ~cond := #in~cond; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,487 INFO L290 TraceCheckUtils]: 114: Hoare triple {23538#(<= ~counter~0 4)} assume !(0 == ~cond); {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,488 INFO L290 TraceCheckUtils]: 115: Hoare triple {23538#(<= ~counter~0 4)} assume true; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,488 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {23538#(<= ~counter~0 4)} {23538#(<= ~counter~0 4)} #67#return; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,488 INFO L290 TraceCheckUtils]: 117: Hoare triple {23538#(<= ~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; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:17:59,489 INFO L290 TraceCheckUtils]: 118: Hoare triple {23538#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,489 INFO L290 TraceCheckUtils]: 119: Hoare triple {23623#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,489 INFO L272 TraceCheckUtils]: 120: Hoare triple {23623#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,489 INFO L290 TraceCheckUtils]: 121: Hoare triple {23623#(<= ~counter~0 5)} ~cond := #in~cond; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,490 INFO L290 TraceCheckUtils]: 122: Hoare triple {23623#(<= ~counter~0 5)} assume !(0 == ~cond); {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,490 INFO L290 TraceCheckUtils]: 123: Hoare triple {23623#(<= ~counter~0 5)} assume true; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,490 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {23623#(<= ~counter~0 5)} {23623#(<= ~counter~0 5)} #59#return; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,491 INFO L272 TraceCheckUtils]: 125: Hoare triple {23623#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,491 INFO L290 TraceCheckUtils]: 126: Hoare triple {23623#(<= ~counter~0 5)} ~cond := #in~cond; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,491 INFO L290 TraceCheckUtils]: 127: Hoare triple {23623#(<= ~counter~0 5)} assume !(0 == ~cond); {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,491 INFO L290 TraceCheckUtils]: 128: Hoare triple {23623#(<= ~counter~0 5)} assume true; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,492 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {23623#(<= ~counter~0 5)} {23623#(<= ~counter~0 5)} #61#return; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,492 INFO L272 TraceCheckUtils]: 130: Hoare triple {23623#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,492 INFO L290 TraceCheckUtils]: 131: Hoare triple {23623#(<= ~counter~0 5)} ~cond := #in~cond; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,492 INFO L290 TraceCheckUtils]: 132: Hoare triple {23623#(<= ~counter~0 5)} assume !(0 == ~cond); {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,493 INFO L290 TraceCheckUtils]: 133: Hoare triple {23623#(<= ~counter~0 5)} assume true; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,493 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {23623#(<= ~counter~0 5)} {23623#(<= ~counter~0 5)} #63#return; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,494 INFO L272 TraceCheckUtils]: 135: Hoare triple {23623#(<= ~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)); {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,494 INFO L290 TraceCheckUtils]: 136: Hoare triple {23623#(<= ~counter~0 5)} ~cond := #in~cond; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,494 INFO L290 TraceCheckUtils]: 137: Hoare triple {23623#(<= ~counter~0 5)} assume !(0 == ~cond); {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,494 INFO L290 TraceCheckUtils]: 138: Hoare triple {23623#(<= ~counter~0 5)} assume true; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,495 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {23623#(<= ~counter~0 5)} {23623#(<= ~counter~0 5)} #65#return; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,495 INFO L272 TraceCheckUtils]: 140: Hoare triple {23623#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,495 INFO L290 TraceCheckUtils]: 141: Hoare triple {23623#(<= ~counter~0 5)} ~cond := #in~cond; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,495 INFO L290 TraceCheckUtils]: 142: Hoare triple {23623#(<= ~counter~0 5)} assume !(0 == ~cond); {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,496 INFO L290 TraceCheckUtils]: 143: Hoare triple {23623#(<= ~counter~0 5)} assume true; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,496 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {23623#(<= ~counter~0 5)} {23623#(<= ~counter~0 5)} #67#return; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,496 INFO L290 TraceCheckUtils]: 145: Hoare triple {23623#(<= ~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; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:17:59,497 INFO L290 TraceCheckUtils]: 146: Hoare triple {23623#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,497 INFO L290 TraceCheckUtils]: 147: Hoare triple {23708#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,497 INFO L272 TraceCheckUtils]: 148: Hoare triple {23708#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,498 INFO L290 TraceCheckUtils]: 149: Hoare triple {23708#(<= ~counter~0 6)} ~cond := #in~cond; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,498 INFO L290 TraceCheckUtils]: 150: Hoare triple {23708#(<= ~counter~0 6)} assume !(0 == ~cond); {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,498 INFO L290 TraceCheckUtils]: 151: Hoare triple {23708#(<= ~counter~0 6)} assume true; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,498 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {23708#(<= ~counter~0 6)} {23708#(<= ~counter~0 6)} #59#return; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,506 INFO L272 TraceCheckUtils]: 153: Hoare triple {23708#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,507 INFO L290 TraceCheckUtils]: 154: Hoare triple {23708#(<= ~counter~0 6)} ~cond := #in~cond; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,507 INFO L290 TraceCheckUtils]: 155: Hoare triple {23708#(<= ~counter~0 6)} assume !(0 == ~cond); {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,507 INFO L290 TraceCheckUtils]: 156: Hoare triple {23708#(<= ~counter~0 6)} assume true; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,508 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {23708#(<= ~counter~0 6)} {23708#(<= ~counter~0 6)} #61#return; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,508 INFO L272 TraceCheckUtils]: 158: Hoare triple {23708#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,508 INFO L290 TraceCheckUtils]: 159: Hoare triple {23708#(<= ~counter~0 6)} ~cond := #in~cond; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,508 INFO L290 TraceCheckUtils]: 160: Hoare triple {23708#(<= ~counter~0 6)} assume !(0 == ~cond); {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,509 INFO L290 TraceCheckUtils]: 161: Hoare triple {23708#(<= ~counter~0 6)} assume true; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,509 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {23708#(<= ~counter~0 6)} {23708#(<= ~counter~0 6)} #63#return; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,509 INFO L272 TraceCheckUtils]: 163: Hoare triple {23708#(<= ~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)); {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,510 INFO L290 TraceCheckUtils]: 164: Hoare triple {23708#(<= ~counter~0 6)} ~cond := #in~cond; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,510 INFO L290 TraceCheckUtils]: 165: Hoare triple {23708#(<= ~counter~0 6)} assume !(0 == ~cond); {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,510 INFO L290 TraceCheckUtils]: 166: Hoare triple {23708#(<= ~counter~0 6)} assume true; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,510 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {23708#(<= ~counter~0 6)} {23708#(<= ~counter~0 6)} #65#return; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,511 INFO L272 TraceCheckUtils]: 168: Hoare triple {23708#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,511 INFO L290 TraceCheckUtils]: 169: Hoare triple {23708#(<= ~counter~0 6)} ~cond := #in~cond; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,511 INFO L290 TraceCheckUtils]: 170: Hoare triple {23708#(<= ~counter~0 6)} assume !(0 == ~cond); {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,512 INFO L290 TraceCheckUtils]: 171: Hoare triple {23708#(<= ~counter~0 6)} assume true; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,512 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {23708#(<= ~counter~0 6)} {23708#(<= ~counter~0 6)} #67#return; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,512 INFO L290 TraceCheckUtils]: 173: Hoare triple {23708#(<= ~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; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:17:59,513 INFO L290 TraceCheckUtils]: 174: Hoare triple {23708#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,513 INFO L290 TraceCheckUtils]: 175: Hoare triple {23793#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,514 INFO L272 TraceCheckUtils]: 176: Hoare triple {23793#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,514 INFO L290 TraceCheckUtils]: 177: Hoare triple {23793#(<= ~counter~0 7)} ~cond := #in~cond; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,514 INFO L290 TraceCheckUtils]: 178: Hoare triple {23793#(<= ~counter~0 7)} assume !(0 == ~cond); {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,514 INFO L290 TraceCheckUtils]: 179: Hoare triple {23793#(<= ~counter~0 7)} assume true; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,515 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {23793#(<= ~counter~0 7)} {23793#(<= ~counter~0 7)} #59#return; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,515 INFO L272 TraceCheckUtils]: 181: Hoare triple {23793#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,515 INFO L290 TraceCheckUtils]: 182: Hoare triple {23793#(<= ~counter~0 7)} ~cond := #in~cond; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,515 INFO L290 TraceCheckUtils]: 183: Hoare triple {23793#(<= ~counter~0 7)} assume !(0 == ~cond); {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,516 INFO L290 TraceCheckUtils]: 184: Hoare triple {23793#(<= ~counter~0 7)} assume true; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,516 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {23793#(<= ~counter~0 7)} {23793#(<= ~counter~0 7)} #61#return; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,516 INFO L272 TraceCheckUtils]: 186: Hoare triple {23793#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,517 INFO L290 TraceCheckUtils]: 187: Hoare triple {23793#(<= ~counter~0 7)} ~cond := #in~cond; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,517 INFO L290 TraceCheckUtils]: 188: Hoare triple {23793#(<= ~counter~0 7)} assume !(0 == ~cond); {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,517 INFO L290 TraceCheckUtils]: 189: Hoare triple {23793#(<= ~counter~0 7)} assume true; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,517 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {23793#(<= ~counter~0 7)} {23793#(<= ~counter~0 7)} #63#return; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,518 INFO L272 TraceCheckUtils]: 191: Hoare triple {23793#(<= ~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)); {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,518 INFO L290 TraceCheckUtils]: 192: Hoare triple {23793#(<= ~counter~0 7)} ~cond := #in~cond; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,518 INFO L290 TraceCheckUtils]: 193: Hoare triple {23793#(<= ~counter~0 7)} assume !(0 == ~cond); {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,519 INFO L290 TraceCheckUtils]: 194: Hoare triple {23793#(<= ~counter~0 7)} assume true; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,519 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {23793#(<= ~counter~0 7)} {23793#(<= ~counter~0 7)} #65#return; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,519 INFO L272 TraceCheckUtils]: 196: Hoare triple {23793#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,520 INFO L290 TraceCheckUtils]: 197: Hoare triple {23793#(<= ~counter~0 7)} ~cond := #in~cond; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,520 INFO L290 TraceCheckUtils]: 198: Hoare triple {23793#(<= ~counter~0 7)} assume !(0 == ~cond); {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,520 INFO L290 TraceCheckUtils]: 199: Hoare triple {23793#(<= ~counter~0 7)} assume true; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,520 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {23793#(<= ~counter~0 7)} {23793#(<= ~counter~0 7)} #67#return; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,521 INFO L290 TraceCheckUtils]: 201: Hoare triple {23793#(<= ~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; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:17:59,521 INFO L290 TraceCheckUtils]: 202: Hoare triple {23793#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,521 INFO L290 TraceCheckUtils]: 203: Hoare triple {23878#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,522 INFO L272 TraceCheckUtils]: 204: Hoare triple {23878#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,522 INFO L290 TraceCheckUtils]: 205: Hoare triple {23878#(<= ~counter~0 8)} ~cond := #in~cond; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,522 INFO L290 TraceCheckUtils]: 206: Hoare triple {23878#(<= ~counter~0 8)} assume !(0 == ~cond); {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,522 INFO L290 TraceCheckUtils]: 207: Hoare triple {23878#(<= ~counter~0 8)} assume true; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,523 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {23878#(<= ~counter~0 8)} {23878#(<= ~counter~0 8)} #59#return; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,524 INFO L272 TraceCheckUtils]: 209: Hoare triple {23878#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,524 INFO L290 TraceCheckUtils]: 210: Hoare triple {23878#(<= ~counter~0 8)} ~cond := #in~cond; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,525 INFO L290 TraceCheckUtils]: 211: Hoare triple {23878#(<= ~counter~0 8)} assume !(0 == ~cond); {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,525 INFO L290 TraceCheckUtils]: 212: Hoare triple {23878#(<= ~counter~0 8)} assume true; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,525 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {23878#(<= ~counter~0 8)} {23878#(<= ~counter~0 8)} #61#return; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,526 INFO L272 TraceCheckUtils]: 214: Hoare triple {23878#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,526 INFO L290 TraceCheckUtils]: 215: Hoare triple {23878#(<= ~counter~0 8)} ~cond := #in~cond; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,526 INFO L290 TraceCheckUtils]: 216: Hoare triple {23878#(<= ~counter~0 8)} assume !(0 == ~cond); {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,526 INFO L290 TraceCheckUtils]: 217: Hoare triple {23878#(<= ~counter~0 8)} assume true; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,527 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {23878#(<= ~counter~0 8)} {23878#(<= ~counter~0 8)} #63#return; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,527 INFO L272 TraceCheckUtils]: 219: Hoare triple {23878#(<= ~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)); {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,527 INFO L290 TraceCheckUtils]: 220: Hoare triple {23878#(<= ~counter~0 8)} ~cond := #in~cond; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,528 INFO L290 TraceCheckUtils]: 221: Hoare triple {23878#(<= ~counter~0 8)} assume !(0 == ~cond); {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,528 INFO L290 TraceCheckUtils]: 222: Hoare triple {23878#(<= ~counter~0 8)} assume true; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,528 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {23878#(<= ~counter~0 8)} {23878#(<= ~counter~0 8)} #65#return; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,529 INFO L272 TraceCheckUtils]: 224: Hoare triple {23878#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,529 INFO L290 TraceCheckUtils]: 225: Hoare triple {23878#(<= ~counter~0 8)} ~cond := #in~cond; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,529 INFO L290 TraceCheckUtils]: 226: Hoare triple {23878#(<= ~counter~0 8)} assume !(0 == ~cond); {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,529 INFO L290 TraceCheckUtils]: 227: Hoare triple {23878#(<= ~counter~0 8)} assume true; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,530 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {23878#(<= ~counter~0 8)} {23878#(<= ~counter~0 8)} #67#return; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,530 INFO L290 TraceCheckUtils]: 229: Hoare triple {23878#(<= ~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; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:17:59,530 INFO L290 TraceCheckUtils]: 230: Hoare triple {23878#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,531 INFO L290 TraceCheckUtils]: 231: Hoare triple {23963#(<= ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,531 INFO L272 TraceCheckUtils]: 232: Hoare triple {23963#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,538 INFO L290 TraceCheckUtils]: 233: Hoare triple {23963#(<= ~counter~0 9)} ~cond := #in~cond; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,538 INFO L290 TraceCheckUtils]: 234: Hoare triple {23963#(<= ~counter~0 9)} assume !(0 == ~cond); {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,538 INFO L290 TraceCheckUtils]: 235: Hoare triple {23963#(<= ~counter~0 9)} assume true; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,539 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {23963#(<= ~counter~0 9)} {23963#(<= ~counter~0 9)} #59#return; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,539 INFO L272 TraceCheckUtils]: 237: Hoare triple {23963#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,539 INFO L290 TraceCheckUtils]: 238: Hoare triple {23963#(<= ~counter~0 9)} ~cond := #in~cond; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,539 INFO L290 TraceCheckUtils]: 239: Hoare triple {23963#(<= ~counter~0 9)} assume !(0 == ~cond); {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,540 INFO L290 TraceCheckUtils]: 240: Hoare triple {23963#(<= ~counter~0 9)} assume true; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,540 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {23963#(<= ~counter~0 9)} {23963#(<= ~counter~0 9)} #61#return; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,540 INFO L272 TraceCheckUtils]: 242: Hoare triple {23963#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,541 INFO L290 TraceCheckUtils]: 243: Hoare triple {23963#(<= ~counter~0 9)} ~cond := #in~cond; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,541 INFO L290 TraceCheckUtils]: 244: Hoare triple {23963#(<= ~counter~0 9)} assume !(0 == ~cond); {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,541 INFO L290 TraceCheckUtils]: 245: Hoare triple {23963#(<= ~counter~0 9)} assume true; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,541 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {23963#(<= ~counter~0 9)} {23963#(<= ~counter~0 9)} #63#return; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,542 INFO L272 TraceCheckUtils]: 247: Hoare triple {23963#(<= ~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)); {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,542 INFO L290 TraceCheckUtils]: 248: Hoare triple {23963#(<= ~counter~0 9)} ~cond := #in~cond; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,542 INFO L290 TraceCheckUtils]: 249: Hoare triple {23963#(<= ~counter~0 9)} assume !(0 == ~cond); {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,543 INFO L290 TraceCheckUtils]: 250: Hoare triple {23963#(<= ~counter~0 9)} assume true; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,543 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {23963#(<= ~counter~0 9)} {23963#(<= ~counter~0 9)} #65#return; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,543 INFO L272 TraceCheckUtils]: 252: Hoare triple {23963#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,544 INFO L290 TraceCheckUtils]: 253: Hoare triple {23963#(<= ~counter~0 9)} ~cond := #in~cond; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,544 INFO L290 TraceCheckUtils]: 254: Hoare triple {23963#(<= ~counter~0 9)} assume !(0 == ~cond); {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,544 INFO L290 TraceCheckUtils]: 255: Hoare triple {23963#(<= ~counter~0 9)} assume true; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,544 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {23963#(<= ~counter~0 9)} {23963#(<= ~counter~0 9)} #67#return; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,545 INFO L290 TraceCheckUtils]: 257: Hoare triple {23963#(<= ~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; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:17:59,545 INFO L290 TraceCheckUtils]: 258: Hoare triple {23963#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24048#(<= |main_#t~post5| 9)} is VALID [2022-04-28 11:17:59,545 INFO L290 TraceCheckUtils]: 259: Hoare triple {24048#(<= |main_#t~post5| 9)} assume !(#t~post5 < 10);havoc #t~post5; {23260#false} is VALID [2022-04-28 11:17:59,545 INFO L272 TraceCheckUtils]: 260: Hoare triple {23260#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23260#false} is VALID [2022-04-28 11:17:59,545 INFO L290 TraceCheckUtils]: 261: Hoare triple {23260#false} ~cond := #in~cond; {23260#false} is VALID [2022-04-28 11:17:59,545 INFO L290 TraceCheckUtils]: 262: Hoare triple {23260#false} assume !(0 == ~cond); {23260#false} is VALID [2022-04-28 11:17:59,545 INFO L290 TraceCheckUtils]: 263: Hoare triple {23260#false} assume true; {23260#false} is VALID [2022-04-28 11:17:59,546 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {23260#false} {23260#false} #69#return; {23260#false} is VALID [2022-04-28 11:17:59,546 INFO L272 TraceCheckUtils]: 265: Hoare triple {23260#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {23260#false} is VALID [2022-04-28 11:17:59,546 INFO L290 TraceCheckUtils]: 266: Hoare triple {23260#false} ~cond := #in~cond; {23260#false} is VALID [2022-04-28 11:17:59,546 INFO L290 TraceCheckUtils]: 267: Hoare triple {23260#false} assume 0 == ~cond; {23260#false} is VALID [2022-04-28 11:17:59,546 INFO L290 TraceCheckUtils]: 268: Hoare triple {23260#false} assume !false; {23260#false} is VALID [2022-04-28 11:17:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4538 backedges. 270 proven. 3906 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2022-04-28 11:17:59,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:00,278 INFO L290 TraceCheckUtils]: 268: Hoare triple {23260#false} assume !false; {23260#false} is VALID [2022-04-28 11:18:00,279 INFO L290 TraceCheckUtils]: 267: Hoare triple {23260#false} assume 0 == ~cond; {23260#false} is VALID [2022-04-28 11:18:00,279 INFO L290 TraceCheckUtils]: 266: Hoare triple {23260#false} ~cond := #in~cond; {23260#false} is VALID [2022-04-28 11:18:00,279 INFO L272 TraceCheckUtils]: 265: Hoare triple {23260#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {23260#false} is VALID [2022-04-28 11:18:00,279 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {23259#true} {23260#false} #69#return; {23260#false} is VALID [2022-04-28 11:18:00,279 INFO L290 TraceCheckUtils]: 263: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,279 INFO L290 TraceCheckUtils]: 262: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,279 INFO L290 TraceCheckUtils]: 261: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,279 INFO L272 TraceCheckUtils]: 260: Hoare triple {23260#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,279 INFO L290 TraceCheckUtils]: 259: Hoare triple {24048#(<= |main_#t~post5| 9)} assume !(#t~post5 < 10);havoc #t~post5; {23260#false} is VALID [2022-04-28 11:18:00,280 INFO L290 TraceCheckUtils]: 258: Hoare triple {23963#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24048#(<= |main_#t~post5| 9)} is VALID [2022-04-28 11:18:00,280 INFO L290 TraceCheckUtils]: 257: Hoare triple {23963#(<= ~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; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:18:00,280 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {23259#true} {23963#(<= ~counter~0 9)} #67#return; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:18:00,280 INFO L290 TraceCheckUtils]: 255: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,280 INFO L290 TraceCheckUtils]: 254: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,280 INFO L290 TraceCheckUtils]: 253: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,280 INFO L272 TraceCheckUtils]: 252: Hoare triple {23963#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,281 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {23259#true} {23963#(<= ~counter~0 9)} #65#return; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:18:00,281 INFO L290 TraceCheckUtils]: 250: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,281 INFO L290 TraceCheckUtils]: 249: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,281 INFO L290 TraceCheckUtils]: 248: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,281 INFO L272 TraceCheckUtils]: 247: Hoare triple {23963#(<= ~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)); {23259#true} is VALID [2022-04-28 11:18:00,281 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {23259#true} {23963#(<= ~counter~0 9)} #63#return; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:18:00,281 INFO L290 TraceCheckUtils]: 245: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,282 INFO L290 TraceCheckUtils]: 244: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,282 INFO L290 TraceCheckUtils]: 243: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,282 INFO L272 TraceCheckUtils]: 242: Hoare triple {23963#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,282 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {23259#true} {23963#(<= ~counter~0 9)} #61#return; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:18:00,282 INFO L290 TraceCheckUtils]: 240: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,282 INFO L290 TraceCheckUtils]: 239: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,282 INFO L290 TraceCheckUtils]: 238: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,282 INFO L272 TraceCheckUtils]: 237: Hoare triple {23963#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,283 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {23259#true} {23963#(<= ~counter~0 9)} #59#return; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:18:00,283 INFO L290 TraceCheckUtils]: 235: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,283 INFO L290 TraceCheckUtils]: 234: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,283 INFO L290 TraceCheckUtils]: 233: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,283 INFO L272 TraceCheckUtils]: 232: Hoare triple {23963#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,283 INFO L290 TraceCheckUtils]: 231: Hoare triple {23963#(<= ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:18:00,284 INFO L290 TraceCheckUtils]: 230: Hoare triple {23878#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23963#(<= ~counter~0 9)} is VALID [2022-04-28 11:18:00,284 INFO L290 TraceCheckUtils]: 229: Hoare triple {23878#(<= ~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; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:18:00,284 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {23259#true} {23878#(<= ~counter~0 8)} #67#return; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:18:00,284 INFO L290 TraceCheckUtils]: 227: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,284 INFO L290 TraceCheckUtils]: 226: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,284 INFO L290 TraceCheckUtils]: 225: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,285 INFO L272 TraceCheckUtils]: 224: Hoare triple {23878#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,285 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {23259#true} {23878#(<= ~counter~0 8)} #65#return; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:18:00,285 INFO L290 TraceCheckUtils]: 222: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,285 INFO L290 TraceCheckUtils]: 221: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,285 INFO L290 TraceCheckUtils]: 220: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,285 INFO L272 TraceCheckUtils]: 219: Hoare triple {23878#(<= ~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)); {23259#true} is VALID [2022-04-28 11:18:00,286 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {23259#true} {23878#(<= ~counter~0 8)} #63#return; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:18:00,286 INFO L290 TraceCheckUtils]: 217: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,286 INFO L290 TraceCheckUtils]: 216: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,286 INFO L290 TraceCheckUtils]: 215: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,286 INFO L272 TraceCheckUtils]: 214: Hoare triple {23878#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,286 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {23259#true} {23878#(<= ~counter~0 8)} #61#return; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:18:00,286 INFO L290 TraceCheckUtils]: 212: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,286 INFO L290 TraceCheckUtils]: 211: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,286 INFO L290 TraceCheckUtils]: 210: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,286 INFO L272 TraceCheckUtils]: 209: Hoare triple {23878#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,287 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {23259#true} {23878#(<= ~counter~0 8)} #59#return; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:18:00,287 INFO L290 TraceCheckUtils]: 207: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,287 INFO L290 TraceCheckUtils]: 206: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,287 INFO L290 TraceCheckUtils]: 205: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,287 INFO L272 TraceCheckUtils]: 204: Hoare triple {23878#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,287 INFO L290 TraceCheckUtils]: 203: Hoare triple {23878#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:18:00,288 INFO L290 TraceCheckUtils]: 202: Hoare triple {23793#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23878#(<= ~counter~0 8)} is VALID [2022-04-28 11:18:00,288 INFO L290 TraceCheckUtils]: 201: Hoare triple {23793#(<= ~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; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:18:00,288 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {23259#true} {23793#(<= ~counter~0 7)} #67#return; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:18:00,288 INFO L290 TraceCheckUtils]: 199: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,288 INFO L290 TraceCheckUtils]: 198: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,288 INFO L290 TraceCheckUtils]: 197: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,288 INFO L272 TraceCheckUtils]: 196: Hoare triple {23793#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,289 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {23259#true} {23793#(<= ~counter~0 7)} #65#return; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:18:00,289 INFO L290 TraceCheckUtils]: 194: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,289 INFO L290 TraceCheckUtils]: 193: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,289 INFO L290 TraceCheckUtils]: 192: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,289 INFO L272 TraceCheckUtils]: 191: Hoare triple {23793#(<= ~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)); {23259#true} is VALID [2022-04-28 11:18:00,289 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {23259#true} {23793#(<= ~counter~0 7)} #63#return; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:18:00,289 INFO L290 TraceCheckUtils]: 189: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,289 INFO L290 TraceCheckUtils]: 188: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,290 INFO L290 TraceCheckUtils]: 187: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,290 INFO L272 TraceCheckUtils]: 186: Hoare triple {23793#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,290 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {23259#true} {23793#(<= ~counter~0 7)} #61#return; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:18:00,290 INFO L290 TraceCheckUtils]: 184: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,290 INFO L290 TraceCheckUtils]: 183: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,290 INFO L290 TraceCheckUtils]: 182: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,290 INFO L272 TraceCheckUtils]: 181: Hoare triple {23793#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,291 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {23259#true} {23793#(<= ~counter~0 7)} #59#return; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:18:00,291 INFO L290 TraceCheckUtils]: 179: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,291 INFO L290 TraceCheckUtils]: 178: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,291 INFO L290 TraceCheckUtils]: 177: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,291 INFO L272 TraceCheckUtils]: 176: Hoare triple {23793#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,291 INFO L290 TraceCheckUtils]: 175: Hoare triple {23793#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:18:00,291 INFO L290 TraceCheckUtils]: 174: Hoare triple {23708#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23793#(<= ~counter~0 7)} is VALID [2022-04-28 11:18:00,292 INFO L290 TraceCheckUtils]: 173: Hoare triple {23708#(<= ~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; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:18:00,292 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {23259#true} {23708#(<= ~counter~0 6)} #67#return; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:18:00,292 INFO L290 TraceCheckUtils]: 171: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,292 INFO L290 TraceCheckUtils]: 170: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,292 INFO L290 TraceCheckUtils]: 169: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,292 INFO L272 TraceCheckUtils]: 168: Hoare triple {23708#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,293 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {23259#true} {23708#(<= ~counter~0 6)} #65#return; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:18:00,293 INFO L290 TraceCheckUtils]: 166: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,293 INFO L290 TraceCheckUtils]: 165: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,293 INFO L290 TraceCheckUtils]: 164: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,293 INFO L272 TraceCheckUtils]: 163: Hoare triple {23708#(<= ~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)); {23259#true} is VALID [2022-04-28 11:18:00,293 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {23259#true} {23708#(<= ~counter~0 6)} #63#return; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:18:00,293 INFO L290 TraceCheckUtils]: 161: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,293 INFO L290 TraceCheckUtils]: 160: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,293 INFO L290 TraceCheckUtils]: 159: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,293 INFO L272 TraceCheckUtils]: 158: Hoare triple {23708#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,294 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {23259#true} {23708#(<= ~counter~0 6)} #61#return; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:18:00,294 INFO L290 TraceCheckUtils]: 156: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,294 INFO L290 TraceCheckUtils]: 155: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,294 INFO L290 TraceCheckUtils]: 154: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,294 INFO L272 TraceCheckUtils]: 153: Hoare triple {23708#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,294 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {23259#true} {23708#(<= ~counter~0 6)} #59#return; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:18:00,294 INFO L290 TraceCheckUtils]: 151: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,294 INFO L290 TraceCheckUtils]: 150: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,295 INFO L290 TraceCheckUtils]: 149: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,295 INFO L272 TraceCheckUtils]: 148: Hoare triple {23708#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,295 INFO L290 TraceCheckUtils]: 147: Hoare triple {23708#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:18:00,295 INFO L290 TraceCheckUtils]: 146: Hoare triple {23623#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23708#(<= ~counter~0 6)} is VALID [2022-04-28 11:18:00,295 INFO L290 TraceCheckUtils]: 145: Hoare triple {23623#(<= ~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; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:18:00,296 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {23259#true} {23623#(<= ~counter~0 5)} #67#return; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:18:00,296 INFO L290 TraceCheckUtils]: 143: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,296 INFO L290 TraceCheckUtils]: 142: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,296 INFO L290 TraceCheckUtils]: 141: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,296 INFO L272 TraceCheckUtils]: 140: Hoare triple {23623#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,296 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {23259#true} {23623#(<= ~counter~0 5)} #65#return; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:18:00,297 INFO L290 TraceCheckUtils]: 138: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,297 INFO L290 TraceCheckUtils]: 137: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,297 INFO L290 TraceCheckUtils]: 136: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,297 INFO L272 TraceCheckUtils]: 135: Hoare triple {23623#(<= ~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)); {23259#true} is VALID [2022-04-28 11:18:00,297 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {23259#true} {23623#(<= ~counter~0 5)} #63#return; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:18:00,297 INFO L290 TraceCheckUtils]: 133: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,297 INFO L290 TraceCheckUtils]: 132: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,297 INFO L290 TraceCheckUtils]: 131: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,297 INFO L272 TraceCheckUtils]: 130: Hoare triple {23623#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,298 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {23259#true} {23623#(<= ~counter~0 5)} #61#return; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:18:00,298 INFO L290 TraceCheckUtils]: 128: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,298 INFO L290 TraceCheckUtils]: 127: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,298 INFO L290 TraceCheckUtils]: 126: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,298 INFO L272 TraceCheckUtils]: 125: Hoare triple {23623#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,298 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {23259#true} {23623#(<= ~counter~0 5)} #59#return; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:18:00,298 INFO L290 TraceCheckUtils]: 123: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,298 INFO L290 TraceCheckUtils]: 122: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,298 INFO L290 TraceCheckUtils]: 121: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,298 INFO L272 TraceCheckUtils]: 120: Hoare triple {23623#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,299 INFO L290 TraceCheckUtils]: 119: Hoare triple {23623#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:18:00,299 INFO L290 TraceCheckUtils]: 118: Hoare triple {23538#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23623#(<= ~counter~0 5)} is VALID [2022-04-28 11:18:00,299 INFO L290 TraceCheckUtils]: 117: Hoare triple {23538#(<= ~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; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:18:00,300 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {23259#true} {23538#(<= ~counter~0 4)} #67#return; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:18:00,300 INFO L290 TraceCheckUtils]: 115: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,300 INFO L290 TraceCheckUtils]: 114: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,300 INFO L290 TraceCheckUtils]: 113: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,300 INFO L272 TraceCheckUtils]: 112: Hoare triple {23538#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,300 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {23259#true} {23538#(<= ~counter~0 4)} #65#return; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:18:00,300 INFO L290 TraceCheckUtils]: 110: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,300 INFO L290 TraceCheckUtils]: 109: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,300 INFO L290 TraceCheckUtils]: 108: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,301 INFO L272 TraceCheckUtils]: 107: Hoare triple {23538#(<= ~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)); {23259#true} is VALID [2022-04-28 11:18:00,301 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {23259#true} {23538#(<= ~counter~0 4)} #63#return; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:18:00,301 INFO L290 TraceCheckUtils]: 105: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,301 INFO L290 TraceCheckUtils]: 104: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,301 INFO L290 TraceCheckUtils]: 103: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,301 INFO L272 TraceCheckUtils]: 102: Hoare triple {23538#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,301 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {23259#true} {23538#(<= ~counter~0 4)} #61#return; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:18:00,302 INFO L290 TraceCheckUtils]: 100: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,302 INFO L290 TraceCheckUtils]: 99: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,302 INFO L290 TraceCheckUtils]: 98: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,302 INFO L272 TraceCheckUtils]: 97: Hoare triple {23538#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,304 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {23259#true} {23538#(<= ~counter~0 4)} #59#return; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:18:00,304 INFO L290 TraceCheckUtils]: 95: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,304 INFO L290 TraceCheckUtils]: 94: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,304 INFO L290 TraceCheckUtils]: 93: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,304 INFO L272 TraceCheckUtils]: 92: Hoare triple {23538#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,305 INFO L290 TraceCheckUtils]: 91: Hoare triple {23538#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:18:00,305 INFO L290 TraceCheckUtils]: 90: Hoare triple {23453#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23538#(<= ~counter~0 4)} is VALID [2022-04-28 11:18:00,305 INFO L290 TraceCheckUtils]: 89: Hoare triple {23453#(<= ~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; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:18:00,306 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {23259#true} {23453#(<= ~counter~0 3)} #67#return; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:18:00,306 INFO L290 TraceCheckUtils]: 87: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,306 INFO L290 TraceCheckUtils]: 86: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,306 INFO L290 TraceCheckUtils]: 85: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,306 INFO L272 TraceCheckUtils]: 84: Hoare triple {23453#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,306 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {23259#true} {23453#(<= ~counter~0 3)} #65#return; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:18:00,306 INFO L290 TraceCheckUtils]: 82: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,306 INFO L290 TraceCheckUtils]: 81: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,307 INFO L290 TraceCheckUtils]: 80: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,307 INFO L272 TraceCheckUtils]: 79: Hoare triple {23453#(<= ~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)); {23259#true} is VALID [2022-04-28 11:18:00,307 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {23259#true} {23453#(<= ~counter~0 3)} #63#return; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:18:00,307 INFO L290 TraceCheckUtils]: 77: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,307 INFO L290 TraceCheckUtils]: 76: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,307 INFO L290 TraceCheckUtils]: 75: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,307 INFO L272 TraceCheckUtils]: 74: Hoare triple {23453#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,308 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {23259#true} {23453#(<= ~counter~0 3)} #61#return; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:18:00,308 INFO L290 TraceCheckUtils]: 72: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,308 INFO L290 TraceCheckUtils]: 71: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,308 INFO L290 TraceCheckUtils]: 70: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,308 INFO L272 TraceCheckUtils]: 69: Hoare triple {23453#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,308 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {23259#true} {23453#(<= ~counter~0 3)} #59#return; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:18:00,308 INFO L290 TraceCheckUtils]: 67: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,308 INFO L290 TraceCheckUtils]: 66: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,308 INFO L290 TraceCheckUtils]: 65: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,308 INFO L272 TraceCheckUtils]: 64: Hoare triple {23453#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,309 INFO L290 TraceCheckUtils]: 63: Hoare triple {23453#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:18:00,309 INFO L290 TraceCheckUtils]: 62: Hoare triple {23368#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23453#(<= ~counter~0 3)} is VALID [2022-04-28 11:18:00,309 INFO L290 TraceCheckUtils]: 61: Hoare triple {23368#(<= ~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; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:18:00,310 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {23259#true} {23368#(<= ~counter~0 2)} #67#return; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:18:00,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,310 INFO L290 TraceCheckUtils]: 58: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,310 INFO L272 TraceCheckUtils]: 56: Hoare triple {23368#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,310 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23259#true} {23368#(<= ~counter~0 2)} #65#return; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:18:00,310 INFO L290 TraceCheckUtils]: 54: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,310 INFO L290 TraceCheckUtils]: 53: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,310 INFO L290 TraceCheckUtils]: 52: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,310 INFO L272 TraceCheckUtils]: 51: Hoare triple {23368#(<= ~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)); {23259#true} is VALID [2022-04-28 11:18:00,311 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23259#true} {23368#(<= ~counter~0 2)} #63#return; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:18:00,311 INFO L290 TraceCheckUtils]: 49: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,311 INFO L290 TraceCheckUtils]: 48: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,311 INFO L290 TraceCheckUtils]: 47: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,311 INFO L272 TraceCheckUtils]: 46: Hoare triple {23368#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,311 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {23259#true} {23368#(<= ~counter~0 2)} #61#return; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:18:00,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,312 INFO L290 TraceCheckUtils]: 42: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,312 INFO L272 TraceCheckUtils]: 41: Hoare triple {23368#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,312 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {23259#true} {23368#(<= ~counter~0 2)} #59#return; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:18:00,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,312 INFO L272 TraceCheckUtils]: 36: Hoare triple {23368#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {23368#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:18:00,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {23283#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23368#(<= ~counter~0 2)} is VALID [2022-04-28 11:18:00,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {23283#(<= ~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; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:18:00,313 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23259#true} {23283#(<= ~counter~0 1)} #67#return; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:18:00,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,314 INFO L272 TraceCheckUtils]: 28: Hoare triple {23283#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,314 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {23259#true} {23283#(<= ~counter~0 1)} #65#return; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:18:00,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,314 INFO L272 TraceCheckUtils]: 23: Hoare triple {23283#(<= ~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)); {23259#true} is VALID [2022-04-28 11:18:00,315 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {23259#true} {23283#(<= ~counter~0 1)} #63#return; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:18:00,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,315 INFO L272 TraceCheckUtils]: 18: Hoare triple {23283#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,315 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {23259#true} {23283#(<= ~counter~0 1)} #61#return; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:18:00,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,315 INFO L272 TraceCheckUtils]: 13: Hoare triple {23283#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,316 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {23259#true} {23283#(<= ~counter~0 1)} #59#return; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:18:00,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {23259#true} assume true; {23259#true} is VALID [2022-04-28 11:18:00,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {23259#true} assume !(0 == ~cond); {23259#true} is VALID [2022-04-28 11:18:00,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {23259#true} ~cond := #in~cond; {23259#true} is VALID [2022-04-28 11:18:00,316 INFO L272 TraceCheckUtils]: 8: Hoare triple {23283#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23259#true} is VALID [2022-04-28 11:18:00,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {23283#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:18:00,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {23267#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23283#(<= ~counter~0 1)} is VALID [2022-04-28 11:18:00,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {23267#(<= ~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; {23267#(<= ~counter~0 0)} is VALID [2022-04-28 11:18:00,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {23267#(<= ~counter~0 0)} call #t~ret6 := main(); {23267#(<= ~counter~0 0)} is VALID [2022-04-28 11:18:00,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23267#(<= ~counter~0 0)} {23259#true} #81#return; {23267#(<= ~counter~0 0)} is VALID [2022-04-28 11:18:00,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {23267#(<= ~counter~0 0)} assume true; {23267#(<= ~counter~0 0)} is VALID [2022-04-28 11:18:00,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {23259#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; {23267#(<= ~counter~0 0)} is VALID [2022-04-28 11:18:00,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {23259#true} call ULTIMATE.init(); {23259#true} is VALID [2022-04-28 11:18:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4538 backedges. 92 proven. 306 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2022-04-28 11:18:00,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:00,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859229799] [2022-04-28 11:18:00,320 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:00,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988360389] [2022-04-28 11:18:00,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988360389] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:18:00,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:18:00,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-28 11:18:00,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:00,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1127624250] [2022-04-28 11:18:00,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1127624250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:00,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:00,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 11:18:00,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3268086] [2022-04-28 11:18:00,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:00,321 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 states have internal predecessors, (64), 12 states have call successors, (49), 12 states have call predecessors, (49), 11 states have return successors, (47), 11 states have call predecessors, (47), 11 states have call successors, (47) Word has length 269 [2022-04-28 11:18:00,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:00,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 states have internal predecessors, (64), 12 states have call successors, (49), 12 states have call predecessors, (49), 11 states have return successors, (47), 11 states have call predecessors, (47), 11 states have call successors, (47) [2022-04-28 11:18:00,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:00,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 11:18:00,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:00,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 11:18:00,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:18:00,455 INFO L87 Difference]: Start difference. First operand 182 states and 207 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 states have internal predecessors, (64), 12 states have call successors, (49), 12 states have call predecessors, (49), 11 states have return successors, (47), 11 states have call predecessors, (47), 11 states have call successors, (47) [2022-04-28 11:18:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:01,817 INFO L93 Difference]: Finished difference Result 212 states and 242 transitions. [2022-04-28 11:18:01,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 11:18:01,817 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 states have internal predecessors, (64), 12 states have call successors, (49), 12 states have call predecessors, (49), 11 states have return successors, (47), 11 states have call predecessors, (47), 11 states have call successors, (47) Word has length 269 [2022-04-28 11:18:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:01,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 states have internal predecessors, (64), 12 states have call successors, (49), 12 states have call predecessors, (49), 11 states have return successors, (47), 11 states have call predecessors, (47), 11 states have call successors, (47) [2022-04-28 11:18:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 191 transitions. [2022-04-28 11:18:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 states have internal predecessors, (64), 12 states have call successors, (49), 12 states have call predecessors, (49), 11 states have return successors, (47), 11 states have call predecessors, (47), 11 states have call successors, (47) [2022-04-28 11:18:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 191 transitions. [2022-04-28 11:18:01,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 191 transitions. [2022-04-28 11:18:01,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:01,960 INFO L225 Difference]: With dead ends: 212 [2022-04-28 11:18:01,961 INFO L226 Difference]: Without dead ends: 198 [2022-04-28 11:18:01,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 525 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2022-04-28 11:18:01,961 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 8 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:18:01,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 258 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:18:01,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-04-28 11:18:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-04-28 11:18:02,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:02,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 198 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 115 states have internal predecessors, (116), 56 states have call successors, (56), 28 states have call predecessors, (56), 27 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 11:18:02,182 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 198 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 115 states have internal predecessors, (116), 56 states have call successors, (56), 28 states have call predecessors, (56), 27 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 11:18:02,182 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 198 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 115 states have internal predecessors, (116), 56 states have call successors, (56), 28 states have call predecessors, (56), 27 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 11:18:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:02,185 INFO L93 Difference]: Finished difference Result 198 states and 226 transitions. [2022-04-28 11:18:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 226 transitions. [2022-04-28 11:18:02,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:02,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:02,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 115 states have internal predecessors, (116), 56 states have call successors, (56), 28 states have call predecessors, (56), 27 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand 198 states. [2022-04-28 11:18:02,186 INFO L87 Difference]: Start difference. First operand has 198 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 115 states have internal predecessors, (116), 56 states have call successors, (56), 28 states have call predecessors, (56), 27 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand 198 states. [2022-04-28 11:18:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:02,188 INFO L93 Difference]: Finished difference Result 198 states and 226 transitions. [2022-04-28 11:18:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 226 transitions. [2022-04-28 11:18:02,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:02,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:02,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:02,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 115 states have internal predecessors, (116), 56 states have call successors, (56), 28 states have call predecessors, (56), 27 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 11:18:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 226 transitions. [2022-04-28 11:18:02,192 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 226 transitions. Word has length 269 [2022-04-28 11:18:02,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:02,192 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 226 transitions. [2022-04-28 11:18:02,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 states have internal predecessors, (64), 12 states have call successors, (49), 12 states have call predecessors, (49), 11 states have return successors, (47), 11 states have call predecessors, (47), 11 states have call successors, (47) [2022-04-28 11:18:02,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 198 states and 226 transitions. [2022-04-28 11:18:11,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 224 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:11,942 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 226 transitions. [2022-04-28 11:18:11,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-04-28 11:18:11,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:11,943 INFO L195 NwaCegarLoop]: 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-28 11:18:11,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 11:18:12,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-28 11:18:12,150 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:12,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:12,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1533533153, now seen corresponding path program 19 times [2022-04-28 11:18:12,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:12,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [614185976] [2022-04-28 11:18:12,363 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:12,363 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:12,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1533533153, now seen corresponding path program 20 times [2022-04-28 11:18:12,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:12,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317431178] [2022-04-28 11:18:12,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:12,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:12,376 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:12,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1644321904] [2022-04-28 11:18:12,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:18:12,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:12,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:12,377 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:18:12,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 11:18:12,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:18:12,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 11:18:12,494 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 11:18:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 11:18:12,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 11:18:12,665 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 11:18:12,665 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 11:18:12,668 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:18:12,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 11:18:12,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-28 11:18:12,888 INFO L356 BasicCegarLoop]: Path program histogram: [20, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 11:18:12,891 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-28 11:18:12,910 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-28 11:18:12,911 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 11:18:12,912 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 11:18:12,912 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-28 11:18:12,912 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 11:18:12,912 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 11:18:12,912 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 11:18:12,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:18:12 BoogieIcfgContainer [2022-04-28 11:18:12,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:18:12,913 INFO L158 Benchmark]: Toolchain (without parser) took 340924.14ms. Allocated memory was 184.5MB in the beginning and 316.7MB in the end (delta: 132.1MB). Free memory was 135.4MB in the beginning and 268.1MB in the end (delta: -132.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:18:12,913 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:18:12,913 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.20ms. Allocated memory is still 184.5MB. Free memory was 135.2MB in the beginning and 160.1MB in the end (delta: -24.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 11:18:12,913 INFO L158 Benchmark]: Boogie Preprocessor took 29.21ms. Allocated memory is still 184.5MB. Free memory was 160.1MB in the beginning and 158.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 11:18:12,914 INFO L158 Benchmark]: RCFGBuilder took 245.73ms. Allocated memory is still 184.5MB. Free memory was 158.6MB in the beginning and 147.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 11:18:12,914 INFO L158 Benchmark]: TraceAbstraction took 340394.45ms. Allocated memory was 184.5MB in the beginning and 316.7MB in the end (delta: 132.1MB). Free memory was 146.5MB in the beginning and 268.1MB in the end (delta: -121.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 11:18:12,914 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.20ms. Allocated memory is still 184.5MB. Free memory was 135.2MB in the beginning and 160.1MB in the end (delta: -24.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.21ms. Allocated memory is still 184.5MB. Free memory was 160.1MB in the beginning and 158.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 245.73ms. Allocated memory is still 184.5MB. Free memory was 158.6MB in the beginning and 147.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 340394.45ms. Allocated memory was 184.5MB in the beginning and 316.7MB in the end (delta: 132.1MB). Free memory was 146.5MB in the beginning and 268.1MB in the end (delta: -121.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 [L33] EXPR counter++ [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND FALSE !(counter++<10) [L48] CALL __VERIFIER_assert(z == 6*n + 6) [L15] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(z == 6*n + 6) [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) [L15] COND TRUE !(cond) [L17] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 340.3s, OverallIterations: 24, TraceHistogramMax: 52, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 93.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 44.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 208 mSDsluCounter, 3335 SdHoareTripleChecker+Invalid, 44.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2288 mSDsCounter, 313 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2832 IncrementalHoareTripleChecker+Invalid, 3157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 313 mSolverCounterUnsat, 1047 mSDtfsCounter, 2832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4080 GetRequests, 3784 SyntacticMatches, 23 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=23, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 33 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 11:18:12,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...