/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-34549b5 [2022-04-08 11:10:15,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:10:15,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:10:15,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:10:15,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:10:15,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:10:15,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:10:15,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:10:15,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:10:15,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:10:15,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:10:15,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:10:15,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:10:15,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:10:15,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:10:15,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:10:15,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:10:15,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:10:15,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:10:15,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:10:15,099 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:10:15,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:10:15,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:10:15,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:10:15,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:10:15,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:10:15,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:10:15,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:10:15,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:10:15,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:10:15,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:10:15,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:10:15,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:10:15,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:10:15,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:10:15,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:10:15,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:10:15,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:10:15,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:10:15,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:10:15,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:10:15,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:10:15,109 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 11:10:15,116 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:10:15,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:10:15,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:10:15,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:10:15,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:10:15,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:10:15,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:10:15,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:10:15,118 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:10:15,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:10:15,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:10:15,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:10:15,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:10:15,119 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:10:15,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:10:15,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:10:15,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:10:15,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:10:15,120 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:10:15,120 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:10:15,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:10:15,120 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:10:15,120 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-08 11:10:15,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:10:15,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:10:15,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:10:15,308 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:10:15,309 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:10:15,310 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-08 11:10:15,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87313f9e5/35fb4a78c29d4052852d3cf1dcbfbbf0/FLAG6414df748 [2022-04-08 11:10:15,670 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:10:15,670 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2022-04-08 11:10:15,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87313f9e5/35fb4a78c29d4052852d3cf1dcbfbbf0/FLAG6414df748 [2022-04-08 11:10:16,109 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87313f9e5/35fb4a78c29d4052852d3cf1dcbfbbf0 [2022-04-08 11:10:16,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:10:16,111 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:10:16,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:10:16,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:10:16,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:10:16,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:10:16" (1/1) ... [2022-04-08 11:10:16,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d00384c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:16, skipping insertion in model container [2022-04-08 11:10:16,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:10:16" (1/1) ... [2022-04-08 11:10:16,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:10:16,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:10:16,253 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-08 11:10:16,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:10:16,276 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:10:16,291 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-08 11:10:16,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:10:16,308 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:10:16,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:16 WrapperNode [2022-04-08 11:10:16,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:10:16,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:10:16,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:10:16,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:10:16,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:16" (1/1) ... [2022-04-08 11:10:16,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:16" (1/1) ... [2022-04-08 11:10:16,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:16" (1/1) ... [2022-04-08 11:10:16,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:16" (1/1) ... [2022-04-08 11:10:16,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:16" (1/1) ... [2022-04-08 11:10:16,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:16" (1/1) ... [2022-04-08 11:10:16,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:16" (1/1) ... [2022-04-08 11:10:16,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:10:16,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:10:16,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:10:16,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:10:16,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:16" (1/1) ... [2022-04-08 11:10:16,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:10:16,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:16,370 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-08 11:10:16,385 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-08 11:10:16,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:10:16,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:10:16,401 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:10:16,401 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:10:16,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:10:16,401 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:10:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:10:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:10:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:10:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:10:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-08 11:10:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:10:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:10:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:10:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:10:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:10:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:10:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:10:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:10:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:10:16,442 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:10:16,443 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:10:16,558 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:10:16,563 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:10:16,563 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 11:10:16,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:10:16 BoogieIcfgContainer [2022-04-08 11:10:16,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:10:16,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:10:16,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:10:16,568 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:10:16,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:10:16" (1/3) ... [2022-04-08 11:10:16,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446cbbe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:10:16, skipping insertion in model container [2022-04-08 11:10:16,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:16" (2/3) ... [2022-04-08 11:10:16,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446cbbe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:10:16, skipping insertion in model container [2022-04-08 11:10:16,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:10:16" (3/3) ... [2022-04-08 11:10:16,570 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound10.c [2022-04-08 11:10:16,573 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:10:16,573 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:10:16,600 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:10:16,604 INFO L340 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 [2022-04-08 11:10:16,604 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:10:16,629 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-08 11:10:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 11:10:16,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:16,635 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:16,636 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:16,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:16,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-08 11:10:16,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:16,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [840247525] [2022-04-08 11:10:16,673 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:10:16,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 2 times [2022-04-08 11:10:16,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:16,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205786909] [2022-04-08 11:10:16,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:16,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:16,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:10:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:16,846 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-08 11:10:16,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 11:10:16,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-08 11:10:16,848 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-08 11:10:16,849 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-08 11:10:16,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 11:10:16,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-08 11:10:16,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-08 11:10:16,849 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-08 11:10:16,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-08 11:10:16,850 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-08 11:10:16,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-08 11:10:16,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-08 11:10:16,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-08 11:10:16,851 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-08 11:10:16,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:16,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205786909] [2022-04-08 11:10:16,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205786909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:16,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:16,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:10:16,854 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:16,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [840247525] [2022-04-08 11:10:16,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [840247525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:16,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:16,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:10:16,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686432904] [2022-04-08 11:10:16,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:16,858 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-08 11:10:16,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:16,861 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-08 11:10:16,873 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-08 11:10:16,873 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:10:16,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:16,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:10:16,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:10:16,889 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-08 11:10:17,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:17,032 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-08 11:10:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:10:17,033 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-08 11:10:17,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:17,034 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-08 11:10:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-08 11:10:17,040 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-08 11:10:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-08 11:10:17,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-08 11:10:17,136 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-08 11:10:17,145 INFO L225 Difference]: With dead ends: 57 [2022-04-08 11:10:17,146 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 11:10:17,151 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:10:17,154 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:10:17,156 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:10:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 11:10:17,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-08 11:10:17,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:17,211 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-08 11:10:17,212 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-08 11:10:17,212 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-08 11:10:17,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:17,215 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-08 11:10:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-08 11:10:17,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:17,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:17,216 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-08 11:10:17,217 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-08 11:10:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:17,219 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-08 11:10:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-08 11:10:17,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:17,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:17,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:17,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:17,221 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-08 11:10:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-08 11:10:17,230 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-08 11:10:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:17,230 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-08 11:10:17,230 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:10:17,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 37 transitions. [2022-04-08 11:10:17,265 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-08 11:10:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-08 11:10:17,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 11:10:17,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:17,269 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:17,273 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:10:17,274 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:17,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:17,276 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-08 11:10:17,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:17,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [254078194] [2022-04-08 11:10:17,278 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:10:17,278 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 2 times [2022-04-08 11:10:17,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:17,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320944958] [2022-04-08 11:10:17,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:17,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:17,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:10:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:17,382 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-08 11:10:17,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:10:17,383 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:10:17,384 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-08 11:10:17,384 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-08 11:10:17,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:10:17,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:10:17,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(= ~counter~0 0)} call #t~ret6 := main(); {267#(= ~counter~0 0)} is VALID [2022-04-08 11:10:17,387 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-08 11:10:17,387 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-08 11:10:17,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {263#false} is VALID [2022-04-08 11:10:17,388 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-08 11:10:17,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-08 11:10:17,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-08 11:10:17,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-08 11:10:17,389 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-08 11:10:17,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:17,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320944958] [2022-04-08 11:10:17,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320944958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:17,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:17,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:10:17,392 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:17,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [254078194] [2022-04-08 11:10:17,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [254078194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:17,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:17,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:10:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541770840] [2022-04-08 11:10:17,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:17,394 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-08 11:10:17,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:17,395 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-08 11:10:17,403 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-08 11:10:17,403 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:10:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:17,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:10:17,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:10:17,404 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-08 11:10:17,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:17,619 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-08 11:10:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:10:17,619 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-08 11:10:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:17,620 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-08 11:10:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-08 11:10:17,623 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-08 11:10:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-08 11:10:17,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-08 11:10:17,683 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-08 11:10:17,685 INFO L225 Difference]: With dead ends: 40 [2022-04-08 11:10:17,686 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 11:10:17,686 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:10:17,688 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:10:17,689 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:10:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 11:10:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 11:10:17,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:17,698 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-08 11:10:17,698 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-08 11:10:17,699 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-08 11:10:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:17,703 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-08 11:10:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-08 11:10:17,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:17,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:17,710 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-08 11:10:17,710 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-08 11:10:17,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:17,712 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-08 11:10:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-08 11:10:17,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:17,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:17,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:17,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:17,714 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-08 11:10:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-08 11:10:17,719 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-08 11:10:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:17,719 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-08 11:10:17,719 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:10:17,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-08 11:10:17,750 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-08 11:10:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-08 11:10:17,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 11:10:17,750 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:17,751 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:17,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 11:10:17,751 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:17,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:17,753 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-08 11:10:17,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:17,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1540897589] [2022-04-08 11:10:17,757 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:10:17,757 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 2 times [2022-04-08 11:10:17,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:17,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196407326] [2022-04-08 11:10:17,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:17,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:17,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:10:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:17,869 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-08 11:10:17,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-08 11:10:17,870 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-08 11:10:17,870 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-08 11:10:17,871 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-08 11:10:17,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-08 11:10:17,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-08 11:10:17,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret6 := main(); {466#true} is VALID [2022-04-08 11:10:17,872 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-08 11:10:17,872 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-08 11:10:17,875 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-08 11:10:17,875 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-08 11:10:17,876 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-08 11:10:17,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {467#false} is VALID [2022-04-08 11:10:17,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-04-08 11:10:17,877 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-08 11:10:17,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:17,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196407326] [2022-04-08 11:10:17,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196407326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:17,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:17,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:10:17,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:17,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1540897589] [2022-04-08 11:10:17,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1540897589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:17,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:17,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:10:17,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479607383] [2022-04-08 11:10:17,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:17,879 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-08 11:10:17,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:17,879 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-08 11:10:17,888 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-08 11:10:17,888 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:10:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:17,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:10:17,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:10:17,889 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-08 11:10:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:18,194 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-08 11:10:18,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:10:18,194 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-08 11:10:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:18,195 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-08 11:10:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-08 11:10:18,196 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-08 11:10:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-08 11:10:18,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-08 11:10:18,234 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-08 11:10:18,235 INFO L225 Difference]: With dead ends: 34 [2022-04-08 11:10:18,235 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 11:10:18,236 INFO L912 BasicCegarLoop]: 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-08 11:10:18,236 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:10:18,237 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:10:18,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 11:10:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 11:10:18,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:18,241 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-08 11:10:18,243 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-08 11:10:18,243 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-08 11:10:18,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:18,248 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 11:10:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 11:10:18,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:18,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:18,249 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-08 11:10:18,249 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-08 11:10:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:18,253 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 11:10:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 11:10:18,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:18,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:18,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:18,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:18,253 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-08 11:10:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-08 11:10:18,257 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-08 11:10:18,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:18,257 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-08 11:10:18,257 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:10:18,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-08 11:10:18,291 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-08 11:10:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 11:10:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 11:10:18,292 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:18,292 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:18,292 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 11:10:18,294 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:18,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:18,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-08 11:10:18,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:18,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2046444483] [2022-04-08 11:10:18,297 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:10:18,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 2 times [2022-04-08 11:10:18,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:18,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246405457] [2022-04-08 11:10:18,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:18,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:18,313 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:10:18,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [692295405] [2022-04-08 11:10:18,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:10:18,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:18,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:18,314 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-08 11:10:18,334 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-08 11:10:18,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:10:18,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:10:18,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:10:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:18,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:10:18,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2022-04-08 11:10:18,503 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-08 11:10:18,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-08 11:10:18,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #81#return; {681#true} is VALID [2022-04-08 11:10:18,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2022-04-08 11:10:18,504 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-08 11:10:18,505 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-08 11:10:18,505 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-08 11:10:18,505 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-08 11:10:18,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#true} ~cond := #in~cond; {681#true} is VALID [2022-04-08 11:10:18,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(0 == ~cond); {681#true} is VALID [2022-04-08 11:10:18,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-08 11:10:18,506 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-08 11:10:18,507 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-08 11:10:18,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:18,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {682#false} is VALID [2022-04-08 11:10:18,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {682#false} assume !false; {682#false} is VALID [2022-04-08 11:10:18,508 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-08 11:10:18,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:10:18,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:18,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246405457] [2022-04-08 11:10:18,509 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:10:18,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692295405] [2022-04-08 11:10:18,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692295405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:18,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:18,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:10:18,509 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:18,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2046444483] [2022-04-08 11:10:18,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2046444483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:18,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:18,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:10:18,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834407926] [2022-04-08 11:10:18,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:18,510 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-08 11:10:18,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:18,510 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-08 11:10:18,535 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-08 11:10:18,535 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:10:18,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:18,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:10:18,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:10:18,536 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-08 11:10:18,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:18,796 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-08 11:10:18,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:10:18,796 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-08 11:10:18,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:18,796 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-08 11:10:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:10:18,798 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-08 11:10:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:10:18,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 11:10:18,862 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-08 11:10:18,863 INFO L225 Difference]: With dead ends: 50 [2022-04-08 11:10:18,863 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 11:10:18,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:10:18,865 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:10:18,866 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:10:18,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 11:10:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-08 11:10:18,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:18,884 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-08 11:10:18,885 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-08 11:10:18,885 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-08 11:10:18,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:18,889 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-08 11:10:18,889 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-08 11:10:18,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:18,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:18,889 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-08 11:10:18,889 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-08 11:10:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:18,891 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-08 11:10:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-08 11:10:18,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:18,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:18,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:18,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:18,892 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-08 11:10:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-08 11:10:18,894 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-08 11:10:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:18,894 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-08 11:10:18,894 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:10:18,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 49 transitions. [2022-04-08 11:10:18,937 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-08 11:10:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-08 11:10:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 11:10:18,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:18,937 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:18,956 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-08 11:10:19,155 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:19,156 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:19,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:19,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-08 11:10:19,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:19,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [711488692] [2022-04-08 11:10:19,157 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:10:19,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 2 times [2022-04-08 11:10:19,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:19,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043110842] [2022-04-08 11:10:19,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:19,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:19,167 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:10:19,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1237732546] [2022-04-08 11:10:19,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:10:19,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:19,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:19,171 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-08 11:10:19,172 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-08 11:10:19,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:10:19,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:10:19,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:10:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:19,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:10:19,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1010#true} is VALID [2022-04-08 11:10:19,335 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-08 11:10:19,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-08 11:10:19,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #81#return; {1010#true} is VALID [2022-04-08 11:10:19,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret6 := main(); {1010#true} is VALID [2022-04-08 11:10:19,336 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-08 11:10:19,337 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-08 11:10:19,337 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-08 11:10:19,337 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-08 11:10:19,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-08 11:10:19,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-08 11:10:19,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-08 11:10:19,338 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-08 11:10:19,338 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-08 11:10:19,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-08 11:10:19,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-08 11:10:19,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-08 11:10:19,341 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-08 11:10:19,342 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-08 11:10:19,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:19,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1011#false} is VALID [2022-04-08 11:10:19,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2022-04-08 11:10:19,358 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-08 11:10:19,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:10:19,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:19,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043110842] [2022-04-08 11:10:19,359 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:10:19,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237732546] [2022-04-08 11:10:19,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237732546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:19,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:19,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:10:19,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:19,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [711488692] [2022-04-08 11:10:19,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [711488692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:19,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:19,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:10:19,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405361188] [2022-04-08 11:10:19,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:19,360 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-08 11:10:19,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:19,361 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-08 11:10:19,374 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-08 11:10:19,374 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:10:19,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:19,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:10:19,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:10:19,375 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-08 11:10:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:19,548 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-08 11:10:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:10:19,548 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-08 11:10:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:19,549 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-08 11:10:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:10:19,550 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-08 11:10:19,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:10:19,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 11:10:19,600 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-08 11:10:19,601 INFO L225 Difference]: With dead ends: 54 [2022-04-08 11:10:19,601 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 11:10:19,601 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:10:19,601 INFO L913 BasicCegarLoop]: 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-08 11:10:19,602 INFO L914 BasicCegarLoop]: 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-08 11:10:19,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 11:10:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-08 11:10:19,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:19,614 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-08 11:10:19,614 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-08 11:10:19,615 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-08 11:10:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:19,616 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-08 11:10:19,616 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-08 11:10:19,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:19,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:19,617 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-08 11:10:19,617 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-08 11:10:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:19,619 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-08 11:10:19,619 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-08 11:10:19,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:19,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:19,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:19,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:19,620 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-08 11:10:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-08 11:10:19,622 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-08 11:10:19,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:19,622 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-08 11:10:19,622 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:10:19,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 64 transitions. [2022-04-08 11:10:19,685 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-08 11:10:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-08 11:10:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 11:10:19,686 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:19,686 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:19,703 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-08 11:10:19,895 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:19,895 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:19,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:19,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-08 11:10:19,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:19,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [212292687] [2022-04-08 11:10:19,896 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:10:19,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 2 times [2022-04-08 11:10:19,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:19,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370764514] [2022-04-08 11:10:19,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:19,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:19,906 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:10:19,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [734671622] [2022-04-08 11:10:19,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:10:19,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:19,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:19,907 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-08 11:10:19,954 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-08 11:10:19,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:10:19,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:10:19,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:10:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:19,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:10:20,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {1390#true} call ULTIMATE.init(); {1390#true} is VALID [2022-04-08 11:10:20,086 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-08 11:10:20,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-08 11:10:20,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#true} {1390#true} #81#return; {1390#true} is VALID [2022-04-08 11:10:20,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {1390#true} call #t~ret6 := main(); {1390#true} is VALID [2022-04-08 11:10:20,087 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-08 11:10:20,088 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-08 11:10:20,088 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-08 11:10:20,088 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-08 11:10:20,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-08 11:10:20,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-08 11:10:20,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-08 11:10:20,090 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-08 11:10:20,090 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-08 11:10:20,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-08 11:10:20,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-08 11:10:20,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-08 11:10:20,091 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-08 11:10:20,091 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-08 11:10:20,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-08 11:10:20,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-08 11:10:20,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-08 11:10:20,093 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-08 11:10:20,093 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-08 11:10:20,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:20,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {1469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1391#false} is VALID [2022-04-08 11:10:20,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {1391#false} assume !false; {1391#false} is VALID [2022-04-08 11:10:20,094 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-08 11:10:20,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:10:20,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:20,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370764514] [2022-04-08 11:10:20,095 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:10:20,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734671622] [2022-04-08 11:10:20,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734671622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:20,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:20,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:10:20,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:20,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [212292687] [2022-04-08 11:10:20,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [212292687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:20,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:20,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:10:20,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895508569] [2022-04-08 11:10:20,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:20,096 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-08 11:10:20,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:20,096 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-08 11:10:20,111 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-08 11:10:20,111 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:10:20,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:20,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:10:20,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:10:20,112 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-08 11:10:20,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:20,376 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-08 11:10:20,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:10:20,376 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-08 11:10:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:20,376 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-08 11:10:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:10:20,377 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-08 11:10:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:10:20,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 11:10:20,429 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-08 11:10:20,430 INFO L225 Difference]: With dead ends: 62 [2022-04-08 11:10:20,430 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 11:10:20,430 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:10:20,431 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:10:20,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:10:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 11:10:20,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 11:10:20,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:20,446 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-08 11:10:20,446 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-08 11:10:20,447 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-08 11:10:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:20,448 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-08 11:10:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-08 11:10:20,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:20,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:20,449 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-08 11:10:20,449 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-08 11:10:20,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:20,450 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-08 11:10:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-08 11:10:20,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:20,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:20,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:20,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:20,451 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-08 11:10:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-08 11:10:20,452 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-08 11:10:20,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:20,452 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-08 11:10:20,453 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 11:10:20,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-08 11:10:20,507 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-08 11:10:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-08 11:10:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 11:10:20,508 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:20,508 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:20,524 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-08 11:10:20,715 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:20,715 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:20,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:20,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-08 11:10:20,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:20,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [53479728] [2022-04-08 11:10:21,043 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:10:21,043 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:10:21,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 2 times [2022-04-08 11:10:21,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:21,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388588224] [2022-04-08 11:10:21,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:21,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:21,058 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:10:21,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1192207225] [2022-04-08 11:10:21,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:10:21,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:21,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:21,059 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-08 11:10:21,060 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-08 11:10:21,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:10:21,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:10:21,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:10:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:21,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:10:21,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-08 11:10:21,292 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-08 11:10:21,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#(<= ~counter~0 0)} assume true; {1809#(<= ~counter~0 0)} is VALID [2022-04-08 11:10:21,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#(<= ~counter~0 0)} {1801#true} #81#return; {1809#(<= ~counter~0 0)} is VALID [2022-04-08 11:10:21,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {1809#(<= ~counter~0 0)} call #t~ret6 := main(); {1809#(<= ~counter~0 0)} is VALID [2022-04-08 11:10:21,294 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-08 11:10:21,294 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-08 11:10:21,295 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-08 11:10:21,295 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-08 11:10:21,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,299 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #59#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,307 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-08 11:10:21,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,309 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #61#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,309 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-08 11:10:21,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,310 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #63#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,311 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-08 11:10:21,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,312 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #65#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,313 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-08 11:10:21,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,314 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #67#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:21,314 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-08 11:10:21,315 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-08 11:10:21,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {1910#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {1802#false} is VALID [2022-04-08 11:10:21,315 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-08 11:10:21,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-08 11:10:21,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {1802#false} assume !(0 == ~cond); {1802#false} is VALID [2022-04-08 11:10:21,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {1802#false} assume true; {1802#false} is VALID [2022-04-08 11:10:21,316 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1802#false} {1802#false} #69#return; {1802#false} is VALID [2022-04-08 11:10:21,316 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-08 11:10:21,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-08 11:10:21,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-08 11:10:21,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-08 11:10:21,316 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-08 11:10:21,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:10:21,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-08 11:10:21,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-08 11:10:21,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-08 11:10:21,485 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-08 11:10:21,486 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1801#true} {1802#false} #69#return; {1802#false} is VALID [2022-04-08 11:10:21,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:10:21,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:10:21,486 INFO L290 TraceCheckUtils]: 37: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:10:21,486 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-08 11:10:21,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {1968#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1802#false} is VALID [2022-04-08 11:10:21,487 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-08 11:10:21,487 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-08 11:10:21,487 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1801#true} {1972#(< ~counter~0 10)} #67#return; {1972#(< ~counter~0 10)} is VALID [2022-04-08 11:10:21,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:10:21,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:10:21,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:10:21,488 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-08 11:10:21,488 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1801#true} {1972#(< ~counter~0 10)} #65#return; {1972#(< ~counter~0 10)} is VALID [2022-04-08 11:10:21,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:10:21,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:10:21,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:10:21,489 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-08 11:10:21,489 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1801#true} {1972#(< ~counter~0 10)} #63#return; {1972#(< ~counter~0 10)} is VALID [2022-04-08 11:10:21,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:10:21,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:10:21,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:10:21,489 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-08 11:10:21,490 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1801#true} {1972#(< ~counter~0 10)} #61#return; {1972#(< ~counter~0 10)} is VALID [2022-04-08 11:10:21,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:10:21,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:10:21,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:10:21,490 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-08 11:10:21,491 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1801#true} {1972#(< ~counter~0 10)} #59#return; {1972#(< ~counter~0 10)} is VALID [2022-04-08 11:10:21,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:10:21,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:10:21,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:10:21,491 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-08 11:10:21,494 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-08 11:10:21,494 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-08 11:10:21,495 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-08 11:10:21,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {2057#(< ~counter~0 9)} call #t~ret6 := main(); {2057#(< ~counter~0 9)} is VALID [2022-04-08 11:10:21,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2057#(< ~counter~0 9)} {1801#true} #81#return; {2057#(< ~counter~0 9)} is VALID [2022-04-08 11:10:21,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {2057#(< ~counter~0 9)} assume true; {2057#(< ~counter~0 9)} is VALID [2022-04-08 11:10:21,496 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-08 11:10:21,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-08 11:10:21,496 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-08 11:10:21,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:21,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388588224] [2022-04-08 11:10:21,497 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:10:21,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192207225] [2022-04-08 11:10:21,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192207225] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:10:21,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:10:21,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 11:10:21,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:21,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [53479728] [2022-04-08 11:10:21,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [53479728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:21,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:21,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:10:21,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267532898] [2022-04-08 11:10:21,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:21,498 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-08 11:10:21,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:21,498 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-08 11:10:21,520 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-08 11:10:21,520 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:10:21,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:21,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:10:21,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:10:21,520 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-08 11:10:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:21,765 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-08 11:10:21,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:10:21,766 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-08 11:10:21,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:21,766 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-08 11:10:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-08 11:10:21,767 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-08 11:10:21,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-08 11:10:21,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-08 11:10:21,814 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-08 11:10:21,815 INFO L225 Difference]: With dead ends: 72 [2022-04-08 11:10:21,815 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 11:10:21,816 INFO L912 BasicCegarLoop]: 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-08 11:10:21,816 INFO L913 BasicCegarLoop]: 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-08 11:10:21,816 INFO L914 BasicCegarLoop]: 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-08 11:10:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 11:10:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-08 11:10:21,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:21,843 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-08 11:10:21,843 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-08 11:10:21,844 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-08 11:10:21,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:21,845 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-08 11:10:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 11:10:21,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:21,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:21,846 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-08 11:10:21,846 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-08 11:10:21,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:21,847 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-08 11:10:21,847 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 11:10:21,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:21,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:21,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:21,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:21,848 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-08 11:10:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-08 11:10:21,849 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 45 [2022-04-08 11:10:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:21,849 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-08 11:10:21,849 INFO L479 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-08 11:10:21,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-08 11:10:21,907 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-08 11:10:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 11:10:21,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 11:10:21,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:21,908 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:21,924 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-08 11:10:22,108 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:22,109 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:22,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:22,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-08 11:10:22,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:22,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2129748016] [2022-04-08 11:10:22,402 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:10:22,402 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:10:22,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 2 times [2022-04-08 11:10:22,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:22,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060709027] [2022-04-08 11:10:22,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:22,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:22,410 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:10:22,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [180823042] [2022-04-08 11:10:22,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:10:22,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:22,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:22,411 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-08 11:10:22,456 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-08 11:10:22,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:10:22,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:10:22,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 11:10:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:22,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:10:22,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-08 11:10:22,654 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-08 11:10:22,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:22,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-08 11:10:22,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-08 11:10:22,655 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-08 11:10:22,656 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-08 11:10:22,656 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-08 11:10:22,656 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-08 11:10:22,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:22,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:22,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:22,657 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-08 11:10:22,657 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-08 11:10:22,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:22,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:22,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:22,658 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-08 11:10:22,658 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-08 11:10:22,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:22,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:22,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:22,659 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-08 11:10:22,659 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-08 11:10:22,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:22,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:22,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:22,660 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-08 11:10:22,660 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-08 11:10:22,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:22,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:22,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:22,661 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-08 11:10:22,661 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-08 11:10:22,662 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-08 11:10:22,662 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-08 11:10:22,662 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-08 11:10:22,662 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:22,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:22,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:22,663 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-08 11:10:22,663 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-08 11:10:22,664 INFO L290 TraceCheckUtils]: 42: Hoare triple {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:22,664 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-08 11:10:22,664 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-08 11:10:22,664 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-08 11:10:22,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:10:22,834 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-08 11:10:22,835 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-08 11:10:22,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:22,836 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-08 11:10:22,836 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-08 11:10:22,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:22,837 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:22,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:22,837 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-08 11:10:22,839 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-08 11:10:22,842 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-08 11:10:22,846 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-08 11:10:22,847 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-08 11:10:22,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:22,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:22,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:22,847 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-08 11:10:22,848 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-08 11:10:22,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:22,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:22,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:22,848 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-08 11:10:22,848 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-08 11:10:22,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:22,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:22,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:22,849 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-08 11:10:22,849 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-08 11:10:22,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:22,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:22,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:22,850 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-08 11:10:22,850 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-08 11:10:22,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:22,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:22,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:22,850 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-08 11:10:22,851 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-08 11:10:22,851 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-08 11:10:22,852 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-08 11:10:22,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-08 11:10:22,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-08 11:10:22,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:22,852 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-08 11:10:22,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-08 11:10:22,852 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-08 11:10:22,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:22,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060709027] [2022-04-08 11:10:22,853 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:10:22,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180823042] [2022-04-08 11:10:22,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180823042] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:10:22,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:10:22,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-08 11:10:22,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:22,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2129748016] [2022-04-08 11:10:22,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2129748016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:22,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:22,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:10:22,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833784900] [2022-04-08 11:10:22,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:22,854 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-08 11:10:22,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:22,854 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-08 11:10:22,875 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-08 11:10:22,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:10:22,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:22,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:10:22,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:10:22,876 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-08 11:10:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:23,212 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2022-04-08 11:10:23,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:10:23,212 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-08 11:10:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:23,213 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-08 11:10:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-08 11:10:23,219 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-08 11:10:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-08 11:10:23,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-08 11:10:23,279 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-08 11:10:23,280 INFO L225 Difference]: With dead ends: 78 [2022-04-08 11:10:23,280 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 11:10:23,280 INFO L912 BasicCegarLoop]: 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-08 11:10:23,281 INFO L913 BasicCegarLoop]: 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-08 11:10:23,281 INFO L914 BasicCegarLoop]: 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-08 11:10:23,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 11:10:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-04-08 11:10:23,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:23,315 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-08 11:10:23,316 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-08 11:10:23,317 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-08 11:10:23,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:23,319 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-08 11:10:23,319 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-08 11:10:23,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:23,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:23,325 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-08 11:10:23,326 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-08 11:10:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:23,328 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-08 11:10:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-08 11:10:23,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:23,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:23,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:23,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:23,329 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-08 11:10:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-04-08 11:10:23,345 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 45 [2022-04-08 11:10:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:23,345 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-04-08 11:10:23,345 INFO L479 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-08 11:10:23,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 77 transitions. [2022-04-08 11:10:23,410 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-08 11:10:23,410 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-08 11:10:23,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:10:23,411 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:23,411 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:23,427 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-08 11:10:23,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:23,611 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:23,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:23,612 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 3 times [2022-04-08 11:10:23,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:23,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [328216292] [2022-04-08 11:10:23,860 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:10:23,860 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:10:23,860 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 4 times [2022-04-08 11:10:23,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:23,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138452717] [2022-04-08 11:10:23,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:23,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:23,870 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:10:23,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [727835646] [2022-04-08 11:10:23,870 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:10:23,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:23,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:23,871 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-08 11:10:23,872 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-08 11:10:23,921 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:10:23,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:10:23,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 11:10:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:23,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:10:24,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-08 11:10:24,443 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-08 11:10:24,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:24,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-08 11:10:24,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-08 11:10:24,443 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-08 11:10:24,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3167#true} is VALID [2022-04-08 11:10:24,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 10);havoc #t~post5; {3167#true} is VALID [2022-04-08 11:10:24,444 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-08 11:10:24,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:10:24,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:10:24,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:24,444 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-08 11:10:24,444 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-08 11:10:24,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:24,445 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-08 11:10:24,445 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-08 11:10:24,446 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-08 11:10:24,446 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-08 11:10:24,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:24,446 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-08 11:10:24,447 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-08 11:10:24,447 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-08 11:10:24,447 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-08 11:10:24,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:24,448 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-08 11:10:24,448 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-08 11:10:24,449 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-08 11:10:24,449 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-08 11:10:24,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:10:24,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:10:24,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:24,450 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-08 11:10:26,452 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-08 11:10:26,453 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-08 11:10:26,453 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-08 11:10:26,453 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-08 11:10:26,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:26,454 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-08 11:10:26,454 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-08 11:10:26,457 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-08 11:10:26,457 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-08 11:10:26,458 INFO L290 TraceCheckUtils]: 42: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:26,467 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-08 11:10:26,467 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-08 11:10:26,468 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-08 11:10:26,469 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-08 11:10:26,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:26,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-08 11:10:26,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-08 11:10:26,470 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-08 11:10:26,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:10:27,203 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-08 11:10:27,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-08 11:10:27,203 INFO L290 TraceCheckUtils]: 47: Hoare triple {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:27,204 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-08 11:10:27,205 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-08 11:10:27,205 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-08 11:10:27,205 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-08 11:10:27,206 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-08 11:10:27,206 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-08 11:10:27,206 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-08 11:10:27,207 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-08 11:10:27,207 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-08 11:10:27,207 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-08 11:10:27,207 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-08 11:10:27,208 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-08 11:10:27,208 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-08 11:10:27,214 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-08 11:10:27,214 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-08 11:10:27,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:27,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:10:27,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:10:27,215 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-08 11:10:27,218 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-08 11:10:27,218 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-08 11:10:27,218 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-08 11:10:27,219 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-08 11:10:27,219 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-08 11:10:27,219 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3167#true} {3167#true} #63#return; {3167#true} is VALID [2022-04-08 11:10:27,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:27,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:10:27,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:10:27,219 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-08 11:10:27,219 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3167#true} {3167#true} #61#return; {3167#true} is VALID [2022-04-08 11:10:27,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:27,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:10:27,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:10:27,220 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-08 11:10:27,220 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-08 11:10:27,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:27,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:10:27,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:10:27,220 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-08 11:10:27,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 10);havoc #t~post5; {3167#true} is VALID [2022-04-08 11:10:27,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3167#true} is VALID [2022-04-08 11:10:27,220 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-08 11:10:27,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-08 11:10:27,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-08 11:10:27,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:27,221 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-08 11:10:27,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-08 11:10:27,221 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-08 11:10:27,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:27,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138452717] [2022-04-08 11:10:27,221 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:10:27,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727835646] [2022-04-08 11:10:27,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727835646] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:10:27,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:10:27,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-08 11:10:27,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:27,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [328216292] [2022-04-08 11:10:27,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [328216292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:27,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:27,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 11:10:27,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380254687] [2022-04-08 11:10:27,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:27,222 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-08 11:10:27,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:27,223 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-08 11:10:29,252 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-08 11:10:29,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 11:10:29,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:29,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 11:10:29,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:10:29,253 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-08 11:10:35,126 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-08 11:10:37,140 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-08 11:10:39,296 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-08 11:10:43,188 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-08 11:10:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:48,479 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2022-04-08 11:10:48,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:10:48,479 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-08 11:10:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:48,479 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-08 11:10:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 11:10:48,481 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-08 11:10:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 11:10:48,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-08 11:10:50,623 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-08 11:10:50,624 INFO L225 Difference]: With dead ends: 72 [2022-04-08 11:10:50,624 INFO L226 Difference]: Without dead ends: 68 [2022-04-08 11:10:50,625 INFO L912 BasicCegarLoop]: 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-08 11:10:50,627 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 23 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-04-08 11:10:50,627 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 84 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 137 Invalid, 4 Unknown, 0 Unchecked, 10.9s Time] [2022-04-08 11:10:50,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-08 11:10:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-08 11:10:50,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:50,669 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-08 11:10:50,669 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-08 11:10:50,669 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-08 11:10:50,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:50,671 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-08 11:10:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-08 11:10:50,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:50,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:50,671 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-08 11:10:50,672 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-08 11:10:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:50,673 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-08 11:10:50,673 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-08 11:10:50,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:50,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:50,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:50,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:50,674 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-08 11:10:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-04-08 11:10:50,676 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 50 [2022-04-08 11:10:50,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:50,676 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-04-08 11:10:50,676 INFO L479 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-08 11:10:50,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 76 transitions. [2022-04-08 11:10:52,763 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-08 11:10:52,763 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-08 11:10:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 11:10:52,764 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:52,764 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:52,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-08 11:10:52,964 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:52,965 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:52,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:52,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-08 11:10:52,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:52,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [325475720] [2022-04-08 11:10:53,229 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:10:53,255 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:10:53,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 2 times [2022-04-08 11:10:53,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:53,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690035742] [2022-04-08 11:10:53,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:53,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:53,270 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:10:53,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084083424] [2022-04-08 11:10:53,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:10:53,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:53,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:53,271 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-08 11:10:53,272 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-08 11:10:53,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:10:53,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:10:53,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 11:10:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:53,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:10:53,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {3899#true} call ULTIMATE.init(); {3899#true} is VALID [2022-04-08 11:10:53,809 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-08 11:10:53,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-08 11:10:53,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3899#true} {3899#true} #81#return; {3899#true} is VALID [2022-04-08 11:10:53,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {3899#true} call #t~ret6 := main(); {3899#true} is VALID [2022-04-08 11:10:53,810 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-08 11:10:53,810 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-08 11:10:53,810 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-08 11:10:53,810 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-08 11:10:53,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-08 11:10:53,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-08 11:10:53,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-08 11:10:53,811 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-08 11:10:53,811 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-08 11:10:53,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-08 11:10:53,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-08 11:10:53,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-08 11:10:53,812 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-08 11:10:53,812 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-08 11:10:53,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-08 11:10:53,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-08 11:10:53,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-08 11:10:53,813 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-08 11:10:53,813 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-08 11:10:53,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-08 11:10:53,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-08 11:10:53,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-08 11:10:53,814 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-08 11:10:53,814 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-08 11:10:53,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-08 11:10:53,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-08 11:10:53,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-08 11:10:53,815 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-08 11:10:53,815 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-08 11:10:53,816 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-08 11:10:53,816 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-08 11:10:53,816 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-08 11:10:53,816 INFO L290 TraceCheckUtils]: 37: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-08 11:10:53,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-08 11:10:53,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-08 11:10:53,817 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-08 11:10:53,817 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-08 11:10:53,817 INFO L290 TraceCheckUtils]: 42: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-08 11:10:53,817 INFO L290 TraceCheckUtils]: 43: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-08 11:10:53,817 INFO L290 TraceCheckUtils]: 44: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-08 11:10:53,818 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-08 11:10:53,818 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-08 11:10:53,818 INFO L290 TraceCheckUtils]: 47: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-08 11:10:53,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-08 11:10:53,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-08 11:10:53,818 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-08 11:10:53,819 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-08 11:10:53,819 INFO L290 TraceCheckUtils]: 52: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-08 11:10:53,819 INFO L290 TraceCheckUtils]: 53: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-08 11:10:53,819 INFO L290 TraceCheckUtils]: 54: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-08 11:10:53,819 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-08 11:10:53,819 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-08 11:10:53,819 INFO L290 TraceCheckUtils]: 57: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-08 11:10:53,819 INFO L290 TraceCheckUtils]: 58: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-08 11:10:53,820 INFO L290 TraceCheckUtils]: 59: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-08 11:10:53,820 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-08 11:10:53,821 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-08 11:10:53,821 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-08 11:10:53,821 INFO L290 TraceCheckUtils]: 63: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-08 11:10:53,821 INFO L290 TraceCheckUtils]: 64: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-08 11:10:53,821 INFO L290 TraceCheckUtils]: 65: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-08 11:10:53,821 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-08 11:10:53,822 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-08 11:10:53,822 INFO L290 TraceCheckUtils]: 68: Hoare triple {4108#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4112#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:53,822 INFO L290 TraceCheckUtils]: 69: Hoare triple {4112#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3900#false} is VALID [2022-04-08 11:10:53,823 INFO L290 TraceCheckUtils]: 70: Hoare triple {3900#false} assume !false; {3900#false} is VALID [2022-04-08 11:10:53,823 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-08 11:10:53,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:10:54,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:54,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690035742] [2022-04-08 11:10:54,171 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:10:54,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084083424] [2022-04-08 11:10:54,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084083424] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:10:54,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:10:54,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 11:10:54,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:54,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [325475720] [2022-04-08 11:10:54,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [325475720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:54,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:54,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:10:54,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062369748] [2022-04-08 11:10:54,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:54,172 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-08 11:10:54,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:54,173 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-08 11:10:54,206 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-08 11:10:54,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:10:54,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:54,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:10:54,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:10:54,207 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-08 11:10:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:54,693 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-04-08 11:10:54,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:10:54,694 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-08 11:10:54,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:54,694 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-08 11:10:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-08 11:10:54,695 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-08 11:10:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-08 11:10:54,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-04-08 11:10:54,761 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-08 11:10:54,762 INFO L225 Difference]: With dead ends: 86 [2022-04-08 11:10:54,762 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 11:10:54,762 INFO L912 BasicCegarLoop]: 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-08 11:10:54,763 INFO L913 BasicCegarLoop]: 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-08 11:10:54,763 INFO L914 BasicCegarLoop]: 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-08 11:10:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 11:10:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-04-08 11:10:54,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:54,825 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-08 11:10:54,825 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-08 11:10:54,826 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-08 11:10:54,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:54,828 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-04-08 11:10:54,828 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2022-04-08 11:10:54,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:54,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:54,829 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-08 11:10:54,829 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-08 11:10:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:54,831 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-04-08 11:10:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2022-04-08 11:10:54,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:54,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:54,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:54,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:54,831 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-08 11:10:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2022-04-08 11:10:54,834 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 71 [2022-04-08 11:10:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:54,834 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2022-04-08 11:10:54,834 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (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-08 11:10:54,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 94 transitions. [2022-04-08 11:10:56,949 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-08 11:10:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2022-04-08 11:10:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 11:10:56,950 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:56,950 INFO L499 BasicCegarLoop]: 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-08 11:10:56,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 11:10:57,151 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:57,151 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:57,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:57,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 3 times [2022-04-08 11:10:57,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:57,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1713239793] [2022-04-08 11:10:57,433 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:10:57,433 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:10:57,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 4 times [2022-04-08 11:10:57,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:57,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142210888] [2022-04-08 11:10:57,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:57,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:57,456 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:10:57,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151834989] [2022-04-08 11:10:57,456 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:10:57,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:57,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:57,460 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-08 11:10:57,463 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-08 11:10:57,502 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:10:57,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:10:57,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:10:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:57,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:10:57,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {4746#true} call ULTIMATE.init(); {4746#true} is VALID [2022-04-08 11:10:57,751 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-08 11:10:57,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {4754#(<= ~counter~0 0)} assume true; {4754#(<= ~counter~0 0)} is VALID [2022-04-08 11:10:57,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4754#(<= ~counter~0 0)} {4746#true} #81#return; {4754#(<= ~counter~0 0)} is VALID [2022-04-08 11:10:57,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {4754#(<= ~counter~0 0)} call #t~ret6 := main(); {4754#(<= ~counter~0 0)} is VALID [2022-04-08 11:10:57,752 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-08 11:10:57,752 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-08 11:10:57,753 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-08 11:10:57,753 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-08 11:10:57,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {4770#(<= ~counter~0 1)} ~cond := #in~cond; {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {4770#(<= ~counter~0 1)} assume !(0 == ~cond); {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {4770#(<= ~counter~0 1)} assume true; {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,756 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4770#(<= ~counter~0 1)} {4770#(<= ~counter~0 1)} #59#return; {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,756 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-08 11:10:57,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {4770#(<= ~counter~0 1)} ~cond := #in~cond; {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {4770#(<= ~counter~0 1)} assume !(0 == ~cond); {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {4770#(<= ~counter~0 1)} assume true; {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,757 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4770#(<= ~counter~0 1)} {4770#(<= ~counter~0 1)} #61#return; {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,757 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-08 11:10:57,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {4770#(<= ~counter~0 1)} ~cond := #in~cond; {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {4770#(<= ~counter~0 1)} assume !(0 == ~cond); {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {4770#(<= ~counter~0 1)} assume true; {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,759 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4770#(<= ~counter~0 1)} {4770#(<= ~counter~0 1)} #63#return; {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,759 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-08 11:10:57,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {4770#(<= ~counter~0 1)} ~cond := #in~cond; {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {4770#(<= ~counter~0 1)} assume !(0 == ~cond); {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {4770#(<= ~counter~0 1)} assume true; {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,760 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4770#(<= ~counter~0 1)} {4770#(<= ~counter~0 1)} #65#return; {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,761 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-08 11:10:57,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {4770#(<= ~counter~0 1)} ~cond := #in~cond; {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {4770#(<= ~counter~0 1)} assume !(0 == ~cond); {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {4770#(<= ~counter~0 1)} assume true; {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,762 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4770#(<= ~counter~0 1)} {4770#(<= ~counter~0 1)} #67#return; {4770#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:57,763 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-08 11:10:57,763 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-08 11:10:57,763 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-08 11:10:57,764 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-08 11:10:57,764 INFO L290 TraceCheckUtils]: 37: Hoare triple {4855#(<= ~counter~0 2)} ~cond := #in~cond; {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,764 INFO L290 TraceCheckUtils]: 38: Hoare triple {4855#(<= ~counter~0 2)} assume !(0 == ~cond); {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {4855#(<= ~counter~0 2)} assume true; {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,765 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4855#(<= ~counter~0 2)} {4855#(<= ~counter~0 2)} #59#return; {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,765 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-08 11:10:57,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {4855#(<= ~counter~0 2)} ~cond := #in~cond; {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {4855#(<= ~counter~0 2)} assume !(0 == ~cond); {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {4855#(<= ~counter~0 2)} assume true; {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,766 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4855#(<= ~counter~0 2)} {4855#(<= ~counter~0 2)} #61#return; {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,768 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-08 11:10:57,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {4855#(<= ~counter~0 2)} ~cond := #in~cond; {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {4855#(<= ~counter~0 2)} assume !(0 == ~cond); {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,774 INFO L290 TraceCheckUtils]: 49: Hoare triple {4855#(<= ~counter~0 2)} assume true; {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,774 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4855#(<= ~counter~0 2)} {4855#(<= ~counter~0 2)} #63#return; {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,775 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-08 11:10:57,775 INFO L290 TraceCheckUtils]: 52: Hoare triple {4855#(<= ~counter~0 2)} ~cond := #in~cond; {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,775 INFO L290 TraceCheckUtils]: 53: Hoare triple {4855#(<= ~counter~0 2)} assume !(0 == ~cond); {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,775 INFO L290 TraceCheckUtils]: 54: Hoare triple {4855#(<= ~counter~0 2)} assume true; {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,776 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4855#(<= ~counter~0 2)} {4855#(<= ~counter~0 2)} #65#return; {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,776 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-08 11:10:57,777 INFO L290 TraceCheckUtils]: 57: Hoare triple {4855#(<= ~counter~0 2)} ~cond := #in~cond; {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,777 INFO L290 TraceCheckUtils]: 58: Hoare triple {4855#(<= ~counter~0 2)} assume !(0 == ~cond); {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,777 INFO L290 TraceCheckUtils]: 59: Hoare triple {4855#(<= ~counter~0 2)} assume true; {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,777 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4855#(<= ~counter~0 2)} {4855#(<= ~counter~0 2)} #67#return; {4855#(<= ~counter~0 2)} is VALID [2022-04-08 11:10:57,778 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-08 11:10:57,778 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-08 11:10:57,778 INFO L290 TraceCheckUtils]: 63: Hoare triple {4940#(<= |main_#t~post5| 2)} assume !(#t~post5 < 10);havoc #t~post5; {4747#false} is VALID [2022-04-08 11:10:57,778 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-08 11:10:57,779 INFO L290 TraceCheckUtils]: 65: Hoare triple {4747#false} ~cond := #in~cond; {4747#false} is VALID [2022-04-08 11:10:57,779 INFO L290 TraceCheckUtils]: 66: Hoare triple {4747#false} assume !(0 == ~cond); {4747#false} is VALID [2022-04-08 11:10:57,779 INFO L290 TraceCheckUtils]: 67: Hoare triple {4747#false} assume true; {4747#false} is VALID [2022-04-08 11:10:57,779 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4747#false} {4747#false} #69#return; {4747#false} is VALID [2022-04-08 11:10:57,779 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-08 11:10:57,779 INFO L290 TraceCheckUtils]: 70: Hoare triple {4747#false} ~cond := #in~cond; {4747#false} is VALID [2022-04-08 11:10:57,779 INFO L290 TraceCheckUtils]: 71: Hoare triple {4747#false} assume 0 == ~cond; {4747#false} is VALID [2022-04-08 11:10:57,779 INFO L290 TraceCheckUtils]: 72: Hoare triple {4747#false} assume !false; {4747#false} is VALID [2022-04-08 11:10:57,780 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-08 11:10:57,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:10:57,990 INFO L290 TraceCheckUtils]: 72: Hoare triple {4747#false} assume !false; {4747#false} is VALID [2022-04-08 11:10:57,990 INFO L290 TraceCheckUtils]: 71: Hoare triple {4747#false} assume 0 == ~cond; {4747#false} is VALID [2022-04-08 11:10:57,990 INFO L290 TraceCheckUtils]: 70: Hoare triple {4747#false} ~cond := #in~cond; {4747#false} is VALID [2022-04-08 11:10:57,990 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-08 11:10:57,990 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4746#true} {4747#false} #69#return; {4747#false} is VALID [2022-04-08 11:10:57,990 INFO L290 TraceCheckUtils]: 67: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-08 11:10:57,990 INFO L290 TraceCheckUtils]: 66: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-08 11:10:57,990 INFO L290 TraceCheckUtils]: 65: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-08 11:10:57,990 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-08 11:10:58,002 INFO L290 TraceCheckUtils]: 63: Hoare triple {4998#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {4747#false} is VALID [2022-04-08 11:10:58,002 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-08 11:10:58,003 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-08 11:10:58,003 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4746#true} {5002#(< ~counter~0 10)} #67#return; {5002#(< ~counter~0 10)} is VALID [2022-04-08 11:10:58,003 INFO L290 TraceCheckUtils]: 59: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-08 11:10:58,003 INFO L290 TraceCheckUtils]: 58: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-08 11:10:58,003 INFO L290 TraceCheckUtils]: 57: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-08 11:10:58,003 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-08 11:10:58,004 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4746#true} {5002#(< ~counter~0 10)} #65#return; {5002#(< ~counter~0 10)} is VALID [2022-04-08 11:10:58,004 INFO L290 TraceCheckUtils]: 54: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-08 11:10:58,004 INFO L290 TraceCheckUtils]: 53: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-08 11:10:58,004 INFO L290 TraceCheckUtils]: 52: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-08 11:10:58,004 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-08 11:10:58,004 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4746#true} {5002#(< ~counter~0 10)} #63#return; {5002#(< ~counter~0 10)} is VALID [2022-04-08 11:10:58,005 INFO L290 TraceCheckUtils]: 49: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-08 11:10:58,005 INFO L290 TraceCheckUtils]: 48: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-08 11:10:58,005 INFO L290 TraceCheckUtils]: 47: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-08 11:10:58,005 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-08 11:10:58,005 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4746#true} {5002#(< ~counter~0 10)} #61#return; {5002#(< ~counter~0 10)} is VALID [2022-04-08 11:10:58,005 INFO L290 TraceCheckUtils]: 44: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-08 11:10:58,005 INFO L290 TraceCheckUtils]: 43: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-08 11:10:58,005 INFO L290 TraceCheckUtils]: 42: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-08 11:10:58,005 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-08 11:10:58,006 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4746#true} {5002#(< ~counter~0 10)} #59#return; {5002#(< ~counter~0 10)} is VALID [2022-04-08 11:10:58,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-08 11:10:58,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-08 11:10:58,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-08 11:10:58,006 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-08 11:10:58,006 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-08 11:10:58,007 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-08 11:10:58,007 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-08 11:10:58,008 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4746#true} {5087#(< ~counter~0 9)} #67#return; {5087#(< ~counter~0 9)} is VALID [2022-04-08 11:10:58,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-08 11:10:58,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-08 11:10:58,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-08 11:10:58,008 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-08 11:10:58,008 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4746#true} {5087#(< ~counter~0 9)} #65#return; {5087#(< ~counter~0 9)} is VALID [2022-04-08 11:10:58,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-08 11:10:58,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-08 11:10:58,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-08 11:10:58,009 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-08 11:10:58,009 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4746#true} {5087#(< ~counter~0 9)} #63#return; {5087#(< ~counter~0 9)} is VALID [2022-04-08 11:10:58,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-08 11:10:58,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-08 11:10:58,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-08 11:10:58,009 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-08 11:10:58,009 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4746#true} {5087#(< ~counter~0 9)} #61#return; {5087#(< ~counter~0 9)} is VALID [2022-04-08 11:10:58,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-08 11:10:58,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-08 11:10:58,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-08 11:10:58,010 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-08 11:10:58,010 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4746#true} {5087#(< ~counter~0 9)} #59#return; {5087#(< ~counter~0 9)} is VALID [2022-04-08 11:10:58,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-08 11:10:58,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-08 11:10:58,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-08 11:10:58,011 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-08 11:10:58,011 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-08 11:10:58,011 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-08 11:10:58,011 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-08 11:10:58,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {5172#(< ~counter~0 8)} call #t~ret6 := main(); {5172#(< ~counter~0 8)} is VALID [2022-04-08 11:10:58,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5172#(< ~counter~0 8)} {4746#true} #81#return; {5172#(< ~counter~0 8)} is VALID [2022-04-08 11:10:58,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {5172#(< ~counter~0 8)} assume true; {5172#(< ~counter~0 8)} is VALID [2022-04-08 11:10:58,013 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-08 11:10:58,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {4746#true} call ULTIMATE.init(); {4746#true} is VALID [2022-04-08 11:10:58,013 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-08 11:10:58,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:58,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142210888] [2022-04-08 11:10:58,013 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:10:58,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151834989] [2022-04-08 11:10:58,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151834989] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:10:58,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:10:58,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 11:10:58,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:58,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1713239793] [2022-04-08 11:10:58,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1713239793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:58,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:58,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:10:58,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581312628] [2022-04-08 11:10:58,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:58,014 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-08 11:10:58,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:58,015 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-08 11:10:58,043 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-08 11:10:58,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:10:58,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:58,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:10:58,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:10:58,044 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-08 11:10:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:58,479 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2022-04-08 11:10:58,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:10:58,479 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-08 11:10:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:58,480 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-08 11:10:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-08 11:10:58,481 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-08 11:10:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-08 11:10:58,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 90 transitions. [2022-04-08 11:10:58,526 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-08 11:10:58,535 INFO L225 Difference]: With dead ends: 114 [2022-04-08 11:10:58,536 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 11:10:58,536 INFO L912 BasicCegarLoop]: 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-08 11:10:58,537 INFO L913 BasicCegarLoop]: 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-08 11:10:58,537 INFO L914 BasicCegarLoop]: 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-08 11:10:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 11:10:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-04-08 11:10:58,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:58,598 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-08 11:10:58,600 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-08 11:10:58,600 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-08 11:10:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:58,608 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-04-08 11:10:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-04-08 11:10:58,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:58,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:58,609 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-08 11:10:58,610 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-08 11:10:58,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:58,621 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-04-08 11:10:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-04-08 11:10:58,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:58,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:58,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:58,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:58,623 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-08 11:10:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2022-04-08 11:10:58,641 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 73 [2022-04-08 11:10:58,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:58,642 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2022-04-08 11:10:58,642 INFO L479 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-08 11:10:58,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 109 transitions. [2022-04-08 11:11:00,751 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-08 11:11:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2022-04-08 11:11:00,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-08 11:11:00,752 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:11:00,752 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:11:00,770 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-08 11:11:00,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 11:11:00,971 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:11:00,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:11:00,987 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-08 11:11:00,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:00,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1050886592] [2022-04-08 11:11:01,252 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:11:01,252 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:11:01,253 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 2 times [2022-04-08 11:11:01,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:11:01,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465576102] [2022-04-08 11:11:01,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:11:01,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:11:01,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:11:01,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [439593194] [2022-04-08 11:11:01,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:11:01,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:01,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:11:01,261 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-08 11:11:01,262 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-08 11:11:01,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:11:01,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:11:01,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 11:11:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:01,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:11:01,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {5821#true} call ULTIMATE.init(); {5821#true} is VALID [2022-04-08 11:11:01,840 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-08 11:11:01,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-08 11:11:01,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5821#true} {5821#true} #81#return; {5821#true} is VALID [2022-04-08 11:11:01,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {5821#true} call #t~ret6 := main(); {5821#true} is VALID [2022-04-08 11:11:01,841 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-08 11:11:01,841 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-08 11:11:01,842 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-08 11:11:01,842 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-08 11:11:01,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-08 11:11:01,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-08 11:11:01,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-08 11:11:01,843 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-08 11:11:01,843 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-08 11:11:01,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-08 11:11:01,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-08 11:11:01,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-08 11:11:01,843 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-08 11:11:01,843 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-08 11:11:01,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-08 11:11:01,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-08 11:11:01,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-08 11:11:01,844 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-08 11:11:01,844 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-08 11:11:01,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-08 11:11:01,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-08 11:11:01,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-08 11:11:01,845 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-08 11:11:01,845 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-08 11:11:01,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-08 11:11:01,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-08 11:11:01,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-08 11:11:01,845 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-08 11:11:01,846 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-08 11:11:01,846 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-08 11:11:01,847 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-08 11:11:01,847 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-08 11:11:01,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-08 11:11:01,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-08 11:11:01,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-08 11:11:01,848 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-08 11:11:01,848 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-08 11:11:01,848 INFO L290 TraceCheckUtils]: 42: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-08 11:11:01,848 INFO L290 TraceCheckUtils]: 43: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-08 11:11:01,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-08 11:11:01,848 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-08 11:11:01,848 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-08 11:11:01,848 INFO L290 TraceCheckUtils]: 47: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-08 11:11:01,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-08 11:11:01,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-08 11:11:01,851 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-08 11:11:01,851 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-08 11:11:01,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-08 11:11:01,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-08 11:11:01,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-08 11:11:01,852 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-08 11:11:01,852 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-08 11:11:01,852 INFO L290 TraceCheckUtils]: 57: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-08 11:11:01,852 INFO L290 TraceCheckUtils]: 58: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-08 11:11:01,852 INFO L290 TraceCheckUtils]: 59: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-08 11:11:01,853 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-08 11:11:01,853 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-08 11:11:01,853 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-08 11:11:01,853 INFO L290 TraceCheckUtils]: 63: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-08 11:11:01,853 INFO L290 TraceCheckUtils]: 64: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-08 11:11:01,854 INFO L290 TraceCheckUtils]: 65: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-08 11:11:01,854 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-08 11:11:01,854 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-08 11:11:01,854 INFO L290 TraceCheckUtils]: 68: Hoare triple {5821#true} ~cond := #in~cond; {5821#true} is VALID [2022-04-08 11:11:01,854 INFO L290 TraceCheckUtils]: 69: Hoare triple {5821#true} assume !(0 == ~cond); {5821#true} is VALID [2022-04-08 11:11:01,854 INFO L290 TraceCheckUtils]: 70: Hoare triple {5821#true} assume true; {5821#true} is VALID [2022-04-08 11:11:01,855 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-08 11:11:01,856 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-08 11:11:01,856 INFO L290 TraceCheckUtils]: 73: Hoare triple {6045#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6049#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:11:01,857 INFO L290 TraceCheckUtils]: 74: Hoare triple {6049#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5822#false} is VALID [2022-04-08 11:11:01,857 INFO L290 TraceCheckUtils]: 75: Hoare triple {5822#false} assume !false; {5822#false} is VALID [2022-04-08 11:11:01,857 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-08 11:11:01,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:11:10,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:11:10,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465576102] [2022-04-08 11:11:10,007 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:11:10,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439593194] [2022-04-08 11:11:10,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439593194] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:11:10,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:11:10,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 11:11:10,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:11:10,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1050886592] [2022-04-08 11:11:10,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1050886592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:11:10,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:11:10,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:11:10,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716241121] [2022-04-08 11:11:10,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:11:10,008 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-08 11:11:10,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:11:10,008 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-08 11:11:10,044 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-08 11:11:10,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:11:10,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:10,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:11:10,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:11:10,044 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-08 11:11:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:10,454 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-04-08 11:11:10,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:11:10,455 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-08 11:11:10,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:11:10,456 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-08 11:11:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-08 11:11:10,457 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-08 11:11:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-08 11:11:10,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-04-08 11:11:10,532 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-08 11:11:10,533 INFO L225 Difference]: With dead ends: 104 [2022-04-08 11:11:10,533 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 11:11:10,533 INFO L912 BasicCegarLoop]: 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-08 11:11:10,534 INFO L913 BasicCegarLoop]: 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-08 11:11:10,534 INFO L914 BasicCegarLoop]: 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-08 11:11:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 11:11:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-08 11:11:10,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:11:10,643 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-08 11:11:10,643 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-08 11:11:10,643 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-08 11:11:10,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:10,646 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-04-08 11:11:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-04-08 11:11:10,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:10,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:10,646 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-08 11:11:10,646 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-08 11:11:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:10,650 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-04-08 11:11:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-04-08 11:11:10,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:10,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:10,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:11:10,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:11:10,650 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-08 11:11:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2022-04-08 11:11:10,652 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 76 [2022-04-08 11:11:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:11:10,653 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2022-04-08 11:11:10,653 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 11:11:10,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 110 transitions. [2022-04-08 11:11:12,798 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-08 11:11:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-04-08 11:11:12,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 11:11:12,800 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:11:12,800 INFO L499 BasicCegarLoop]: 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-08 11:11:12,816 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-08 11:11:13,016 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:13,016 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:11:13,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:11:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash 210840414, now seen corresponding path program 1 times [2022-04-08 11:11:13,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:13,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1148650594] [2022-04-08 11:11:13,219 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:11:13,219 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:11:13,219 INFO L85 PathProgramCache]: Analyzing trace with hash 210840414, now seen corresponding path program 2 times [2022-04-08 11:11:13,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:11:13,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122393208] [2022-04-08 11:11:13,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:11:13,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:11:13,231 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:11:13,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683106273] [2022-04-08 11:11:13,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:11:13,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:13,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:11:13,233 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-08 11:11:13,248 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-08 11:11:13,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:11:13,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:11:13,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 11:11:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:13,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:11:19,989 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:11:20,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {6802#true} call ULTIMATE.init(); {6802#true} is VALID [2022-04-08 11:11:20,717 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-08 11:11:20,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:11:20,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6802#true} {6802#true} #81#return; {6802#true} is VALID [2022-04-08 11:11:20,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {6802#true} call #t~ret6 := main(); {6802#true} is VALID [2022-04-08 11:11:20,718 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-08 11:11:20,719 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-08 11:11:20,720 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-08 11:11:20,720 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-08 11:11:20,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:11:20,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:11:20,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:11:20,721 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-08 11:11:20,721 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-08 11:11:20,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:11:20,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:11:20,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:11:20,721 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-08 11:11:20,722 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-08 11:11:20,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:11:20,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:11:20,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:11:20,722 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-08 11:11:20,722 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-08 11:11:20,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:11:20,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:11:20,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:11:20,723 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-08 11:11:20,723 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-08 11:11:20,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:11:20,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:11:20,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:11:20,724 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-08 11:11:20,725 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-08 11:11:20,725 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-08 11:11:20,725 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-08 11:11:20,726 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-08 11:11:20,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:11:20,726 INFO L290 TraceCheckUtils]: 38: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:11:20,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:11:20,726 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-08 11:11:20,726 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-08 11:11:20,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:11:20,727 INFO L290 TraceCheckUtils]: 43: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:11:20,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:11:20,727 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-08 11:11:20,727 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-08 11:11:20,727 INFO L290 TraceCheckUtils]: 47: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:11:20,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:11:20,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:11:20,728 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-08 11:11:20,728 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-08 11:11:20,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {6802#true} ~cond := #in~cond; {6965#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:11:20,729 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-08 11:11:20,729 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-08 11:11:20,729 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-08 11:11:20,729 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-08 11:11:20,730 INFO L290 TraceCheckUtils]: 57: Hoare triple {6802#true} ~cond := #in~cond; {6965#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:11:20,730 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-08 11:11:20,730 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-08 11:11:20,731 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-08 11:11:20,731 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-08 11:11:20,731 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-08 11:11:20,732 INFO L290 TraceCheckUtils]: 63: Hoare triple {6802#true} ~cond := #in~cond; {6965#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:11:20,732 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-08 11:11:20,732 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-08 11:11:20,733 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-08 11:11:20,733 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-08 11:11:20,733 INFO L290 TraceCheckUtils]: 68: Hoare triple {6802#true} ~cond := #in~cond; {6965#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:11:20,734 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-08 11:11:20,734 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-08 11:11:20,735 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-08 11:11:20,735 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-08 11:11:20,735 INFO L290 TraceCheckUtils]: 73: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:11:20,735 INFO L290 TraceCheckUtils]: 74: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:11:20,735 INFO L290 TraceCheckUtils]: 75: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:11:20,736 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-08 11:11:20,741 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-08 11:11:20,741 INFO L290 TraceCheckUtils]: 78: Hoare triple {7045#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7049#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:11:20,742 INFO L290 TraceCheckUtils]: 79: Hoare triple {7049#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6803#false} is VALID [2022-04-08 11:11:20,742 INFO L290 TraceCheckUtils]: 80: Hoare triple {6803#false} assume !false; {6803#false} is VALID [2022-04-08 11:11:20,742 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-08 11:11:20,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:12,577 INFO L290 TraceCheckUtils]: 80: Hoare triple {6803#false} assume !false; {6803#false} is VALID [2022-04-08 11:12:12,577 INFO L290 TraceCheckUtils]: 79: Hoare triple {7049#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6803#false} is VALID [2022-04-08 11:12:12,578 INFO L290 TraceCheckUtils]: 78: Hoare triple {7045#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7049#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:12,578 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-08 11:12:12,579 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-08 11:12:12,579 INFO L290 TraceCheckUtils]: 75: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:12:12,579 INFO L290 TraceCheckUtils]: 74: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:12:12,579 INFO L290 TraceCheckUtils]: 73: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:12:12,579 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-08 11:12:12,580 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-08 11:12:12,580 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-08 11:12:12,581 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-08 11:12:12,581 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-08 11:12:12,581 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-08 11:12:12,582 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-08 11:12:12,582 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-08 11:12:12,582 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-08 11:12:12,583 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-08 11:12:12,583 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-08 11:12:12,583 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-08 11:12:12,584 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-08 11:12:12,584 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-08 11:12:12,585 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-08 11:12:12,585 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-08 11:12:12,585 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-08 11:12:12,589 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-08 11:12:12,590 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-08 11:12:12,590 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-08 11:12:12,590 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-08 11:12:12,590 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-08 11:12:12,591 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6802#true} {6802#true} #63#return; {6802#true} is VALID [2022-04-08 11:12:12,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:12:12,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:12:12,591 INFO L290 TraceCheckUtils]: 47: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:12:12,591 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-08 11:12:12,591 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6802#true} {6802#true} #61#return; {6802#true} is VALID [2022-04-08 11:12:12,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:12:12,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:12:12,591 INFO L290 TraceCheckUtils]: 42: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:12:12,591 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-08 11:12:12,591 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6802#true} {6802#true} #59#return; {6802#true} is VALID [2022-04-08 11:12:12,591 INFO L290 TraceCheckUtils]: 39: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:12:12,591 INFO L290 TraceCheckUtils]: 38: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:12:12,591 INFO L290 TraceCheckUtils]: 37: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:12:12,592 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-08 11:12:12,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {6802#true} assume !!(#t~post5 < 10);havoc #t~post5; {6802#true} is VALID [2022-04-08 11:12:12,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {6802#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6802#true} is VALID [2022-04-08 11:12:12,592 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-08 11:12:12,592 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6802#true} {6802#true} #67#return; {6802#true} is VALID [2022-04-08 11:12:12,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:12:12,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:12:12,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:12:12,592 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-08 11:12:12,592 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6802#true} {6802#true} #65#return; {6802#true} is VALID [2022-04-08 11:12:12,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:12:12,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:12:12,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:12:12,592 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-08 11:12:12,593 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6802#true} {6802#true} #63#return; {6802#true} is VALID [2022-04-08 11:12:12,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:12:12,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:12:12,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:12:12,593 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-08 11:12:12,593 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6802#true} {6802#true} #61#return; {6802#true} is VALID [2022-04-08 11:12:12,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:12:12,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:12:12,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:12:12,593 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-08 11:12:12,593 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6802#true} {6802#true} #59#return; {6802#true} is VALID [2022-04-08 11:12:12,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:12:12,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {6802#true} assume !(0 == ~cond); {6802#true} is VALID [2022-04-08 11:12:12,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {6802#true} ~cond := #in~cond; {6802#true} is VALID [2022-04-08 11:12:12,594 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-08 11:12:12,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {6802#true} assume !!(#t~post5 < 10);havoc #t~post5; {6802#true} is VALID [2022-04-08 11:12:12,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {6802#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6802#true} is VALID [2022-04-08 11:12:12,594 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-08 11:12:12,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {6802#true} call #t~ret6 := main(); {6802#true} is VALID [2022-04-08 11:12:12,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6802#true} {6802#true} #81#return; {6802#true} is VALID [2022-04-08 11:12:12,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {6802#true} assume true; {6802#true} is VALID [2022-04-08 11:12:12,594 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-08 11:12:12,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {6802#true} call ULTIMATE.init(); {6802#true} is VALID [2022-04-08 11:12:12,595 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-08 11:12:12,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:12,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122393208] [2022-04-08 11:12:12,595 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:12,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683106273] [2022-04-08 11:12:12,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683106273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:12:12,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:12:12,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-04-08 11:12:12,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:12,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1148650594] [2022-04-08 11:12:12,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1148650594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:12,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:12,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 11:12:12,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254540824] [2022-04-08 11:12:12,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:12,596 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-08 11:12:12,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:12,596 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-08 11:12:12,659 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-08 11:12:12,659 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 11:12:12,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:12,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 11:12:12,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-04-08 11:12:12,660 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-08 11:12:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:14,034 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-04-08 11:12:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 11:12:14,034 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-08 11:12:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:14,034 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-08 11:12:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-08 11:12:14,035 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-08 11:12:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-08 11:12:14,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2022-04-08 11:12:14,112 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-08 11:12:14,113 INFO L225 Difference]: With dead ends: 102 [2022-04-08 11:12:14,113 INFO L226 Difference]: Without dead ends: 86 [2022-04-08 11:12:14,113 INFO L912 BasicCegarLoop]: 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-08 11:12:14,114 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.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, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:14,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 107 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 11:12:14,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-08 11:12:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-08 11:12:14,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:14,216 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-08 11:12:14,217 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-08 11:12:14,217 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-08 11:12:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:14,218 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-04-08 11:12:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-04-08 11:12:14,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:14,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:14,219 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-08 11:12:14,219 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-08 11:12:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:14,220 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-04-08 11:12:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-04-08 11:12:14,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:14,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:14,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:14,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:14,221 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-08 11:12:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2022-04-08 11:12:14,222 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 81 [2022-04-08 11:12:14,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:14,222 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2022-04-08 11:12:14,222 INFO L479 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-08 11:12:14,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 94 transitions. [2022-04-08 11:12:15,691 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-08 11:12:15,691 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-04-08 11:12:15,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 11:12:15,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:15,692 INFO L499 BasicCegarLoop]: 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-08 11:12:15,708 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-08 11:12:15,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 11:12:15,909 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:15,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:15,911 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 3 times [2022-04-08 11:12:15,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:15,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1633377062] [2022-04-08 11:12:16,168 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:16,168 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:16,169 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 4 times [2022-04-08 11:12:16,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:16,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159337869] [2022-04-08 11:12:16,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:16,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:16,204 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:16,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328569065] [2022-04-08 11:12:16,205 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:12:16,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:16,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:16,206 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-08 11:12:16,207 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-08 11:12:16,310 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:12:16,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:16,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 11:12:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:16,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:16,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {7856#true} call ULTIMATE.init(); {7856#true} is VALID [2022-04-08 11:12:16,909 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-08 11:12:16,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-08 11:12:16,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7856#true} {7856#true} #81#return; {7856#true} is VALID [2022-04-08 11:12:16,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {7856#true} call #t~ret6 := main(); {7856#true} is VALID [2022-04-08 11:12:16,910 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-08 11:12:16,910 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-08 11:12:16,911 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-08 11:12:16,911 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-08 11:12:16,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-08 11:12:16,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-08 11:12:16,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-08 11:12:16,911 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-08 11:12:16,911 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-08 11:12:16,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-08 11:12:16,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-08 11:12:16,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-08 11:12:16,912 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-08 11:12:16,912 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-08 11:12:16,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-08 11:12:16,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-08 11:12:16,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-08 11:12:16,927 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-08 11:12:16,927 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-08 11:12:16,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-08 11:12:16,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-08 11:12:16,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-08 11:12:16,928 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-08 11:12:16,928 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-08 11:12:16,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-08 11:12:16,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-08 11:12:16,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-08 11:12:16,928 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-08 11:12:16,929 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-08 11:12:16,929 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-08 11:12:16,929 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-08 11:12:16,929 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-08 11:12:16,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-08 11:12:16,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-08 11:12:16,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-08 11:12:16,930 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-08 11:12:16,930 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-08 11:12:16,930 INFO L290 TraceCheckUtils]: 42: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-08 11:12:16,930 INFO L290 TraceCheckUtils]: 43: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-08 11:12:16,930 INFO L290 TraceCheckUtils]: 44: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-08 11:12:16,931 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-08 11:12:16,931 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-08 11:12:16,931 INFO L290 TraceCheckUtils]: 47: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-08 11:12:16,931 INFO L290 TraceCheckUtils]: 48: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-08 11:12:16,931 INFO L290 TraceCheckUtils]: 49: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-08 11:12:16,931 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-08 11:12:16,931 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-08 11:12:16,931 INFO L290 TraceCheckUtils]: 52: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-08 11:12:16,932 INFO L290 TraceCheckUtils]: 53: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-08 11:12:16,932 INFO L290 TraceCheckUtils]: 54: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-08 11:12:16,932 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-08 11:12:16,932 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-08 11:12:16,932 INFO L290 TraceCheckUtils]: 57: Hoare triple {7856#true} ~cond := #in~cond; {8034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:16,933 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-08 11:12:16,933 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-08 11:12:16,933 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-08 11:12:16,934 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-08 11:12:16,934 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-08 11:12:16,934 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-08 11:12:16,934 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-08 11:12:16,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-08 11:12:16,935 INFO L290 TraceCheckUtils]: 66: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-08 11:12:16,935 INFO L290 TraceCheckUtils]: 67: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-08 11:12:16,937 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-08 11:12:16,938 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-08 11:12:16,938 INFO L290 TraceCheckUtils]: 70: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-08 11:12:16,938 INFO L290 TraceCheckUtils]: 71: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-08 11:12:16,938 INFO L290 TraceCheckUtils]: 72: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-08 11:12:16,938 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-08 11:12:16,938 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-08 11:12:16,938 INFO L290 TraceCheckUtils]: 75: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-08 11:12:16,938 INFO L290 TraceCheckUtils]: 76: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-08 11:12:16,939 INFO L290 TraceCheckUtils]: 77: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-08 11:12:16,939 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-08 11:12:16,939 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-08 11:12:16,939 INFO L290 TraceCheckUtils]: 80: Hoare triple {7856#true} ~cond := #in~cond; {8034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:16,939 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-08 11:12:16,940 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-08 11:12:16,940 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-08 11:12:16,940 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-08 11:12:16,940 INFO L290 TraceCheckUtils]: 85: Hoare triple {7856#true} ~cond := #in~cond; {8034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:16,941 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-08 11:12:16,941 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-08 11:12:16,941 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-08 11:12:16,942 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-08 11:12:16,942 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-08 11:12:16,942 INFO L290 TraceCheckUtils]: 91: Hoare triple {7856#true} ~cond := #in~cond; {7856#true} is VALID [2022-04-08 11:12:16,942 INFO L290 TraceCheckUtils]: 92: Hoare triple {7856#true} assume !(0 == ~cond); {7856#true} is VALID [2022-04-08 11:12:16,942 INFO L290 TraceCheckUtils]: 93: Hoare triple {7856#true} assume true; {7856#true} is VALID [2022-04-08 11:12:16,942 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-08 11:12:16,943 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-08 11:12:16,943 INFO L290 TraceCheckUtils]: 96: Hoare triple {8153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:16,944 INFO L290 TraceCheckUtils]: 97: Hoare triple {8157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7857#false} is VALID [2022-04-08 11:12:16,944 INFO L290 TraceCheckUtils]: 98: Hoare triple {7857#false} assume !false; {7857#false} is VALID [2022-04-08 11:12:16,944 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-08 11:12:16,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:32,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:32,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159337869] [2022-04-08 11:12:32,958 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:32,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328569065] [2022-04-08 11:12:32,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328569065] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:12:32,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:12:32,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 11:12:32,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:32,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1633377062] [2022-04-08 11:12:32,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1633377062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:32,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:32,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 11:12:32,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865446663] [2022-04-08 11:12:32,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:32,959 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-08 11:12:32,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:32,959 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-08 11:12:33,009 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-08 11:12:33,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 11:12:33,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:33,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 11:12:33,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-04-08 11:12:33,010 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-08 11:12:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:34,514 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2022-04-08 11:12:34,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 11:12:34,515 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-08 11:12:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:34,515 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-08 11:12:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-08 11:12:34,516 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-08 11:12:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-08 11:12:34,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 85 transitions. [2022-04-08 11:12:34,600 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-08 11:12:34,602 INFO L225 Difference]: With dead ends: 110 [2022-04-08 11:12:34,602 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 11:12:34,602 INFO L912 BasicCegarLoop]: 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-08 11:12:34,603 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 15 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:34,603 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 11:12:34,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 11:12:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-08 11:12:34,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:34,712 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-08 11:12:34,712 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-08 11:12:34,713 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-08 11:12:34,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:34,714 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2022-04-08 11:12:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-04-08 11:12:34,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:34,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:34,719 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-08 11:12:34,719 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-08 11:12:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:34,721 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2022-04-08 11:12:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-04-08 11:12:34,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:34,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:34,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:34,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:34,722 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-08 11:12:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2022-04-08 11:12:34,726 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 99 [2022-04-08 11:12:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:34,726 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2022-04-08 11:12:34,726 INFO L479 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-08 11:12:34,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 111 transitions. [2022-04-08 11:12:36,917 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-08 11:12:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-04-08 11:12:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 11:12:36,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:36,918 INFO L499 BasicCegarLoop]: 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-08 11:12:36,922 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-08 11:12:37,122 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 11:12:37,122 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:37,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 5 times [2022-04-08 11:12:37,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:37,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1423254284] [2022-04-08 11:12:37,375 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:37,376 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:37,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 6 times [2022-04-08 11:12:37,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:37,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790119435] [2022-04-08 11:12:37,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:37,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:37,402 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:37,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1648650130] [2022-04-08 11:12:37,402 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:12:37,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:37,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:37,403 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-08 11:12:37,404 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-08 11:12:37,635 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 11:12:37,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:37,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 11:12:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:37,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:37,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {8912#true} call ULTIMATE.init(); {8912#true} is VALID [2022-04-08 11:12:37,996 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-08 11:12:37,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {8920#(<= ~counter~0 0)} assume true; {8920#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:37,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8920#(<= ~counter~0 0)} {8912#true} #81#return; {8920#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:37,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {8920#(<= ~counter~0 0)} call #t~ret6 := main(); {8920#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:37,997 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-08 11:12:37,998 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-08 11:12:37,998 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-08 11:12:37,999 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-08 11:12:38,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {8936#(<= ~counter~0 1)} ~cond := #in~cond; {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {8936#(<= ~counter~0 1)} assume !(0 == ~cond); {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {8936#(<= ~counter~0 1)} assume true; {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,016 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8936#(<= ~counter~0 1)} {8936#(<= ~counter~0 1)} #59#return; {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,017 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-08 11:12:38,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {8936#(<= ~counter~0 1)} ~cond := #in~cond; {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {8936#(<= ~counter~0 1)} assume !(0 == ~cond); {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {8936#(<= ~counter~0 1)} assume true; {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,018 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8936#(<= ~counter~0 1)} {8936#(<= ~counter~0 1)} #61#return; {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,019 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-08 11:12:38,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {8936#(<= ~counter~0 1)} ~cond := #in~cond; {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {8936#(<= ~counter~0 1)} assume !(0 == ~cond); {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {8936#(<= ~counter~0 1)} assume true; {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,020 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8936#(<= ~counter~0 1)} {8936#(<= ~counter~0 1)} #63#return; {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,020 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-08 11:12:38,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {8936#(<= ~counter~0 1)} ~cond := #in~cond; {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {8936#(<= ~counter~0 1)} assume !(0 == ~cond); {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {8936#(<= ~counter~0 1)} assume true; {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,022 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8936#(<= ~counter~0 1)} {8936#(<= ~counter~0 1)} #65#return; {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,022 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-08 11:12:38,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {8936#(<= ~counter~0 1)} ~cond := #in~cond; {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {8936#(<= ~counter~0 1)} assume !(0 == ~cond); {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {8936#(<= ~counter~0 1)} assume true; {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,023 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8936#(<= ~counter~0 1)} {8936#(<= ~counter~0 1)} #67#return; {8936#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:38,023 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-08 11:12:38,024 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-08 11:12:38,024 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-08 11:12:38,025 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-08 11:12:38,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {9021#(<= ~counter~0 2)} ~cond := #in~cond; {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,025 INFO L290 TraceCheckUtils]: 38: Hoare triple {9021#(<= ~counter~0 2)} assume !(0 == ~cond); {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {9021#(<= ~counter~0 2)} assume true; {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,026 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9021#(<= ~counter~0 2)} {9021#(<= ~counter~0 2)} #59#return; {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,027 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-08 11:12:38,027 INFO L290 TraceCheckUtils]: 42: Hoare triple {9021#(<= ~counter~0 2)} ~cond := #in~cond; {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,027 INFO L290 TraceCheckUtils]: 43: Hoare triple {9021#(<= ~counter~0 2)} assume !(0 == ~cond); {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,027 INFO L290 TraceCheckUtils]: 44: Hoare triple {9021#(<= ~counter~0 2)} assume true; {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,028 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9021#(<= ~counter~0 2)} {9021#(<= ~counter~0 2)} #61#return; {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,028 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-08 11:12:38,029 INFO L290 TraceCheckUtils]: 47: Hoare triple {9021#(<= ~counter~0 2)} ~cond := #in~cond; {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,029 INFO L290 TraceCheckUtils]: 48: Hoare triple {9021#(<= ~counter~0 2)} assume !(0 == ~cond); {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,029 INFO L290 TraceCheckUtils]: 49: Hoare triple {9021#(<= ~counter~0 2)} assume true; {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,030 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9021#(<= ~counter~0 2)} {9021#(<= ~counter~0 2)} #63#return; {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,030 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-08 11:12:38,030 INFO L290 TraceCheckUtils]: 52: Hoare triple {9021#(<= ~counter~0 2)} ~cond := #in~cond; {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,031 INFO L290 TraceCheckUtils]: 53: Hoare triple {9021#(<= ~counter~0 2)} assume !(0 == ~cond); {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,031 INFO L290 TraceCheckUtils]: 54: Hoare triple {9021#(<= ~counter~0 2)} assume true; {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,031 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9021#(<= ~counter~0 2)} {9021#(<= ~counter~0 2)} #65#return; {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,032 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-08 11:12:38,032 INFO L290 TraceCheckUtils]: 57: Hoare triple {9021#(<= ~counter~0 2)} ~cond := #in~cond; {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,032 INFO L290 TraceCheckUtils]: 58: Hoare triple {9021#(<= ~counter~0 2)} assume !(0 == ~cond); {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,033 INFO L290 TraceCheckUtils]: 59: Hoare triple {9021#(<= ~counter~0 2)} assume true; {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,033 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9021#(<= ~counter~0 2)} {9021#(<= ~counter~0 2)} #67#return; {9021#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:38,033 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-08 11:12:38,034 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-08 11:12:38,034 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-08 11:12:38,035 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-08 11:12:38,060 INFO L290 TraceCheckUtils]: 65: Hoare triple {9106#(<= ~counter~0 3)} ~cond := #in~cond; {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,060 INFO L290 TraceCheckUtils]: 66: Hoare triple {9106#(<= ~counter~0 3)} assume !(0 == ~cond); {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,060 INFO L290 TraceCheckUtils]: 67: Hoare triple {9106#(<= ~counter~0 3)} assume true; {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,072 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9106#(<= ~counter~0 3)} {9106#(<= ~counter~0 3)} #59#return; {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,072 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-08 11:12:38,072 INFO L290 TraceCheckUtils]: 70: Hoare triple {9106#(<= ~counter~0 3)} ~cond := #in~cond; {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,073 INFO L290 TraceCheckUtils]: 71: Hoare triple {9106#(<= ~counter~0 3)} assume !(0 == ~cond); {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,073 INFO L290 TraceCheckUtils]: 72: Hoare triple {9106#(<= ~counter~0 3)} assume true; {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,073 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9106#(<= ~counter~0 3)} {9106#(<= ~counter~0 3)} #61#return; {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,074 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-08 11:12:38,074 INFO L290 TraceCheckUtils]: 75: Hoare triple {9106#(<= ~counter~0 3)} ~cond := #in~cond; {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,074 INFO L290 TraceCheckUtils]: 76: Hoare triple {9106#(<= ~counter~0 3)} assume !(0 == ~cond); {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,074 INFO L290 TraceCheckUtils]: 77: Hoare triple {9106#(<= ~counter~0 3)} assume true; {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,075 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {9106#(<= ~counter~0 3)} {9106#(<= ~counter~0 3)} #63#return; {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,076 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-08 11:12:38,076 INFO L290 TraceCheckUtils]: 80: Hoare triple {9106#(<= ~counter~0 3)} ~cond := #in~cond; {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,076 INFO L290 TraceCheckUtils]: 81: Hoare triple {9106#(<= ~counter~0 3)} assume !(0 == ~cond); {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,076 INFO L290 TraceCheckUtils]: 82: Hoare triple {9106#(<= ~counter~0 3)} assume true; {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,077 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {9106#(<= ~counter~0 3)} {9106#(<= ~counter~0 3)} #65#return; {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,077 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-08 11:12:38,078 INFO L290 TraceCheckUtils]: 85: Hoare triple {9106#(<= ~counter~0 3)} ~cond := #in~cond; {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,078 INFO L290 TraceCheckUtils]: 86: Hoare triple {9106#(<= ~counter~0 3)} assume !(0 == ~cond); {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,078 INFO L290 TraceCheckUtils]: 87: Hoare triple {9106#(<= ~counter~0 3)} assume true; {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,079 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9106#(<= ~counter~0 3)} {9106#(<= ~counter~0 3)} #67#return; {9106#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:38,079 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-08 11:12:38,079 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-08 11:12:38,080 INFO L290 TraceCheckUtils]: 91: Hoare triple {9191#(<= |main_#t~post5| 3)} assume !(#t~post5 < 10);havoc #t~post5; {8913#false} is VALID [2022-04-08 11:12:38,080 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-08 11:12:38,080 INFO L290 TraceCheckUtils]: 93: Hoare triple {8913#false} ~cond := #in~cond; {8913#false} is VALID [2022-04-08 11:12:38,080 INFO L290 TraceCheckUtils]: 94: Hoare triple {8913#false} assume !(0 == ~cond); {8913#false} is VALID [2022-04-08 11:12:38,080 INFO L290 TraceCheckUtils]: 95: Hoare triple {8913#false} assume true; {8913#false} is VALID [2022-04-08 11:12:38,080 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {8913#false} {8913#false} #69#return; {8913#false} is VALID [2022-04-08 11:12:38,080 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-08 11:12:38,080 INFO L290 TraceCheckUtils]: 98: Hoare triple {8913#false} ~cond := #in~cond; {8913#false} is VALID [2022-04-08 11:12:38,080 INFO L290 TraceCheckUtils]: 99: Hoare triple {8913#false} assume 0 == ~cond; {8913#false} is VALID [2022-04-08 11:12:38,080 INFO L290 TraceCheckUtils]: 100: Hoare triple {8913#false} assume !false; {8913#false} is VALID [2022-04-08 11:12:38,081 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-08 11:12:38,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:38,405 INFO L290 TraceCheckUtils]: 100: Hoare triple {8913#false} assume !false; {8913#false} is VALID [2022-04-08 11:12:38,405 INFO L290 TraceCheckUtils]: 99: Hoare triple {8913#false} assume 0 == ~cond; {8913#false} is VALID [2022-04-08 11:12:38,405 INFO L290 TraceCheckUtils]: 98: Hoare triple {8913#false} ~cond := #in~cond; {8913#false} is VALID [2022-04-08 11:12:38,405 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-08 11:12:38,405 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {8912#true} {8913#false} #69#return; {8913#false} is VALID [2022-04-08 11:12:38,405 INFO L290 TraceCheckUtils]: 95: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-08 11:12:38,405 INFO L290 TraceCheckUtils]: 94: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-08 11:12:38,405 INFO L290 TraceCheckUtils]: 93: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-08 11:12:38,405 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-08 11:12:38,406 INFO L290 TraceCheckUtils]: 91: Hoare triple {9249#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {8913#false} is VALID [2022-04-08 11:12:38,406 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-08 11:12:38,406 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-08 11:12:38,407 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8912#true} {9253#(< ~counter~0 10)} #67#return; {9253#(< ~counter~0 10)} is VALID [2022-04-08 11:12:38,407 INFO L290 TraceCheckUtils]: 87: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-08 11:12:38,407 INFO L290 TraceCheckUtils]: 86: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-08 11:12:38,407 INFO L290 TraceCheckUtils]: 85: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-08 11:12:38,407 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-08 11:12:38,407 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {8912#true} {9253#(< ~counter~0 10)} #65#return; {9253#(< ~counter~0 10)} is VALID [2022-04-08 11:12:38,408 INFO L290 TraceCheckUtils]: 82: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-08 11:12:38,408 INFO L290 TraceCheckUtils]: 81: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-08 11:12:38,408 INFO L290 TraceCheckUtils]: 80: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-08 11:12:38,408 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-08 11:12:38,408 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {8912#true} {9253#(< ~counter~0 10)} #63#return; {9253#(< ~counter~0 10)} is VALID [2022-04-08 11:12:38,408 INFO L290 TraceCheckUtils]: 77: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-08 11:12:38,408 INFO L290 TraceCheckUtils]: 76: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-08 11:12:38,409 INFO L290 TraceCheckUtils]: 75: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-08 11:12:38,409 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-08 11:12:38,409 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8912#true} {9253#(< ~counter~0 10)} #61#return; {9253#(< ~counter~0 10)} is VALID [2022-04-08 11:12:38,409 INFO L290 TraceCheckUtils]: 72: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-08 11:12:38,409 INFO L290 TraceCheckUtils]: 71: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-08 11:12:38,409 INFO L290 TraceCheckUtils]: 70: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-08 11:12:38,410 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-08 11:12:38,410 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8912#true} {9253#(< ~counter~0 10)} #59#return; {9253#(< ~counter~0 10)} is VALID [2022-04-08 11:12:38,410 INFO L290 TraceCheckUtils]: 67: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-08 11:12:38,410 INFO L290 TraceCheckUtils]: 66: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-08 11:12:38,410 INFO L290 TraceCheckUtils]: 65: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-08 11:12:38,410 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-08 11:12:38,410 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-08 11:12:38,411 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-08 11:12:38,411 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-08 11:12:38,412 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8912#true} {9338#(< ~counter~0 9)} #67#return; {9338#(< ~counter~0 9)} is VALID [2022-04-08 11:12:38,412 INFO L290 TraceCheckUtils]: 59: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-08 11:12:38,412 INFO L290 TraceCheckUtils]: 58: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-08 11:12:38,412 INFO L290 TraceCheckUtils]: 57: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-08 11:12:38,412 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-08 11:12:38,412 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8912#true} {9338#(< ~counter~0 9)} #65#return; {9338#(< ~counter~0 9)} is VALID [2022-04-08 11:12:38,412 INFO L290 TraceCheckUtils]: 54: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-08 11:12:38,412 INFO L290 TraceCheckUtils]: 53: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-08 11:12:38,413 INFO L290 TraceCheckUtils]: 52: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-08 11:12:38,413 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-08 11:12:38,413 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8912#true} {9338#(< ~counter~0 9)} #63#return; {9338#(< ~counter~0 9)} is VALID [2022-04-08 11:12:38,413 INFO L290 TraceCheckUtils]: 49: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-08 11:12:38,413 INFO L290 TraceCheckUtils]: 48: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-08 11:12:38,413 INFO L290 TraceCheckUtils]: 47: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-08 11:12:38,413 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-08 11:12:38,414 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8912#true} {9338#(< ~counter~0 9)} #61#return; {9338#(< ~counter~0 9)} is VALID [2022-04-08 11:12:38,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-08 11:12:38,414 INFO L290 TraceCheckUtils]: 43: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-08 11:12:38,414 INFO L290 TraceCheckUtils]: 42: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-08 11:12:38,414 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-08 11:12:38,414 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8912#true} {9338#(< ~counter~0 9)} #59#return; {9338#(< ~counter~0 9)} is VALID [2022-04-08 11:12:38,414 INFO L290 TraceCheckUtils]: 39: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-08 11:12:38,414 INFO L290 TraceCheckUtils]: 38: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-08 11:12:38,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-08 11:12:38,415 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-08 11:12:38,415 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-08 11:12:38,415 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-08 11:12:38,415 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-08 11:12:38,416 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8912#true} {9423#(< ~counter~0 8)} #67#return; {9423#(< ~counter~0 8)} is VALID [2022-04-08 11:12:38,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-08 11:12:38,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-08 11:12:38,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-08 11:12:38,416 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-08 11:12:38,416 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8912#true} {9423#(< ~counter~0 8)} #65#return; {9423#(< ~counter~0 8)} is VALID [2022-04-08 11:12:38,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-08 11:12:38,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-08 11:12:38,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-08 11:12:38,417 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-08 11:12:38,421 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8912#true} {9423#(< ~counter~0 8)} #63#return; {9423#(< ~counter~0 8)} is VALID [2022-04-08 11:12:38,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-08 11:12:38,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-08 11:12:38,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-08 11:12:38,421 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-08 11:12:38,422 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8912#true} {9423#(< ~counter~0 8)} #61#return; {9423#(< ~counter~0 8)} is VALID [2022-04-08 11:12:38,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-08 11:12:38,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-08 11:12:38,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-08 11:12:38,422 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-08 11:12:38,422 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8912#true} {9423#(< ~counter~0 8)} #59#return; {9423#(< ~counter~0 8)} is VALID [2022-04-08 11:12:38,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-08 11:12:38,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-08 11:12:38,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-08 11:12:38,423 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-08 11:12:38,423 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-08 11:12:38,423 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-08 11:12:38,423 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-08 11:12:38,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {9508#(< ~counter~0 7)} call #t~ret6 := main(); {9508#(< ~counter~0 7)} is VALID [2022-04-08 11:12:38,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9508#(< ~counter~0 7)} {8912#true} #81#return; {9508#(< ~counter~0 7)} is VALID [2022-04-08 11:12:38,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {9508#(< ~counter~0 7)} assume true; {9508#(< ~counter~0 7)} is VALID [2022-04-08 11:12:38,425 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-08 11:12:38,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {8912#true} call ULTIMATE.init(); {8912#true} is VALID [2022-04-08 11:12:38,425 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-08 11:12:38,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:38,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790119435] [2022-04-08 11:12:38,425 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:38,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648650130] [2022-04-08 11:12:38,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648650130] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:12:38,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:12:38,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 11:12:38,427 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:38,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1423254284] [2022-04-08 11:12:38,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1423254284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:38,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:38,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:12:38,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507801147] [2022-04-08 11:12:38,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:38,427 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-08 11:12:38,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:38,428 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-08 11:12:38,468 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-08 11:12:38,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:12:38,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:38,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:12:38,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:12:38,471 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-08 11:12:39,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:39,009 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2022-04-08 11:12:39,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 11:12:39,009 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-08 11:12:39,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:39,011 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-08 11:12:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-08 11:12:39,013 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-08 11:12:39,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-08 11:12:39,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2022-04-08 11:12:39,085 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-08 11:12:39,087 INFO L225 Difference]: With dead ends: 116 [2022-04-08 11:12:39,087 INFO L226 Difference]: Without dead ends: 102 [2022-04-08 11:12:39,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-08 11:12:39,088 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:39,088 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 146 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:12:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-08 11:12:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-08 11:12:39,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:39,197 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-08 11:12:39,197 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-08 11:12:39,198 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-08 11:12:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:39,200 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-04-08 11:12:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2022-04-08 11:12:39,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:39,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:39,201 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-08 11:12:39,201 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-08 11:12:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:39,203 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-04-08 11:12:39,203 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2022-04-08 11:12:39,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:39,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:39,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:39,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:39,203 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-08 11:12:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2022-04-08 11:12:39,205 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 101 [2022-04-08 11:12:39,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:39,205 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2022-04-08 11:12:39,205 INFO L479 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-08 11:12:39,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 113 transitions. [2022-04-08 11:12:41,377 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-08 11:12:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2022-04-08 11:12:41,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-08 11:12:41,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:41,378 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:41,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-08 11:12:41,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 11:12:41,579 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:41,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:41,579 INFO L85 PathProgramCache]: Analyzing trace with hash -813840784, now seen corresponding path program 5 times [2022-04-08 11:12:41,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:41,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [792379040] [2022-04-08 11:12:41,820 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:41,821 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:41,821 INFO L85 PathProgramCache]: Analyzing trace with hash -813840784, now seen corresponding path program 6 times [2022-04-08 11:12:41,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:41,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493725795] [2022-04-08 11:12:41,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:41,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:41,829 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:41,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1475154599] [2022-04-08 11:12:41,829 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:12:41,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:41,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:41,830 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-08 11:12:41,831 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-08 11:12:42,311 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 11:12:42,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:42,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 11:12:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:42,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:43,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {10175#true} call ULTIMATE.init(); {10175#true} is VALID [2022-04-08 11:12:43,017 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-08 11:12:43,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10175#true} {10175#true} #81#return; {10175#true} is VALID [2022-04-08 11:12:43,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {10175#true} call #t~ret6 := main(); {10175#true} is VALID [2022-04-08 11:12:43,017 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-08 11:12:43,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {10175#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10175#true} is VALID [2022-04-08 11:12:43,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {10175#true} assume !!(#t~post5 < 10);havoc #t~post5; {10175#true} is VALID [2022-04-08 11:12:43,017 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-08 11:12:43,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,018 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10175#true} {10175#true} #59#return; {10175#true} is VALID [2022-04-08 11:12:43,018 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-08 11:12:43,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,018 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10175#true} {10175#true} #61#return; {10175#true} is VALID [2022-04-08 11:12:43,018 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-08 11:12:43,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,018 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10175#true} {10175#true} #63#return; {10175#true} is VALID [2022-04-08 11:12:43,018 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-08 11:12:43,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,019 INFO L290 TraceCheckUtils]: 25: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,019 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10175#true} {10175#true} #65#return; {10175#true} is VALID [2022-04-08 11:12:43,019 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-08 11:12:43,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,019 INFO L290 TraceCheckUtils]: 30: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,019 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10175#true} {10175#true} #67#return; {10175#true} is VALID [2022-04-08 11:12:43,019 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-08 11:12:43,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {10175#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10175#true} is VALID [2022-04-08 11:12:43,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {10175#true} assume !!(#t~post5 < 10);havoc #t~post5; {10175#true} is VALID [2022-04-08 11:12:43,019 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-08 11:12:43,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,019 INFO L290 TraceCheckUtils]: 38: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,020 INFO L290 TraceCheckUtils]: 39: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,020 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10175#true} {10175#true} #59#return; {10175#true} is VALID [2022-04-08 11:12:43,020 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-08 11:12:43,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,020 INFO L290 TraceCheckUtils]: 43: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,020 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10175#true} {10175#true} #61#return; {10175#true} is VALID [2022-04-08 11:12:43,020 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-08 11:12:43,020 INFO L290 TraceCheckUtils]: 47: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,020 INFO L290 TraceCheckUtils]: 48: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,020 INFO L290 TraceCheckUtils]: 49: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,020 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10175#true} {10175#true} #63#return; {10175#true} is VALID [2022-04-08 11:12:43,020 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-08 11:12:43,021 INFO L290 TraceCheckUtils]: 52: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,021 INFO L290 TraceCheckUtils]: 53: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,021 INFO L290 TraceCheckUtils]: 54: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,021 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10175#true} {10175#true} #65#return; {10175#true} is VALID [2022-04-08 11:12:43,021 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-08 11:12:43,021 INFO L290 TraceCheckUtils]: 57: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,021 INFO L290 TraceCheckUtils]: 58: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,021 INFO L290 TraceCheckUtils]: 59: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,021 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10175#true} {10175#true} #67#return; {10175#true} is VALID [2022-04-08 11:12:43,021 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-08 11:12:43,021 INFO L290 TraceCheckUtils]: 62: Hoare triple {10175#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10175#true} is VALID [2022-04-08 11:12:43,021 INFO L290 TraceCheckUtils]: 63: Hoare triple {10175#true} assume !!(#t~post5 < 10);havoc #t~post5; {10175#true} is VALID [2022-04-08 11:12:43,021 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-08 11:12:43,021 INFO L290 TraceCheckUtils]: 65: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,021 INFO L290 TraceCheckUtils]: 66: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,022 INFO L290 TraceCheckUtils]: 67: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,022 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10175#true} {10175#true} #59#return; {10175#true} is VALID [2022-04-08 11:12:43,022 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-08 11:12:43,022 INFO L290 TraceCheckUtils]: 70: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,022 INFO L290 TraceCheckUtils]: 71: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,022 INFO L290 TraceCheckUtils]: 72: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,022 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10175#true} {10175#true} #61#return; {10175#true} is VALID [2022-04-08 11:12:43,022 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-08 11:12:43,022 INFO L290 TraceCheckUtils]: 75: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,022 INFO L290 TraceCheckUtils]: 76: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,022 INFO L290 TraceCheckUtils]: 77: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,022 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10175#true} {10175#true} #63#return; {10175#true} is VALID [2022-04-08 11:12:43,022 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-08 11:12:43,022 INFO L290 TraceCheckUtils]: 80: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,023 INFO L290 TraceCheckUtils]: 81: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,023 INFO L290 TraceCheckUtils]: 82: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,023 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {10175#true} {10175#true} #65#return; {10175#true} is VALID [2022-04-08 11:12:43,023 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-08 11:12:43,023 INFO L290 TraceCheckUtils]: 85: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,023 INFO L290 TraceCheckUtils]: 86: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,023 INFO L290 TraceCheckUtils]: 87: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,023 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10175#true} {10175#true} #67#return; {10175#true} is VALID [2022-04-08 11:12:43,024 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-08 11:12:43,024 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-08 11:12:43,024 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-08 11:12:43,024 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-08 11:12:43,025 INFO L290 TraceCheckUtils]: 93: Hoare triple {10175#true} ~cond := #in~cond; {10460#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:43,025 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-08 11:12:43,025 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-08 11:12:43,026 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-08 11:12:43,026 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-08 11:12:43,026 INFO L290 TraceCheckUtils]: 98: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,026 INFO L290 TraceCheckUtils]: 99: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,026 INFO L290 TraceCheckUtils]: 100: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,027 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-08 11:12:43,027 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-08 11:12:43,027 INFO L290 TraceCheckUtils]: 103: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,027 INFO L290 TraceCheckUtils]: 104: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,027 INFO L290 TraceCheckUtils]: 105: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,027 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-08 11:12:43,028 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-08 11:12:43,028 INFO L290 TraceCheckUtils]: 108: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,028 INFO L290 TraceCheckUtils]: 109: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,028 INFO L290 TraceCheckUtils]: 110: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,028 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-08 11:12:43,028 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-08 11:12:43,028 INFO L290 TraceCheckUtils]: 113: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,028 INFO L290 TraceCheckUtils]: 114: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,029 INFO L290 TraceCheckUtils]: 115: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,029 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-08 11:12:43,030 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-08 11:12:43,030 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-08 11:12:43,030 INFO L290 TraceCheckUtils]: 119: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:43,030 INFO L290 TraceCheckUtils]: 120: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:43,030 INFO L290 TraceCheckUtils]: 121: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:43,030 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-08 11:12:45,032 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-08 11:12:45,033 INFO L290 TraceCheckUtils]: 124: Hoare triple {10554#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10558#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:45,033 INFO L290 TraceCheckUtils]: 125: Hoare triple {10558#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10176#false} is VALID [2022-04-08 11:12:45,033 INFO L290 TraceCheckUtils]: 126: Hoare triple {10176#false} assume !false; {10176#false} is VALID [2022-04-08 11:12:45,034 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-08 11:12:45,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:47,336 INFO L290 TraceCheckUtils]: 126: Hoare triple {10176#false} assume !false; {10176#false} is VALID [2022-04-08 11:12:47,336 INFO L290 TraceCheckUtils]: 125: Hoare triple {10558#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10176#false} is VALID [2022-04-08 11:12:47,337 INFO L290 TraceCheckUtils]: 124: Hoare triple {10554#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10558#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:49,338 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-08 11:12:49,339 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-08 11:12:49,339 INFO L290 TraceCheckUtils]: 121: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,339 INFO L290 TraceCheckUtils]: 120: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,339 INFO L290 TraceCheckUtils]: 119: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,339 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-08 11:12:49,340 INFO L290 TraceCheckUtils]: 117: Hoare triple {10592#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} assume !(~n~0 <= ~a~0); {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-08 11:12:49,340 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {10175#true} {10592#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #67#return; {10592#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-08 11:12:49,341 INFO L290 TraceCheckUtils]: 115: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,341 INFO L290 TraceCheckUtils]: 114: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,341 INFO L290 TraceCheckUtils]: 113: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,341 INFO L272 TraceCheckUtils]: 112: Hoare triple {10592#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10175#true} is VALID [2022-04-08 11:12:49,341 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {10175#true} {10592#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #65#return; {10592#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-08 11:12:49,341 INFO L290 TraceCheckUtils]: 110: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,341 INFO L290 TraceCheckUtils]: 109: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,342 INFO L290 TraceCheckUtils]: 108: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,342 INFO L272 TraceCheckUtils]: 107: Hoare triple {10592#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10175#true} is VALID [2022-04-08 11:12:49,342 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {10175#true} {10592#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #63#return; {10592#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-08 11:12:49,342 INFO L290 TraceCheckUtils]: 105: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,342 INFO L290 TraceCheckUtils]: 104: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,342 INFO L290 TraceCheckUtils]: 103: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,342 INFO L272 TraceCheckUtils]: 102: Hoare triple {10592#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10175#true} is VALID [2022-04-08 11:12:49,343 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10175#true} {10592#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #61#return; {10592#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-08 11:12:49,343 INFO L290 TraceCheckUtils]: 100: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,343 INFO L290 TraceCheckUtils]: 99: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,343 INFO L290 TraceCheckUtils]: 98: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,343 INFO L272 TraceCheckUtils]: 97: Hoare triple {10592#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10175#true} is VALID [2022-04-08 11:12:49,344 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {10464#(not (= |__VERIFIER_assert_#in~cond| 0))} {10656#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} #59#return; {10592#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-08 11:12:49,344 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-08 11:12:49,345 INFO L290 TraceCheckUtils]: 94: Hoare triple {10666#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10464#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:49,345 INFO L290 TraceCheckUtils]: 93: Hoare triple {10175#true} ~cond := #in~cond; {10666#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:12:49,345 INFO L272 TraceCheckUtils]: 92: Hoare triple {10656#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10175#true} is VALID [2022-04-08 11:12:49,346 INFO L290 TraceCheckUtils]: 91: Hoare triple {10656#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} assume !!(#t~post5 < 10);havoc #t~post5; {10656#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-08 11:12:49,346 INFO L290 TraceCheckUtils]: 90: Hoare triple {10656#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10656#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-08 11:12:49,347 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; {10656#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-08 11:12:49,347 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10175#true} {10175#true} #67#return; {10175#true} is VALID [2022-04-08 11:12:49,347 INFO L290 TraceCheckUtils]: 87: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,347 INFO L290 TraceCheckUtils]: 86: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,347 INFO L290 TraceCheckUtils]: 85: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,347 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-08 11:12:49,347 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {10175#true} {10175#true} #65#return; {10175#true} is VALID [2022-04-08 11:12:49,347 INFO L290 TraceCheckUtils]: 82: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,347 INFO L290 TraceCheckUtils]: 81: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,347 INFO L290 TraceCheckUtils]: 80: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,347 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-08 11:12:49,347 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10175#true} {10175#true} #63#return; {10175#true} is VALID [2022-04-08 11:12:49,348 INFO L290 TraceCheckUtils]: 77: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,348 INFO L290 TraceCheckUtils]: 76: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,348 INFO L290 TraceCheckUtils]: 75: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,348 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-08 11:12:49,348 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10175#true} {10175#true} #61#return; {10175#true} is VALID [2022-04-08 11:12:49,348 INFO L290 TraceCheckUtils]: 72: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,348 INFO L290 TraceCheckUtils]: 71: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,348 INFO L290 TraceCheckUtils]: 70: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,348 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-08 11:12:49,348 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10175#true} {10175#true} #59#return; {10175#true} is VALID [2022-04-08 11:12:49,348 INFO L290 TraceCheckUtils]: 67: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,348 INFO L290 TraceCheckUtils]: 66: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,348 INFO L290 TraceCheckUtils]: 65: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,348 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-08 11:12:49,349 INFO L290 TraceCheckUtils]: 63: Hoare triple {10175#true} assume !!(#t~post5 < 10);havoc #t~post5; {10175#true} is VALID [2022-04-08 11:12:49,349 INFO L290 TraceCheckUtils]: 62: Hoare triple {10175#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10175#true} is VALID [2022-04-08 11:12:49,349 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-08 11:12:49,349 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10175#true} {10175#true} #67#return; {10175#true} is VALID [2022-04-08 11:12:49,349 INFO L290 TraceCheckUtils]: 59: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,349 INFO L290 TraceCheckUtils]: 58: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,349 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-08 11:12:49,349 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10175#true} {10175#true} #65#return; {10175#true} is VALID [2022-04-08 11:12:49,349 INFO L290 TraceCheckUtils]: 54: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,349 INFO L290 TraceCheckUtils]: 53: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,349 INFO L290 TraceCheckUtils]: 52: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,349 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-08 11:12:49,349 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10175#true} {10175#true} #63#return; {10175#true} is VALID [2022-04-08 11:12:49,350 INFO L290 TraceCheckUtils]: 49: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,350 INFO L290 TraceCheckUtils]: 48: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,350 INFO L290 TraceCheckUtils]: 47: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,350 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-08 11:12:49,350 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10175#true} {10175#true} #61#return; {10175#true} is VALID [2022-04-08 11:12:49,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,350 INFO L290 TraceCheckUtils]: 42: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,350 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-08 11:12:49,350 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10175#true} {10175#true} #59#return; {10175#true} is VALID [2022-04-08 11:12:49,350 INFO L290 TraceCheckUtils]: 39: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,350 INFO L290 TraceCheckUtils]: 38: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,350 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-08 11:12:49,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {10175#true} assume !!(#t~post5 < 10);havoc #t~post5; {10175#true} is VALID [2022-04-08 11:12:49,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {10175#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10175#true} is VALID [2022-04-08 11:12:49,351 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-08 11:12:49,351 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10175#true} {10175#true} #67#return; {10175#true} is VALID [2022-04-08 11:12:49,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,351 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-08 11:12:49,351 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10175#true} {10175#true} #65#return; {10175#true} is VALID [2022-04-08 11:12:49,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,351 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-08 11:12:49,351 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10175#true} {10175#true} #63#return; {10175#true} is VALID [2022-04-08 11:12:49,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,352 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-08 11:12:49,352 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10175#true} {10175#true} #61#return; {10175#true} is VALID [2022-04-08 11:12:49,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,352 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-08 11:12:49,352 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10175#true} {10175#true} #59#return; {10175#true} is VALID [2022-04-08 11:12:49,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2022-04-08 11:12:49,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2022-04-08 11:12:49,352 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-08 11:12:49,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {10175#true} assume !!(#t~post5 < 10);havoc #t~post5; {10175#true} is VALID [2022-04-08 11:12:49,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {10175#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10175#true} is VALID [2022-04-08 11:12:49,353 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-08 11:12:49,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {10175#true} call #t~ret6 := main(); {10175#true} is VALID [2022-04-08 11:12:49,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10175#true} {10175#true} #81#return; {10175#true} is VALID [2022-04-08 11:12:49,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {10175#true} assume true; {10175#true} is VALID [2022-04-08 11:12:49,353 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-08 11:12:49,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {10175#true} call ULTIMATE.init(); {10175#true} is VALID [2022-04-08 11:12:49,353 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-08 11:12:49,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:49,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493725795] [2022-04-08 11:12:49,354 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:49,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475154599] [2022-04-08 11:12:49,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475154599] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:12:49,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:12:49,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-04-08 11:12:49,354 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:49,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [792379040] [2022-04-08 11:12:49,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [792379040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:49,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:49,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 11:12:49,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498136464] [2022-04-08 11:12:49,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:49,357 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-08 11:12:49,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:49,357 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-08 11:12:51,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:51,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 11:12:51,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:51,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 11:12:51,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:12:51,394 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-08 11:12:56,577 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-08 11:12:58,581 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-08 11:13:04,300 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-08 11:13:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:13:04,675 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-04-08 11:13:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 11:13:04,675 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-08 11:13:04,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:13:04,676 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-08 11:13:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-08 11:13:04,676 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-08 11:13:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-08 11:13:04,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2022-04-08 11:13:06,733 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-08 11:13:06,735 INFO L225 Difference]: With dead ends: 112 [2022-04-08 11:13:06,735 INFO L226 Difference]: Without dead ends: 110 [2022-04-08 11:13:06,735 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-08 11:13:06,735 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 18 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:13:06,736 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 129 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 210 Invalid, 3 Unknown, 0 Unchecked, 8.1s Time] [2022-04-08 11:13:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-08 11:13:06,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2022-04-08 11:13:06,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:13:06,869 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-08 11:13:06,869 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-08 11:13:06,869 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-08 11:13:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:13:06,871 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2022-04-08 11:13:06,871 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2022-04-08 11:13:06,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:13:06,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:13:06,872 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-08 11:13:06,872 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-08 11:13:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:13:06,873 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2022-04-08 11:13:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2022-04-08 11:13:06,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:13:06,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:13:06,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:13:06,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:13:06,874 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-08 11:13:06,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2022-04-08 11:13:06,876 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 127 [2022-04-08 11:13:06,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:13:06,876 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2022-04-08 11:13:06,876 INFO L479 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-08 11:13:06,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 120 transitions. [2022-04-08 11:13:08,538 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-08 11:13:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2022-04-08 11:13:08,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-08 11:13:08,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:13:08,539 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:13:08,546 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-08 11:13:08,740 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 11:13:08,740 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:13:08,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:13:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash -167438485, now seen corresponding path program 7 times [2022-04-08 11:13:08,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:13:08,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1534272642] [2022-04-08 11:13:09,000 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:13:09,000 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:13:09,000 INFO L85 PathProgramCache]: Analyzing trace with hash -167438485, now seen corresponding path program 8 times [2022-04-08 11:13:09,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:13:09,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673476805] [2022-04-08 11:13:09,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:13:09,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:13:09,009 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:13:09,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1945803553] [2022-04-08 11:13:09,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:13:09,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:13:09,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:13:09,021 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-08 11:13:09,022 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-08 11:13:09,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:13:09,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:13:09,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 11:13:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:13:09,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:13:09,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {11614#true} call ULTIMATE.init(); {11614#true} is VALID [2022-04-08 11:13:09,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {11614#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; {11622#(<= ~counter~0 0)} is VALID [2022-04-08 11:13:09,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {11622#(<= ~counter~0 0)} assume true; {11622#(<= ~counter~0 0)} is VALID [2022-04-08 11:13:09,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11622#(<= ~counter~0 0)} {11614#true} #81#return; {11622#(<= ~counter~0 0)} is VALID [2022-04-08 11:13:09,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {11622#(<= ~counter~0 0)} call #t~ret6 := main(); {11622#(<= ~counter~0 0)} is VALID [2022-04-08 11:13:09,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {11622#(<= ~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; {11622#(<= ~counter~0 0)} is VALID [2022-04-08 11:13:09,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {11622#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {11638#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,556 INFO L272 TraceCheckUtils]: 8: Hoare triple {11638#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {11638#(<= ~counter~0 1)} ~cond := #in~cond; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {11638#(<= ~counter~0 1)} assume !(0 == ~cond); {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {11638#(<= ~counter~0 1)} assume true; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,558 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11638#(<= ~counter~0 1)} {11638#(<= ~counter~0 1)} #59#return; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,558 INFO L272 TraceCheckUtils]: 13: Hoare triple {11638#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {11638#(<= ~counter~0 1)} ~cond := #in~cond; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {11638#(<= ~counter~0 1)} assume !(0 == ~cond); {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {11638#(<= ~counter~0 1)} assume true; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,559 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11638#(<= ~counter~0 1)} {11638#(<= ~counter~0 1)} #61#return; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,560 INFO L272 TraceCheckUtils]: 18: Hoare triple {11638#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {11638#(<= ~counter~0 1)} ~cond := #in~cond; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {11638#(<= ~counter~0 1)} assume !(0 == ~cond); {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {11638#(<= ~counter~0 1)} assume true; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,561 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11638#(<= ~counter~0 1)} {11638#(<= ~counter~0 1)} #63#return; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,561 INFO L272 TraceCheckUtils]: 23: Hoare triple {11638#(<= ~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)); {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {11638#(<= ~counter~0 1)} ~cond := #in~cond; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {11638#(<= ~counter~0 1)} assume !(0 == ~cond); {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {11638#(<= ~counter~0 1)} assume true; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,563 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11638#(<= ~counter~0 1)} {11638#(<= ~counter~0 1)} #65#return; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,563 INFO L272 TraceCheckUtils]: 28: Hoare triple {11638#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {11638#(<= ~counter~0 1)} ~cond := #in~cond; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {11638#(<= ~counter~0 1)} assume !(0 == ~cond); {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {11638#(<= ~counter~0 1)} assume true; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,564 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11638#(<= ~counter~0 1)} {11638#(<= ~counter~0 1)} #67#return; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {11638#(<= ~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; {11638#(<= ~counter~0 1)} is VALID [2022-04-08 11:13:09,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {11638#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {11723#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,566 INFO L272 TraceCheckUtils]: 36: Hoare triple {11723#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,566 INFO L290 TraceCheckUtils]: 37: Hoare triple {11723#(<= ~counter~0 2)} ~cond := #in~cond; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,566 INFO L290 TraceCheckUtils]: 38: Hoare triple {11723#(<= ~counter~0 2)} assume !(0 == ~cond); {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,566 INFO L290 TraceCheckUtils]: 39: Hoare triple {11723#(<= ~counter~0 2)} assume true; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,567 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11723#(<= ~counter~0 2)} {11723#(<= ~counter~0 2)} #59#return; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,567 INFO L272 TraceCheckUtils]: 41: Hoare triple {11723#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {11723#(<= ~counter~0 2)} ~cond := #in~cond; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,568 INFO L290 TraceCheckUtils]: 43: Hoare triple {11723#(<= ~counter~0 2)} assume !(0 == ~cond); {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,568 INFO L290 TraceCheckUtils]: 44: Hoare triple {11723#(<= ~counter~0 2)} assume true; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,569 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11723#(<= ~counter~0 2)} {11723#(<= ~counter~0 2)} #61#return; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,569 INFO L272 TraceCheckUtils]: 46: Hoare triple {11723#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,569 INFO L290 TraceCheckUtils]: 47: Hoare triple {11723#(<= ~counter~0 2)} ~cond := #in~cond; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,569 INFO L290 TraceCheckUtils]: 48: Hoare triple {11723#(<= ~counter~0 2)} assume !(0 == ~cond); {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,570 INFO L290 TraceCheckUtils]: 49: Hoare triple {11723#(<= ~counter~0 2)} assume true; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,570 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11723#(<= ~counter~0 2)} {11723#(<= ~counter~0 2)} #63#return; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,571 INFO L272 TraceCheckUtils]: 51: Hoare triple {11723#(<= ~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)); {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,571 INFO L290 TraceCheckUtils]: 52: Hoare triple {11723#(<= ~counter~0 2)} ~cond := #in~cond; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,571 INFO L290 TraceCheckUtils]: 53: Hoare triple {11723#(<= ~counter~0 2)} assume !(0 == ~cond); {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,571 INFO L290 TraceCheckUtils]: 54: Hoare triple {11723#(<= ~counter~0 2)} assume true; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,572 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11723#(<= ~counter~0 2)} {11723#(<= ~counter~0 2)} #65#return; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,572 INFO L272 TraceCheckUtils]: 56: Hoare triple {11723#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,573 INFO L290 TraceCheckUtils]: 57: Hoare triple {11723#(<= ~counter~0 2)} ~cond := #in~cond; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,573 INFO L290 TraceCheckUtils]: 58: Hoare triple {11723#(<= ~counter~0 2)} assume !(0 == ~cond); {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,573 INFO L290 TraceCheckUtils]: 59: Hoare triple {11723#(<= ~counter~0 2)} assume true; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,574 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11723#(<= ~counter~0 2)} {11723#(<= ~counter~0 2)} #67#return; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,574 INFO L290 TraceCheckUtils]: 61: Hoare triple {11723#(<= ~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; {11723#(<= ~counter~0 2)} is VALID [2022-04-08 11:13:09,574 INFO L290 TraceCheckUtils]: 62: Hoare triple {11723#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,575 INFO L290 TraceCheckUtils]: 63: Hoare triple {11808#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,575 INFO L272 TraceCheckUtils]: 64: Hoare triple {11808#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,575 INFO L290 TraceCheckUtils]: 65: Hoare triple {11808#(<= ~counter~0 3)} ~cond := #in~cond; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,576 INFO L290 TraceCheckUtils]: 66: Hoare triple {11808#(<= ~counter~0 3)} assume !(0 == ~cond); {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,576 INFO L290 TraceCheckUtils]: 67: Hoare triple {11808#(<= ~counter~0 3)} assume true; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,576 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11808#(<= ~counter~0 3)} {11808#(<= ~counter~0 3)} #59#return; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,577 INFO L272 TraceCheckUtils]: 69: Hoare triple {11808#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,577 INFO L290 TraceCheckUtils]: 70: Hoare triple {11808#(<= ~counter~0 3)} ~cond := #in~cond; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,577 INFO L290 TraceCheckUtils]: 71: Hoare triple {11808#(<= ~counter~0 3)} assume !(0 == ~cond); {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,577 INFO L290 TraceCheckUtils]: 72: Hoare triple {11808#(<= ~counter~0 3)} assume true; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,578 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11808#(<= ~counter~0 3)} {11808#(<= ~counter~0 3)} #61#return; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,578 INFO L272 TraceCheckUtils]: 74: Hoare triple {11808#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,579 INFO L290 TraceCheckUtils]: 75: Hoare triple {11808#(<= ~counter~0 3)} ~cond := #in~cond; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,579 INFO L290 TraceCheckUtils]: 76: Hoare triple {11808#(<= ~counter~0 3)} assume !(0 == ~cond); {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,579 INFO L290 TraceCheckUtils]: 77: Hoare triple {11808#(<= ~counter~0 3)} assume true; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,580 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {11808#(<= ~counter~0 3)} {11808#(<= ~counter~0 3)} #63#return; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,580 INFO L272 TraceCheckUtils]: 79: Hoare triple {11808#(<= ~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)); {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,580 INFO L290 TraceCheckUtils]: 80: Hoare triple {11808#(<= ~counter~0 3)} ~cond := #in~cond; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,581 INFO L290 TraceCheckUtils]: 81: Hoare triple {11808#(<= ~counter~0 3)} assume !(0 == ~cond); {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,581 INFO L290 TraceCheckUtils]: 82: Hoare triple {11808#(<= ~counter~0 3)} assume true; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,581 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {11808#(<= ~counter~0 3)} {11808#(<= ~counter~0 3)} #65#return; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,582 INFO L272 TraceCheckUtils]: 84: Hoare triple {11808#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,582 INFO L290 TraceCheckUtils]: 85: Hoare triple {11808#(<= ~counter~0 3)} ~cond := #in~cond; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,582 INFO L290 TraceCheckUtils]: 86: Hoare triple {11808#(<= ~counter~0 3)} assume !(0 == ~cond); {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,582 INFO L290 TraceCheckUtils]: 87: Hoare triple {11808#(<= ~counter~0 3)} assume true; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,583 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11808#(<= ~counter~0 3)} {11808#(<= ~counter~0 3)} #67#return; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,583 INFO L290 TraceCheckUtils]: 89: Hoare triple {11808#(<= ~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; {11808#(<= ~counter~0 3)} is VALID [2022-04-08 11:13:09,584 INFO L290 TraceCheckUtils]: 90: Hoare triple {11808#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,584 INFO L290 TraceCheckUtils]: 91: Hoare triple {11893#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,584 INFO L272 TraceCheckUtils]: 92: Hoare triple {11893#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,585 INFO L290 TraceCheckUtils]: 93: Hoare triple {11893#(<= ~counter~0 4)} ~cond := #in~cond; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,585 INFO L290 TraceCheckUtils]: 94: Hoare triple {11893#(<= ~counter~0 4)} assume !(0 == ~cond); {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,585 INFO L290 TraceCheckUtils]: 95: Hoare triple {11893#(<= ~counter~0 4)} assume true; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,586 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {11893#(<= ~counter~0 4)} {11893#(<= ~counter~0 4)} #59#return; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,586 INFO L272 TraceCheckUtils]: 97: Hoare triple {11893#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,586 INFO L290 TraceCheckUtils]: 98: Hoare triple {11893#(<= ~counter~0 4)} ~cond := #in~cond; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,587 INFO L290 TraceCheckUtils]: 99: Hoare triple {11893#(<= ~counter~0 4)} assume !(0 == ~cond); {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,587 INFO L290 TraceCheckUtils]: 100: Hoare triple {11893#(<= ~counter~0 4)} assume true; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,587 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11893#(<= ~counter~0 4)} {11893#(<= ~counter~0 4)} #61#return; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,588 INFO L272 TraceCheckUtils]: 102: Hoare triple {11893#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,588 INFO L290 TraceCheckUtils]: 103: Hoare triple {11893#(<= ~counter~0 4)} ~cond := #in~cond; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,588 INFO L290 TraceCheckUtils]: 104: Hoare triple {11893#(<= ~counter~0 4)} assume !(0 == ~cond); {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,588 INFO L290 TraceCheckUtils]: 105: Hoare triple {11893#(<= ~counter~0 4)} assume true; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,589 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {11893#(<= ~counter~0 4)} {11893#(<= ~counter~0 4)} #63#return; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,589 INFO L272 TraceCheckUtils]: 107: Hoare triple {11893#(<= ~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)); {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,590 INFO L290 TraceCheckUtils]: 108: Hoare triple {11893#(<= ~counter~0 4)} ~cond := #in~cond; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,590 INFO L290 TraceCheckUtils]: 109: Hoare triple {11893#(<= ~counter~0 4)} assume !(0 == ~cond); {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,590 INFO L290 TraceCheckUtils]: 110: Hoare triple {11893#(<= ~counter~0 4)} assume true; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,591 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {11893#(<= ~counter~0 4)} {11893#(<= ~counter~0 4)} #65#return; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,591 INFO L272 TraceCheckUtils]: 112: Hoare triple {11893#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,591 INFO L290 TraceCheckUtils]: 113: Hoare triple {11893#(<= ~counter~0 4)} ~cond := #in~cond; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,592 INFO L290 TraceCheckUtils]: 114: Hoare triple {11893#(<= ~counter~0 4)} assume !(0 == ~cond); {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,592 INFO L290 TraceCheckUtils]: 115: Hoare triple {11893#(<= ~counter~0 4)} assume true; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,592 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11893#(<= ~counter~0 4)} {11893#(<= ~counter~0 4)} #67#return; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,593 INFO L290 TraceCheckUtils]: 117: Hoare triple {11893#(<= ~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; {11893#(<= ~counter~0 4)} is VALID [2022-04-08 11:13:09,593 INFO L290 TraceCheckUtils]: 118: Hoare triple {11893#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11978#(<= |main_#t~post5| 4)} is VALID [2022-04-08 11:13:09,593 INFO L290 TraceCheckUtils]: 119: Hoare triple {11978#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {11615#false} is VALID [2022-04-08 11:13:09,593 INFO L272 TraceCheckUtils]: 120: Hoare triple {11615#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11615#false} is VALID [2022-04-08 11:13:09,593 INFO L290 TraceCheckUtils]: 121: Hoare triple {11615#false} ~cond := #in~cond; {11615#false} is VALID [2022-04-08 11:13:09,593 INFO L290 TraceCheckUtils]: 122: Hoare triple {11615#false} assume !(0 == ~cond); {11615#false} is VALID [2022-04-08 11:13:09,594 INFO L290 TraceCheckUtils]: 123: Hoare triple {11615#false} assume true; {11615#false} is VALID [2022-04-08 11:13:09,594 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {11615#false} {11615#false} #69#return; {11615#false} is VALID [2022-04-08 11:13:09,594 INFO L272 TraceCheckUtils]: 125: Hoare triple {11615#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {11615#false} is VALID [2022-04-08 11:13:09,594 INFO L290 TraceCheckUtils]: 126: Hoare triple {11615#false} ~cond := #in~cond; {11615#false} is VALID [2022-04-08 11:13:09,594 INFO L290 TraceCheckUtils]: 127: Hoare triple {11615#false} assume 0 == ~cond; {11615#false} is VALID [2022-04-08 11:13:09,594 INFO L290 TraceCheckUtils]: 128: Hoare triple {11615#false} assume !false; {11615#false} is VALID [2022-04-08 11:13:09,594 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-08 11:13:09,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:13:10,032 INFO L290 TraceCheckUtils]: 128: Hoare triple {11615#false} assume !false; {11615#false} is VALID [2022-04-08 11:13:10,032 INFO L290 TraceCheckUtils]: 127: Hoare triple {11615#false} assume 0 == ~cond; {11615#false} is VALID [2022-04-08 11:13:10,032 INFO L290 TraceCheckUtils]: 126: Hoare triple {11615#false} ~cond := #in~cond; {11615#false} is VALID [2022-04-08 11:13:10,033 INFO L272 TraceCheckUtils]: 125: Hoare triple {11615#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {11615#false} is VALID [2022-04-08 11:13:10,033 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {11614#true} {11615#false} #69#return; {11615#false} is VALID [2022-04-08 11:13:10,033 INFO L290 TraceCheckUtils]: 123: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,033 INFO L290 TraceCheckUtils]: 122: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,033 INFO L290 TraceCheckUtils]: 121: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,033 INFO L272 TraceCheckUtils]: 120: Hoare triple {11615#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,033 INFO L290 TraceCheckUtils]: 119: Hoare triple {12036#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {11615#false} is VALID [2022-04-08 11:13:10,034 INFO L290 TraceCheckUtils]: 118: Hoare triple {12040#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12036#(< |main_#t~post5| 10)} is VALID [2022-04-08 11:13:10,034 INFO L290 TraceCheckUtils]: 117: Hoare triple {12040#(< ~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; {12040#(< ~counter~0 10)} is VALID [2022-04-08 11:13:10,034 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11614#true} {12040#(< ~counter~0 10)} #67#return; {12040#(< ~counter~0 10)} is VALID [2022-04-08 11:13:10,034 INFO L290 TraceCheckUtils]: 115: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,034 INFO L290 TraceCheckUtils]: 114: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,034 INFO L290 TraceCheckUtils]: 113: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,035 INFO L272 TraceCheckUtils]: 112: Hoare triple {12040#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,035 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {11614#true} {12040#(< ~counter~0 10)} #65#return; {12040#(< ~counter~0 10)} is VALID [2022-04-08 11:13:10,035 INFO L290 TraceCheckUtils]: 110: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,035 INFO L290 TraceCheckUtils]: 109: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,035 INFO L290 TraceCheckUtils]: 108: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,035 INFO L272 TraceCheckUtils]: 107: Hoare triple {12040#(< ~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)); {11614#true} is VALID [2022-04-08 11:13:10,036 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {11614#true} {12040#(< ~counter~0 10)} #63#return; {12040#(< ~counter~0 10)} is VALID [2022-04-08 11:13:10,036 INFO L290 TraceCheckUtils]: 105: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,036 INFO L290 TraceCheckUtils]: 104: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,036 INFO L290 TraceCheckUtils]: 103: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,036 INFO L272 TraceCheckUtils]: 102: Hoare triple {12040#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,036 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11614#true} {12040#(< ~counter~0 10)} #61#return; {12040#(< ~counter~0 10)} is VALID [2022-04-08 11:13:10,037 INFO L290 TraceCheckUtils]: 100: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,037 INFO L290 TraceCheckUtils]: 99: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,037 INFO L290 TraceCheckUtils]: 98: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,037 INFO L272 TraceCheckUtils]: 97: Hoare triple {12040#(< ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,037 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {11614#true} {12040#(< ~counter~0 10)} #59#return; {12040#(< ~counter~0 10)} is VALID [2022-04-08 11:13:10,037 INFO L290 TraceCheckUtils]: 95: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,037 INFO L290 TraceCheckUtils]: 94: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,037 INFO L290 TraceCheckUtils]: 93: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,037 INFO L272 TraceCheckUtils]: 92: Hoare triple {12040#(< ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,038 INFO L290 TraceCheckUtils]: 91: Hoare triple {12040#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {12040#(< ~counter~0 10)} is VALID [2022-04-08 11:13:10,038 INFO L290 TraceCheckUtils]: 90: Hoare triple {12125#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12040#(< ~counter~0 10)} is VALID [2022-04-08 11:13:10,039 INFO L290 TraceCheckUtils]: 89: Hoare triple {12125#(< ~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; {12125#(< ~counter~0 9)} is VALID [2022-04-08 11:13:10,039 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11614#true} {12125#(< ~counter~0 9)} #67#return; {12125#(< ~counter~0 9)} is VALID [2022-04-08 11:13:10,039 INFO L290 TraceCheckUtils]: 87: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,039 INFO L290 TraceCheckUtils]: 86: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,039 INFO L290 TraceCheckUtils]: 85: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,039 INFO L272 TraceCheckUtils]: 84: Hoare triple {12125#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,040 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {11614#true} {12125#(< ~counter~0 9)} #65#return; {12125#(< ~counter~0 9)} is VALID [2022-04-08 11:13:10,040 INFO L290 TraceCheckUtils]: 82: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,040 INFO L290 TraceCheckUtils]: 81: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,040 INFO L290 TraceCheckUtils]: 80: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,040 INFO L272 TraceCheckUtils]: 79: Hoare triple {12125#(< ~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)); {11614#true} is VALID [2022-04-08 11:13:10,040 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {11614#true} {12125#(< ~counter~0 9)} #63#return; {12125#(< ~counter~0 9)} is VALID [2022-04-08 11:13:10,041 INFO L290 TraceCheckUtils]: 77: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,041 INFO L290 TraceCheckUtils]: 76: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,041 INFO L290 TraceCheckUtils]: 75: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,041 INFO L272 TraceCheckUtils]: 74: Hoare triple {12125#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,041 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11614#true} {12125#(< ~counter~0 9)} #61#return; {12125#(< ~counter~0 9)} is VALID [2022-04-08 11:13:10,041 INFO L290 TraceCheckUtils]: 72: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,041 INFO L290 TraceCheckUtils]: 71: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,041 INFO L290 TraceCheckUtils]: 70: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,041 INFO L272 TraceCheckUtils]: 69: Hoare triple {12125#(< ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,042 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11614#true} {12125#(< ~counter~0 9)} #59#return; {12125#(< ~counter~0 9)} is VALID [2022-04-08 11:13:10,042 INFO L290 TraceCheckUtils]: 67: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,042 INFO L290 TraceCheckUtils]: 66: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,042 INFO L290 TraceCheckUtils]: 65: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,042 INFO L272 TraceCheckUtils]: 64: Hoare triple {12125#(< ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,042 INFO L290 TraceCheckUtils]: 63: Hoare triple {12125#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {12125#(< ~counter~0 9)} is VALID [2022-04-08 11:13:10,043 INFO L290 TraceCheckUtils]: 62: Hoare triple {12210#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12125#(< ~counter~0 9)} is VALID [2022-04-08 11:13:10,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {12210#(< ~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; {12210#(< ~counter~0 8)} is VALID [2022-04-08 11:13:10,044 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11614#true} {12210#(< ~counter~0 8)} #67#return; {12210#(< ~counter~0 8)} is VALID [2022-04-08 11:13:10,044 INFO L290 TraceCheckUtils]: 59: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,044 INFO L290 TraceCheckUtils]: 58: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,044 INFO L290 TraceCheckUtils]: 57: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,044 INFO L272 TraceCheckUtils]: 56: Hoare triple {12210#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,044 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11614#true} {12210#(< ~counter~0 8)} #65#return; {12210#(< ~counter~0 8)} is VALID [2022-04-08 11:13:10,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,044 INFO L290 TraceCheckUtils]: 53: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,045 INFO L290 TraceCheckUtils]: 52: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,045 INFO L272 TraceCheckUtils]: 51: Hoare triple {12210#(< ~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)); {11614#true} is VALID [2022-04-08 11:13:10,045 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11614#true} {12210#(< ~counter~0 8)} #63#return; {12210#(< ~counter~0 8)} is VALID [2022-04-08 11:13:10,045 INFO L290 TraceCheckUtils]: 49: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,045 INFO L290 TraceCheckUtils]: 48: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,045 INFO L290 TraceCheckUtils]: 47: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,045 INFO L272 TraceCheckUtils]: 46: Hoare triple {12210#(< ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,046 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11614#true} {12210#(< ~counter~0 8)} #61#return; {12210#(< ~counter~0 8)} is VALID [2022-04-08 11:13:10,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,046 INFO L290 TraceCheckUtils]: 42: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,046 INFO L272 TraceCheckUtils]: 41: Hoare triple {12210#(< ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,046 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11614#true} {12210#(< ~counter~0 8)} #59#return; {12210#(< ~counter~0 8)} is VALID [2022-04-08 11:13:10,047 INFO L290 TraceCheckUtils]: 39: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,047 INFO L272 TraceCheckUtils]: 36: Hoare triple {12210#(< ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {12210#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {12210#(< ~counter~0 8)} is VALID [2022-04-08 11:13:10,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {12295#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12210#(< ~counter~0 8)} is VALID [2022-04-08 11:13:10,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {12295#(< ~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; {12295#(< ~counter~0 7)} is VALID [2022-04-08 11:13:10,048 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11614#true} {12295#(< ~counter~0 7)} #67#return; {12295#(< ~counter~0 7)} is VALID [2022-04-08 11:13:10,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,048 INFO L272 TraceCheckUtils]: 28: Hoare triple {12295#(< ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,049 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11614#true} {12295#(< ~counter~0 7)} #65#return; {12295#(< ~counter~0 7)} is VALID [2022-04-08 11:13:10,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,049 INFO L272 TraceCheckUtils]: 23: Hoare triple {12295#(< ~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)); {11614#true} is VALID [2022-04-08 11:13:10,050 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11614#true} {12295#(< ~counter~0 7)} #63#return; {12295#(< ~counter~0 7)} is VALID [2022-04-08 11:13:10,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,050 INFO L272 TraceCheckUtils]: 18: Hoare triple {12295#(< ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,050 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11614#true} {12295#(< ~counter~0 7)} #61#return; {12295#(< ~counter~0 7)} is VALID [2022-04-08 11:13:10,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,051 INFO L272 TraceCheckUtils]: 13: Hoare triple {12295#(< ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,051 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11614#true} {12295#(< ~counter~0 7)} #59#return; {12295#(< ~counter~0 7)} is VALID [2022-04-08 11:13:10,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {11614#true} assume true; {11614#true} is VALID [2022-04-08 11:13:10,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {11614#true} assume !(0 == ~cond); {11614#true} is VALID [2022-04-08 11:13:10,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {11614#true} ~cond := #in~cond; {11614#true} is VALID [2022-04-08 11:13:10,051 INFO L272 TraceCheckUtils]: 8: Hoare triple {12295#(< ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11614#true} is VALID [2022-04-08 11:13:10,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {12295#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {12295#(< ~counter~0 7)} is VALID [2022-04-08 11:13:10,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {12380#(< ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12295#(< ~counter~0 7)} is VALID [2022-04-08 11:13:10,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {12380#(< ~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; {12380#(< ~counter~0 6)} is VALID [2022-04-08 11:13:10,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {12380#(< ~counter~0 6)} call #t~ret6 := main(); {12380#(< ~counter~0 6)} is VALID [2022-04-08 11:13:10,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12380#(< ~counter~0 6)} {11614#true} #81#return; {12380#(< ~counter~0 6)} is VALID [2022-04-08 11:13:10,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {12380#(< ~counter~0 6)} assume true; {12380#(< ~counter~0 6)} is VALID [2022-04-08 11:13:10,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {11614#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; {12380#(< ~counter~0 6)} is VALID [2022-04-08 11:13:10,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {11614#true} call ULTIMATE.init(); {11614#true} is VALID [2022-04-08 11:13:10,054 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-08 11:13:10,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:13:10,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673476805] [2022-04-08 11:13:10,054 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:13:10,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945803553] [2022-04-08 11:13:10,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945803553] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:13:10,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:13:10,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 11:13:10,055 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:13:10,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1534272642] [2022-04-08 11:13:10,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1534272642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:13:10,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:13:10,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:13:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874629936] [2022-04-08 11:13:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:13:10,056 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-08 11:13:10,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:13:10,056 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-08 11:13:10,115 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-08 11:13:10,115 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 11:13:10,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:13:10,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 11:13:10,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 11:13:10,116 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-08 11:13:10,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:13:10,843 INFO L93 Difference]: Finished difference Result 152 states and 171 transitions. [2022-04-08 11:13:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 11:13:10,844 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-08 11:13:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:13:10,844 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-08 11:13:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2022-04-08 11:13:10,846 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-08 11:13:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2022-04-08 11:13:10,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 122 transitions. [2022-04-08 11:13:10,905 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-08 11:13:10,907 INFO L225 Difference]: With dead ends: 152 [2022-04-08 11:13:10,907 INFO L226 Difference]: Without dead ends: 138 [2022-04-08 11:13:10,907 INFO L912 BasicCegarLoop]: 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-08 11:13:10,907 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 16 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:13:10,908 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 175 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:13:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-08 11:13:11,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-04-08 11:13:11,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:13:11,066 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-08 11:13:11,066 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-08 11:13:11,066 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-08 11:13:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:13:11,068 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2022-04-08 11:13:11,069 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2022-04-08 11:13:11,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:13:11,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:13:11,069 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-08 11:13:11,069 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-08 11:13:11,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:13:11,071 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2022-04-08 11:13:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2022-04-08 11:13:11,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:13:11,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:13:11,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:13:11,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:13:11,072 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-08 11:13:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2022-04-08 11:13:11,074 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 129 [2022-04-08 11:13:11,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:13:11,074 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2022-04-08 11:13:11,075 INFO L479 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-08 11:13:11,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 154 transitions. [2022-04-08 11:13:17,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 153 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:13:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2022-04-08 11:13:17,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-08 11:13:17,533 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:13:17,533 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:13:17,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-08 11:13:17,734 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:13:17,734 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:13:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:13:17,734 INFO L85 PathProgramCache]: Analyzing trace with hash 173938976, now seen corresponding path program 3 times [2022-04-08 11:13:17,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:13:17,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [367662351] [2022-04-08 11:13:17,947 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:13:17,948 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:13:17,948 INFO L85 PathProgramCache]: Analyzing trace with hash 173938976, now seen corresponding path program 4 times [2022-04-08 11:13:17,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:13:17,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421939827] [2022-04-08 11:13:17,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:13:17,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:13:17,956 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:13:17,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171026292] [2022-04-08 11:13:17,956 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:13:17,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:13:17,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:13:17,957 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-08 11:13:17,960 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-08 11:13:19,238 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:13:19,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:13:19,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-08 11:13:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:13:19,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:13:57,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {13261#true} call ULTIMATE.init(); {13261#true} is VALID [2022-04-08 11:13:57,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {13261#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; {13261#true} is VALID [2022-04-08 11:13:57,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:13:57,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13261#true} {13261#true} #81#return; {13261#true} is VALID [2022-04-08 11:13:57,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {13261#true} call #t~ret6 := main(); {13261#true} is VALID [2022-04-08 11:13:57,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {13261#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; {13261#true} is VALID [2022-04-08 11:13:57,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {13261#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13261#true} is VALID [2022-04-08 11:13:57,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {13261#true} assume !!(#t~post5 < 10);havoc #t~post5; {13261#true} is VALID [2022-04-08 11:13:57,311 INFO L272 TraceCheckUtils]: 8: Hoare triple {13261#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13261#true} is VALID [2022-04-08 11:13:57,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:13:57,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:13:57,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:13:57,312 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13261#true} {13261#true} #59#return; {13261#true} is VALID [2022-04-08 11:13:57,312 INFO L272 TraceCheckUtils]: 13: Hoare triple {13261#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13261#true} is VALID [2022-04-08 11:13:57,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {13261#true} ~cond := #in~cond; {13308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:13:57,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {13308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:13:57,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:13:57,313 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} {13261#true} #61#return; {13319#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-08 11:13:57,313 INFO L272 TraceCheckUtils]: 18: Hoare triple {13319#(= (+ (* 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)); {13261#true} is VALID [2022-04-08 11:13:57,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {13261#true} ~cond := #in~cond; {13308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:13:57,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {13308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:13:57,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:13:57,315 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} {13319#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {13335#(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-08 11:13:57,315 INFO L272 TraceCheckUtils]: 23: Hoare triple {13335#(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)); {13261#true} is VALID [2022-04-08 11:13:57,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:13:57,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:13:57,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:13:57,315 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13261#true} {13335#(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; {13335#(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-08 11:13:57,315 INFO L272 TraceCheckUtils]: 28: Hoare triple {13335#(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)); {13261#true} is VALID [2022-04-08 11:13:57,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:13:57,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:13:57,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:13:57,316 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13261#true} {13335#(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; {13335#(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-08 11:13:57,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {13335#(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; {13369#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} is VALID [2022-04-08 11:13:57,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {13369#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13369#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} is VALID [2022-04-08 11:13:57,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {13369#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {13369#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} is VALID [2022-04-08 11:13:57,322 INFO L272 TraceCheckUtils]: 36: Hoare triple {13369#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13261#true} is VALID [2022-04-08 11:13:57,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:13:57,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:13:57,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:13:57,323 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13261#true} {13369#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} #59#return; {13369#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} is VALID [2022-04-08 11:13:57,323 INFO L272 TraceCheckUtils]: 41: Hoare triple {13369#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13261#true} is VALID [2022-04-08 11:13:57,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {13261#true} ~cond := #in~cond; {13308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:13:57,324 INFO L290 TraceCheckUtils]: 43: Hoare triple {13308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:13:57,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:13:57,325 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} {13369#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} #61#return; {13406#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-08 11:13:57,325 INFO L272 TraceCheckUtils]: 46: Hoare triple {13406#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~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)); {13261#true} is VALID [2022-04-08 11:13:57,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {13261#true} ~cond := #in~cond; {13308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:13:57,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {13308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:13:57,326 INFO L290 TraceCheckUtils]: 49: Hoare triple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:13:57,326 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} {13406#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #63#return; {13422#(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-08 11:13:57,326 INFO L272 TraceCheckUtils]: 51: Hoare triple {13422#(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)); {13261#true} is VALID [2022-04-08 11:13:57,326 INFO L290 TraceCheckUtils]: 52: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:13:57,327 INFO L290 TraceCheckUtils]: 53: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:13:57,327 INFO L290 TraceCheckUtils]: 54: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:13:57,327 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13261#true} {13422#(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; {13422#(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-08 11:13:57,327 INFO L272 TraceCheckUtils]: 56: Hoare triple {13422#(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)); {13261#true} is VALID [2022-04-08 11:13:57,327 INFO L290 TraceCheckUtils]: 57: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:13:57,327 INFO L290 TraceCheckUtils]: 58: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:13:57,327 INFO L290 TraceCheckUtils]: 59: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:13:57,328 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13261#true} {13422#(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; {13422#(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-08 11:13:57,332 INFO L290 TraceCheckUtils]: 61: Hoare triple {13422#(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; {13422#(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-08 11:13:57,332 INFO L290 TraceCheckUtils]: 62: Hoare triple {13422#(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; {13422#(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-08 11:13:57,333 INFO L290 TraceCheckUtils]: 63: Hoare triple {13422#(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; {13422#(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-08 11:13:57,333 INFO L272 TraceCheckUtils]: 64: Hoare triple {13422#(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)); {13261#true} is VALID [2022-04-08 11:13:57,333 INFO L290 TraceCheckUtils]: 65: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:13:57,333 INFO L290 TraceCheckUtils]: 66: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:13:57,333 INFO L290 TraceCheckUtils]: 67: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:13:57,334 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13261#true} {13422#(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; {13422#(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-08 11:13:57,334 INFO L272 TraceCheckUtils]: 69: Hoare triple {13422#(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)); {13261#true} is VALID [2022-04-08 11:13:57,334 INFO L290 TraceCheckUtils]: 70: Hoare triple {13261#true} ~cond := #in~cond; {13308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:13:57,334 INFO L290 TraceCheckUtils]: 71: Hoare triple {13308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:13:57,334 INFO L290 TraceCheckUtils]: 72: Hoare triple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:13:57,335 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} {13422#(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; {13422#(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-08 11:13:57,335 INFO L272 TraceCheckUtils]: 74: Hoare triple {13422#(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)); {13261#true} is VALID [2022-04-08 11:13:57,335 INFO L290 TraceCheckUtils]: 75: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:13:57,335 INFO L290 TraceCheckUtils]: 76: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:13:57,335 INFO L290 TraceCheckUtils]: 77: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:13:57,336 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {13261#true} {13422#(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; {13422#(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-08 11:13:57,336 INFO L272 TraceCheckUtils]: 79: Hoare triple {13422#(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)); {13261#true} is VALID [2022-04-08 11:13:57,336 INFO L290 TraceCheckUtils]: 80: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:13:57,336 INFO L290 TraceCheckUtils]: 81: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:13:57,336 INFO L290 TraceCheckUtils]: 82: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:13:57,336 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {13261#true} {13422#(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; {13422#(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-08 11:13:57,336 INFO L272 TraceCheckUtils]: 84: Hoare triple {13422#(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)); {13261#true} is VALID [2022-04-08 11:13:57,337 INFO L290 TraceCheckUtils]: 85: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:13:57,337 INFO L290 TraceCheckUtils]: 86: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:13:57,337 INFO L290 TraceCheckUtils]: 87: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:13:57,337 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13261#true} {13422#(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; {13422#(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-08 11:13:57,341 INFO L290 TraceCheckUtils]: 89: Hoare triple {13422#(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; {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-08 11:13:57,341 INFO L290 TraceCheckUtils]: 90: Hoare triple {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-08 11:13:57,342 INFO L290 TraceCheckUtils]: 91: Hoare triple {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} assume !!(#t~post5 < 10);havoc #t~post5; {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-08 11:13:57,342 INFO L272 TraceCheckUtils]: 92: Hoare triple {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13261#true} is VALID [2022-04-08 11:13:57,342 INFO L290 TraceCheckUtils]: 93: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:13:57,342 INFO L290 TraceCheckUtils]: 94: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:13:57,342 INFO L290 TraceCheckUtils]: 95: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:13:57,343 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13261#true} {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} #59#return; {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-08 11:13:57,343 INFO L272 TraceCheckUtils]: 97: Hoare triple {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13261#true} is VALID [2022-04-08 11:13:57,343 INFO L290 TraceCheckUtils]: 98: Hoare triple {13261#true} ~cond := #in~cond; {13308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:13:57,343 INFO L290 TraceCheckUtils]: 99: Hoare triple {13308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:13:57,344 INFO L290 TraceCheckUtils]: 100: Hoare triple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:13:57,344 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} #61#return; {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-08 11:13:57,344 INFO L272 TraceCheckUtils]: 102: Hoare triple {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13261#true} is VALID [2022-04-08 11:13:57,344 INFO L290 TraceCheckUtils]: 103: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:13:57,344 INFO L290 TraceCheckUtils]: 104: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:13:57,344 INFO L290 TraceCheckUtils]: 105: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:13:57,345 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {13261#true} {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} #63#return; {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-08 11:13:57,345 INFO L272 TraceCheckUtils]: 107: Hoare triple {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~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)); {13261#true} is VALID [2022-04-08 11:13:57,345 INFO L290 TraceCheckUtils]: 108: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:13:57,345 INFO L290 TraceCheckUtils]: 109: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:13:57,345 INFO L290 TraceCheckUtils]: 110: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:13:57,346 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {13261#true} {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} #65#return; {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-08 11:13:57,346 INFO L272 TraceCheckUtils]: 112: Hoare triple {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13261#true} is VALID [2022-04-08 11:13:57,346 INFO L290 TraceCheckUtils]: 113: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:13:57,346 INFO L290 TraceCheckUtils]: 114: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:13:57,346 INFO L290 TraceCheckUtils]: 115: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:13:57,346 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13261#true} {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} #67#return; {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-08 11:13:57,347 INFO L290 TraceCheckUtils]: 117: Hoare triple {13540#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} assume !(~n~0 <= ~a~0); {13625#(and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-08 11:13:57,347 INFO L272 TraceCheckUtils]: 118: Hoare triple {13625#(and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13261#true} is VALID [2022-04-08 11:13:57,347 INFO L290 TraceCheckUtils]: 119: Hoare triple {13261#true} ~cond := #in~cond; {13308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:13:57,348 INFO L290 TraceCheckUtils]: 120: Hoare triple {13308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:13:57,348 INFO L290 TraceCheckUtils]: 121: Hoare triple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:13:57,685 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} {13625#(and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} #69#return; {13641#(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-08 11:13:57,686 INFO L272 TraceCheckUtils]: 123: Hoare triple {13641#(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)); {13261#true} is VALID [2022-04-08 11:13:57,686 INFO L290 TraceCheckUtils]: 124: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:13:57,686 INFO L290 TraceCheckUtils]: 125: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:13:57,686 INFO L290 TraceCheckUtils]: 126: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:13:57,686 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {13261#true} {13641#(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; {13641#(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-08 11:13:59,688 WARN L272 TraceCheckUtils]: 128: Hoare triple {13641#(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)); {13660#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-08 11:13:59,689 INFO L290 TraceCheckUtils]: 129: Hoare triple {13660#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13664#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:13:59,689 INFO L290 TraceCheckUtils]: 130: Hoare triple {13664#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13262#false} is VALID [2022-04-08 11:13:59,689 INFO L290 TraceCheckUtils]: 131: Hoare triple {13262#false} assume !false; {13262#false} is VALID [2022-04-08 11:13:59,690 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-08 11:13:59,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:14:05,755 INFO L290 TraceCheckUtils]: 131: Hoare triple {13262#false} assume !false; {13262#false} is VALID [2022-04-08 11:14:05,756 INFO L290 TraceCheckUtils]: 130: Hoare triple {13664#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13262#false} is VALID [2022-04-08 11:14:05,756 INFO L290 TraceCheckUtils]: 129: Hoare triple {13660#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13664#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:14:05,757 INFO L272 TraceCheckUtils]: 128: Hoare triple {13680#(= (+ (* 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)); {13660#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:14:05,757 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {13261#true} {13680#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #71#return; {13680#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-08 11:14:05,757 INFO L290 TraceCheckUtils]: 126: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,757 INFO L290 TraceCheckUtils]: 125: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,758 INFO L290 TraceCheckUtils]: 124: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,758 INFO L272 TraceCheckUtils]: 123: Hoare triple {13680#(= (+ (* 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)); {13261#true} is VALID [2022-04-08 11:14:05,758 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} {13699#(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; {13680#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-08 11:14:05,759 INFO L290 TraceCheckUtils]: 121: Hoare triple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:05,759 INFO L290 TraceCheckUtils]: 120: Hoare triple {13709#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:05,759 INFO L290 TraceCheckUtils]: 119: Hoare triple {13261#true} ~cond := #in~cond; {13709#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:14:05,759 INFO L272 TraceCheckUtils]: 118: Hoare triple {13699#(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)); {13261#true} is VALID [2022-04-08 11:14:05,760 INFO L290 TraceCheckUtils]: 117: Hoare triple {13716#(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); {13699#(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-08 11:14:05,760 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13261#true} {13716#(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; {13716#(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-08 11:14:05,760 INFO L290 TraceCheckUtils]: 115: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,760 INFO L290 TraceCheckUtils]: 114: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,760 INFO L290 TraceCheckUtils]: 113: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,760 INFO L272 TraceCheckUtils]: 112: Hoare triple {13716#(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)); {13261#true} is VALID [2022-04-08 11:14:05,761 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {13261#true} {13716#(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; {13716#(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-08 11:14:05,761 INFO L290 TraceCheckUtils]: 110: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,761 INFO L290 TraceCheckUtils]: 109: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,761 INFO L290 TraceCheckUtils]: 108: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,761 INFO L272 TraceCheckUtils]: 107: Hoare triple {13716#(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)); {13261#true} is VALID [2022-04-08 11:14:05,762 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {13261#true} {13716#(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; {13716#(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-08 11:14:05,762 INFO L290 TraceCheckUtils]: 105: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,762 INFO L290 TraceCheckUtils]: 104: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,762 INFO L290 TraceCheckUtils]: 103: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,762 INFO L272 TraceCheckUtils]: 102: Hoare triple {13716#(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)); {13261#true} is VALID [2022-04-08 11:14:05,763 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} {13765#(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; {13716#(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-08 11:14:05,763 INFO L290 TraceCheckUtils]: 100: Hoare triple {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:05,763 INFO L290 TraceCheckUtils]: 99: Hoare triple {13709#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:05,764 INFO L290 TraceCheckUtils]: 98: Hoare triple {13261#true} ~cond := #in~cond; {13709#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:14:05,764 INFO L272 TraceCheckUtils]: 97: Hoare triple {13765#(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)); {13261#true} is VALID [2022-04-08 11:14:05,764 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13261#true} {13765#(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; {13765#(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-08 11:14:05,764 INFO L290 TraceCheckUtils]: 95: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,764 INFO L290 TraceCheckUtils]: 94: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,764 INFO L290 TraceCheckUtils]: 93: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,764 INFO L272 TraceCheckUtils]: 92: Hoare triple {13765#(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)); {13261#true} is VALID [2022-04-08 11:14:05,765 INFO L290 TraceCheckUtils]: 91: Hoare triple {13765#(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; {13765#(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-08 11:14:05,765 INFO L290 TraceCheckUtils]: 90: Hoare triple {13765#(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; {13765#(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-08 11:14:05,768 INFO L290 TraceCheckUtils]: 89: Hoare triple {13261#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; {13765#(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-08 11:14:05,768 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13261#true} {13261#true} #67#return; {13261#true} is VALID [2022-04-08 11:14:05,768 INFO L290 TraceCheckUtils]: 87: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,768 INFO L290 TraceCheckUtils]: 86: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,768 INFO L290 TraceCheckUtils]: 85: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,768 INFO L272 TraceCheckUtils]: 84: Hoare triple {13261#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13261#true} is VALID [2022-04-08 11:14:05,768 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {13261#true} {13261#true} #65#return; {13261#true} is VALID [2022-04-08 11:14:05,768 INFO L290 TraceCheckUtils]: 82: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,768 INFO L290 TraceCheckUtils]: 81: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,768 INFO L290 TraceCheckUtils]: 80: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,768 INFO L272 TraceCheckUtils]: 79: Hoare triple {13261#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13261#true} is VALID [2022-04-08 11:14:05,769 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {13261#true} {13261#true} #63#return; {13261#true} is VALID [2022-04-08 11:14:05,769 INFO L290 TraceCheckUtils]: 77: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,769 INFO L290 TraceCheckUtils]: 76: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,769 INFO L290 TraceCheckUtils]: 75: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,769 INFO L272 TraceCheckUtils]: 74: Hoare triple {13261#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13261#true} is VALID [2022-04-08 11:14:05,769 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13261#true} {13261#true} #61#return; {13261#true} is VALID [2022-04-08 11:14:05,769 INFO L290 TraceCheckUtils]: 72: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,769 INFO L290 TraceCheckUtils]: 71: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,769 INFO L290 TraceCheckUtils]: 70: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,769 INFO L272 TraceCheckUtils]: 69: Hoare triple {13261#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13261#true} is VALID [2022-04-08 11:14:05,769 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13261#true} {13261#true} #59#return; {13261#true} is VALID [2022-04-08 11:14:05,769 INFO L290 TraceCheckUtils]: 67: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,769 INFO L290 TraceCheckUtils]: 66: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,769 INFO L290 TraceCheckUtils]: 65: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,769 INFO L272 TraceCheckUtils]: 64: Hoare triple {13261#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13261#true} is VALID [2022-04-08 11:14:05,770 INFO L290 TraceCheckUtils]: 63: Hoare triple {13261#true} assume !!(#t~post5 < 10);havoc #t~post5; {13261#true} is VALID [2022-04-08 11:14:05,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {13261#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13261#true} is VALID [2022-04-08 11:14:05,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {13261#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; {13261#true} is VALID [2022-04-08 11:14:05,770 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13261#true} {13261#true} #67#return; {13261#true} is VALID [2022-04-08 11:14:05,770 INFO L290 TraceCheckUtils]: 59: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,770 INFO L290 TraceCheckUtils]: 57: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,770 INFO L272 TraceCheckUtils]: 56: Hoare triple {13261#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13261#true} is VALID [2022-04-08 11:14:05,770 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13261#true} {13261#true} #65#return; {13261#true} is VALID [2022-04-08 11:14:05,770 INFO L290 TraceCheckUtils]: 54: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,770 INFO L290 TraceCheckUtils]: 53: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,770 INFO L290 TraceCheckUtils]: 52: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,770 INFO L272 TraceCheckUtils]: 51: Hoare triple {13261#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13261#true} is VALID [2022-04-08 11:14:05,770 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13261#true} {13261#true} #63#return; {13261#true} is VALID [2022-04-08 11:14:05,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,771 INFO L290 TraceCheckUtils]: 47: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,771 INFO L272 TraceCheckUtils]: 46: Hoare triple {13261#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13261#true} is VALID [2022-04-08 11:14:05,771 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13261#true} {13261#true} #61#return; {13261#true} is VALID [2022-04-08 11:14:05,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,771 INFO L272 TraceCheckUtils]: 41: Hoare triple {13261#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13261#true} is VALID [2022-04-08 11:14:05,771 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13261#true} {13261#true} #59#return; {13261#true} is VALID [2022-04-08 11:14:05,771 INFO L290 TraceCheckUtils]: 39: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,771 INFO L272 TraceCheckUtils]: 36: Hoare triple {13261#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13261#true} is VALID [2022-04-08 11:14:05,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {13261#true} assume !!(#t~post5 < 10);havoc #t~post5; {13261#true} is VALID [2022-04-08 11:14:05,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {13261#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13261#true} is VALID [2022-04-08 11:14:05,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {13261#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; {13261#true} is VALID [2022-04-08 11:14:05,772 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13261#true} {13261#true} #67#return; {13261#true} is VALID [2022-04-08 11:14:05,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,772 INFO L272 TraceCheckUtils]: 28: Hoare triple {13261#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13261#true} is VALID [2022-04-08 11:14:05,772 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13261#true} {13261#true} #65#return; {13261#true} is VALID [2022-04-08 11:14:05,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,772 INFO L272 TraceCheckUtils]: 23: Hoare triple {13261#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13261#true} is VALID [2022-04-08 11:14:05,772 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13261#true} {13261#true} #63#return; {13261#true} is VALID [2022-04-08 11:14:05,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,773 INFO L272 TraceCheckUtils]: 18: Hoare triple {13261#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13261#true} is VALID [2022-04-08 11:14:05,773 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13261#true} {13261#true} #61#return; {13261#true} is VALID [2022-04-08 11:14:05,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,773 INFO L272 TraceCheckUtils]: 13: Hoare triple {13261#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13261#true} is VALID [2022-04-08 11:14:05,773 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13261#true} {13261#true} #59#return; {13261#true} is VALID [2022-04-08 11:14:05,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {13261#true} assume !(0 == ~cond); {13261#true} is VALID [2022-04-08 11:14:05,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {13261#true} ~cond := #in~cond; {13261#true} is VALID [2022-04-08 11:14:05,773 INFO L272 TraceCheckUtils]: 8: Hoare triple {13261#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13261#true} is VALID [2022-04-08 11:14:05,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {13261#true} assume !!(#t~post5 < 10);havoc #t~post5; {13261#true} is VALID [2022-04-08 11:14:05,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {13261#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13261#true} is VALID [2022-04-08 11:14:05,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {13261#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; {13261#true} is VALID [2022-04-08 11:14:05,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {13261#true} call #t~ret6 := main(); {13261#true} is VALID [2022-04-08 11:14:05,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13261#true} {13261#true} #81#return; {13261#true} is VALID [2022-04-08 11:14:05,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {13261#true} assume true; {13261#true} is VALID [2022-04-08 11:14:05,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {13261#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; {13261#true} is VALID [2022-04-08 11:14:05,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {13261#true} call ULTIMATE.init(); {13261#true} is VALID [2022-04-08 11:14:05,774 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-08 11:14:05,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:14:05,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421939827] [2022-04-08 11:14:05,775 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:14:05,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171026292] [2022-04-08 11:14:05,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171026292] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:14:05,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:14:05,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2022-04-08 11:14:05,775 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:14:05,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [367662351] [2022-04-08 11:14:05,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [367662351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:14:05,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:14:05,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 11:14:05,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398322435] [2022-04-08 11:14:05,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:14:05,776 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-08 11:14:05,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:14:05,776 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-08 11:14:07,053 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-08 11:14:07,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 11:14:07,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:14:07,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 11:14:07,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-04-08 11:14:07,054 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-08 11:14:10,404 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-08 11:14:12,102 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:14:17,928 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:14:27,757 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-08 11:14:29,988 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-08 11:14:34,203 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-08 11:14:36,223 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-08 11:14:38,765 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-08 11:14:40,766 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-08 11:14:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:40,774 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2022-04-08 11:14:40,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 11:14:40,774 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-08 11:14:40,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:14:40,774 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-08 11:14:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-08 11:14:40,775 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-08 11:14:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-08 11:14:40,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2022-04-08 11:14:42,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 60 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:14:42,932 INFO L225 Difference]: With dead ends: 146 [2022-04-08 11:14:42,932 INFO L226 Difference]: Without dead ends: 117 [2022-04-08 11:14:42,932 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 245 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-04-08 11:14:42,933 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 65 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:14:42,933 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 99 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 22.4s Time] [2022-04-08 11:14:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-08 11:14:43,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-04-08 11:14:43,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:14:43,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 117 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 30 states have call successors, (30), 18 states have call predecessors, (30), 17 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 11:14:43,079 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 117 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 30 states have call successors, (30), 18 states have call predecessors, (30), 17 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 11:14:43,079 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 117 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 30 states have call successors, (30), 18 states have call predecessors, (30), 17 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 11:14:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:43,081 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2022-04-08 11:14:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2022-04-08 11:14:43,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:14:43,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:14:43,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 30 states have call successors, (30), 18 states have call predecessors, (30), 17 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 117 states. [2022-04-08 11:14:43,082 INFO L87 Difference]: Start difference. First operand has 117 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 30 states have call successors, (30), 18 states have call predecessors, (30), 17 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 117 states. [2022-04-08 11:14:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:43,083 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2022-04-08 11:14:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2022-04-08 11:14:43,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:14:43,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:14:43,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:14:43,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:14:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 30 states have call successors, (30), 18 states have call predecessors, (30), 17 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 11:14:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2022-04-08 11:14:43,086 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 132 [2022-04-08 11:14:43,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:14:43,086 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2022-04-08 11:14:43,086 INFO L479 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-08 11:14:43,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 129 transitions. [2022-04-08 11:14:46,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 128 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:14:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2022-04-08 11:14:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-08 11:14:46,345 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:14:46,345 INFO L499 BasicCegarLoop]: 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-08 11:14:46,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-08 11:14:46,545 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 11:14:46,546 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:14:46,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:14:46,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2040587668, now seen corresponding path program 9 times [2022-04-08 11:14:46,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:14:46,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [918608053] [2022-04-08 11:14:46,767 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:14:46,767 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:14:46,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2040587668, now seen corresponding path program 10 times [2022-04-08 11:14:46,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:14:46,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991940207] [2022-04-08 11:14:46,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:14:46,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:14:46,777 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:14:46,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1539237965] [2022-04-08 11:14:46,777 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:14:46,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:14:46,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:14:46,780 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-08 11:14:46,781 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-08 11:14:46,863 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:14:46,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:14:46,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 11:14:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:14:46,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:14:47,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {14843#true} call ULTIMATE.init(); {14843#true} is VALID [2022-04-08 11:14:47,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {14843#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; {14851#(<= ~counter~0 0)} is VALID [2022-04-08 11:14:47,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {14851#(<= ~counter~0 0)} assume true; {14851#(<= ~counter~0 0)} is VALID [2022-04-08 11:14:47,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14851#(<= ~counter~0 0)} {14843#true} #81#return; {14851#(<= ~counter~0 0)} is VALID [2022-04-08 11:14:47,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {14851#(<= ~counter~0 0)} call #t~ret6 := main(); {14851#(<= ~counter~0 0)} is VALID [2022-04-08 11:14:47,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {14851#(<= ~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; {14851#(<= ~counter~0 0)} is VALID [2022-04-08 11:14:47,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {14851#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {14867#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,373 INFO L272 TraceCheckUtils]: 8: Hoare triple {14867#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {14867#(<= ~counter~0 1)} ~cond := #in~cond; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {14867#(<= ~counter~0 1)} assume !(0 == ~cond); {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {14867#(<= ~counter~0 1)} assume true; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,374 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {14867#(<= ~counter~0 1)} {14867#(<= ~counter~0 1)} #59#return; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,374 INFO L272 TraceCheckUtils]: 13: Hoare triple {14867#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {14867#(<= ~counter~0 1)} ~cond := #in~cond; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {14867#(<= ~counter~0 1)} assume !(0 == ~cond); {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {14867#(<= ~counter~0 1)} assume true; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,375 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14867#(<= ~counter~0 1)} {14867#(<= ~counter~0 1)} #61#return; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,376 INFO L272 TraceCheckUtils]: 18: Hoare triple {14867#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {14867#(<= ~counter~0 1)} ~cond := #in~cond; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {14867#(<= ~counter~0 1)} assume !(0 == ~cond); {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {14867#(<= ~counter~0 1)} assume true; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,377 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14867#(<= ~counter~0 1)} {14867#(<= ~counter~0 1)} #63#return; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,377 INFO L272 TraceCheckUtils]: 23: Hoare triple {14867#(<= ~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)); {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {14867#(<= ~counter~0 1)} ~cond := #in~cond; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {14867#(<= ~counter~0 1)} assume !(0 == ~cond); {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {14867#(<= ~counter~0 1)} assume true; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,378 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14867#(<= ~counter~0 1)} {14867#(<= ~counter~0 1)} #65#return; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,379 INFO L272 TraceCheckUtils]: 28: Hoare triple {14867#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {14867#(<= ~counter~0 1)} ~cond := #in~cond; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {14867#(<= ~counter~0 1)} assume !(0 == ~cond); {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {14867#(<= ~counter~0 1)} assume true; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,380 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14867#(<= ~counter~0 1)} {14867#(<= ~counter~0 1)} #67#return; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {14867#(<= ~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; {14867#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:47,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {14867#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {14952#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,381 INFO L272 TraceCheckUtils]: 36: Hoare triple {14952#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,382 INFO L290 TraceCheckUtils]: 37: Hoare triple {14952#(<= ~counter~0 2)} ~cond := #in~cond; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,382 INFO L290 TraceCheckUtils]: 38: Hoare triple {14952#(<= ~counter~0 2)} assume !(0 == ~cond); {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {14952#(<= ~counter~0 2)} assume true; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,383 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {14952#(<= ~counter~0 2)} {14952#(<= ~counter~0 2)} #59#return; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,383 INFO L272 TraceCheckUtils]: 41: Hoare triple {14952#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,383 INFO L290 TraceCheckUtils]: 42: Hoare triple {14952#(<= ~counter~0 2)} ~cond := #in~cond; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,383 INFO L290 TraceCheckUtils]: 43: Hoare triple {14952#(<= ~counter~0 2)} assume !(0 == ~cond); {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,384 INFO L290 TraceCheckUtils]: 44: Hoare triple {14952#(<= ~counter~0 2)} assume true; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,384 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14952#(<= ~counter~0 2)} {14952#(<= ~counter~0 2)} #61#return; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,384 INFO L272 TraceCheckUtils]: 46: Hoare triple {14952#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,385 INFO L290 TraceCheckUtils]: 47: Hoare triple {14952#(<= ~counter~0 2)} ~cond := #in~cond; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,385 INFO L290 TraceCheckUtils]: 48: Hoare triple {14952#(<= ~counter~0 2)} assume !(0 == ~cond); {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,385 INFO L290 TraceCheckUtils]: 49: Hoare triple {14952#(<= ~counter~0 2)} assume true; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,386 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14952#(<= ~counter~0 2)} {14952#(<= ~counter~0 2)} #63#return; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,386 INFO L272 TraceCheckUtils]: 51: Hoare triple {14952#(<= ~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)); {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,386 INFO L290 TraceCheckUtils]: 52: Hoare triple {14952#(<= ~counter~0 2)} ~cond := #in~cond; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {14952#(<= ~counter~0 2)} assume !(0 == ~cond); {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,387 INFO L290 TraceCheckUtils]: 54: Hoare triple {14952#(<= ~counter~0 2)} assume true; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,387 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14952#(<= ~counter~0 2)} {14952#(<= ~counter~0 2)} #65#return; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,387 INFO L272 TraceCheckUtils]: 56: Hoare triple {14952#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,392 INFO L290 TraceCheckUtils]: 57: Hoare triple {14952#(<= ~counter~0 2)} ~cond := #in~cond; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,392 INFO L290 TraceCheckUtils]: 58: Hoare triple {14952#(<= ~counter~0 2)} assume !(0 == ~cond); {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,392 INFO L290 TraceCheckUtils]: 59: Hoare triple {14952#(<= ~counter~0 2)} assume true; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,393 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14952#(<= ~counter~0 2)} {14952#(<= ~counter~0 2)} #67#return; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,393 INFO L290 TraceCheckUtils]: 61: Hoare triple {14952#(<= ~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; {14952#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:47,394 INFO L290 TraceCheckUtils]: 62: Hoare triple {14952#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,394 INFO L290 TraceCheckUtils]: 63: Hoare triple {15037#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,394 INFO L272 TraceCheckUtils]: 64: Hoare triple {15037#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,394 INFO L290 TraceCheckUtils]: 65: Hoare triple {15037#(<= ~counter~0 3)} ~cond := #in~cond; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,395 INFO L290 TraceCheckUtils]: 66: Hoare triple {15037#(<= ~counter~0 3)} assume !(0 == ~cond); {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,395 INFO L290 TraceCheckUtils]: 67: Hoare triple {15037#(<= ~counter~0 3)} assume true; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,395 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15037#(<= ~counter~0 3)} {15037#(<= ~counter~0 3)} #59#return; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,396 INFO L272 TraceCheckUtils]: 69: Hoare triple {15037#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,396 INFO L290 TraceCheckUtils]: 70: Hoare triple {15037#(<= ~counter~0 3)} ~cond := #in~cond; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,396 INFO L290 TraceCheckUtils]: 71: Hoare triple {15037#(<= ~counter~0 3)} assume !(0 == ~cond); {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,396 INFO L290 TraceCheckUtils]: 72: Hoare triple {15037#(<= ~counter~0 3)} assume true; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,397 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15037#(<= ~counter~0 3)} {15037#(<= ~counter~0 3)} #61#return; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,397 INFO L272 TraceCheckUtils]: 74: Hoare triple {15037#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,397 INFO L290 TraceCheckUtils]: 75: Hoare triple {15037#(<= ~counter~0 3)} ~cond := #in~cond; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,398 INFO L290 TraceCheckUtils]: 76: Hoare triple {15037#(<= ~counter~0 3)} assume !(0 == ~cond); {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,398 INFO L290 TraceCheckUtils]: 77: Hoare triple {15037#(<= ~counter~0 3)} assume true; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,398 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {15037#(<= ~counter~0 3)} {15037#(<= ~counter~0 3)} #63#return; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,399 INFO L272 TraceCheckUtils]: 79: Hoare triple {15037#(<= ~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)); {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,399 INFO L290 TraceCheckUtils]: 80: Hoare triple {15037#(<= ~counter~0 3)} ~cond := #in~cond; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,399 INFO L290 TraceCheckUtils]: 81: Hoare triple {15037#(<= ~counter~0 3)} assume !(0 == ~cond); {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,399 INFO L290 TraceCheckUtils]: 82: Hoare triple {15037#(<= ~counter~0 3)} assume true; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,400 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {15037#(<= ~counter~0 3)} {15037#(<= ~counter~0 3)} #65#return; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,400 INFO L272 TraceCheckUtils]: 84: Hoare triple {15037#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,400 INFO L290 TraceCheckUtils]: 85: Hoare triple {15037#(<= ~counter~0 3)} ~cond := #in~cond; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,401 INFO L290 TraceCheckUtils]: 86: Hoare triple {15037#(<= ~counter~0 3)} assume !(0 == ~cond); {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,401 INFO L290 TraceCheckUtils]: 87: Hoare triple {15037#(<= ~counter~0 3)} assume true; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,401 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {15037#(<= ~counter~0 3)} {15037#(<= ~counter~0 3)} #67#return; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,402 INFO L290 TraceCheckUtils]: 89: Hoare triple {15037#(<= ~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; {15037#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:47,402 INFO L290 TraceCheckUtils]: 90: Hoare triple {15037#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,403 INFO L290 TraceCheckUtils]: 91: Hoare triple {15122#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,403 INFO L272 TraceCheckUtils]: 92: Hoare triple {15122#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,403 INFO L290 TraceCheckUtils]: 93: Hoare triple {15122#(<= ~counter~0 4)} ~cond := #in~cond; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,403 INFO L290 TraceCheckUtils]: 94: Hoare triple {15122#(<= ~counter~0 4)} assume !(0 == ~cond); {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,404 INFO L290 TraceCheckUtils]: 95: Hoare triple {15122#(<= ~counter~0 4)} assume true; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,404 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {15122#(<= ~counter~0 4)} {15122#(<= ~counter~0 4)} #59#return; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,404 INFO L272 TraceCheckUtils]: 97: Hoare triple {15122#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,405 INFO L290 TraceCheckUtils]: 98: Hoare triple {15122#(<= ~counter~0 4)} ~cond := #in~cond; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,405 INFO L290 TraceCheckUtils]: 99: Hoare triple {15122#(<= ~counter~0 4)} assume !(0 == ~cond); {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,405 INFO L290 TraceCheckUtils]: 100: Hoare triple {15122#(<= ~counter~0 4)} assume true; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,405 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15122#(<= ~counter~0 4)} {15122#(<= ~counter~0 4)} #61#return; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,406 INFO L272 TraceCheckUtils]: 102: Hoare triple {15122#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,406 INFO L290 TraceCheckUtils]: 103: Hoare triple {15122#(<= ~counter~0 4)} ~cond := #in~cond; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,406 INFO L290 TraceCheckUtils]: 104: Hoare triple {15122#(<= ~counter~0 4)} assume !(0 == ~cond); {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,407 INFO L290 TraceCheckUtils]: 105: Hoare triple {15122#(<= ~counter~0 4)} assume true; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,407 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {15122#(<= ~counter~0 4)} {15122#(<= ~counter~0 4)} #63#return; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,407 INFO L272 TraceCheckUtils]: 107: Hoare triple {15122#(<= ~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)); {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,408 INFO L290 TraceCheckUtils]: 108: Hoare triple {15122#(<= ~counter~0 4)} ~cond := #in~cond; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,408 INFO L290 TraceCheckUtils]: 109: Hoare triple {15122#(<= ~counter~0 4)} assume !(0 == ~cond); {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,408 INFO L290 TraceCheckUtils]: 110: Hoare triple {15122#(<= ~counter~0 4)} assume true; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,408 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {15122#(<= ~counter~0 4)} {15122#(<= ~counter~0 4)} #65#return; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,409 INFO L272 TraceCheckUtils]: 112: Hoare triple {15122#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,409 INFO L290 TraceCheckUtils]: 113: Hoare triple {15122#(<= ~counter~0 4)} ~cond := #in~cond; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,409 INFO L290 TraceCheckUtils]: 114: Hoare triple {15122#(<= ~counter~0 4)} assume !(0 == ~cond); {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,410 INFO L290 TraceCheckUtils]: 115: Hoare triple {15122#(<= ~counter~0 4)} assume true; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,410 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {15122#(<= ~counter~0 4)} {15122#(<= ~counter~0 4)} #67#return; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,410 INFO L290 TraceCheckUtils]: 117: Hoare triple {15122#(<= ~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; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,411 INFO L290 TraceCheckUtils]: 118: Hoare triple {15122#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,411 INFO L290 TraceCheckUtils]: 119: Hoare triple {15207#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,411 INFO L272 TraceCheckUtils]: 120: Hoare triple {15207#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,412 INFO L290 TraceCheckUtils]: 121: Hoare triple {15207#(<= ~counter~0 5)} ~cond := #in~cond; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,412 INFO L290 TraceCheckUtils]: 122: Hoare triple {15207#(<= ~counter~0 5)} assume !(0 == ~cond); {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,412 INFO L290 TraceCheckUtils]: 123: Hoare triple {15207#(<= ~counter~0 5)} assume true; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,413 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {15207#(<= ~counter~0 5)} {15207#(<= ~counter~0 5)} #59#return; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,413 INFO L272 TraceCheckUtils]: 125: Hoare triple {15207#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,413 INFO L290 TraceCheckUtils]: 126: Hoare triple {15207#(<= ~counter~0 5)} ~cond := #in~cond; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,413 INFO L290 TraceCheckUtils]: 127: Hoare triple {15207#(<= ~counter~0 5)} assume !(0 == ~cond); {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,414 INFO L290 TraceCheckUtils]: 128: Hoare triple {15207#(<= ~counter~0 5)} assume true; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,414 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {15207#(<= ~counter~0 5)} {15207#(<= ~counter~0 5)} #61#return; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,414 INFO L272 TraceCheckUtils]: 130: Hoare triple {15207#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,415 INFO L290 TraceCheckUtils]: 131: Hoare triple {15207#(<= ~counter~0 5)} ~cond := #in~cond; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,415 INFO L290 TraceCheckUtils]: 132: Hoare triple {15207#(<= ~counter~0 5)} assume !(0 == ~cond); {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,415 INFO L290 TraceCheckUtils]: 133: Hoare triple {15207#(<= ~counter~0 5)} assume true; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,415 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {15207#(<= ~counter~0 5)} {15207#(<= ~counter~0 5)} #63#return; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,416 INFO L272 TraceCheckUtils]: 135: Hoare triple {15207#(<= ~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)); {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,416 INFO L290 TraceCheckUtils]: 136: Hoare triple {15207#(<= ~counter~0 5)} ~cond := #in~cond; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,416 INFO L290 TraceCheckUtils]: 137: Hoare triple {15207#(<= ~counter~0 5)} assume !(0 == ~cond); {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,417 INFO L290 TraceCheckUtils]: 138: Hoare triple {15207#(<= ~counter~0 5)} assume true; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,417 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {15207#(<= ~counter~0 5)} {15207#(<= ~counter~0 5)} #65#return; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,417 INFO L272 TraceCheckUtils]: 140: Hoare triple {15207#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,418 INFO L290 TraceCheckUtils]: 141: Hoare triple {15207#(<= ~counter~0 5)} ~cond := #in~cond; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,418 INFO L290 TraceCheckUtils]: 142: Hoare triple {15207#(<= ~counter~0 5)} assume !(0 == ~cond); {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,418 INFO L290 TraceCheckUtils]: 143: Hoare triple {15207#(<= ~counter~0 5)} assume true; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,419 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {15207#(<= ~counter~0 5)} {15207#(<= ~counter~0 5)} #67#return; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,419 INFO L290 TraceCheckUtils]: 145: Hoare triple {15207#(<= ~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; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,419 INFO L290 TraceCheckUtils]: 146: Hoare triple {15207#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15292#(<= |main_#t~post5| 5)} is VALID [2022-04-08 11:14:47,419 INFO L290 TraceCheckUtils]: 147: Hoare triple {15292#(<= |main_#t~post5| 5)} assume !(#t~post5 < 10);havoc #t~post5; {14844#false} is VALID [2022-04-08 11:14:47,420 INFO L272 TraceCheckUtils]: 148: Hoare triple {14844#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14844#false} is VALID [2022-04-08 11:14:47,420 INFO L290 TraceCheckUtils]: 149: Hoare triple {14844#false} ~cond := #in~cond; {14844#false} is VALID [2022-04-08 11:14:47,420 INFO L290 TraceCheckUtils]: 150: Hoare triple {14844#false} assume !(0 == ~cond); {14844#false} is VALID [2022-04-08 11:14:47,420 INFO L290 TraceCheckUtils]: 151: Hoare triple {14844#false} assume true; {14844#false} is VALID [2022-04-08 11:14:47,420 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {14844#false} {14844#false} #69#return; {14844#false} is VALID [2022-04-08 11:14:47,420 INFO L272 TraceCheckUtils]: 153: Hoare triple {14844#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {14844#false} is VALID [2022-04-08 11:14:47,420 INFO L290 TraceCheckUtils]: 154: Hoare triple {14844#false} ~cond := #in~cond; {14844#false} is VALID [2022-04-08 11:14:47,420 INFO L290 TraceCheckUtils]: 155: Hoare triple {14844#false} assume 0 == ~cond; {14844#false} is VALID [2022-04-08 11:14:47,420 INFO L290 TraceCheckUtils]: 156: Hoare triple {14844#false} assume !false; {14844#false} is VALID [2022-04-08 11:14:47,421 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-08 11:14:47,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:14:47,855 INFO L290 TraceCheckUtils]: 156: Hoare triple {14844#false} assume !false; {14844#false} is VALID [2022-04-08 11:14:47,855 INFO L290 TraceCheckUtils]: 155: Hoare triple {14844#false} assume 0 == ~cond; {14844#false} is VALID [2022-04-08 11:14:47,855 INFO L290 TraceCheckUtils]: 154: Hoare triple {14844#false} ~cond := #in~cond; {14844#false} is VALID [2022-04-08 11:14:47,855 INFO L272 TraceCheckUtils]: 153: Hoare triple {14844#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {14844#false} is VALID [2022-04-08 11:14:47,855 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {14843#true} {14844#false} #69#return; {14844#false} is VALID [2022-04-08 11:14:47,855 INFO L290 TraceCheckUtils]: 151: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,855 INFO L290 TraceCheckUtils]: 150: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,856 INFO L290 TraceCheckUtils]: 149: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,856 INFO L272 TraceCheckUtils]: 148: Hoare triple {14844#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,856 INFO L290 TraceCheckUtils]: 147: Hoare triple {15350#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {14844#false} is VALID [2022-04-08 11:14:47,856 INFO L290 TraceCheckUtils]: 146: Hoare triple {15354#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15350#(< |main_#t~post5| 10)} is VALID [2022-04-08 11:14:47,856 INFO L290 TraceCheckUtils]: 145: Hoare triple {15354#(< ~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; {15354#(< ~counter~0 10)} is VALID [2022-04-08 11:14:47,857 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {14843#true} {15354#(< ~counter~0 10)} #67#return; {15354#(< ~counter~0 10)} is VALID [2022-04-08 11:14:47,857 INFO L290 TraceCheckUtils]: 143: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,857 INFO L290 TraceCheckUtils]: 142: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,857 INFO L290 TraceCheckUtils]: 141: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,857 INFO L272 TraceCheckUtils]: 140: Hoare triple {15354#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,857 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {14843#true} {15354#(< ~counter~0 10)} #65#return; {15354#(< ~counter~0 10)} is VALID [2022-04-08 11:14:47,857 INFO L290 TraceCheckUtils]: 138: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,857 INFO L290 TraceCheckUtils]: 137: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,857 INFO L290 TraceCheckUtils]: 136: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,857 INFO L272 TraceCheckUtils]: 135: Hoare triple {15354#(< ~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)); {14843#true} is VALID [2022-04-08 11:14:47,858 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {14843#true} {15354#(< ~counter~0 10)} #63#return; {15354#(< ~counter~0 10)} is VALID [2022-04-08 11:14:47,858 INFO L290 TraceCheckUtils]: 133: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,858 INFO L290 TraceCheckUtils]: 132: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,858 INFO L290 TraceCheckUtils]: 131: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,858 INFO L272 TraceCheckUtils]: 130: Hoare triple {15354#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,858 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {14843#true} {15354#(< ~counter~0 10)} #61#return; {15354#(< ~counter~0 10)} is VALID [2022-04-08 11:14:47,858 INFO L290 TraceCheckUtils]: 128: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,858 INFO L290 TraceCheckUtils]: 127: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,858 INFO L290 TraceCheckUtils]: 126: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,858 INFO L272 TraceCheckUtils]: 125: Hoare triple {15354#(< ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,859 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {14843#true} {15354#(< ~counter~0 10)} #59#return; {15354#(< ~counter~0 10)} is VALID [2022-04-08 11:14:47,859 INFO L290 TraceCheckUtils]: 123: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,859 INFO L290 TraceCheckUtils]: 122: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,859 INFO L290 TraceCheckUtils]: 121: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,859 INFO L272 TraceCheckUtils]: 120: Hoare triple {15354#(< ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,859 INFO L290 TraceCheckUtils]: 119: Hoare triple {15354#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {15354#(< ~counter~0 10)} is VALID [2022-04-08 11:14:47,860 INFO L290 TraceCheckUtils]: 118: Hoare triple {15439#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15354#(< ~counter~0 10)} is VALID [2022-04-08 11:14:47,860 INFO L290 TraceCheckUtils]: 117: Hoare triple {15439#(< ~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; {15439#(< ~counter~0 9)} is VALID [2022-04-08 11:14:47,860 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {14843#true} {15439#(< ~counter~0 9)} #67#return; {15439#(< ~counter~0 9)} is VALID [2022-04-08 11:14:47,860 INFO L290 TraceCheckUtils]: 115: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,860 INFO L290 TraceCheckUtils]: 114: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,860 INFO L290 TraceCheckUtils]: 113: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,860 INFO L272 TraceCheckUtils]: 112: Hoare triple {15439#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,861 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {14843#true} {15439#(< ~counter~0 9)} #65#return; {15439#(< ~counter~0 9)} is VALID [2022-04-08 11:14:47,861 INFO L290 TraceCheckUtils]: 110: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,861 INFO L290 TraceCheckUtils]: 109: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,861 INFO L290 TraceCheckUtils]: 108: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,861 INFO L272 TraceCheckUtils]: 107: Hoare triple {15439#(< ~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)); {14843#true} is VALID [2022-04-08 11:14:47,861 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {14843#true} {15439#(< ~counter~0 9)} #63#return; {15439#(< ~counter~0 9)} is VALID [2022-04-08 11:14:47,861 INFO L290 TraceCheckUtils]: 105: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,861 INFO L290 TraceCheckUtils]: 104: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,862 INFO L290 TraceCheckUtils]: 103: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,862 INFO L272 TraceCheckUtils]: 102: Hoare triple {15439#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,862 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {14843#true} {15439#(< ~counter~0 9)} #61#return; {15439#(< ~counter~0 9)} is VALID [2022-04-08 11:14:47,862 INFO L290 TraceCheckUtils]: 100: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,862 INFO L290 TraceCheckUtils]: 99: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,862 INFO L290 TraceCheckUtils]: 98: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,862 INFO L272 TraceCheckUtils]: 97: Hoare triple {15439#(< ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,862 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {14843#true} {15439#(< ~counter~0 9)} #59#return; {15439#(< ~counter~0 9)} is VALID [2022-04-08 11:14:47,862 INFO L290 TraceCheckUtils]: 95: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,863 INFO L290 TraceCheckUtils]: 94: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,863 INFO L290 TraceCheckUtils]: 93: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,863 INFO L272 TraceCheckUtils]: 92: Hoare triple {15439#(< ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,863 INFO L290 TraceCheckUtils]: 91: Hoare triple {15439#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {15439#(< ~counter~0 9)} is VALID [2022-04-08 11:14:47,863 INFO L290 TraceCheckUtils]: 90: Hoare triple {15524#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15439#(< ~counter~0 9)} is VALID [2022-04-08 11:14:47,863 INFO L290 TraceCheckUtils]: 89: Hoare triple {15524#(< ~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; {15524#(< ~counter~0 8)} is VALID [2022-04-08 11:14:47,864 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {14843#true} {15524#(< ~counter~0 8)} #67#return; {15524#(< ~counter~0 8)} is VALID [2022-04-08 11:14:47,864 INFO L290 TraceCheckUtils]: 87: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,864 INFO L290 TraceCheckUtils]: 86: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,864 INFO L290 TraceCheckUtils]: 85: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,864 INFO L272 TraceCheckUtils]: 84: Hoare triple {15524#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,864 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {14843#true} {15524#(< ~counter~0 8)} #65#return; {15524#(< ~counter~0 8)} is VALID [2022-04-08 11:14:47,864 INFO L290 TraceCheckUtils]: 82: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,864 INFO L290 TraceCheckUtils]: 81: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,864 INFO L290 TraceCheckUtils]: 80: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,865 INFO L272 TraceCheckUtils]: 79: Hoare triple {15524#(< ~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)); {14843#true} is VALID [2022-04-08 11:14:47,865 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {14843#true} {15524#(< ~counter~0 8)} #63#return; {15524#(< ~counter~0 8)} is VALID [2022-04-08 11:14:47,865 INFO L290 TraceCheckUtils]: 77: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,865 INFO L290 TraceCheckUtils]: 76: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,865 INFO L290 TraceCheckUtils]: 75: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,865 INFO L272 TraceCheckUtils]: 74: Hoare triple {15524#(< ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,865 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {14843#true} {15524#(< ~counter~0 8)} #61#return; {15524#(< ~counter~0 8)} is VALID [2022-04-08 11:14:47,865 INFO L290 TraceCheckUtils]: 72: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,865 INFO L290 TraceCheckUtils]: 71: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,866 INFO L290 TraceCheckUtils]: 70: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,866 INFO L272 TraceCheckUtils]: 69: Hoare triple {15524#(< ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,866 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {14843#true} {15524#(< ~counter~0 8)} #59#return; {15524#(< ~counter~0 8)} is VALID [2022-04-08 11:14:47,866 INFO L290 TraceCheckUtils]: 67: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,866 INFO L290 TraceCheckUtils]: 66: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,866 INFO L290 TraceCheckUtils]: 65: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,866 INFO L272 TraceCheckUtils]: 64: Hoare triple {15524#(< ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,866 INFO L290 TraceCheckUtils]: 63: Hoare triple {15524#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {15524#(< ~counter~0 8)} is VALID [2022-04-08 11:14:47,868 INFO L290 TraceCheckUtils]: 62: Hoare triple {15609#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15524#(< ~counter~0 8)} is VALID [2022-04-08 11:14:47,869 INFO L290 TraceCheckUtils]: 61: Hoare triple {15609#(< ~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; {15609#(< ~counter~0 7)} is VALID [2022-04-08 11:14:47,869 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14843#true} {15609#(< ~counter~0 7)} #67#return; {15609#(< ~counter~0 7)} is VALID [2022-04-08 11:14:47,869 INFO L290 TraceCheckUtils]: 59: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,869 INFO L290 TraceCheckUtils]: 57: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,869 INFO L272 TraceCheckUtils]: 56: Hoare triple {15609#(< ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,870 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14843#true} {15609#(< ~counter~0 7)} #65#return; {15609#(< ~counter~0 7)} is VALID [2022-04-08 11:14:47,870 INFO L290 TraceCheckUtils]: 54: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,870 INFO L272 TraceCheckUtils]: 51: Hoare triple {15609#(< ~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)); {14843#true} is VALID [2022-04-08 11:14:47,870 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14843#true} {15609#(< ~counter~0 7)} #63#return; {15609#(< ~counter~0 7)} is VALID [2022-04-08 11:14:47,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,870 INFO L272 TraceCheckUtils]: 46: Hoare triple {15609#(< ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,871 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14843#true} {15609#(< ~counter~0 7)} #61#return; {15609#(< ~counter~0 7)} is VALID [2022-04-08 11:14:47,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,871 INFO L272 TraceCheckUtils]: 41: Hoare triple {15609#(< ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,871 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {14843#true} {15609#(< ~counter~0 7)} #59#return; {15609#(< ~counter~0 7)} is VALID [2022-04-08 11:14:47,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,872 INFO L272 TraceCheckUtils]: 36: Hoare triple {15609#(< ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {15609#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {15609#(< ~counter~0 7)} is VALID [2022-04-08 11:14:47,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {15207#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15609#(< ~counter~0 7)} is VALID [2022-04-08 11:14:47,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {15207#(<= ~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; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,873 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14843#true} {15207#(<= ~counter~0 5)} #67#return; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,873 INFO L272 TraceCheckUtils]: 28: Hoare triple {15207#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,873 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14843#true} {15207#(<= ~counter~0 5)} #65#return; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,873 INFO L272 TraceCheckUtils]: 23: Hoare triple {15207#(<= ~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)); {14843#true} is VALID [2022-04-08 11:14:47,874 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14843#true} {15207#(<= ~counter~0 5)} #63#return; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,874 INFO L272 TraceCheckUtils]: 18: Hoare triple {15207#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,874 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14843#true} {15207#(<= ~counter~0 5)} #61#return; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,875 INFO L272 TraceCheckUtils]: 13: Hoare triple {15207#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,875 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {14843#true} {15207#(<= ~counter~0 5)} #59#return; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {14843#true} assume true; {14843#true} is VALID [2022-04-08 11:14:47,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {14843#true} assume !(0 == ~cond); {14843#true} is VALID [2022-04-08 11:14:47,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {14843#true} ~cond := #in~cond; {14843#true} is VALID [2022-04-08 11:14:47,875 INFO L272 TraceCheckUtils]: 8: Hoare triple {15207#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14843#true} is VALID [2022-04-08 11:14:47,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {15207#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {15122#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15207#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:47,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {15122#(<= ~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; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {15122#(<= ~counter~0 4)} call #t~ret6 := main(); {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15122#(<= ~counter~0 4)} {14843#true} #81#return; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {15122#(<= ~counter~0 4)} assume true; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {14843#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; {15122#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:47,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {14843#true} call ULTIMATE.init(); {14843#true} is VALID [2022-04-08 11:14:47,877 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-08 11:14:47,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:14:47,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991940207] [2022-04-08 11:14:47,878 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:14:47,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539237965] [2022-04-08 11:14:47,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539237965] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:14:47,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:14:47,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 11:14:47,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:14:47,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [918608053] [2022-04-08 11:14:47,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [918608053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:14:47,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:14:47,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 11:14:47,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259566182] [2022-04-08 11:14:47,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:14:47,879 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-08 11:14:47,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:14:47,880 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-08 11:14:47,925 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-08 11:14:47,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 11:14:47,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:14:47,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 11:14:47,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 11:14:47,926 INFO L87 Difference]: Start difference. First operand 117 states and 129 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-08 11:14:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:48,995 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2022-04-08 11:14:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 11:14:48,995 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-08 11:14:48,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:14:48,996 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-08 11:14:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 123 transitions. [2022-04-08 11:14:48,998 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-08 11:14:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 123 transitions. [2022-04-08 11:14:49,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 123 transitions. [2022-04-08 11:14:49,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:14:49,124 INFO L225 Difference]: With dead ends: 146 [2022-04-08 11:14:49,125 INFO L226 Difference]: Without dead ends: 133 [2022-04-08 11:14:49,126 INFO L912 BasicCegarLoop]: 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-08 11:14:49,126 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:14:49,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 148 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:14:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-08 11:14:49,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-04-08 11:14:49,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:14:49,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 79 states have internal predecessors, (80), 35 states have call successors, (35), 20 states have call predecessors, (35), 19 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 11:14:49,278 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 79 states have internal predecessors, (80), 35 states have call successors, (35), 20 states have call predecessors, (35), 19 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 11:14:49,278 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 79 states have internal predecessors, (80), 35 states have call successors, (35), 20 states have call predecessors, (35), 19 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 11:14:49,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:49,281 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2022-04-08 11:14:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2022-04-08 11:14:49,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:14:49,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:14:49,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 79 states have internal predecessors, (80), 35 states have call successors, (35), 20 states have call predecessors, (35), 19 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 133 states. [2022-04-08 11:14:49,282 INFO L87 Difference]: Start difference. First operand has 133 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 79 states have internal predecessors, (80), 35 states have call successors, (35), 20 states have call predecessors, (35), 19 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 133 states. [2022-04-08 11:14:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:49,285 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2022-04-08 11:14:49,285 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2022-04-08 11:14:49,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:14:49,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:14:49,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:14:49,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:14:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 79 states have internal predecessors, (80), 35 states have call successors, (35), 20 states have call predecessors, (35), 19 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 11:14:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 148 transitions. [2022-04-08 11:14:49,287 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 148 transitions. Word has length 157 [2022-04-08 11:14:49,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:14:49,287 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 148 transitions. [2022-04-08 11:14:49,288 INFO L479 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-08 11:14:49,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 148 transitions. [2022-04-08 11:14:53,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 147 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:14:53,392 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2022-04-08 11:14:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-04-08 11:14:53,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:14:53,392 INFO L499 BasicCegarLoop]: 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-08 11:14:53,409 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-08 11:14:53,593 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:14:53,593 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:14:53,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:14:53,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1100526531, now seen corresponding path program 11 times [2022-04-08 11:14:53,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:14:53,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1102261467] [2022-04-08 11:14:53,962 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:14:53,963 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:14:53,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1100526531, now seen corresponding path program 12 times [2022-04-08 11:14:53,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:14:53,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120515109] [2022-04-08 11:14:53,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:14:53,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:14:53,987 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:14:53,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [340853695] [2022-04-08 11:14:53,987 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:14:53,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:14:53,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:14:53,988 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-08 11:14:53,989 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-08 11:14:54,736 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-08 11:14:54,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:14:54,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 11:14:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:14:54,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:14:55,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {16632#true} call ULTIMATE.init(); {16632#true} is VALID [2022-04-08 11:14:55,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#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; {16640#(<= ~counter~0 0)} is VALID [2022-04-08 11:14:55,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {16640#(<= ~counter~0 0)} assume true; {16640#(<= ~counter~0 0)} is VALID [2022-04-08 11:14:55,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16640#(<= ~counter~0 0)} {16632#true} #81#return; {16640#(<= ~counter~0 0)} is VALID [2022-04-08 11:14:55,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {16640#(<= ~counter~0 0)} call #t~ret6 := main(); {16640#(<= ~counter~0 0)} is VALID [2022-04-08 11:14:55,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {16640#(<= ~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; {16640#(<= ~counter~0 0)} is VALID [2022-04-08 11:14:55,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {16640#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {16656#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,489 INFO L272 TraceCheckUtils]: 8: Hoare triple {16656#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {16656#(<= ~counter~0 1)} ~cond := #in~cond; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {16656#(<= ~counter~0 1)} assume !(0 == ~cond); {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {16656#(<= ~counter~0 1)} assume true; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,490 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16656#(<= ~counter~0 1)} {16656#(<= ~counter~0 1)} #59#return; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,491 INFO L272 TraceCheckUtils]: 13: Hoare triple {16656#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {16656#(<= ~counter~0 1)} ~cond := #in~cond; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {16656#(<= ~counter~0 1)} assume !(0 == ~cond); {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {16656#(<= ~counter~0 1)} assume true; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,492 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16656#(<= ~counter~0 1)} {16656#(<= ~counter~0 1)} #61#return; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,492 INFO L272 TraceCheckUtils]: 18: Hoare triple {16656#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {16656#(<= ~counter~0 1)} ~cond := #in~cond; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {16656#(<= ~counter~0 1)} assume !(0 == ~cond); {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {16656#(<= ~counter~0 1)} assume true; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,493 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16656#(<= ~counter~0 1)} {16656#(<= ~counter~0 1)} #63#return; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,493 INFO L272 TraceCheckUtils]: 23: Hoare triple {16656#(<= ~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)); {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {16656#(<= ~counter~0 1)} ~cond := #in~cond; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {16656#(<= ~counter~0 1)} assume !(0 == ~cond); {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {16656#(<= ~counter~0 1)} assume true; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,494 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16656#(<= ~counter~0 1)} {16656#(<= ~counter~0 1)} #65#return; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,494 INFO L272 TraceCheckUtils]: 28: Hoare triple {16656#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {16656#(<= ~counter~0 1)} ~cond := #in~cond; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,495 INFO L290 TraceCheckUtils]: 30: Hoare triple {16656#(<= ~counter~0 1)} assume !(0 == ~cond); {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,495 INFO L290 TraceCheckUtils]: 31: Hoare triple {16656#(<= ~counter~0 1)} assume true; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,495 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16656#(<= ~counter~0 1)} {16656#(<= ~counter~0 1)} #67#return; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {16656#(<= ~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; {16656#(<= ~counter~0 1)} is VALID [2022-04-08 11:14:55,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {16656#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {16741#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,497 INFO L272 TraceCheckUtils]: 36: Hoare triple {16741#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {16741#(<= ~counter~0 2)} ~cond := #in~cond; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,497 INFO L290 TraceCheckUtils]: 38: Hoare triple {16741#(<= ~counter~0 2)} assume !(0 == ~cond); {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {16741#(<= ~counter~0 2)} assume true; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,498 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16741#(<= ~counter~0 2)} {16741#(<= ~counter~0 2)} #59#return; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,498 INFO L272 TraceCheckUtils]: 41: Hoare triple {16741#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,498 INFO L290 TraceCheckUtils]: 42: Hoare triple {16741#(<= ~counter~0 2)} ~cond := #in~cond; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,499 INFO L290 TraceCheckUtils]: 43: Hoare triple {16741#(<= ~counter~0 2)} assume !(0 == ~cond); {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,499 INFO L290 TraceCheckUtils]: 44: Hoare triple {16741#(<= ~counter~0 2)} assume true; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,499 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16741#(<= ~counter~0 2)} {16741#(<= ~counter~0 2)} #61#return; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,500 INFO L272 TraceCheckUtils]: 46: Hoare triple {16741#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {16741#(<= ~counter~0 2)} ~cond := #in~cond; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {16741#(<= ~counter~0 2)} assume !(0 == ~cond); {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,500 INFO L290 TraceCheckUtils]: 49: Hoare triple {16741#(<= ~counter~0 2)} assume true; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,501 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16741#(<= ~counter~0 2)} {16741#(<= ~counter~0 2)} #63#return; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,501 INFO L272 TraceCheckUtils]: 51: Hoare triple {16741#(<= ~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)); {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,501 INFO L290 TraceCheckUtils]: 52: Hoare triple {16741#(<= ~counter~0 2)} ~cond := #in~cond; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {16741#(<= ~counter~0 2)} assume !(0 == ~cond); {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,502 INFO L290 TraceCheckUtils]: 54: Hoare triple {16741#(<= ~counter~0 2)} assume true; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,502 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16741#(<= ~counter~0 2)} {16741#(<= ~counter~0 2)} #65#return; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,502 INFO L272 TraceCheckUtils]: 56: Hoare triple {16741#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,502 INFO L290 TraceCheckUtils]: 57: Hoare triple {16741#(<= ~counter~0 2)} ~cond := #in~cond; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,503 INFO L290 TraceCheckUtils]: 58: Hoare triple {16741#(<= ~counter~0 2)} assume !(0 == ~cond); {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,503 INFO L290 TraceCheckUtils]: 59: Hoare triple {16741#(<= ~counter~0 2)} assume true; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,503 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16741#(<= ~counter~0 2)} {16741#(<= ~counter~0 2)} #67#return; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,503 INFO L290 TraceCheckUtils]: 61: Hoare triple {16741#(<= ~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; {16741#(<= ~counter~0 2)} is VALID [2022-04-08 11:14:55,504 INFO L290 TraceCheckUtils]: 62: Hoare triple {16741#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,504 INFO L290 TraceCheckUtils]: 63: Hoare triple {16826#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,505 INFO L272 TraceCheckUtils]: 64: Hoare triple {16826#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,505 INFO L290 TraceCheckUtils]: 65: Hoare triple {16826#(<= ~counter~0 3)} ~cond := #in~cond; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,505 INFO L290 TraceCheckUtils]: 66: Hoare triple {16826#(<= ~counter~0 3)} assume !(0 == ~cond); {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,505 INFO L290 TraceCheckUtils]: 67: Hoare triple {16826#(<= ~counter~0 3)} assume true; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,506 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {16826#(<= ~counter~0 3)} {16826#(<= ~counter~0 3)} #59#return; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,506 INFO L272 TraceCheckUtils]: 69: Hoare triple {16826#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,506 INFO L290 TraceCheckUtils]: 70: Hoare triple {16826#(<= ~counter~0 3)} ~cond := #in~cond; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,506 INFO L290 TraceCheckUtils]: 71: Hoare triple {16826#(<= ~counter~0 3)} assume !(0 == ~cond); {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,507 INFO L290 TraceCheckUtils]: 72: Hoare triple {16826#(<= ~counter~0 3)} assume true; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,507 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16826#(<= ~counter~0 3)} {16826#(<= ~counter~0 3)} #61#return; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,507 INFO L272 TraceCheckUtils]: 74: Hoare triple {16826#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,508 INFO L290 TraceCheckUtils]: 75: Hoare triple {16826#(<= ~counter~0 3)} ~cond := #in~cond; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,508 INFO L290 TraceCheckUtils]: 76: Hoare triple {16826#(<= ~counter~0 3)} assume !(0 == ~cond); {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,508 INFO L290 TraceCheckUtils]: 77: Hoare triple {16826#(<= ~counter~0 3)} assume true; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,508 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {16826#(<= ~counter~0 3)} {16826#(<= ~counter~0 3)} #63#return; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,509 INFO L272 TraceCheckUtils]: 79: Hoare triple {16826#(<= ~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)); {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,509 INFO L290 TraceCheckUtils]: 80: Hoare triple {16826#(<= ~counter~0 3)} ~cond := #in~cond; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,509 INFO L290 TraceCheckUtils]: 81: Hoare triple {16826#(<= ~counter~0 3)} assume !(0 == ~cond); {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,509 INFO L290 TraceCheckUtils]: 82: Hoare triple {16826#(<= ~counter~0 3)} assume true; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,510 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {16826#(<= ~counter~0 3)} {16826#(<= ~counter~0 3)} #65#return; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,510 INFO L272 TraceCheckUtils]: 84: Hoare triple {16826#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,510 INFO L290 TraceCheckUtils]: 85: Hoare triple {16826#(<= ~counter~0 3)} ~cond := #in~cond; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,510 INFO L290 TraceCheckUtils]: 86: Hoare triple {16826#(<= ~counter~0 3)} assume !(0 == ~cond); {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,511 INFO L290 TraceCheckUtils]: 87: Hoare triple {16826#(<= ~counter~0 3)} assume true; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,511 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {16826#(<= ~counter~0 3)} {16826#(<= ~counter~0 3)} #67#return; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,511 INFO L290 TraceCheckUtils]: 89: Hoare triple {16826#(<= ~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; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:55,512 INFO L290 TraceCheckUtils]: 90: Hoare triple {16826#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,512 INFO L290 TraceCheckUtils]: 91: Hoare triple {16911#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,512 INFO L272 TraceCheckUtils]: 92: Hoare triple {16911#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,513 INFO L290 TraceCheckUtils]: 93: Hoare triple {16911#(<= ~counter~0 4)} ~cond := #in~cond; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,513 INFO L290 TraceCheckUtils]: 94: Hoare triple {16911#(<= ~counter~0 4)} assume !(0 == ~cond); {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,513 INFO L290 TraceCheckUtils]: 95: Hoare triple {16911#(<= ~counter~0 4)} assume true; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,513 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {16911#(<= ~counter~0 4)} {16911#(<= ~counter~0 4)} #59#return; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,514 INFO L272 TraceCheckUtils]: 97: Hoare triple {16911#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,514 INFO L290 TraceCheckUtils]: 98: Hoare triple {16911#(<= ~counter~0 4)} ~cond := #in~cond; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,514 INFO L290 TraceCheckUtils]: 99: Hoare triple {16911#(<= ~counter~0 4)} assume !(0 == ~cond); {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,514 INFO L290 TraceCheckUtils]: 100: Hoare triple {16911#(<= ~counter~0 4)} assume true; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,515 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {16911#(<= ~counter~0 4)} {16911#(<= ~counter~0 4)} #61#return; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,515 INFO L272 TraceCheckUtils]: 102: Hoare triple {16911#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,515 INFO L290 TraceCheckUtils]: 103: Hoare triple {16911#(<= ~counter~0 4)} ~cond := #in~cond; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,515 INFO L290 TraceCheckUtils]: 104: Hoare triple {16911#(<= ~counter~0 4)} assume !(0 == ~cond); {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,516 INFO L290 TraceCheckUtils]: 105: Hoare triple {16911#(<= ~counter~0 4)} assume true; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,516 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {16911#(<= ~counter~0 4)} {16911#(<= ~counter~0 4)} #63#return; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,516 INFO L272 TraceCheckUtils]: 107: Hoare triple {16911#(<= ~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)); {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,517 INFO L290 TraceCheckUtils]: 108: Hoare triple {16911#(<= ~counter~0 4)} ~cond := #in~cond; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,517 INFO L290 TraceCheckUtils]: 109: Hoare triple {16911#(<= ~counter~0 4)} assume !(0 == ~cond); {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,517 INFO L290 TraceCheckUtils]: 110: Hoare triple {16911#(<= ~counter~0 4)} assume true; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,517 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {16911#(<= ~counter~0 4)} {16911#(<= ~counter~0 4)} #65#return; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,518 INFO L272 TraceCheckUtils]: 112: Hoare triple {16911#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,518 INFO L290 TraceCheckUtils]: 113: Hoare triple {16911#(<= ~counter~0 4)} ~cond := #in~cond; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,518 INFO L290 TraceCheckUtils]: 114: Hoare triple {16911#(<= ~counter~0 4)} assume !(0 == ~cond); {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,518 INFO L290 TraceCheckUtils]: 115: Hoare triple {16911#(<= ~counter~0 4)} assume true; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,519 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {16911#(<= ~counter~0 4)} {16911#(<= ~counter~0 4)} #67#return; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,519 INFO L290 TraceCheckUtils]: 117: Hoare triple {16911#(<= ~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; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:55,520 INFO L290 TraceCheckUtils]: 118: Hoare triple {16911#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,520 INFO L290 TraceCheckUtils]: 119: Hoare triple {16996#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,520 INFO L272 TraceCheckUtils]: 120: Hoare triple {16996#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,520 INFO L290 TraceCheckUtils]: 121: Hoare triple {16996#(<= ~counter~0 5)} ~cond := #in~cond; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,521 INFO L290 TraceCheckUtils]: 122: Hoare triple {16996#(<= ~counter~0 5)} assume !(0 == ~cond); {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,521 INFO L290 TraceCheckUtils]: 123: Hoare triple {16996#(<= ~counter~0 5)} assume true; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,521 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {16996#(<= ~counter~0 5)} {16996#(<= ~counter~0 5)} #59#return; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,521 INFO L272 TraceCheckUtils]: 125: Hoare triple {16996#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,522 INFO L290 TraceCheckUtils]: 126: Hoare triple {16996#(<= ~counter~0 5)} ~cond := #in~cond; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,522 INFO L290 TraceCheckUtils]: 127: Hoare triple {16996#(<= ~counter~0 5)} assume !(0 == ~cond); {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,522 INFO L290 TraceCheckUtils]: 128: Hoare triple {16996#(<= ~counter~0 5)} assume true; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,522 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {16996#(<= ~counter~0 5)} {16996#(<= ~counter~0 5)} #61#return; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,523 INFO L272 TraceCheckUtils]: 130: Hoare triple {16996#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,523 INFO L290 TraceCheckUtils]: 131: Hoare triple {16996#(<= ~counter~0 5)} ~cond := #in~cond; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,523 INFO L290 TraceCheckUtils]: 132: Hoare triple {16996#(<= ~counter~0 5)} assume !(0 == ~cond); {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,523 INFO L290 TraceCheckUtils]: 133: Hoare triple {16996#(<= ~counter~0 5)} assume true; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,524 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {16996#(<= ~counter~0 5)} {16996#(<= ~counter~0 5)} #63#return; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,524 INFO L272 TraceCheckUtils]: 135: Hoare triple {16996#(<= ~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)); {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,524 INFO L290 TraceCheckUtils]: 136: Hoare triple {16996#(<= ~counter~0 5)} ~cond := #in~cond; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,525 INFO L290 TraceCheckUtils]: 137: Hoare triple {16996#(<= ~counter~0 5)} assume !(0 == ~cond); {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,525 INFO L290 TraceCheckUtils]: 138: Hoare triple {16996#(<= ~counter~0 5)} assume true; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,525 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {16996#(<= ~counter~0 5)} {16996#(<= ~counter~0 5)} #65#return; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,525 INFO L272 TraceCheckUtils]: 140: Hoare triple {16996#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,526 INFO L290 TraceCheckUtils]: 141: Hoare triple {16996#(<= ~counter~0 5)} ~cond := #in~cond; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,526 INFO L290 TraceCheckUtils]: 142: Hoare triple {16996#(<= ~counter~0 5)} assume !(0 == ~cond); {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,526 INFO L290 TraceCheckUtils]: 143: Hoare triple {16996#(<= ~counter~0 5)} assume true; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,526 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {16996#(<= ~counter~0 5)} {16996#(<= ~counter~0 5)} #67#return; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,527 INFO L290 TraceCheckUtils]: 145: Hoare triple {16996#(<= ~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; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:55,527 INFO L290 TraceCheckUtils]: 146: Hoare triple {16996#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,528 INFO L290 TraceCheckUtils]: 147: Hoare triple {17081#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,528 INFO L272 TraceCheckUtils]: 148: Hoare triple {17081#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,528 INFO L290 TraceCheckUtils]: 149: Hoare triple {17081#(<= ~counter~0 6)} ~cond := #in~cond; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,528 INFO L290 TraceCheckUtils]: 150: Hoare triple {17081#(<= ~counter~0 6)} assume !(0 == ~cond); {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,529 INFO L290 TraceCheckUtils]: 151: Hoare triple {17081#(<= ~counter~0 6)} assume true; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,529 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {17081#(<= ~counter~0 6)} {17081#(<= ~counter~0 6)} #59#return; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,529 INFO L272 TraceCheckUtils]: 153: Hoare triple {17081#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,529 INFO L290 TraceCheckUtils]: 154: Hoare triple {17081#(<= ~counter~0 6)} ~cond := #in~cond; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,530 INFO L290 TraceCheckUtils]: 155: Hoare triple {17081#(<= ~counter~0 6)} assume !(0 == ~cond); {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,530 INFO L290 TraceCheckUtils]: 156: Hoare triple {17081#(<= ~counter~0 6)} assume true; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,530 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {17081#(<= ~counter~0 6)} {17081#(<= ~counter~0 6)} #61#return; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,531 INFO L272 TraceCheckUtils]: 158: Hoare triple {17081#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,531 INFO L290 TraceCheckUtils]: 159: Hoare triple {17081#(<= ~counter~0 6)} ~cond := #in~cond; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,531 INFO L290 TraceCheckUtils]: 160: Hoare triple {17081#(<= ~counter~0 6)} assume !(0 == ~cond); {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,531 INFO L290 TraceCheckUtils]: 161: Hoare triple {17081#(<= ~counter~0 6)} assume true; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,532 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {17081#(<= ~counter~0 6)} {17081#(<= ~counter~0 6)} #63#return; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,532 INFO L272 TraceCheckUtils]: 163: Hoare triple {17081#(<= ~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)); {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,532 INFO L290 TraceCheckUtils]: 164: Hoare triple {17081#(<= ~counter~0 6)} ~cond := #in~cond; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,532 INFO L290 TraceCheckUtils]: 165: Hoare triple {17081#(<= ~counter~0 6)} assume !(0 == ~cond); {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,533 INFO L290 TraceCheckUtils]: 166: Hoare triple {17081#(<= ~counter~0 6)} assume true; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,533 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {17081#(<= ~counter~0 6)} {17081#(<= ~counter~0 6)} #65#return; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,533 INFO L272 TraceCheckUtils]: 168: Hoare triple {17081#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,534 INFO L290 TraceCheckUtils]: 169: Hoare triple {17081#(<= ~counter~0 6)} ~cond := #in~cond; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,534 INFO L290 TraceCheckUtils]: 170: Hoare triple {17081#(<= ~counter~0 6)} assume !(0 == ~cond); {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,534 INFO L290 TraceCheckUtils]: 171: Hoare triple {17081#(<= ~counter~0 6)} assume true; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,534 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {17081#(<= ~counter~0 6)} {17081#(<= ~counter~0 6)} #67#return; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,534 INFO L290 TraceCheckUtils]: 173: Hoare triple {17081#(<= ~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; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:55,535 INFO L290 TraceCheckUtils]: 174: Hoare triple {17081#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17166#(<= |main_#t~post5| 6)} is VALID [2022-04-08 11:14:55,535 INFO L290 TraceCheckUtils]: 175: Hoare triple {17166#(<= |main_#t~post5| 6)} assume !(#t~post5 < 10);havoc #t~post5; {16633#false} is VALID [2022-04-08 11:14:55,535 INFO L272 TraceCheckUtils]: 176: Hoare triple {16633#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16633#false} is VALID [2022-04-08 11:14:55,535 INFO L290 TraceCheckUtils]: 177: Hoare triple {16633#false} ~cond := #in~cond; {16633#false} is VALID [2022-04-08 11:14:55,535 INFO L290 TraceCheckUtils]: 178: Hoare triple {16633#false} assume !(0 == ~cond); {16633#false} is VALID [2022-04-08 11:14:55,535 INFO L290 TraceCheckUtils]: 179: Hoare triple {16633#false} assume true; {16633#false} is VALID [2022-04-08 11:14:55,535 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {16633#false} {16633#false} #69#return; {16633#false} is VALID [2022-04-08 11:14:55,536 INFO L272 TraceCheckUtils]: 181: Hoare triple {16633#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {16633#false} is VALID [2022-04-08 11:14:55,536 INFO L290 TraceCheckUtils]: 182: Hoare triple {16633#false} ~cond := #in~cond; {16633#false} is VALID [2022-04-08 11:14:55,536 INFO L290 TraceCheckUtils]: 183: Hoare triple {16633#false} assume 0 == ~cond; {16633#false} is VALID [2022-04-08 11:14:55,536 INFO L290 TraceCheckUtils]: 184: Hoare triple {16633#false} assume !false; {16633#false} is VALID [2022-04-08 11:14:55,537 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-08 11:14:55,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:14:56,001 INFO L290 TraceCheckUtils]: 184: Hoare triple {16633#false} assume !false; {16633#false} is VALID [2022-04-08 11:14:56,001 INFO L290 TraceCheckUtils]: 183: Hoare triple {16633#false} assume 0 == ~cond; {16633#false} is VALID [2022-04-08 11:14:56,001 INFO L290 TraceCheckUtils]: 182: Hoare triple {16633#false} ~cond := #in~cond; {16633#false} is VALID [2022-04-08 11:14:56,001 INFO L272 TraceCheckUtils]: 181: Hoare triple {16633#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {16633#false} is VALID [2022-04-08 11:14:56,002 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {16632#true} {16633#false} #69#return; {16633#false} is VALID [2022-04-08 11:14:56,002 INFO L290 TraceCheckUtils]: 179: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,002 INFO L290 TraceCheckUtils]: 178: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,002 INFO L290 TraceCheckUtils]: 177: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,002 INFO L272 TraceCheckUtils]: 176: Hoare triple {16633#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,002 INFO L290 TraceCheckUtils]: 175: Hoare triple {17224#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {16633#false} is VALID [2022-04-08 11:14:56,002 INFO L290 TraceCheckUtils]: 174: Hoare triple {17228#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17224#(< |main_#t~post5| 10)} is VALID [2022-04-08 11:14:56,002 INFO L290 TraceCheckUtils]: 173: Hoare triple {17228#(< ~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; {17228#(< ~counter~0 10)} is VALID [2022-04-08 11:14:56,003 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {16632#true} {17228#(< ~counter~0 10)} #67#return; {17228#(< ~counter~0 10)} is VALID [2022-04-08 11:14:56,003 INFO L290 TraceCheckUtils]: 171: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,003 INFO L290 TraceCheckUtils]: 170: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,003 INFO L290 TraceCheckUtils]: 169: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,003 INFO L272 TraceCheckUtils]: 168: Hoare triple {17228#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,003 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {16632#true} {17228#(< ~counter~0 10)} #65#return; {17228#(< ~counter~0 10)} is VALID [2022-04-08 11:14:56,003 INFO L290 TraceCheckUtils]: 166: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,004 INFO L290 TraceCheckUtils]: 165: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,004 INFO L290 TraceCheckUtils]: 164: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,004 INFO L272 TraceCheckUtils]: 163: Hoare triple {17228#(< ~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)); {16632#true} is VALID [2022-04-08 11:14:56,004 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {16632#true} {17228#(< ~counter~0 10)} #63#return; {17228#(< ~counter~0 10)} is VALID [2022-04-08 11:14:56,004 INFO L290 TraceCheckUtils]: 161: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,004 INFO L290 TraceCheckUtils]: 160: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,004 INFO L290 TraceCheckUtils]: 159: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,004 INFO L272 TraceCheckUtils]: 158: Hoare triple {17228#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,005 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {16632#true} {17228#(< ~counter~0 10)} #61#return; {17228#(< ~counter~0 10)} is VALID [2022-04-08 11:14:56,005 INFO L290 TraceCheckUtils]: 156: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,005 INFO L290 TraceCheckUtils]: 155: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,005 INFO L290 TraceCheckUtils]: 154: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,005 INFO L272 TraceCheckUtils]: 153: Hoare triple {17228#(< ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,005 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {16632#true} {17228#(< ~counter~0 10)} #59#return; {17228#(< ~counter~0 10)} is VALID [2022-04-08 11:14:56,005 INFO L290 TraceCheckUtils]: 151: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,005 INFO L290 TraceCheckUtils]: 150: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,005 INFO L290 TraceCheckUtils]: 149: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,005 INFO L272 TraceCheckUtils]: 148: Hoare triple {17228#(< ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,006 INFO L290 TraceCheckUtils]: 147: Hoare triple {17228#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {17228#(< ~counter~0 10)} is VALID [2022-04-08 11:14:56,006 INFO L290 TraceCheckUtils]: 146: Hoare triple {17313#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17228#(< ~counter~0 10)} is VALID [2022-04-08 11:14:56,006 INFO L290 TraceCheckUtils]: 145: Hoare triple {17313#(< ~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; {17313#(< ~counter~0 9)} is VALID [2022-04-08 11:14:56,007 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {16632#true} {17313#(< ~counter~0 9)} #67#return; {17313#(< ~counter~0 9)} is VALID [2022-04-08 11:14:56,007 INFO L290 TraceCheckUtils]: 143: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,007 INFO L290 TraceCheckUtils]: 142: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,007 INFO L290 TraceCheckUtils]: 141: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,007 INFO L272 TraceCheckUtils]: 140: Hoare triple {17313#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,007 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {16632#true} {17313#(< ~counter~0 9)} #65#return; {17313#(< ~counter~0 9)} is VALID [2022-04-08 11:14:56,007 INFO L290 TraceCheckUtils]: 138: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,007 INFO L290 TraceCheckUtils]: 137: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,007 INFO L290 TraceCheckUtils]: 136: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,007 INFO L272 TraceCheckUtils]: 135: Hoare triple {17313#(< ~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)); {16632#true} is VALID [2022-04-08 11:14:56,008 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {16632#true} {17313#(< ~counter~0 9)} #63#return; {17313#(< ~counter~0 9)} is VALID [2022-04-08 11:14:56,008 INFO L290 TraceCheckUtils]: 133: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,008 INFO L290 TraceCheckUtils]: 132: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,008 INFO L290 TraceCheckUtils]: 131: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,008 INFO L272 TraceCheckUtils]: 130: Hoare triple {17313#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,008 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {16632#true} {17313#(< ~counter~0 9)} #61#return; {17313#(< ~counter~0 9)} is VALID [2022-04-08 11:14:56,008 INFO L290 TraceCheckUtils]: 128: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,008 INFO L290 TraceCheckUtils]: 127: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,008 INFO L290 TraceCheckUtils]: 126: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,009 INFO L272 TraceCheckUtils]: 125: Hoare triple {17313#(< ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,031 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {16632#true} {17313#(< ~counter~0 9)} #59#return; {17313#(< ~counter~0 9)} is VALID [2022-04-08 11:14:56,031 INFO L290 TraceCheckUtils]: 123: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,031 INFO L290 TraceCheckUtils]: 122: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,031 INFO L290 TraceCheckUtils]: 121: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,031 INFO L272 TraceCheckUtils]: 120: Hoare triple {17313#(< ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,032 INFO L290 TraceCheckUtils]: 119: Hoare triple {17313#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {17313#(< ~counter~0 9)} is VALID [2022-04-08 11:14:56,032 INFO L290 TraceCheckUtils]: 118: Hoare triple {17398#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17313#(< ~counter~0 9)} is VALID [2022-04-08 11:14:56,032 INFO L290 TraceCheckUtils]: 117: Hoare triple {17398#(< ~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; {17398#(< ~counter~0 8)} is VALID [2022-04-08 11:14:56,033 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {16632#true} {17398#(< ~counter~0 8)} #67#return; {17398#(< ~counter~0 8)} is VALID [2022-04-08 11:14:56,033 INFO L290 TraceCheckUtils]: 115: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,033 INFO L290 TraceCheckUtils]: 114: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,033 INFO L290 TraceCheckUtils]: 113: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,033 INFO L272 TraceCheckUtils]: 112: Hoare triple {17398#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,033 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {16632#true} {17398#(< ~counter~0 8)} #65#return; {17398#(< ~counter~0 8)} is VALID [2022-04-08 11:14:56,033 INFO L290 TraceCheckUtils]: 110: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,033 INFO L290 TraceCheckUtils]: 109: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,033 INFO L290 TraceCheckUtils]: 108: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,034 INFO L272 TraceCheckUtils]: 107: Hoare triple {17398#(< ~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)); {16632#true} is VALID [2022-04-08 11:14:56,034 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {16632#true} {17398#(< ~counter~0 8)} #63#return; {17398#(< ~counter~0 8)} is VALID [2022-04-08 11:14:56,034 INFO L290 TraceCheckUtils]: 105: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,034 INFO L290 TraceCheckUtils]: 104: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,034 INFO L290 TraceCheckUtils]: 103: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,034 INFO L272 TraceCheckUtils]: 102: Hoare triple {17398#(< ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,034 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {16632#true} {17398#(< ~counter~0 8)} #61#return; {17398#(< ~counter~0 8)} is VALID [2022-04-08 11:14:56,034 INFO L290 TraceCheckUtils]: 100: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,034 INFO L290 TraceCheckUtils]: 99: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,035 INFO L290 TraceCheckUtils]: 98: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,035 INFO L272 TraceCheckUtils]: 97: Hoare triple {17398#(< ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,035 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {16632#true} {17398#(< ~counter~0 8)} #59#return; {17398#(< ~counter~0 8)} is VALID [2022-04-08 11:14:56,035 INFO L290 TraceCheckUtils]: 95: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,035 INFO L290 TraceCheckUtils]: 94: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,035 INFO L290 TraceCheckUtils]: 93: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,035 INFO L272 TraceCheckUtils]: 92: Hoare triple {17398#(< ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,035 INFO L290 TraceCheckUtils]: 91: Hoare triple {17398#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {17398#(< ~counter~0 8)} is VALID [2022-04-08 11:14:56,036 INFO L290 TraceCheckUtils]: 90: Hoare triple {17081#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17398#(< ~counter~0 8)} is VALID [2022-04-08 11:14:56,036 INFO L290 TraceCheckUtils]: 89: Hoare triple {17081#(<= ~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; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:56,036 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {16632#true} {17081#(<= ~counter~0 6)} #67#return; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:56,036 INFO L290 TraceCheckUtils]: 87: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,036 INFO L290 TraceCheckUtils]: 86: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,036 INFO L290 TraceCheckUtils]: 85: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,036 INFO L272 TraceCheckUtils]: 84: Hoare triple {17081#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,037 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {16632#true} {17081#(<= ~counter~0 6)} #65#return; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:56,037 INFO L290 TraceCheckUtils]: 82: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,037 INFO L290 TraceCheckUtils]: 81: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,037 INFO L290 TraceCheckUtils]: 80: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,037 INFO L272 TraceCheckUtils]: 79: Hoare triple {17081#(<= ~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)); {16632#true} is VALID [2022-04-08 11:14:56,037 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {16632#true} {17081#(<= ~counter~0 6)} #63#return; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:56,037 INFO L290 TraceCheckUtils]: 77: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,037 INFO L290 TraceCheckUtils]: 76: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,038 INFO L290 TraceCheckUtils]: 75: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,038 INFO L272 TraceCheckUtils]: 74: Hoare triple {17081#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,038 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16632#true} {17081#(<= ~counter~0 6)} #61#return; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:56,038 INFO L290 TraceCheckUtils]: 72: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,038 INFO L290 TraceCheckUtils]: 71: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,038 INFO L290 TraceCheckUtils]: 70: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,038 INFO L272 TraceCheckUtils]: 69: Hoare triple {17081#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,038 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {16632#true} {17081#(<= ~counter~0 6)} #59#return; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:56,038 INFO L290 TraceCheckUtils]: 67: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,039 INFO L290 TraceCheckUtils]: 66: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,039 INFO L290 TraceCheckUtils]: 65: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,039 INFO L272 TraceCheckUtils]: 64: Hoare triple {17081#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {17081#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:56,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {16996#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17081#(<= ~counter~0 6)} is VALID [2022-04-08 11:14:56,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {16996#(<= ~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; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:56,040 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16632#true} {16996#(<= ~counter~0 5)} #67#return; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:56,040 INFO L290 TraceCheckUtils]: 59: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,040 INFO L290 TraceCheckUtils]: 58: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,040 INFO L290 TraceCheckUtils]: 57: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,040 INFO L272 TraceCheckUtils]: 56: Hoare triple {16996#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,040 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16632#true} {16996#(<= ~counter~0 5)} #65#return; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:56,040 INFO L290 TraceCheckUtils]: 54: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,040 INFO L290 TraceCheckUtils]: 53: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,040 INFO L290 TraceCheckUtils]: 52: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,041 INFO L272 TraceCheckUtils]: 51: Hoare triple {16996#(<= ~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)); {16632#true} is VALID [2022-04-08 11:14:56,041 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16632#true} {16996#(<= ~counter~0 5)} #63#return; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:56,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,041 INFO L290 TraceCheckUtils]: 47: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,041 INFO L272 TraceCheckUtils]: 46: Hoare triple {16996#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,041 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16632#true} {16996#(<= ~counter~0 5)} #61#return; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:56,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,041 INFO L290 TraceCheckUtils]: 43: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,042 INFO L272 TraceCheckUtils]: 41: Hoare triple {16996#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,042 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16632#true} {16996#(<= ~counter~0 5)} #59#return; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:56,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,042 INFO L290 TraceCheckUtils]: 38: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,042 INFO L290 TraceCheckUtils]: 37: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,042 INFO L272 TraceCheckUtils]: 36: Hoare triple {16996#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {16996#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:56,043 INFO L290 TraceCheckUtils]: 34: Hoare triple {16911#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16996#(<= ~counter~0 5)} is VALID [2022-04-08 11:14:56,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {16911#(<= ~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; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:56,043 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16632#true} {16911#(<= ~counter~0 4)} #67#return; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:56,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,043 INFO L272 TraceCheckUtils]: 28: Hoare triple {16911#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,044 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16632#true} {16911#(<= ~counter~0 4)} #65#return; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:56,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,044 INFO L272 TraceCheckUtils]: 23: Hoare triple {16911#(<= ~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)); {16632#true} is VALID [2022-04-08 11:14:56,044 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16632#true} {16911#(<= ~counter~0 4)} #63#return; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:56,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,045 INFO L272 TraceCheckUtils]: 18: Hoare triple {16911#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,045 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16632#true} {16911#(<= ~counter~0 4)} #61#return; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:56,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,045 INFO L272 TraceCheckUtils]: 13: Hoare triple {16911#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,045 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16632#true} {16911#(<= ~counter~0 4)} #59#return; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:56,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-04-08 11:14:56,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {16632#true} assume !(0 == ~cond); {16632#true} is VALID [2022-04-08 11:14:56,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {16632#true} ~cond := #in~cond; {16632#true} is VALID [2022-04-08 11:14:56,046 INFO L272 TraceCheckUtils]: 8: Hoare triple {16911#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16632#true} is VALID [2022-04-08 11:14:56,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {16911#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:56,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {16826#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16911#(<= ~counter~0 4)} is VALID [2022-04-08 11:14:56,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {16826#(<= ~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; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:56,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {16826#(<= ~counter~0 3)} call #t~ret6 := main(); {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:56,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16826#(<= ~counter~0 3)} {16632#true} #81#return; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:56,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {16826#(<= ~counter~0 3)} assume true; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:56,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#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; {16826#(<= ~counter~0 3)} is VALID [2022-04-08 11:14:56,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {16632#true} call ULTIMATE.init(); {16632#true} is VALID [2022-04-08 11:14:56,048 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-08 11:14:56,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:14:56,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120515109] [2022-04-08 11:14:56,048 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:14:56,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340853695] [2022-04-08 11:14:56,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340853695] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:14:56,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:14:56,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-08 11:14:56,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:14:56,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1102261467] [2022-04-08 11:14:56,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1102261467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:14:56,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:14:56,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 11:14:56,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037210056] [2022-04-08 11:14:56,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:14:56,050 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-08 11:14:56,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:14:56,050 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-08 11:14:56,107 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-08 11:14:56,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 11:14:56,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:14:56,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 11:14:56,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 11:14:56,108 INFO L87 Difference]: Start difference. First operand 133 states and 148 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-08 11:14:57,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:57,316 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2022-04-08 11:14:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 11:14:57,317 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-08 11:14:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:14:57,317 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-08 11:14:57,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 139 transitions. [2022-04-08 11:14:57,319 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-08 11:14:57,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 139 transitions. [2022-04-08 11:14:57,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 139 transitions. [2022-04-08 11:14:57,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:14:57,488 INFO L225 Difference]: With dead ends: 162 [2022-04-08 11:14:57,488 INFO L226 Difference]: Without dead ends: 149 [2022-04-08 11:14:57,489 INFO L912 BasicCegarLoop]: 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-08 11:14:57,491 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:14:57,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 176 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:14:57,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-08 11:14:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-04-08 11:14:57,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:14:57,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 149 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 88 states have internal predecessors, (89), 40 states have call successors, (40), 22 states have call predecessors, (40), 21 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 11:14:57,674 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 149 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 88 states have internal predecessors, (89), 40 states have call successors, (40), 22 states have call predecessors, (40), 21 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 11:14:57,674 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 149 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 88 states have internal predecessors, (89), 40 states have call successors, (40), 22 states have call predecessors, (40), 21 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 11:14:57,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:57,676 INFO L93 Difference]: Finished difference Result 149 states and 167 transitions. [2022-04-08 11:14:57,676 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2022-04-08 11:14:57,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:14:57,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:14:57,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 88 states have internal predecessors, (89), 40 states have call successors, (40), 22 states have call predecessors, (40), 21 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand 149 states. [2022-04-08 11:14:57,678 INFO L87 Difference]: Start difference. First operand has 149 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 88 states have internal predecessors, (89), 40 states have call successors, (40), 22 states have call predecessors, (40), 21 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand 149 states. [2022-04-08 11:14:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:57,680 INFO L93 Difference]: Finished difference Result 149 states and 167 transitions. [2022-04-08 11:14:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2022-04-08 11:14:57,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:14:57,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:14:57,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:14:57,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:14:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 88 states have internal predecessors, (89), 40 states have call successors, (40), 22 states have call predecessors, (40), 21 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 11:14:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions. [2022-04-08 11:14:57,683 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 185 [2022-04-08 11:14:57,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:14:57,683 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions. [2022-04-08 11:14:57,683 INFO L479 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-08 11:14:57,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 167 transitions. [2022-04-08 11:15:05,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 165 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 11:15:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2022-04-08 11:15:05,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-04-08 11:15:05,491 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:15:05,491 INFO L499 BasicCegarLoop]: 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-08 11:15:05,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-08 11:15:05,692 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:15:05,692 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:15:05,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:15:05,693 INFO L85 PathProgramCache]: Analyzing trace with hash -654931098, now seen corresponding path program 13 times [2022-04-08 11:15:05,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:15:05,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [648099376] [2022-04-08 11:15:05,961 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:15:05,961 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:15:05,961 INFO L85 PathProgramCache]: Analyzing trace with hash -654931098, now seen corresponding path program 14 times [2022-04-08 11:15:05,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:15:05,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543677923] [2022-04-08 11:15:05,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:15:05,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:15:05,976 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:15:05,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1300251177] [2022-04-08 11:15:05,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:15:05,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:15:05,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:15:05,983 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:15:05,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 11:15:06,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:15:06,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:15:06,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 11:15:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:15:06,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:15:06,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {18687#true} call ULTIMATE.init(); {18687#true} is VALID [2022-04-08 11:15:06,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {18687#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; {18695#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:06,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {18695#(<= ~counter~0 0)} assume true; {18695#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:06,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18695#(<= ~counter~0 0)} {18687#true} #81#return; {18695#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:06,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {18695#(<= ~counter~0 0)} call #t~ret6 := main(); {18695#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:06,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {18695#(<= ~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; {18695#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:06,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {18695#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {18711#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,865 INFO L272 TraceCheckUtils]: 8: Hoare triple {18711#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {18711#(<= ~counter~0 1)} ~cond := #in~cond; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {18711#(<= ~counter~0 1)} assume !(0 == ~cond); {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {18711#(<= ~counter~0 1)} assume true; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,866 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18711#(<= ~counter~0 1)} {18711#(<= ~counter~0 1)} #59#return; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,867 INFO L272 TraceCheckUtils]: 13: Hoare triple {18711#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {18711#(<= ~counter~0 1)} ~cond := #in~cond; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {18711#(<= ~counter~0 1)} assume !(0 == ~cond); {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {18711#(<= ~counter~0 1)} assume true; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,868 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18711#(<= ~counter~0 1)} {18711#(<= ~counter~0 1)} #61#return; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,868 INFO L272 TraceCheckUtils]: 18: Hoare triple {18711#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {18711#(<= ~counter~0 1)} ~cond := #in~cond; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {18711#(<= ~counter~0 1)} assume !(0 == ~cond); {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {18711#(<= ~counter~0 1)} assume true; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,870 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18711#(<= ~counter~0 1)} {18711#(<= ~counter~0 1)} #63#return; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,870 INFO L272 TraceCheckUtils]: 23: Hoare triple {18711#(<= ~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)); {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {18711#(<= ~counter~0 1)} ~cond := #in~cond; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {18711#(<= ~counter~0 1)} assume !(0 == ~cond); {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {18711#(<= ~counter~0 1)} assume true; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,871 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {18711#(<= ~counter~0 1)} {18711#(<= ~counter~0 1)} #65#return; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,872 INFO L272 TraceCheckUtils]: 28: Hoare triple {18711#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {18711#(<= ~counter~0 1)} ~cond := #in~cond; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {18711#(<= ~counter~0 1)} assume !(0 == ~cond); {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {18711#(<= ~counter~0 1)} assume true; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,873 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18711#(<= ~counter~0 1)} {18711#(<= ~counter~0 1)} #67#return; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {18711#(<= ~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; {18711#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:06,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {18711#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,874 INFO L290 TraceCheckUtils]: 35: Hoare triple {18796#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,875 INFO L272 TraceCheckUtils]: 36: Hoare triple {18796#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {18796#(<= ~counter~0 2)} ~cond := #in~cond; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {18796#(<= ~counter~0 2)} assume !(0 == ~cond); {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,876 INFO L290 TraceCheckUtils]: 39: Hoare triple {18796#(<= ~counter~0 2)} assume true; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,876 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18796#(<= ~counter~0 2)} {18796#(<= ~counter~0 2)} #59#return; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,876 INFO L272 TraceCheckUtils]: 41: Hoare triple {18796#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,877 INFO L290 TraceCheckUtils]: 42: Hoare triple {18796#(<= ~counter~0 2)} ~cond := #in~cond; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,877 INFO L290 TraceCheckUtils]: 43: Hoare triple {18796#(<= ~counter~0 2)} assume !(0 == ~cond); {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,877 INFO L290 TraceCheckUtils]: 44: Hoare triple {18796#(<= ~counter~0 2)} assume true; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,878 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {18796#(<= ~counter~0 2)} {18796#(<= ~counter~0 2)} #61#return; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,878 INFO L272 TraceCheckUtils]: 46: Hoare triple {18796#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,878 INFO L290 TraceCheckUtils]: 47: Hoare triple {18796#(<= ~counter~0 2)} ~cond := #in~cond; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,879 INFO L290 TraceCheckUtils]: 48: Hoare triple {18796#(<= ~counter~0 2)} assume !(0 == ~cond); {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,879 INFO L290 TraceCheckUtils]: 49: Hoare triple {18796#(<= ~counter~0 2)} assume true; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,879 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18796#(<= ~counter~0 2)} {18796#(<= ~counter~0 2)} #63#return; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,880 INFO L272 TraceCheckUtils]: 51: Hoare triple {18796#(<= ~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)); {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,880 INFO L290 TraceCheckUtils]: 52: Hoare triple {18796#(<= ~counter~0 2)} ~cond := #in~cond; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,880 INFO L290 TraceCheckUtils]: 53: Hoare triple {18796#(<= ~counter~0 2)} assume !(0 == ~cond); {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,881 INFO L290 TraceCheckUtils]: 54: Hoare triple {18796#(<= ~counter~0 2)} assume true; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,881 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18796#(<= ~counter~0 2)} {18796#(<= ~counter~0 2)} #65#return; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,882 INFO L272 TraceCheckUtils]: 56: Hoare triple {18796#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {18796#(<= ~counter~0 2)} ~cond := #in~cond; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,882 INFO L290 TraceCheckUtils]: 58: Hoare triple {18796#(<= ~counter~0 2)} assume !(0 == ~cond); {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,882 INFO L290 TraceCheckUtils]: 59: Hoare triple {18796#(<= ~counter~0 2)} assume true; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,883 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18796#(<= ~counter~0 2)} {18796#(<= ~counter~0 2)} #67#return; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,883 INFO L290 TraceCheckUtils]: 61: Hoare triple {18796#(<= ~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; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:06,884 INFO L290 TraceCheckUtils]: 62: Hoare triple {18796#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,884 INFO L290 TraceCheckUtils]: 63: Hoare triple {18881#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,885 INFO L272 TraceCheckUtils]: 64: Hoare triple {18881#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,885 INFO L290 TraceCheckUtils]: 65: Hoare triple {18881#(<= ~counter~0 3)} ~cond := #in~cond; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,885 INFO L290 TraceCheckUtils]: 66: Hoare triple {18881#(<= ~counter~0 3)} assume !(0 == ~cond); {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,885 INFO L290 TraceCheckUtils]: 67: Hoare triple {18881#(<= ~counter~0 3)} assume true; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,886 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18881#(<= ~counter~0 3)} {18881#(<= ~counter~0 3)} #59#return; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,886 INFO L272 TraceCheckUtils]: 69: Hoare triple {18881#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,887 INFO L290 TraceCheckUtils]: 70: Hoare triple {18881#(<= ~counter~0 3)} ~cond := #in~cond; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,887 INFO L290 TraceCheckUtils]: 71: Hoare triple {18881#(<= ~counter~0 3)} assume !(0 == ~cond); {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,887 INFO L290 TraceCheckUtils]: 72: Hoare triple {18881#(<= ~counter~0 3)} assume true; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,888 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {18881#(<= ~counter~0 3)} {18881#(<= ~counter~0 3)} #61#return; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,888 INFO L272 TraceCheckUtils]: 74: Hoare triple {18881#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,888 INFO L290 TraceCheckUtils]: 75: Hoare triple {18881#(<= ~counter~0 3)} ~cond := #in~cond; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,889 INFO L290 TraceCheckUtils]: 76: Hoare triple {18881#(<= ~counter~0 3)} assume !(0 == ~cond); {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,889 INFO L290 TraceCheckUtils]: 77: Hoare triple {18881#(<= ~counter~0 3)} assume true; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,889 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {18881#(<= ~counter~0 3)} {18881#(<= ~counter~0 3)} #63#return; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,890 INFO L272 TraceCheckUtils]: 79: Hoare triple {18881#(<= ~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)); {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,890 INFO L290 TraceCheckUtils]: 80: Hoare triple {18881#(<= ~counter~0 3)} ~cond := #in~cond; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,890 INFO L290 TraceCheckUtils]: 81: Hoare triple {18881#(<= ~counter~0 3)} assume !(0 == ~cond); {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,891 INFO L290 TraceCheckUtils]: 82: Hoare triple {18881#(<= ~counter~0 3)} assume true; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,891 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {18881#(<= ~counter~0 3)} {18881#(<= ~counter~0 3)} #65#return; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,891 INFO L272 TraceCheckUtils]: 84: Hoare triple {18881#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,892 INFO L290 TraceCheckUtils]: 85: Hoare triple {18881#(<= ~counter~0 3)} ~cond := #in~cond; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,892 INFO L290 TraceCheckUtils]: 86: Hoare triple {18881#(<= ~counter~0 3)} assume !(0 == ~cond); {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,892 INFO L290 TraceCheckUtils]: 87: Hoare triple {18881#(<= ~counter~0 3)} assume true; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,893 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {18881#(<= ~counter~0 3)} {18881#(<= ~counter~0 3)} #67#return; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,893 INFO L290 TraceCheckUtils]: 89: Hoare triple {18881#(<= ~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; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:06,894 INFO L290 TraceCheckUtils]: 90: Hoare triple {18881#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,894 INFO L290 TraceCheckUtils]: 91: Hoare triple {18966#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,895 INFO L272 TraceCheckUtils]: 92: Hoare triple {18966#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,895 INFO L290 TraceCheckUtils]: 93: Hoare triple {18966#(<= ~counter~0 4)} ~cond := #in~cond; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,895 INFO L290 TraceCheckUtils]: 94: Hoare triple {18966#(<= ~counter~0 4)} assume !(0 == ~cond); {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,895 INFO L290 TraceCheckUtils]: 95: Hoare triple {18966#(<= ~counter~0 4)} assume true; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,896 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {18966#(<= ~counter~0 4)} {18966#(<= ~counter~0 4)} #59#return; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,896 INFO L272 TraceCheckUtils]: 97: Hoare triple {18966#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,896 INFO L290 TraceCheckUtils]: 98: Hoare triple {18966#(<= ~counter~0 4)} ~cond := #in~cond; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,897 INFO L290 TraceCheckUtils]: 99: Hoare triple {18966#(<= ~counter~0 4)} assume !(0 == ~cond); {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,897 INFO L290 TraceCheckUtils]: 100: Hoare triple {18966#(<= ~counter~0 4)} assume true; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,897 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {18966#(<= ~counter~0 4)} {18966#(<= ~counter~0 4)} #61#return; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,898 INFO L272 TraceCheckUtils]: 102: Hoare triple {18966#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,898 INFO L290 TraceCheckUtils]: 103: Hoare triple {18966#(<= ~counter~0 4)} ~cond := #in~cond; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,898 INFO L290 TraceCheckUtils]: 104: Hoare triple {18966#(<= ~counter~0 4)} assume !(0 == ~cond); {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,899 INFO L290 TraceCheckUtils]: 105: Hoare triple {18966#(<= ~counter~0 4)} assume true; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,899 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {18966#(<= ~counter~0 4)} {18966#(<= ~counter~0 4)} #63#return; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,900 INFO L272 TraceCheckUtils]: 107: Hoare triple {18966#(<= ~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)); {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,900 INFO L290 TraceCheckUtils]: 108: Hoare triple {18966#(<= ~counter~0 4)} ~cond := #in~cond; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,900 INFO L290 TraceCheckUtils]: 109: Hoare triple {18966#(<= ~counter~0 4)} assume !(0 == ~cond); {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,900 INFO L290 TraceCheckUtils]: 110: Hoare triple {18966#(<= ~counter~0 4)} assume true; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,901 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {18966#(<= ~counter~0 4)} {18966#(<= ~counter~0 4)} #65#return; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,901 INFO L272 TraceCheckUtils]: 112: Hoare triple {18966#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,902 INFO L290 TraceCheckUtils]: 113: Hoare triple {18966#(<= ~counter~0 4)} ~cond := #in~cond; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,902 INFO L290 TraceCheckUtils]: 114: Hoare triple {18966#(<= ~counter~0 4)} assume !(0 == ~cond); {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,902 INFO L290 TraceCheckUtils]: 115: Hoare triple {18966#(<= ~counter~0 4)} assume true; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,903 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {18966#(<= ~counter~0 4)} {18966#(<= ~counter~0 4)} #67#return; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,903 INFO L290 TraceCheckUtils]: 117: Hoare triple {18966#(<= ~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; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:06,904 INFO L290 TraceCheckUtils]: 118: Hoare triple {18966#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,904 INFO L290 TraceCheckUtils]: 119: Hoare triple {19051#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,904 INFO L272 TraceCheckUtils]: 120: Hoare triple {19051#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,905 INFO L290 TraceCheckUtils]: 121: Hoare triple {19051#(<= ~counter~0 5)} ~cond := #in~cond; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,905 INFO L290 TraceCheckUtils]: 122: Hoare triple {19051#(<= ~counter~0 5)} assume !(0 == ~cond); {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,905 INFO L290 TraceCheckUtils]: 123: Hoare triple {19051#(<= ~counter~0 5)} assume true; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,906 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {19051#(<= ~counter~0 5)} {19051#(<= ~counter~0 5)} #59#return; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,906 INFO L272 TraceCheckUtils]: 125: Hoare triple {19051#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,906 INFO L290 TraceCheckUtils]: 126: Hoare triple {19051#(<= ~counter~0 5)} ~cond := #in~cond; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,907 INFO L290 TraceCheckUtils]: 127: Hoare triple {19051#(<= ~counter~0 5)} assume !(0 == ~cond); {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,907 INFO L290 TraceCheckUtils]: 128: Hoare triple {19051#(<= ~counter~0 5)} assume true; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,907 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {19051#(<= ~counter~0 5)} {19051#(<= ~counter~0 5)} #61#return; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,908 INFO L272 TraceCheckUtils]: 130: Hoare triple {19051#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,908 INFO L290 TraceCheckUtils]: 131: Hoare triple {19051#(<= ~counter~0 5)} ~cond := #in~cond; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,908 INFO L290 TraceCheckUtils]: 132: Hoare triple {19051#(<= ~counter~0 5)} assume !(0 == ~cond); {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,909 INFO L290 TraceCheckUtils]: 133: Hoare triple {19051#(<= ~counter~0 5)} assume true; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,909 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {19051#(<= ~counter~0 5)} {19051#(<= ~counter~0 5)} #63#return; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,909 INFO L272 TraceCheckUtils]: 135: Hoare triple {19051#(<= ~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)); {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,910 INFO L290 TraceCheckUtils]: 136: Hoare triple {19051#(<= ~counter~0 5)} ~cond := #in~cond; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,910 INFO L290 TraceCheckUtils]: 137: Hoare triple {19051#(<= ~counter~0 5)} assume !(0 == ~cond); {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,910 INFO L290 TraceCheckUtils]: 138: Hoare triple {19051#(<= ~counter~0 5)} assume true; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,911 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {19051#(<= ~counter~0 5)} {19051#(<= ~counter~0 5)} #65#return; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,911 INFO L272 TraceCheckUtils]: 140: Hoare triple {19051#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,911 INFO L290 TraceCheckUtils]: 141: Hoare triple {19051#(<= ~counter~0 5)} ~cond := #in~cond; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,912 INFO L290 TraceCheckUtils]: 142: Hoare triple {19051#(<= ~counter~0 5)} assume !(0 == ~cond); {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,912 INFO L290 TraceCheckUtils]: 143: Hoare triple {19051#(<= ~counter~0 5)} assume true; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,912 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {19051#(<= ~counter~0 5)} {19051#(<= ~counter~0 5)} #67#return; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,913 INFO L290 TraceCheckUtils]: 145: Hoare triple {19051#(<= ~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; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:06,913 INFO L290 TraceCheckUtils]: 146: Hoare triple {19051#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,914 INFO L290 TraceCheckUtils]: 147: Hoare triple {19136#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,914 INFO L272 TraceCheckUtils]: 148: Hoare triple {19136#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,914 INFO L290 TraceCheckUtils]: 149: Hoare triple {19136#(<= ~counter~0 6)} ~cond := #in~cond; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,915 INFO L290 TraceCheckUtils]: 150: Hoare triple {19136#(<= ~counter~0 6)} assume !(0 == ~cond); {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,915 INFO L290 TraceCheckUtils]: 151: Hoare triple {19136#(<= ~counter~0 6)} assume true; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,915 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {19136#(<= ~counter~0 6)} {19136#(<= ~counter~0 6)} #59#return; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,916 INFO L272 TraceCheckUtils]: 153: Hoare triple {19136#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,916 INFO L290 TraceCheckUtils]: 154: Hoare triple {19136#(<= ~counter~0 6)} ~cond := #in~cond; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,917 INFO L290 TraceCheckUtils]: 155: Hoare triple {19136#(<= ~counter~0 6)} assume !(0 == ~cond); {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,917 INFO L290 TraceCheckUtils]: 156: Hoare triple {19136#(<= ~counter~0 6)} assume true; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,917 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {19136#(<= ~counter~0 6)} {19136#(<= ~counter~0 6)} #61#return; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,918 INFO L272 TraceCheckUtils]: 158: Hoare triple {19136#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,918 INFO L290 TraceCheckUtils]: 159: Hoare triple {19136#(<= ~counter~0 6)} ~cond := #in~cond; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,919 INFO L290 TraceCheckUtils]: 160: Hoare triple {19136#(<= ~counter~0 6)} assume !(0 == ~cond); {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,919 INFO L290 TraceCheckUtils]: 161: Hoare triple {19136#(<= ~counter~0 6)} assume true; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,919 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {19136#(<= ~counter~0 6)} {19136#(<= ~counter~0 6)} #63#return; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,920 INFO L272 TraceCheckUtils]: 163: Hoare triple {19136#(<= ~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)); {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,920 INFO L290 TraceCheckUtils]: 164: Hoare triple {19136#(<= ~counter~0 6)} ~cond := #in~cond; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,921 INFO L290 TraceCheckUtils]: 165: Hoare triple {19136#(<= ~counter~0 6)} assume !(0 == ~cond); {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,921 INFO L290 TraceCheckUtils]: 166: Hoare triple {19136#(<= ~counter~0 6)} assume true; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,921 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {19136#(<= ~counter~0 6)} {19136#(<= ~counter~0 6)} #65#return; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,922 INFO L272 TraceCheckUtils]: 168: Hoare triple {19136#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,922 INFO L290 TraceCheckUtils]: 169: Hoare triple {19136#(<= ~counter~0 6)} ~cond := #in~cond; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,923 INFO L290 TraceCheckUtils]: 170: Hoare triple {19136#(<= ~counter~0 6)} assume !(0 == ~cond); {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,923 INFO L290 TraceCheckUtils]: 171: Hoare triple {19136#(<= ~counter~0 6)} assume true; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,923 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {19136#(<= ~counter~0 6)} {19136#(<= ~counter~0 6)} #67#return; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,924 INFO L290 TraceCheckUtils]: 173: Hoare triple {19136#(<= ~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; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:06,924 INFO L290 TraceCheckUtils]: 174: Hoare triple {19136#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,925 INFO L290 TraceCheckUtils]: 175: Hoare triple {19221#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,925 INFO L272 TraceCheckUtils]: 176: Hoare triple {19221#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,926 INFO L290 TraceCheckUtils]: 177: Hoare triple {19221#(<= ~counter~0 7)} ~cond := #in~cond; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,926 INFO L290 TraceCheckUtils]: 178: Hoare triple {19221#(<= ~counter~0 7)} assume !(0 == ~cond); {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,926 INFO L290 TraceCheckUtils]: 179: Hoare triple {19221#(<= ~counter~0 7)} assume true; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,927 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {19221#(<= ~counter~0 7)} {19221#(<= ~counter~0 7)} #59#return; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,927 INFO L272 TraceCheckUtils]: 181: Hoare triple {19221#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,928 INFO L290 TraceCheckUtils]: 182: Hoare triple {19221#(<= ~counter~0 7)} ~cond := #in~cond; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,928 INFO L290 TraceCheckUtils]: 183: Hoare triple {19221#(<= ~counter~0 7)} assume !(0 == ~cond); {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,928 INFO L290 TraceCheckUtils]: 184: Hoare triple {19221#(<= ~counter~0 7)} assume true; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,929 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {19221#(<= ~counter~0 7)} {19221#(<= ~counter~0 7)} #61#return; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,929 INFO L272 TraceCheckUtils]: 186: Hoare triple {19221#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,930 INFO L290 TraceCheckUtils]: 187: Hoare triple {19221#(<= ~counter~0 7)} ~cond := #in~cond; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,930 INFO L290 TraceCheckUtils]: 188: Hoare triple {19221#(<= ~counter~0 7)} assume !(0 == ~cond); {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,930 INFO L290 TraceCheckUtils]: 189: Hoare triple {19221#(<= ~counter~0 7)} assume true; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,931 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {19221#(<= ~counter~0 7)} {19221#(<= ~counter~0 7)} #63#return; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,931 INFO L272 TraceCheckUtils]: 191: Hoare triple {19221#(<= ~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)); {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,932 INFO L290 TraceCheckUtils]: 192: Hoare triple {19221#(<= ~counter~0 7)} ~cond := #in~cond; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,932 INFO L290 TraceCheckUtils]: 193: Hoare triple {19221#(<= ~counter~0 7)} assume !(0 == ~cond); {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,932 INFO L290 TraceCheckUtils]: 194: Hoare triple {19221#(<= ~counter~0 7)} assume true; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,933 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {19221#(<= ~counter~0 7)} {19221#(<= ~counter~0 7)} #65#return; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,933 INFO L272 TraceCheckUtils]: 196: Hoare triple {19221#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,934 INFO L290 TraceCheckUtils]: 197: Hoare triple {19221#(<= ~counter~0 7)} ~cond := #in~cond; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,934 INFO L290 TraceCheckUtils]: 198: Hoare triple {19221#(<= ~counter~0 7)} assume !(0 == ~cond); {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,934 INFO L290 TraceCheckUtils]: 199: Hoare triple {19221#(<= ~counter~0 7)} assume true; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,935 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {19221#(<= ~counter~0 7)} {19221#(<= ~counter~0 7)} #67#return; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,935 INFO L290 TraceCheckUtils]: 201: Hoare triple {19221#(<= ~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; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:06,935 INFO L290 TraceCheckUtils]: 202: Hoare triple {19221#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19306#(<= |main_#t~post5| 7)} is VALID [2022-04-08 11:15:06,936 INFO L290 TraceCheckUtils]: 203: Hoare triple {19306#(<= |main_#t~post5| 7)} assume !(#t~post5 < 10);havoc #t~post5; {18688#false} is VALID [2022-04-08 11:15:06,936 INFO L272 TraceCheckUtils]: 204: Hoare triple {18688#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18688#false} is VALID [2022-04-08 11:15:06,936 INFO L290 TraceCheckUtils]: 205: Hoare triple {18688#false} ~cond := #in~cond; {18688#false} is VALID [2022-04-08 11:15:06,936 INFO L290 TraceCheckUtils]: 206: Hoare triple {18688#false} assume !(0 == ~cond); {18688#false} is VALID [2022-04-08 11:15:06,936 INFO L290 TraceCheckUtils]: 207: Hoare triple {18688#false} assume true; {18688#false} is VALID [2022-04-08 11:15:06,936 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {18688#false} {18688#false} #69#return; {18688#false} is VALID [2022-04-08 11:15:06,936 INFO L272 TraceCheckUtils]: 209: Hoare triple {18688#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {18688#false} is VALID [2022-04-08 11:15:06,936 INFO L290 TraceCheckUtils]: 210: Hoare triple {18688#false} ~cond := #in~cond; {18688#false} is VALID [2022-04-08 11:15:06,936 INFO L290 TraceCheckUtils]: 211: Hoare triple {18688#false} assume 0 == ~cond; {18688#false} is VALID [2022-04-08 11:15:06,936 INFO L290 TraceCheckUtils]: 212: Hoare triple {18688#false} assume !false; {18688#false} is VALID [2022-04-08 11:15:06,937 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-08 11:15:06,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:15:07,509 INFO L290 TraceCheckUtils]: 212: Hoare triple {18688#false} assume !false; {18688#false} is VALID [2022-04-08 11:15:07,509 INFO L290 TraceCheckUtils]: 211: Hoare triple {18688#false} assume 0 == ~cond; {18688#false} is VALID [2022-04-08 11:15:07,510 INFO L290 TraceCheckUtils]: 210: Hoare triple {18688#false} ~cond := #in~cond; {18688#false} is VALID [2022-04-08 11:15:07,510 INFO L272 TraceCheckUtils]: 209: Hoare triple {18688#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {18688#false} is VALID [2022-04-08 11:15:07,510 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {18687#true} {18688#false} #69#return; {18688#false} is VALID [2022-04-08 11:15:07,510 INFO L290 TraceCheckUtils]: 207: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,510 INFO L290 TraceCheckUtils]: 206: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,510 INFO L290 TraceCheckUtils]: 205: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,510 INFO L272 TraceCheckUtils]: 204: Hoare triple {18688#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,510 INFO L290 TraceCheckUtils]: 203: Hoare triple {19364#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {18688#false} is VALID [2022-04-08 11:15:07,511 INFO L290 TraceCheckUtils]: 202: Hoare triple {19368#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19364#(< |main_#t~post5| 10)} is VALID [2022-04-08 11:15:07,511 INFO L290 TraceCheckUtils]: 201: Hoare triple {19368#(< ~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; {19368#(< ~counter~0 10)} is VALID [2022-04-08 11:15:07,511 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {18687#true} {19368#(< ~counter~0 10)} #67#return; {19368#(< ~counter~0 10)} is VALID [2022-04-08 11:15:07,511 INFO L290 TraceCheckUtils]: 199: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,511 INFO L290 TraceCheckUtils]: 198: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,511 INFO L290 TraceCheckUtils]: 197: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,511 INFO L272 TraceCheckUtils]: 196: Hoare triple {19368#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,512 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {18687#true} {19368#(< ~counter~0 10)} #65#return; {19368#(< ~counter~0 10)} is VALID [2022-04-08 11:15:07,512 INFO L290 TraceCheckUtils]: 194: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,512 INFO L290 TraceCheckUtils]: 193: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,512 INFO L290 TraceCheckUtils]: 192: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,512 INFO L272 TraceCheckUtils]: 191: Hoare triple {19368#(< ~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)); {18687#true} is VALID [2022-04-08 11:15:07,512 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {18687#true} {19368#(< ~counter~0 10)} #63#return; {19368#(< ~counter~0 10)} is VALID [2022-04-08 11:15:07,512 INFO L290 TraceCheckUtils]: 189: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,512 INFO L290 TraceCheckUtils]: 188: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,512 INFO L290 TraceCheckUtils]: 187: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,512 INFO L272 TraceCheckUtils]: 186: Hoare triple {19368#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,513 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {18687#true} {19368#(< ~counter~0 10)} #61#return; {19368#(< ~counter~0 10)} is VALID [2022-04-08 11:15:07,513 INFO L290 TraceCheckUtils]: 184: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,513 INFO L290 TraceCheckUtils]: 183: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,513 INFO L290 TraceCheckUtils]: 182: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,513 INFO L272 TraceCheckUtils]: 181: Hoare triple {19368#(< ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,513 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {18687#true} {19368#(< ~counter~0 10)} #59#return; {19368#(< ~counter~0 10)} is VALID [2022-04-08 11:15:07,513 INFO L290 TraceCheckUtils]: 179: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,513 INFO L290 TraceCheckUtils]: 178: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,513 INFO L290 TraceCheckUtils]: 177: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,514 INFO L272 TraceCheckUtils]: 176: Hoare triple {19368#(< ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,514 INFO L290 TraceCheckUtils]: 175: Hoare triple {19368#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {19368#(< ~counter~0 10)} is VALID [2022-04-08 11:15:07,514 INFO L290 TraceCheckUtils]: 174: Hoare triple {19453#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19368#(< ~counter~0 10)} is VALID [2022-04-08 11:15:07,514 INFO L290 TraceCheckUtils]: 173: Hoare triple {19453#(< ~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; {19453#(< ~counter~0 9)} is VALID [2022-04-08 11:15:07,515 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {18687#true} {19453#(< ~counter~0 9)} #67#return; {19453#(< ~counter~0 9)} is VALID [2022-04-08 11:15:07,515 INFO L290 TraceCheckUtils]: 171: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,515 INFO L290 TraceCheckUtils]: 170: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,515 INFO L290 TraceCheckUtils]: 169: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,515 INFO L272 TraceCheckUtils]: 168: Hoare triple {19453#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,515 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {18687#true} {19453#(< ~counter~0 9)} #65#return; {19453#(< ~counter~0 9)} is VALID [2022-04-08 11:15:07,515 INFO L290 TraceCheckUtils]: 166: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,515 INFO L290 TraceCheckUtils]: 165: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,515 INFO L290 TraceCheckUtils]: 164: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,516 INFO L272 TraceCheckUtils]: 163: Hoare triple {19453#(< ~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)); {18687#true} is VALID [2022-04-08 11:15:07,516 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {18687#true} {19453#(< ~counter~0 9)} #63#return; {19453#(< ~counter~0 9)} is VALID [2022-04-08 11:15:07,516 INFO L290 TraceCheckUtils]: 161: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,516 INFO L290 TraceCheckUtils]: 160: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,516 INFO L290 TraceCheckUtils]: 159: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,516 INFO L272 TraceCheckUtils]: 158: Hoare triple {19453#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,516 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {18687#true} {19453#(< ~counter~0 9)} #61#return; {19453#(< ~counter~0 9)} is VALID [2022-04-08 11:15:07,516 INFO L290 TraceCheckUtils]: 156: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,517 INFO L290 TraceCheckUtils]: 155: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,517 INFO L290 TraceCheckUtils]: 154: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,517 INFO L272 TraceCheckUtils]: 153: Hoare triple {19453#(< ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,517 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {18687#true} {19453#(< ~counter~0 9)} #59#return; {19453#(< ~counter~0 9)} is VALID [2022-04-08 11:15:07,517 INFO L290 TraceCheckUtils]: 151: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,517 INFO L290 TraceCheckUtils]: 150: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,517 INFO L290 TraceCheckUtils]: 149: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,517 INFO L272 TraceCheckUtils]: 148: Hoare triple {19453#(< ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,517 INFO L290 TraceCheckUtils]: 147: Hoare triple {19453#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {19453#(< ~counter~0 9)} is VALID [2022-04-08 11:15:07,518 INFO L290 TraceCheckUtils]: 146: Hoare triple {19221#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19453#(< ~counter~0 9)} is VALID [2022-04-08 11:15:07,518 INFO L290 TraceCheckUtils]: 145: Hoare triple {19221#(<= ~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; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:07,518 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {18687#true} {19221#(<= ~counter~0 7)} #67#return; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:07,518 INFO L290 TraceCheckUtils]: 143: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,518 INFO L290 TraceCheckUtils]: 142: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,518 INFO L290 TraceCheckUtils]: 141: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,518 INFO L272 TraceCheckUtils]: 140: Hoare triple {19221#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,519 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {18687#true} {19221#(<= ~counter~0 7)} #65#return; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:07,519 INFO L290 TraceCheckUtils]: 138: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,519 INFO L290 TraceCheckUtils]: 137: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,519 INFO L290 TraceCheckUtils]: 136: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,519 INFO L272 TraceCheckUtils]: 135: Hoare triple {19221#(<= ~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)); {18687#true} is VALID [2022-04-08 11:15:07,519 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {18687#true} {19221#(<= ~counter~0 7)} #63#return; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:07,519 INFO L290 TraceCheckUtils]: 133: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,519 INFO L290 TraceCheckUtils]: 132: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,520 INFO L290 TraceCheckUtils]: 131: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,520 INFO L272 TraceCheckUtils]: 130: Hoare triple {19221#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,520 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {18687#true} {19221#(<= ~counter~0 7)} #61#return; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:07,520 INFO L290 TraceCheckUtils]: 128: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,520 INFO L290 TraceCheckUtils]: 127: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,520 INFO L290 TraceCheckUtils]: 126: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,520 INFO L272 TraceCheckUtils]: 125: Hoare triple {19221#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,520 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {18687#true} {19221#(<= ~counter~0 7)} #59#return; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:07,521 INFO L290 TraceCheckUtils]: 123: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,521 INFO L290 TraceCheckUtils]: 122: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,521 INFO L290 TraceCheckUtils]: 121: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,521 INFO L272 TraceCheckUtils]: 120: Hoare triple {19221#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,521 INFO L290 TraceCheckUtils]: 119: Hoare triple {19221#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:07,521 INFO L290 TraceCheckUtils]: 118: Hoare triple {19136#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19221#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:07,521 INFO L290 TraceCheckUtils]: 117: Hoare triple {19136#(<= ~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; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:07,522 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {18687#true} {19136#(<= ~counter~0 6)} #67#return; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:07,522 INFO L290 TraceCheckUtils]: 115: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,522 INFO L290 TraceCheckUtils]: 114: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,522 INFO L290 TraceCheckUtils]: 113: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,522 INFO L272 TraceCheckUtils]: 112: Hoare triple {19136#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,522 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {18687#true} {19136#(<= ~counter~0 6)} #65#return; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:07,522 INFO L290 TraceCheckUtils]: 110: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,522 INFO L290 TraceCheckUtils]: 109: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,523 INFO L290 TraceCheckUtils]: 108: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,523 INFO L272 TraceCheckUtils]: 107: Hoare triple {19136#(<= ~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)); {18687#true} is VALID [2022-04-08 11:15:07,523 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {18687#true} {19136#(<= ~counter~0 6)} #63#return; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:07,523 INFO L290 TraceCheckUtils]: 105: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,523 INFO L290 TraceCheckUtils]: 104: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,523 INFO L290 TraceCheckUtils]: 103: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,523 INFO L272 TraceCheckUtils]: 102: Hoare triple {19136#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,523 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {18687#true} {19136#(<= ~counter~0 6)} #61#return; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:07,523 INFO L290 TraceCheckUtils]: 100: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,524 INFO L290 TraceCheckUtils]: 99: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,524 INFO L290 TraceCheckUtils]: 98: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,524 INFO L272 TraceCheckUtils]: 97: Hoare triple {19136#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,524 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {18687#true} {19136#(<= ~counter~0 6)} #59#return; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:07,524 INFO L290 TraceCheckUtils]: 95: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,524 INFO L290 TraceCheckUtils]: 94: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,524 INFO L290 TraceCheckUtils]: 93: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,524 INFO L272 TraceCheckUtils]: 92: Hoare triple {19136#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,524 INFO L290 TraceCheckUtils]: 91: Hoare triple {19136#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:07,525 INFO L290 TraceCheckUtils]: 90: Hoare triple {19051#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19136#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:07,525 INFO L290 TraceCheckUtils]: 89: Hoare triple {19051#(<= ~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; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:07,525 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {18687#true} {19051#(<= ~counter~0 5)} #67#return; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:07,525 INFO L290 TraceCheckUtils]: 87: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,525 INFO L290 TraceCheckUtils]: 86: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,525 INFO L290 TraceCheckUtils]: 85: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,526 INFO L272 TraceCheckUtils]: 84: Hoare triple {19051#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,526 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {18687#true} {19051#(<= ~counter~0 5)} #65#return; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:07,526 INFO L290 TraceCheckUtils]: 82: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,526 INFO L290 TraceCheckUtils]: 81: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,526 INFO L290 TraceCheckUtils]: 80: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,526 INFO L272 TraceCheckUtils]: 79: Hoare triple {19051#(<= ~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)); {18687#true} is VALID [2022-04-08 11:15:07,526 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {18687#true} {19051#(<= ~counter~0 5)} #63#return; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:07,526 INFO L290 TraceCheckUtils]: 77: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,527 INFO L290 TraceCheckUtils]: 76: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,527 INFO L290 TraceCheckUtils]: 75: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,527 INFO L272 TraceCheckUtils]: 74: Hoare triple {19051#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,527 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {18687#true} {19051#(<= ~counter~0 5)} #61#return; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:07,527 INFO L290 TraceCheckUtils]: 72: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,527 INFO L290 TraceCheckUtils]: 71: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,527 INFO L290 TraceCheckUtils]: 70: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,527 INFO L272 TraceCheckUtils]: 69: Hoare triple {19051#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,528 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18687#true} {19051#(<= ~counter~0 5)} #59#return; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:07,528 INFO L290 TraceCheckUtils]: 67: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,528 INFO L290 TraceCheckUtils]: 66: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,528 INFO L290 TraceCheckUtils]: 65: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,528 INFO L272 TraceCheckUtils]: 64: Hoare triple {19051#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,528 INFO L290 TraceCheckUtils]: 63: Hoare triple {19051#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:07,528 INFO L290 TraceCheckUtils]: 62: Hoare triple {18966#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19051#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:07,529 INFO L290 TraceCheckUtils]: 61: Hoare triple {18966#(<= ~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; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:07,529 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18687#true} {18966#(<= ~counter~0 4)} #67#return; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:07,529 INFO L290 TraceCheckUtils]: 59: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,529 INFO L290 TraceCheckUtils]: 58: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,529 INFO L290 TraceCheckUtils]: 57: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,529 INFO L272 TraceCheckUtils]: 56: Hoare triple {18966#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,529 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18687#true} {18966#(<= ~counter~0 4)} #65#return; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:07,529 INFO L290 TraceCheckUtils]: 54: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,530 INFO L290 TraceCheckUtils]: 53: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,530 INFO L290 TraceCheckUtils]: 52: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,530 INFO L272 TraceCheckUtils]: 51: Hoare triple {18966#(<= ~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)); {18687#true} is VALID [2022-04-08 11:15:07,530 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18687#true} {18966#(<= ~counter~0 4)} #63#return; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:07,530 INFO L290 TraceCheckUtils]: 49: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,530 INFO L290 TraceCheckUtils]: 48: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,530 INFO L290 TraceCheckUtils]: 47: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,530 INFO L272 TraceCheckUtils]: 46: Hoare triple {18966#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,530 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {18687#true} {18966#(<= ~counter~0 4)} #61#return; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:07,531 INFO L290 TraceCheckUtils]: 44: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,531 INFO L272 TraceCheckUtils]: 41: Hoare triple {18966#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,531 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18687#true} {18966#(<= ~counter~0 4)} #59#return; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:07,531 INFO L290 TraceCheckUtils]: 39: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,531 INFO L290 TraceCheckUtils]: 38: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,531 INFO L272 TraceCheckUtils]: 36: Hoare triple {18966#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {18966#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:07,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {18881#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18966#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:07,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {18881#(<= ~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; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:07,532 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18687#true} {18881#(<= ~counter~0 3)} #67#return; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:07,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,533 INFO L272 TraceCheckUtils]: 28: Hoare triple {18881#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,533 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {18687#true} {18881#(<= ~counter~0 3)} #65#return; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:07,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,533 INFO L272 TraceCheckUtils]: 23: Hoare triple {18881#(<= ~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)); {18687#true} is VALID [2022-04-08 11:15:07,533 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18687#true} {18881#(<= ~counter~0 3)} #63#return; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:07,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,534 INFO L272 TraceCheckUtils]: 18: Hoare triple {18881#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,534 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18687#true} {18881#(<= ~counter~0 3)} #61#return; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:07,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,534 INFO L272 TraceCheckUtils]: 13: Hoare triple {18881#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,535 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18687#true} {18881#(<= ~counter~0 3)} #59#return; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:07,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {18687#true} assume true; {18687#true} is VALID [2022-04-08 11:15:07,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {18687#true} assume !(0 == ~cond); {18687#true} is VALID [2022-04-08 11:15:07,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {18687#true} ~cond := #in~cond; {18687#true} is VALID [2022-04-08 11:15:07,535 INFO L272 TraceCheckUtils]: 8: Hoare triple {18881#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {18687#true} is VALID [2022-04-08 11:15:07,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {18881#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:07,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {18796#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18881#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:07,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {18796#(<= ~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; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:07,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {18796#(<= ~counter~0 2)} call #t~ret6 := main(); {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:07,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18796#(<= ~counter~0 2)} {18687#true} #81#return; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:07,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {18796#(<= ~counter~0 2)} assume true; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:07,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {18687#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; {18796#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:07,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {18687#true} call ULTIMATE.init(); {18687#true} is VALID [2022-04-08 11:15:07,537 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-08 11:15:07,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:15:07,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543677923] [2022-04-08 11:15:07,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:15:07,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300251177] [2022-04-08 11:15:07,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300251177] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:15:07,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:15:07,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-08 11:15:07,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:15:07,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [648099376] [2022-04-08 11:15:07,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [648099376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:15:07,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:15:07,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 11:15:07,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214487518] [2022-04-08 11:15:07,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:15:07,539 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-08 11:15:07,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:15:07,539 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-08 11:15:07,603 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-08 11:15:07,603 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 11:15:07,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:15:07,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 11:15:07,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 11:15:07,604 INFO L87 Difference]: Start difference. First operand 149 states and 167 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-08 11:15:08,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:15:08,986 INFO L93 Difference]: Finished difference Result 178 states and 200 transitions. [2022-04-08 11:15:08,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 11:15:08,987 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-08 11:15:08,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:15:08,987 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-08 11:15:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 155 transitions. [2022-04-08 11:15:08,989 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-08 11:15:08,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 155 transitions. [2022-04-08 11:15:08,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 155 transitions. [2022-04-08 11:15:09,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:15:09,126 INFO L225 Difference]: With dead ends: 178 [2022-04-08 11:15:09,126 INFO L226 Difference]: Without dead ends: 165 [2022-04-08 11:15:09,127 INFO L912 BasicCegarLoop]: 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-08 11:15:09,127 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 4 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:15:09,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 232 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:15:09,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-08 11:15:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-04-08 11:15:09,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:15:09,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 165 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 97 states have internal predecessors, (98), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-08 11:15:09,334 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 165 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 97 states have internal predecessors, (98), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-08 11:15:09,335 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 165 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 97 states have internal predecessors, (98), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-08 11:15:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:15:09,337 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2022-04-08 11:15:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2022-04-08 11:15:09,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:15:09,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:15:09,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 97 states have internal predecessors, (98), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand 165 states. [2022-04-08 11:15:09,338 INFO L87 Difference]: Start difference. First operand has 165 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 97 states have internal predecessors, (98), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand 165 states. [2022-04-08 11:15:09,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:15:09,340 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2022-04-08 11:15:09,340 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2022-04-08 11:15:09,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:15:09,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:15:09,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:15:09,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:15:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 97 states have internal predecessors, (98), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-08 11:15:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2022-04-08 11:15:09,344 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 213 [2022-04-08 11:15:09,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:15:09,344 INFO L478 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2022-04-08 11:15:09,344 INFO L479 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-08 11:15:09,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 165 states and 186 transitions. [2022-04-08 11:15:18,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 184 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 11:15:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2022-04-08 11:15:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-04-08 11:15:18,626 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:15:18,626 INFO L499 BasicCegarLoop]: 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-08 11:15:18,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 11:15:18,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:15:18,827 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:15:18,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:15:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash -569580785, now seen corresponding path program 15 times [2022-04-08 11:15:18,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:15:18,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1026009007] [2022-04-08 11:15:19,067 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:15:19,067 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:15:19,068 INFO L85 PathProgramCache]: Analyzing trace with hash -569580785, now seen corresponding path program 16 times [2022-04-08 11:15:19,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:15:19,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049003984] [2022-04-08 11:15:19,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:15:19,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:15:19,094 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:15:19,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1853489194] [2022-04-08 11:15:19,095 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:15:19,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:15:19,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:15:19,096 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-08 11:15:19,098 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-08 11:15:19,208 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:15:19,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:15:19,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 11:15:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:15:19,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:15:20,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {21008#true} call ULTIMATE.init(); {21008#true} is VALID [2022-04-08 11:15:20,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {21008#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; {21016#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:20,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {21016#(<= ~counter~0 0)} assume true; {21016#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:20,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21016#(<= ~counter~0 0)} {21008#true} #81#return; {21016#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:20,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {21016#(<= ~counter~0 0)} call #t~ret6 := main(); {21016#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:20,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {21016#(<= ~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; {21016#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:20,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {21016#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {21032#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,101 INFO L272 TraceCheckUtils]: 8: Hoare triple {21032#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {21032#(<= ~counter~0 1)} ~cond := #in~cond; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {21032#(<= ~counter~0 1)} assume !(0 == ~cond); {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {21032#(<= ~counter~0 1)} assume true; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,102 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {21032#(<= ~counter~0 1)} {21032#(<= ~counter~0 1)} #59#return; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,102 INFO L272 TraceCheckUtils]: 13: Hoare triple {21032#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {21032#(<= ~counter~0 1)} ~cond := #in~cond; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {21032#(<= ~counter~0 1)} assume !(0 == ~cond); {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {21032#(<= ~counter~0 1)} assume true; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,103 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21032#(<= ~counter~0 1)} {21032#(<= ~counter~0 1)} #61#return; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,104 INFO L272 TraceCheckUtils]: 18: Hoare triple {21032#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {21032#(<= ~counter~0 1)} ~cond := #in~cond; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {21032#(<= ~counter~0 1)} assume !(0 == ~cond); {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {21032#(<= ~counter~0 1)} assume true; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,105 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21032#(<= ~counter~0 1)} {21032#(<= ~counter~0 1)} #63#return; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,105 INFO L272 TraceCheckUtils]: 23: Hoare triple {21032#(<= ~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)); {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {21032#(<= ~counter~0 1)} ~cond := #in~cond; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {21032#(<= ~counter~0 1)} assume !(0 == ~cond); {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {21032#(<= ~counter~0 1)} assume true; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,107 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {21032#(<= ~counter~0 1)} {21032#(<= ~counter~0 1)} #65#return; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,107 INFO L272 TraceCheckUtils]: 28: Hoare triple {21032#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {21032#(<= ~counter~0 1)} ~cond := #in~cond; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {21032#(<= ~counter~0 1)} assume !(0 == ~cond); {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {21032#(<= ~counter~0 1)} assume true; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,108 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21032#(<= ~counter~0 1)} {21032#(<= ~counter~0 1)} #67#return; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {21032#(<= ~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; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {21032#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,109 INFO L290 TraceCheckUtils]: 35: Hoare triple {21117#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,110 INFO L272 TraceCheckUtils]: 36: Hoare triple {21117#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,110 INFO L290 TraceCheckUtils]: 37: Hoare triple {21117#(<= ~counter~0 2)} ~cond := #in~cond; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,110 INFO L290 TraceCheckUtils]: 38: Hoare triple {21117#(<= ~counter~0 2)} assume !(0 == ~cond); {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,111 INFO L290 TraceCheckUtils]: 39: Hoare triple {21117#(<= ~counter~0 2)} assume true; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,111 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {21117#(<= ~counter~0 2)} {21117#(<= ~counter~0 2)} #59#return; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,112 INFO L272 TraceCheckUtils]: 41: Hoare triple {21117#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {21117#(<= ~counter~0 2)} ~cond := #in~cond; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,112 INFO L290 TraceCheckUtils]: 43: Hoare triple {21117#(<= ~counter~0 2)} assume !(0 == ~cond); {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,112 INFO L290 TraceCheckUtils]: 44: Hoare triple {21117#(<= ~counter~0 2)} assume true; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,113 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {21117#(<= ~counter~0 2)} {21117#(<= ~counter~0 2)} #61#return; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,113 INFO L272 TraceCheckUtils]: 46: Hoare triple {21117#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,113 INFO L290 TraceCheckUtils]: 47: Hoare triple {21117#(<= ~counter~0 2)} ~cond := #in~cond; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {21117#(<= ~counter~0 2)} assume !(0 == ~cond); {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {21117#(<= ~counter~0 2)} assume true; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,114 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21117#(<= ~counter~0 2)} {21117#(<= ~counter~0 2)} #63#return; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,115 INFO L272 TraceCheckUtils]: 51: Hoare triple {21117#(<= ~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)); {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,115 INFO L290 TraceCheckUtils]: 52: Hoare triple {21117#(<= ~counter~0 2)} ~cond := #in~cond; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,115 INFO L290 TraceCheckUtils]: 53: Hoare triple {21117#(<= ~counter~0 2)} assume !(0 == ~cond); {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,116 INFO L290 TraceCheckUtils]: 54: Hoare triple {21117#(<= ~counter~0 2)} assume true; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,116 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21117#(<= ~counter~0 2)} {21117#(<= ~counter~0 2)} #65#return; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,116 INFO L272 TraceCheckUtils]: 56: Hoare triple {21117#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,117 INFO L290 TraceCheckUtils]: 57: Hoare triple {21117#(<= ~counter~0 2)} ~cond := #in~cond; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,117 INFO L290 TraceCheckUtils]: 58: Hoare triple {21117#(<= ~counter~0 2)} assume !(0 == ~cond); {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,117 INFO L290 TraceCheckUtils]: 59: Hoare triple {21117#(<= ~counter~0 2)} assume true; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,118 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {21117#(<= ~counter~0 2)} {21117#(<= ~counter~0 2)} #67#return; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,118 INFO L290 TraceCheckUtils]: 61: Hoare triple {21117#(<= ~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; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,118 INFO L290 TraceCheckUtils]: 62: Hoare triple {21117#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,119 INFO L290 TraceCheckUtils]: 63: Hoare triple {21202#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,119 INFO L272 TraceCheckUtils]: 64: Hoare triple {21202#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,119 INFO L290 TraceCheckUtils]: 65: Hoare triple {21202#(<= ~counter~0 3)} ~cond := #in~cond; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,120 INFO L290 TraceCheckUtils]: 66: Hoare triple {21202#(<= ~counter~0 3)} assume !(0 == ~cond); {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,120 INFO L290 TraceCheckUtils]: 67: Hoare triple {21202#(<= ~counter~0 3)} assume true; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,120 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21202#(<= ~counter~0 3)} {21202#(<= ~counter~0 3)} #59#return; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,121 INFO L272 TraceCheckUtils]: 69: Hoare triple {21202#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,121 INFO L290 TraceCheckUtils]: 70: Hoare triple {21202#(<= ~counter~0 3)} ~cond := #in~cond; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,121 INFO L290 TraceCheckUtils]: 71: Hoare triple {21202#(<= ~counter~0 3)} assume !(0 == ~cond); {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,122 INFO L290 TraceCheckUtils]: 72: Hoare triple {21202#(<= ~counter~0 3)} assume true; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,122 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {21202#(<= ~counter~0 3)} {21202#(<= ~counter~0 3)} #61#return; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,122 INFO L272 TraceCheckUtils]: 74: Hoare triple {21202#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,123 INFO L290 TraceCheckUtils]: 75: Hoare triple {21202#(<= ~counter~0 3)} ~cond := #in~cond; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,123 INFO L290 TraceCheckUtils]: 76: Hoare triple {21202#(<= ~counter~0 3)} assume !(0 == ~cond); {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,123 INFO L290 TraceCheckUtils]: 77: Hoare triple {21202#(<= ~counter~0 3)} assume true; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,124 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21202#(<= ~counter~0 3)} {21202#(<= ~counter~0 3)} #63#return; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,124 INFO L272 TraceCheckUtils]: 79: Hoare triple {21202#(<= ~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)); {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,124 INFO L290 TraceCheckUtils]: 80: Hoare triple {21202#(<= ~counter~0 3)} ~cond := #in~cond; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,125 INFO L290 TraceCheckUtils]: 81: Hoare triple {21202#(<= ~counter~0 3)} assume !(0 == ~cond); {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,125 INFO L290 TraceCheckUtils]: 82: Hoare triple {21202#(<= ~counter~0 3)} assume true; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,125 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {21202#(<= ~counter~0 3)} {21202#(<= ~counter~0 3)} #65#return; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,126 INFO L272 TraceCheckUtils]: 84: Hoare triple {21202#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,126 INFO L290 TraceCheckUtils]: 85: Hoare triple {21202#(<= ~counter~0 3)} ~cond := #in~cond; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,126 INFO L290 TraceCheckUtils]: 86: Hoare triple {21202#(<= ~counter~0 3)} assume !(0 == ~cond); {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,127 INFO L290 TraceCheckUtils]: 87: Hoare triple {21202#(<= ~counter~0 3)} assume true; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,127 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {21202#(<= ~counter~0 3)} {21202#(<= ~counter~0 3)} #67#return; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,127 INFO L290 TraceCheckUtils]: 89: Hoare triple {21202#(<= ~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; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,128 INFO L290 TraceCheckUtils]: 90: Hoare triple {21202#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,128 INFO L290 TraceCheckUtils]: 91: Hoare triple {21287#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,128 INFO L272 TraceCheckUtils]: 92: Hoare triple {21287#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,129 INFO L290 TraceCheckUtils]: 93: Hoare triple {21287#(<= ~counter~0 4)} ~cond := #in~cond; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,129 INFO L290 TraceCheckUtils]: 94: Hoare triple {21287#(<= ~counter~0 4)} assume !(0 == ~cond); {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,129 INFO L290 TraceCheckUtils]: 95: Hoare triple {21287#(<= ~counter~0 4)} assume true; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,130 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {21287#(<= ~counter~0 4)} {21287#(<= ~counter~0 4)} #59#return; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,130 INFO L272 TraceCheckUtils]: 97: Hoare triple {21287#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,130 INFO L290 TraceCheckUtils]: 98: Hoare triple {21287#(<= ~counter~0 4)} ~cond := #in~cond; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,131 INFO L290 TraceCheckUtils]: 99: Hoare triple {21287#(<= ~counter~0 4)} assume !(0 == ~cond); {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,131 INFO L290 TraceCheckUtils]: 100: Hoare triple {21287#(<= ~counter~0 4)} assume true; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,131 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {21287#(<= ~counter~0 4)} {21287#(<= ~counter~0 4)} #61#return; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,132 INFO L272 TraceCheckUtils]: 102: Hoare triple {21287#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,132 INFO L290 TraceCheckUtils]: 103: Hoare triple {21287#(<= ~counter~0 4)} ~cond := #in~cond; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,132 INFO L290 TraceCheckUtils]: 104: Hoare triple {21287#(<= ~counter~0 4)} assume !(0 == ~cond); {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,132 INFO L290 TraceCheckUtils]: 105: Hoare triple {21287#(<= ~counter~0 4)} assume true; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,133 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {21287#(<= ~counter~0 4)} {21287#(<= ~counter~0 4)} #63#return; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,133 INFO L272 TraceCheckUtils]: 107: Hoare triple {21287#(<= ~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)); {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,134 INFO L290 TraceCheckUtils]: 108: Hoare triple {21287#(<= ~counter~0 4)} ~cond := #in~cond; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,134 INFO L290 TraceCheckUtils]: 109: Hoare triple {21287#(<= ~counter~0 4)} assume !(0 == ~cond); {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,134 INFO L290 TraceCheckUtils]: 110: Hoare triple {21287#(<= ~counter~0 4)} assume true; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,135 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {21287#(<= ~counter~0 4)} {21287#(<= ~counter~0 4)} #65#return; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,135 INFO L272 TraceCheckUtils]: 112: Hoare triple {21287#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,135 INFO L290 TraceCheckUtils]: 113: Hoare triple {21287#(<= ~counter~0 4)} ~cond := #in~cond; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,136 INFO L290 TraceCheckUtils]: 114: Hoare triple {21287#(<= ~counter~0 4)} assume !(0 == ~cond); {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,136 INFO L290 TraceCheckUtils]: 115: Hoare triple {21287#(<= ~counter~0 4)} assume true; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,136 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {21287#(<= ~counter~0 4)} {21287#(<= ~counter~0 4)} #67#return; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,136 INFO L290 TraceCheckUtils]: 117: Hoare triple {21287#(<= ~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; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,137 INFO L290 TraceCheckUtils]: 118: Hoare triple {21287#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,137 INFO L290 TraceCheckUtils]: 119: Hoare triple {21372#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,138 INFO L272 TraceCheckUtils]: 120: Hoare triple {21372#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,138 INFO L290 TraceCheckUtils]: 121: Hoare triple {21372#(<= ~counter~0 5)} ~cond := #in~cond; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,138 INFO L290 TraceCheckUtils]: 122: Hoare triple {21372#(<= ~counter~0 5)} assume !(0 == ~cond); {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,139 INFO L290 TraceCheckUtils]: 123: Hoare triple {21372#(<= ~counter~0 5)} assume true; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,139 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {21372#(<= ~counter~0 5)} {21372#(<= ~counter~0 5)} #59#return; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,139 INFO L272 TraceCheckUtils]: 125: Hoare triple {21372#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,140 INFO L290 TraceCheckUtils]: 126: Hoare triple {21372#(<= ~counter~0 5)} ~cond := #in~cond; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,140 INFO L290 TraceCheckUtils]: 127: Hoare triple {21372#(<= ~counter~0 5)} assume !(0 == ~cond); {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,140 INFO L290 TraceCheckUtils]: 128: Hoare triple {21372#(<= ~counter~0 5)} assume true; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,141 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {21372#(<= ~counter~0 5)} {21372#(<= ~counter~0 5)} #61#return; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,141 INFO L272 TraceCheckUtils]: 130: Hoare triple {21372#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,141 INFO L290 TraceCheckUtils]: 131: Hoare triple {21372#(<= ~counter~0 5)} ~cond := #in~cond; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,141 INFO L290 TraceCheckUtils]: 132: Hoare triple {21372#(<= ~counter~0 5)} assume !(0 == ~cond); {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,142 INFO L290 TraceCheckUtils]: 133: Hoare triple {21372#(<= ~counter~0 5)} assume true; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,142 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {21372#(<= ~counter~0 5)} {21372#(<= ~counter~0 5)} #63#return; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,143 INFO L272 TraceCheckUtils]: 135: Hoare triple {21372#(<= ~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)); {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,143 INFO L290 TraceCheckUtils]: 136: Hoare triple {21372#(<= ~counter~0 5)} ~cond := #in~cond; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,143 INFO L290 TraceCheckUtils]: 137: Hoare triple {21372#(<= ~counter~0 5)} assume !(0 == ~cond); {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,143 INFO L290 TraceCheckUtils]: 138: Hoare triple {21372#(<= ~counter~0 5)} assume true; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,144 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {21372#(<= ~counter~0 5)} {21372#(<= ~counter~0 5)} #65#return; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,144 INFO L272 TraceCheckUtils]: 140: Hoare triple {21372#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,145 INFO L290 TraceCheckUtils]: 141: Hoare triple {21372#(<= ~counter~0 5)} ~cond := #in~cond; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,145 INFO L290 TraceCheckUtils]: 142: Hoare triple {21372#(<= ~counter~0 5)} assume !(0 == ~cond); {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,145 INFO L290 TraceCheckUtils]: 143: Hoare triple {21372#(<= ~counter~0 5)} assume true; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,145 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {21372#(<= ~counter~0 5)} {21372#(<= ~counter~0 5)} #67#return; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,146 INFO L290 TraceCheckUtils]: 145: Hoare triple {21372#(<= ~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; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,146 INFO L290 TraceCheckUtils]: 146: Hoare triple {21372#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,147 INFO L290 TraceCheckUtils]: 147: Hoare triple {21457#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,147 INFO L272 TraceCheckUtils]: 148: Hoare triple {21457#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,147 INFO L290 TraceCheckUtils]: 149: Hoare triple {21457#(<= ~counter~0 6)} ~cond := #in~cond; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,148 INFO L290 TraceCheckUtils]: 150: Hoare triple {21457#(<= ~counter~0 6)} assume !(0 == ~cond); {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,148 INFO L290 TraceCheckUtils]: 151: Hoare triple {21457#(<= ~counter~0 6)} assume true; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,149 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {21457#(<= ~counter~0 6)} {21457#(<= ~counter~0 6)} #59#return; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,149 INFO L272 TraceCheckUtils]: 153: Hoare triple {21457#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,149 INFO L290 TraceCheckUtils]: 154: Hoare triple {21457#(<= ~counter~0 6)} ~cond := #in~cond; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,150 INFO L290 TraceCheckUtils]: 155: Hoare triple {21457#(<= ~counter~0 6)} assume !(0 == ~cond); {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,150 INFO L290 TraceCheckUtils]: 156: Hoare triple {21457#(<= ~counter~0 6)} assume true; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,150 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {21457#(<= ~counter~0 6)} {21457#(<= ~counter~0 6)} #61#return; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,151 INFO L272 TraceCheckUtils]: 158: Hoare triple {21457#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,151 INFO L290 TraceCheckUtils]: 159: Hoare triple {21457#(<= ~counter~0 6)} ~cond := #in~cond; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,151 INFO L290 TraceCheckUtils]: 160: Hoare triple {21457#(<= ~counter~0 6)} assume !(0 == ~cond); {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,152 INFO L290 TraceCheckUtils]: 161: Hoare triple {21457#(<= ~counter~0 6)} assume true; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,152 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {21457#(<= ~counter~0 6)} {21457#(<= ~counter~0 6)} #63#return; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,153 INFO L272 TraceCheckUtils]: 163: Hoare triple {21457#(<= ~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)); {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,153 INFO L290 TraceCheckUtils]: 164: Hoare triple {21457#(<= ~counter~0 6)} ~cond := #in~cond; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,153 INFO L290 TraceCheckUtils]: 165: Hoare triple {21457#(<= ~counter~0 6)} assume !(0 == ~cond); {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,154 INFO L290 TraceCheckUtils]: 166: Hoare triple {21457#(<= ~counter~0 6)} assume true; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,154 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {21457#(<= ~counter~0 6)} {21457#(<= ~counter~0 6)} #65#return; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,155 INFO L272 TraceCheckUtils]: 168: Hoare triple {21457#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,155 INFO L290 TraceCheckUtils]: 169: Hoare triple {21457#(<= ~counter~0 6)} ~cond := #in~cond; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,155 INFO L290 TraceCheckUtils]: 170: Hoare triple {21457#(<= ~counter~0 6)} assume !(0 == ~cond); {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,156 INFO L290 TraceCheckUtils]: 171: Hoare triple {21457#(<= ~counter~0 6)} assume true; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,156 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {21457#(<= ~counter~0 6)} {21457#(<= ~counter~0 6)} #67#return; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,156 INFO L290 TraceCheckUtils]: 173: Hoare triple {21457#(<= ~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; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,157 INFO L290 TraceCheckUtils]: 174: Hoare triple {21457#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,157 INFO L290 TraceCheckUtils]: 175: Hoare triple {21542#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,158 INFO L272 TraceCheckUtils]: 176: Hoare triple {21542#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,158 INFO L290 TraceCheckUtils]: 177: Hoare triple {21542#(<= ~counter~0 7)} ~cond := #in~cond; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,158 INFO L290 TraceCheckUtils]: 178: Hoare triple {21542#(<= ~counter~0 7)} assume !(0 == ~cond); {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,159 INFO L290 TraceCheckUtils]: 179: Hoare triple {21542#(<= ~counter~0 7)} assume true; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,159 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {21542#(<= ~counter~0 7)} {21542#(<= ~counter~0 7)} #59#return; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,160 INFO L272 TraceCheckUtils]: 181: Hoare triple {21542#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,160 INFO L290 TraceCheckUtils]: 182: Hoare triple {21542#(<= ~counter~0 7)} ~cond := #in~cond; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,160 INFO L290 TraceCheckUtils]: 183: Hoare triple {21542#(<= ~counter~0 7)} assume !(0 == ~cond); {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,160 INFO L290 TraceCheckUtils]: 184: Hoare triple {21542#(<= ~counter~0 7)} assume true; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,161 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {21542#(<= ~counter~0 7)} {21542#(<= ~counter~0 7)} #61#return; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,161 INFO L272 TraceCheckUtils]: 186: Hoare triple {21542#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,162 INFO L290 TraceCheckUtils]: 187: Hoare triple {21542#(<= ~counter~0 7)} ~cond := #in~cond; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,162 INFO L290 TraceCheckUtils]: 188: Hoare triple {21542#(<= ~counter~0 7)} assume !(0 == ~cond); {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,162 INFO L290 TraceCheckUtils]: 189: Hoare triple {21542#(<= ~counter~0 7)} assume true; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,163 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {21542#(<= ~counter~0 7)} {21542#(<= ~counter~0 7)} #63#return; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,163 INFO L272 TraceCheckUtils]: 191: Hoare triple {21542#(<= ~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)); {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,164 INFO L290 TraceCheckUtils]: 192: Hoare triple {21542#(<= ~counter~0 7)} ~cond := #in~cond; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,164 INFO L290 TraceCheckUtils]: 193: Hoare triple {21542#(<= ~counter~0 7)} assume !(0 == ~cond); {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,164 INFO L290 TraceCheckUtils]: 194: Hoare triple {21542#(<= ~counter~0 7)} assume true; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,165 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {21542#(<= ~counter~0 7)} {21542#(<= ~counter~0 7)} #65#return; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,165 INFO L272 TraceCheckUtils]: 196: Hoare triple {21542#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,165 INFO L290 TraceCheckUtils]: 197: Hoare triple {21542#(<= ~counter~0 7)} ~cond := #in~cond; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,166 INFO L290 TraceCheckUtils]: 198: Hoare triple {21542#(<= ~counter~0 7)} assume !(0 == ~cond); {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,166 INFO L290 TraceCheckUtils]: 199: Hoare triple {21542#(<= ~counter~0 7)} assume true; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,166 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {21542#(<= ~counter~0 7)} {21542#(<= ~counter~0 7)} #67#return; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,167 INFO L290 TraceCheckUtils]: 201: Hoare triple {21542#(<= ~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; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,167 INFO L290 TraceCheckUtils]: 202: Hoare triple {21542#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,167 INFO L290 TraceCheckUtils]: 203: Hoare triple {21627#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,168 INFO L272 TraceCheckUtils]: 204: Hoare triple {21627#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,168 INFO L290 TraceCheckUtils]: 205: Hoare triple {21627#(<= ~counter~0 8)} ~cond := #in~cond; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,168 INFO L290 TraceCheckUtils]: 206: Hoare triple {21627#(<= ~counter~0 8)} assume !(0 == ~cond); {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,169 INFO L290 TraceCheckUtils]: 207: Hoare triple {21627#(<= ~counter~0 8)} assume true; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,169 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {21627#(<= ~counter~0 8)} {21627#(<= ~counter~0 8)} #59#return; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,170 INFO L272 TraceCheckUtils]: 209: Hoare triple {21627#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,170 INFO L290 TraceCheckUtils]: 210: Hoare triple {21627#(<= ~counter~0 8)} ~cond := #in~cond; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,170 INFO L290 TraceCheckUtils]: 211: Hoare triple {21627#(<= ~counter~0 8)} assume !(0 == ~cond); {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,170 INFO L290 TraceCheckUtils]: 212: Hoare triple {21627#(<= ~counter~0 8)} assume true; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,171 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {21627#(<= ~counter~0 8)} {21627#(<= ~counter~0 8)} #61#return; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,171 INFO L272 TraceCheckUtils]: 214: Hoare triple {21627#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,171 INFO L290 TraceCheckUtils]: 215: Hoare triple {21627#(<= ~counter~0 8)} ~cond := #in~cond; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,172 INFO L290 TraceCheckUtils]: 216: Hoare triple {21627#(<= ~counter~0 8)} assume !(0 == ~cond); {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,172 INFO L290 TraceCheckUtils]: 217: Hoare triple {21627#(<= ~counter~0 8)} assume true; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,172 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {21627#(<= ~counter~0 8)} {21627#(<= ~counter~0 8)} #63#return; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,173 INFO L272 TraceCheckUtils]: 219: Hoare triple {21627#(<= ~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)); {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,173 INFO L290 TraceCheckUtils]: 220: Hoare triple {21627#(<= ~counter~0 8)} ~cond := #in~cond; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,173 INFO L290 TraceCheckUtils]: 221: Hoare triple {21627#(<= ~counter~0 8)} assume !(0 == ~cond); {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,174 INFO L290 TraceCheckUtils]: 222: Hoare triple {21627#(<= ~counter~0 8)} assume true; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,174 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {21627#(<= ~counter~0 8)} {21627#(<= ~counter~0 8)} #65#return; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,175 INFO L272 TraceCheckUtils]: 224: Hoare triple {21627#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,175 INFO L290 TraceCheckUtils]: 225: Hoare triple {21627#(<= ~counter~0 8)} ~cond := #in~cond; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,175 INFO L290 TraceCheckUtils]: 226: Hoare triple {21627#(<= ~counter~0 8)} assume !(0 == ~cond); {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,176 INFO L290 TraceCheckUtils]: 227: Hoare triple {21627#(<= ~counter~0 8)} assume true; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,176 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {21627#(<= ~counter~0 8)} {21627#(<= ~counter~0 8)} #67#return; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,176 INFO L290 TraceCheckUtils]: 229: Hoare triple {21627#(<= ~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; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,177 INFO L290 TraceCheckUtils]: 230: Hoare triple {21627#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21712#(<= |main_#t~post5| 8)} is VALID [2022-04-08 11:15:20,177 INFO L290 TraceCheckUtils]: 231: Hoare triple {21712#(<= |main_#t~post5| 8)} assume !(#t~post5 < 10);havoc #t~post5; {21009#false} is VALID [2022-04-08 11:15:20,177 INFO L272 TraceCheckUtils]: 232: Hoare triple {21009#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21009#false} is VALID [2022-04-08 11:15:20,177 INFO L290 TraceCheckUtils]: 233: Hoare triple {21009#false} ~cond := #in~cond; {21009#false} is VALID [2022-04-08 11:15:20,177 INFO L290 TraceCheckUtils]: 234: Hoare triple {21009#false} assume !(0 == ~cond); {21009#false} is VALID [2022-04-08 11:15:20,177 INFO L290 TraceCheckUtils]: 235: Hoare triple {21009#false} assume true; {21009#false} is VALID [2022-04-08 11:15:20,177 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {21009#false} {21009#false} #69#return; {21009#false} is VALID [2022-04-08 11:15:20,177 INFO L272 TraceCheckUtils]: 237: Hoare triple {21009#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {21009#false} is VALID [2022-04-08 11:15:20,177 INFO L290 TraceCheckUtils]: 238: Hoare triple {21009#false} ~cond := #in~cond; {21009#false} is VALID [2022-04-08 11:15:20,177 INFO L290 TraceCheckUtils]: 239: Hoare triple {21009#false} assume 0 == ~cond; {21009#false} is VALID [2022-04-08 11:15:20,178 INFO L290 TraceCheckUtils]: 240: Hoare triple {21009#false} assume !false; {21009#false} is VALID [2022-04-08 11:15:20,179 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-08 11:15:20,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:15:20,772 INFO L290 TraceCheckUtils]: 240: Hoare triple {21009#false} assume !false; {21009#false} is VALID [2022-04-08 11:15:20,773 INFO L290 TraceCheckUtils]: 239: Hoare triple {21009#false} assume 0 == ~cond; {21009#false} is VALID [2022-04-08 11:15:20,773 INFO L290 TraceCheckUtils]: 238: Hoare triple {21009#false} ~cond := #in~cond; {21009#false} is VALID [2022-04-08 11:15:20,773 INFO L272 TraceCheckUtils]: 237: Hoare triple {21009#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {21009#false} is VALID [2022-04-08 11:15:20,773 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {21008#true} {21009#false} #69#return; {21009#false} is VALID [2022-04-08 11:15:20,773 INFO L290 TraceCheckUtils]: 235: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,773 INFO L290 TraceCheckUtils]: 234: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,773 INFO L290 TraceCheckUtils]: 233: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,773 INFO L272 TraceCheckUtils]: 232: Hoare triple {21009#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,773 INFO L290 TraceCheckUtils]: 231: Hoare triple {21770#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {21009#false} is VALID [2022-04-08 11:15:20,773 INFO L290 TraceCheckUtils]: 230: Hoare triple {21774#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21770#(< |main_#t~post5| 10)} is VALID [2022-04-08 11:15:20,774 INFO L290 TraceCheckUtils]: 229: Hoare triple {21774#(< ~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; {21774#(< ~counter~0 10)} is VALID [2022-04-08 11:15:20,774 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {21008#true} {21774#(< ~counter~0 10)} #67#return; {21774#(< ~counter~0 10)} is VALID [2022-04-08 11:15:20,774 INFO L290 TraceCheckUtils]: 227: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,774 INFO L290 TraceCheckUtils]: 226: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,774 INFO L290 TraceCheckUtils]: 225: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,774 INFO L272 TraceCheckUtils]: 224: Hoare triple {21774#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,775 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {21008#true} {21774#(< ~counter~0 10)} #65#return; {21774#(< ~counter~0 10)} is VALID [2022-04-08 11:15:20,775 INFO L290 TraceCheckUtils]: 222: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,775 INFO L290 TraceCheckUtils]: 221: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,775 INFO L290 TraceCheckUtils]: 220: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,775 INFO L272 TraceCheckUtils]: 219: Hoare triple {21774#(< ~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)); {21008#true} is VALID [2022-04-08 11:15:20,775 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {21008#true} {21774#(< ~counter~0 10)} #63#return; {21774#(< ~counter~0 10)} is VALID [2022-04-08 11:15:20,775 INFO L290 TraceCheckUtils]: 217: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,775 INFO L290 TraceCheckUtils]: 216: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,775 INFO L290 TraceCheckUtils]: 215: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,775 INFO L272 TraceCheckUtils]: 214: Hoare triple {21774#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,776 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {21008#true} {21774#(< ~counter~0 10)} #61#return; {21774#(< ~counter~0 10)} is VALID [2022-04-08 11:15:20,776 INFO L290 TraceCheckUtils]: 212: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,776 INFO L290 TraceCheckUtils]: 211: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,776 INFO L290 TraceCheckUtils]: 210: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,776 INFO L272 TraceCheckUtils]: 209: Hoare triple {21774#(< ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,776 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {21008#true} {21774#(< ~counter~0 10)} #59#return; {21774#(< ~counter~0 10)} is VALID [2022-04-08 11:15:20,776 INFO L290 TraceCheckUtils]: 207: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,776 INFO L290 TraceCheckUtils]: 206: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,776 INFO L290 TraceCheckUtils]: 205: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,777 INFO L272 TraceCheckUtils]: 204: Hoare triple {21774#(< ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,777 INFO L290 TraceCheckUtils]: 203: Hoare triple {21774#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {21774#(< ~counter~0 10)} is VALID [2022-04-08 11:15:20,777 INFO L290 TraceCheckUtils]: 202: Hoare triple {21627#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21774#(< ~counter~0 10)} is VALID [2022-04-08 11:15:20,778 INFO L290 TraceCheckUtils]: 201: Hoare triple {21627#(<= ~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; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,778 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {21008#true} {21627#(<= ~counter~0 8)} #67#return; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,778 INFO L290 TraceCheckUtils]: 199: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,778 INFO L290 TraceCheckUtils]: 198: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,778 INFO L290 TraceCheckUtils]: 197: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,778 INFO L272 TraceCheckUtils]: 196: Hoare triple {21627#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,778 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {21008#true} {21627#(<= ~counter~0 8)} #65#return; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,779 INFO L290 TraceCheckUtils]: 194: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,779 INFO L290 TraceCheckUtils]: 193: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,779 INFO L290 TraceCheckUtils]: 192: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,779 INFO L272 TraceCheckUtils]: 191: Hoare triple {21627#(<= ~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)); {21008#true} is VALID [2022-04-08 11:15:20,779 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {21008#true} {21627#(<= ~counter~0 8)} #63#return; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,779 INFO L290 TraceCheckUtils]: 189: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,779 INFO L290 TraceCheckUtils]: 188: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,779 INFO L290 TraceCheckUtils]: 187: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,779 INFO L272 TraceCheckUtils]: 186: Hoare triple {21627#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,780 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {21008#true} {21627#(<= ~counter~0 8)} #61#return; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,780 INFO L290 TraceCheckUtils]: 184: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,780 INFO L290 TraceCheckUtils]: 183: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,780 INFO L290 TraceCheckUtils]: 182: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,780 INFO L272 TraceCheckUtils]: 181: Hoare triple {21627#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,780 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {21008#true} {21627#(<= ~counter~0 8)} #59#return; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,780 INFO L290 TraceCheckUtils]: 179: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,780 INFO L290 TraceCheckUtils]: 178: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,780 INFO L290 TraceCheckUtils]: 177: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,780 INFO L272 TraceCheckUtils]: 176: Hoare triple {21627#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,781 INFO L290 TraceCheckUtils]: 175: Hoare triple {21627#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,781 INFO L290 TraceCheckUtils]: 174: Hoare triple {21542#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21627#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:20,781 INFO L290 TraceCheckUtils]: 173: Hoare triple {21542#(<= ~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; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,782 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {21008#true} {21542#(<= ~counter~0 7)} #67#return; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,782 INFO L290 TraceCheckUtils]: 171: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,782 INFO L290 TraceCheckUtils]: 170: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,782 INFO L290 TraceCheckUtils]: 169: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,782 INFO L272 TraceCheckUtils]: 168: Hoare triple {21542#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,782 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {21008#true} {21542#(<= ~counter~0 7)} #65#return; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,782 INFO L290 TraceCheckUtils]: 166: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,782 INFO L290 TraceCheckUtils]: 165: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,782 INFO L290 TraceCheckUtils]: 164: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,782 INFO L272 TraceCheckUtils]: 163: Hoare triple {21542#(<= ~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)); {21008#true} is VALID [2022-04-08 11:15:20,783 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {21008#true} {21542#(<= ~counter~0 7)} #63#return; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,783 INFO L290 TraceCheckUtils]: 161: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,783 INFO L290 TraceCheckUtils]: 160: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,783 INFO L290 TraceCheckUtils]: 159: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,783 INFO L272 TraceCheckUtils]: 158: Hoare triple {21542#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,783 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {21008#true} {21542#(<= ~counter~0 7)} #61#return; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,783 INFO L290 TraceCheckUtils]: 156: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,783 INFO L290 TraceCheckUtils]: 155: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,784 INFO L290 TraceCheckUtils]: 154: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,784 INFO L272 TraceCheckUtils]: 153: Hoare triple {21542#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,784 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {21008#true} {21542#(<= ~counter~0 7)} #59#return; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,784 INFO L290 TraceCheckUtils]: 151: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,784 INFO L290 TraceCheckUtils]: 150: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,784 INFO L290 TraceCheckUtils]: 149: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,784 INFO L272 TraceCheckUtils]: 148: Hoare triple {21542#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,784 INFO L290 TraceCheckUtils]: 147: Hoare triple {21542#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,785 INFO L290 TraceCheckUtils]: 146: Hoare triple {21457#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21542#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:20,785 INFO L290 TraceCheckUtils]: 145: Hoare triple {21457#(<= ~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; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,785 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {21008#true} {21457#(<= ~counter~0 6)} #67#return; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,785 INFO L290 TraceCheckUtils]: 143: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,785 INFO L290 TraceCheckUtils]: 142: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,785 INFO L290 TraceCheckUtils]: 141: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,786 INFO L272 TraceCheckUtils]: 140: Hoare triple {21457#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,786 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {21008#true} {21457#(<= ~counter~0 6)} #65#return; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,786 INFO L290 TraceCheckUtils]: 138: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,786 INFO L290 TraceCheckUtils]: 137: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,786 INFO L290 TraceCheckUtils]: 136: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,786 INFO L272 TraceCheckUtils]: 135: Hoare triple {21457#(<= ~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)); {21008#true} is VALID [2022-04-08 11:15:20,786 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {21008#true} {21457#(<= ~counter~0 6)} #63#return; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,786 INFO L290 TraceCheckUtils]: 133: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,787 INFO L290 TraceCheckUtils]: 132: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,787 INFO L290 TraceCheckUtils]: 131: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,787 INFO L272 TraceCheckUtils]: 130: Hoare triple {21457#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,787 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {21008#true} {21457#(<= ~counter~0 6)} #61#return; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,787 INFO L290 TraceCheckUtils]: 128: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,787 INFO L290 TraceCheckUtils]: 127: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,787 INFO L290 TraceCheckUtils]: 126: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,787 INFO L272 TraceCheckUtils]: 125: Hoare triple {21457#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,787 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {21008#true} {21457#(<= ~counter~0 6)} #59#return; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,788 INFO L290 TraceCheckUtils]: 123: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,788 INFO L290 TraceCheckUtils]: 122: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,788 INFO L290 TraceCheckUtils]: 121: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,788 INFO L272 TraceCheckUtils]: 120: Hoare triple {21457#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,788 INFO L290 TraceCheckUtils]: 119: Hoare triple {21457#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,788 INFO L290 TraceCheckUtils]: 118: Hoare triple {21372#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21457#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:20,789 INFO L290 TraceCheckUtils]: 117: Hoare triple {21372#(<= ~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; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,789 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {21008#true} {21372#(<= ~counter~0 5)} #67#return; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,789 INFO L290 TraceCheckUtils]: 115: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,789 INFO L290 TraceCheckUtils]: 114: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,789 INFO L290 TraceCheckUtils]: 113: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,789 INFO L272 TraceCheckUtils]: 112: Hoare triple {21372#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,789 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {21008#true} {21372#(<= ~counter~0 5)} #65#return; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,790 INFO L290 TraceCheckUtils]: 110: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,790 INFO L290 TraceCheckUtils]: 109: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,790 INFO L290 TraceCheckUtils]: 108: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,790 INFO L272 TraceCheckUtils]: 107: Hoare triple {21372#(<= ~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)); {21008#true} is VALID [2022-04-08 11:15:20,790 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {21008#true} {21372#(<= ~counter~0 5)} #63#return; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,790 INFO L290 TraceCheckUtils]: 105: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,790 INFO L290 TraceCheckUtils]: 104: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,790 INFO L290 TraceCheckUtils]: 103: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,790 INFO L272 TraceCheckUtils]: 102: Hoare triple {21372#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,791 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {21008#true} {21372#(<= ~counter~0 5)} #61#return; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,791 INFO L290 TraceCheckUtils]: 100: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,791 INFO L290 TraceCheckUtils]: 99: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,791 INFO L290 TraceCheckUtils]: 98: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,791 INFO L272 TraceCheckUtils]: 97: Hoare triple {21372#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,791 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {21008#true} {21372#(<= ~counter~0 5)} #59#return; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,791 INFO L290 TraceCheckUtils]: 95: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,791 INFO L290 TraceCheckUtils]: 94: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,791 INFO L290 TraceCheckUtils]: 93: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,791 INFO L272 TraceCheckUtils]: 92: Hoare triple {21372#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,792 INFO L290 TraceCheckUtils]: 91: Hoare triple {21372#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,792 INFO L290 TraceCheckUtils]: 90: Hoare triple {21287#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21372#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:20,792 INFO L290 TraceCheckUtils]: 89: Hoare triple {21287#(<= ~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; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,793 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {21008#true} {21287#(<= ~counter~0 4)} #67#return; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,793 INFO L290 TraceCheckUtils]: 87: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,793 INFO L290 TraceCheckUtils]: 86: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,793 INFO L290 TraceCheckUtils]: 85: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,793 INFO L272 TraceCheckUtils]: 84: Hoare triple {21287#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,793 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {21008#true} {21287#(<= ~counter~0 4)} #65#return; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,793 INFO L290 TraceCheckUtils]: 82: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,793 INFO L290 TraceCheckUtils]: 81: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,793 INFO L290 TraceCheckUtils]: 80: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,793 INFO L272 TraceCheckUtils]: 79: Hoare triple {21287#(<= ~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)); {21008#true} is VALID [2022-04-08 11:15:20,794 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21008#true} {21287#(<= ~counter~0 4)} #63#return; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,794 INFO L290 TraceCheckUtils]: 77: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,794 INFO L290 TraceCheckUtils]: 76: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,794 INFO L290 TraceCheckUtils]: 75: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,794 INFO L272 TraceCheckUtils]: 74: Hoare triple {21287#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,794 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {21008#true} {21287#(<= ~counter~0 4)} #61#return; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,794 INFO L290 TraceCheckUtils]: 72: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,794 INFO L290 TraceCheckUtils]: 71: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,794 INFO L290 TraceCheckUtils]: 70: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,795 INFO L272 TraceCheckUtils]: 69: Hoare triple {21287#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,795 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21008#true} {21287#(<= ~counter~0 4)} #59#return; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,795 INFO L290 TraceCheckUtils]: 67: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,795 INFO L290 TraceCheckUtils]: 66: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,795 INFO L290 TraceCheckUtils]: 65: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,795 INFO L272 TraceCheckUtils]: 64: Hoare triple {21287#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,795 INFO L290 TraceCheckUtils]: 63: Hoare triple {21287#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,796 INFO L290 TraceCheckUtils]: 62: Hoare triple {21202#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21287#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:20,796 INFO L290 TraceCheckUtils]: 61: Hoare triple {21202#(<= ~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; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,796 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {21008#true} {21202#(<= ~counter~0 3)} #67#return; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,796 INFO L290 TraceCheckUtils]: 59: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,796 INFO L290 TraceCheckUtils]: 58: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,796 INFO L290 TraceCheckUtils]: 57: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,796 INFO L272 TraceCheckUtils]: 56: Hoare triple {21202#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,797 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21008#true} {21202#(<= ~counter~0 3)} #65#return; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,797 INFO L290 TraceCheckUtils]: 54: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,797 INFO L290 TraceCheckUtils]: 53: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,797 INFO L290 TraceCheckUtils]: 52: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,797 INFO L272 TraceCheckUtils]: 51: Hoare triple {21202#(<= ~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)); {21008#true} is VALID [2022-04-08 11:15:20,797 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21008#true} {21202#(<= ~counter~0 3)} #63#return; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,797 INFO L290 TraceCheckUtils]: 49: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,797 INFO L290 TraceCheckUtils]: 48: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,798 INFO L290 TraceCheckUtils]: 47: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,798 INFO L272 TraceCheckUtils]: 46: Hoare triple {21202#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,801 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {21008#true} {21202#(<= ~counter~0 3)} #61#return; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,801 INFO L290 TraceCheckUtils]: 43: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,801 INFO L272 TraceCheckUtils]: 41: Hoare triple {21202#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,801 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {21008#true} {21202#(<= ~counter~0 3)} #59#return; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,801 INFO L272 TraceCheckUtils]: 36: Hoare triple {21202#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {21202#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,802 INFO L290 TraceCheckUtils]: 34: Hoare triple {21117#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21202#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:20,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {21117#(<= ~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; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,803 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21008#true} {21117#(<= ~counter~0 2)} #67#return; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,803 INFO L290 TraceCheckUtils]: 30: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,803 INFO L290 TraceCheckUtils]: 29: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,803 INFO L272 TraceCheckUtils]: 28: Hoare triple {21117#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,803 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {21008#true} {21117#(<= ~counter~0 2)} #65#return; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,804 INFO L272 TraceCheckUtils]: 23: Hoare triple {21117#(<= ~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)); {21008#true} is VALID [2022-04-08 11:15:20,804 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21008#true} {21117#(<= ~counter~0 2)} #63#return; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,804 INFO L272 TraceCheckUtils]: 18: Hoare triple {21117#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,804 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21008#true} {21117#(<= ~counter~0 2)} #61#return; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,805 INFO L272 TraceCheckUtils]: 13: Hoare triple {21117#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,805 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {21008#true} {21117#(<= ~counter~0 2)} #59#return; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {21008#true} assume true; {21008#true} is VALID [2022-04-08 11:15:20,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {21008#true} assume !(0 == ~cond); {21008#true} is VALID [2022-04-08 11:15:20,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {21008#true} ~cond := #in~cond; {21008#true} is VALID [2022-04-08 11:15:20,805 INFO L272 TraceCheckUtils]: 8: Hoare triple {21117#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21008#true} is VALID [2022-04-08 11:15:20,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {21117#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {21032#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21117#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:20,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {21032#(<= ~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; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {21032#(<= ~counter~0 1)} call #t~ret6 := main(); {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21032#(<= ~counter~0 1)} {21008#true} #81#return; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {21032#(<= ~counter~0 1)} assume true; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {21008#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; {21032#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:20,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {21008#true} call ULTIMATE.init(); {21008#true} is VALID [2022-04-08 11:15:20,808 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-08 11:15:20,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:15:20,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049003984] [2022-04-08 11:15:20,808 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:15:20,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853489194] [2022-04-08 11:15:20,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853489194] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:15:20,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:15:20,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-08 11:15:20,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:15:20,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1026009007] [2022-04-08 11:15:20,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1026009007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:15:20,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:15:20,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 11:15:20,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578121174] [2022-04-08 11:15:20,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:15:20,816 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-08 11:15:20,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:15:20,817 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-08 11:15:20,946 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-08 11:15:20,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 11:15:20,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:15:20,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 11:15:20,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 11:15:20,947 INFO L87 Difference]: Start difference. First operand 165 states and 186 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-08 11:15:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:15:22,372 INFO L93 Difference]: Finished difference Result 194 states and 219 transitions. [2022-04-08 11:15:22,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 11:15:22,372 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-08 11:15:22,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:15:22,373 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-08 11:15:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 171 transitions. [2022-04-08 11:15:22,375 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-08 11:15:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 171 transitions. [2022-04-08 11:15:22,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 171 transitions. [2022-04-08 11:15:22,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:15:22,509 INFO L225 Difference]: With dead ends: 194 [2022-04-08 11:15:22,509 INFO L226 Difference]: Without dead ends: 181 [2022-04-08 11:15:22,510 INFO L912 BasicCegarLoop]: 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-08 11:15:22,510 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 4 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:15:22,510 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 218 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:15:22,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-08 11:15:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-04-08 11:15:22,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:15:22,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 181 states, 105 states have (on average 1.019047619047619) internal successors, (107), 106 states have internal predecessors, (107), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-08 11:15:22,739 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 181 states, 105 states have (on average 1.019047619047619) internal successors, (107), 106 states have internal predecessors, (107), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-08 11:15:22,740 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 181 states, 105 states have (on average 1.019047619047619) internal successors, (107), 106 states have internal predecessors, (107), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-08 11:15:22,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:15:22,742 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2022-04-08 11:15:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2022-04-08 11:15:22,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:15:22,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:15:22,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 105 states have (on average 1.019047619047619) internal successors, (107), 106 states have internal predecessors, (107), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand 181 states. [2022-04-08 11:15:22,743 INFO L87 Difference]: Start difference. First operand has 181 states, 105 states have (on average 1.019047619047619) internal successors, (107), 106 states have internal predecessors, (107), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand 181 states. [2022-04-08 11:15:22,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:15:22,745 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2022-04-08 11:15:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2022-04-08 11:15:22,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:15:22,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:15:22,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:15:22,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:15:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 105 states have (on average 1.019047619047619) internal successors, (107), 106 states have internal predecessors, (107), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-08 11:15:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2022-04-08 11:15:22,749 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 241 [2022-04-08 11:15:22,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:15:22,749 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2022-04-08 11:15:22,749 INFO L479 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-08 11:15:22,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 181 states and 205 transitions. [2022-04-08 11:15:31,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 203 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 11:15:31,132 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2022-04-08 11:15:31,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-04-08 11:15:31,133 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:15:31,133 INFO L499 BasicCegarLoop]: 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-08 11:15:31,152 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-08 11:15:31,333 WARN L460 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-08 11:15:31,333 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:15:31,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:15:31,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1921553208, now seen corresponding path program 17 times [2022-04-08 11:15:31,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:15:31,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [180884034] [2022-04-08 11:15:31,568 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:15:31,568 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:15:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1921553208, now seen corresponding path program 18 times [2022-04-08 11:15:31,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:15:31,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935585581] [2022-04-08 11:15:31,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:15:31,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:15:31,584 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:15:31,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [798586974] [2022-04-08 11:15:31,584 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:15:31,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:15:31,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:15:31,585 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-08 11:15:31,586 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-08 11:15:32,175 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-08 11:15:32,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:15:32,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 11:15:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:15:32,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:15:33,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {23595#true} call ULTIMATE.init(); {23595#true} is VALID [2022-04-08 11:15:33,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {23595#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; {23603#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:33,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {23603#(<= ~counter~0 0)} assume true; {23603#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:33,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23603#(<= ~counter~0 0)} {23595#true} #81#return; {23603#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:33,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {23603#(<= ~counter~0 0)} call #t~ret6 := main(); {23603#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:33,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {23603#(<= ~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; {23603#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:33,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {23603#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {23619#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,115 INFO L272 TraceCheckUtils]: 8: Hoare triple {23619#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {23619#(<= ~counter~0 1)} ~cond := #in~cond; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {23619#(<= ~counter~0 1)} assume !(0 == ~cond); {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {23619#(<= ~counter~0 1)} assume true; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,116 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {23619#(<= ~counter~0 1)} {23619#(<= ~counter~0 1)} #59#return; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,117 INFO L272 TraceCheckUtils]: 13: Hoare triple {23619#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {23619#(<= ~counter~0 1)} ~cond := #in~cond; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {23619#(<= ~counter~0 1)} assume !(0 == ~cond); {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {23619#(<= ~counter~0 1)} assume true; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,118 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {23619#(<= ~counter~0 1)} {23619#(<= ~counter~0 1)} #61#return; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,118 INFO L272 TraceCheckUtils]: 18: Hoare triple {23619#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {23619#(<= ~counter~0 1)} ~cond := #in~cond; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {23619#(<= ~counter~0 1)} assume !(0 == ~cond); {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {23619#(<= ~counter~0 1)} assume true; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,119 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {23619#(<= ~counter~0 1)} {23619#(<= ~counter~0 1)} #63#return; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,120 INFO L272 TraceCheckUtils]: 23: Hoare triple {23619#(<= ~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)); {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {23619#(<= ~counter~0 1)} ~cond := #in~cond; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {23619#(<= ~counter~0 1)} assume !(0 == ~cond); {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {23619#(<= ~counter~0 1)} assume true; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,121 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {23619#(<= ~counter~0 1)} {23619#(<= ~counter~0 1)} #65#return; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,122 INFO L272 TraceCheckUtils]: 28: Hoare triple {23619#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {23619#(<= ~counter~0 1)} ~cond := #in~cond; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {23619#(<= ~counter~0 1)} assume !(0 == ~cond); {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {23619#(<= ~counter~0 1)} assume true; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,123 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23619#(<= ~counter~0 1)} {23619#(<= ~counter~0 1)} #67#return; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {23619#(<= ~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; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {23619#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {23704#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,124 INFO L272 TraceCheckUtils]: 36: Hoare triple {23704#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {23704#(<= ~counter~0 2)} ~cond := #in~cond; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {23704#(<= ~counter~0 2)} assume !(0 == ~cond); {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {23704#(<= ~counter~0 2)} assume true; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,126 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {23704#(<= ~counter~0 2)} {23704#(<= ~counter~0 2)} #59#return; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,126 INFO L272 TraceCheckUtils]: 41: Hoare triple {23704#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,126 INFO L290 TraceCheckUtils]: 42: Hoare triple {23704#(<= ~counter~0 2)} ~cond := #in~cond; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,127 INFO L290 TraceCheckUtils]: 43: Hoare triple {23704#(<= ~counter~0 2)} assume !(0 == ~cond); {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {23704#(<= ~counter~0 2)} assume true; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,127 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {23704#(<= ~counter~0 2)} {23704#(<= ~counter~0 2)} #61#return; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,128 INFO L272 TraceCheckUtils]: 46: Hoare triple {23704#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,128 INFO L290 TraceCheckUtils]: 47: Hoare triple {23704#(<= ~counter~0 2)} ~cond := #in~cond; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,128 INFO L290 TraceCheckUtils]: 48: Hoare triple {23704#(<= ~counter~0 2)} assume !(0 == ~cond); {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,128 INFO L290 TraceCheckUtils]: 49: Hoare triple {23704#(<= ~counter~0 2)} assume true; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,129 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23704#(<= ~counter~0 2)} {23704#(<= ~counter~0 2)} #63#return; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,129 INFO L272 TraceCheckUtils]: 51: Hoare triple {23704#(<= ~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)); {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,130 INFO L290 TraceCheckUtils]: 52: Hoare triple {23704#(<= ~counter~0 2)} ~cond := #in~cond; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {23704#(<= ~counter~0 2)} assume !(0 == ~cond); {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,130 INFO L290 TraceCheckUtils]: 54: Hoare triple {23704#(<= ~counter~0 2)} assume true; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,131 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23704#(<= ~counter~0 2)} {23704#(<= ~counter~0 2)} #65#return; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,131 INFO L272 TraceCheckUtils]: 56: Hoare triple {23704#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,131 INFO L290 TraceCheckUtils]: 57: Hoare triple {23704#(<= ~counter~0 2)} ~cond := #in~cond; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,132 INFO L290 TraceCheckUtils]: 58: Hoare triple {23704#(<= ~counter~0 2)} assume !(0 == ~cond); {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,132 INFO L290 TraceCheckUtils]: 59: Hoare triple {23704#(<= ~counter~0 2)} assume true; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,132 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {23704#(<= ~counter~0 2)} {23704#(<= ~counter~0 2)} #67#return; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,133 INFO L290 TraceCheckUtils]: 61: Hoare triple {23704#(<= ~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; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,133 INFO L290 TraceCheckUtils]: 62: Hoare triple {23704#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,133 INFO L290 TraceCheckUtils]: 63: Hoare triple {23789#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,134 INFO L272 TraceCheckUtils]: 64: Hoare triple {23789#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {23789#(<= ~counter~0 3)} ~cond := #in~cond; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,134 INFO L290 TraceCheckUtils]: 66: Hoare triple {23789#(<= ~counter~0 3)} assume !(0 == ~cond); {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,135 INFO L290 TraceCheckUtils]: 67: Hoare triple {23789#(<= ~counter~0 3)} assume true; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,135 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {23789#(<= ~counter~0 3)} {23789#(<= ~counter~0 3)} #59#return; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,135 INFO L272 TraceCheckUtils]: 69: Hoare triple {23789#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,136 INFO L290 TraceCheckUtils]: 70: Hoare triple {23789#(<= ~counter~0 3)} ~cond := #in~cond; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,136 INFO L290 TraceCheckUtils]: 71: Hoare triple {23789#(<= ~counter~0 3)} assume !(0 == ~cond); {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,136 INFO L290 TraceCheckUtils]: 72: Hoare triple {23789#(<= ~counter~0 3)} assume true; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,137 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {23789#(<= ~counter~0 3)} {23789#(<= ~counter~0 3)} #61#return; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,137 INFO L272 TraceCheckUtils]: 74: Hoare triple {23789#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,137 INFO L290 TraceCheckUtils]: 75: Hoare triple {23789#(<= ~counter~0 3)} ~cond := #in~cond; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,138 INFO L290 TraceCheckUtils]: 76: Hoare triple {23789#(<= ~counter~0 3)} assume !(0 == ~cond); {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,138 INFO L290 TraceCheckUtils]: 77: Hoare triple {23789#(<= ~counter~0 3)} assume true; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,138 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {23789#(<= ~counter~0 3)} {23789#(<= ~counter~0 3)} #63#return; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,139 INFO L272 TraceCheckUtils]: 79: Hoare triple {23789#(<= ~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)); {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,139 INFO L290 TraceCheckUtils]: 80: Hoare triple {23789#(<= ~counter~0 3)} ~cond := #in~cond; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,139 INFO L290 TraceCheckUtils]: 81: Hoare triple {23789#(<= ~counter~0 3)} assume !(0 == ~cond); {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,140 INFO L290 TraceCheckUtils]: 82: Hoare triple {23789#(<= ~counter~0 3)} assume true; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,140 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {23789#(<= ~counter~0 3)} {23789#(<= ~counter~0 3)} #65#return; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,141 INFO L272 TraceCheckUtils]: 84: Hoare triple {23789#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,141 INFO L290 TraceCheckUtils]: 85: Hoare triple {23789#(<= ~counter~0 3)} ~cond := #in~cond; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,141 INFO L290 TraceCheckUtils]: 86: Hoare triple {23789#(<= ~counter~0 3)} assume !(0 == ~cond); {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,141 INFO L290 TraceCheckUtils]: 87: Hoare triple {23789#(<= ~counter~0 3)} assume true; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,142 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {23789#(<= ~counter~0 3)} {23789#(<= ~counter~0 3)} #67#return; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,142 INFO L290 TraceCheckUtils]: 89: Hoare triple {23789#(<= ~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; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,143 INFO L290 TraceCheckUtils]: 90: Hoare triple {23789#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,143 INFO L290 TraceCheckUtils]: 91: Hoare triple {23874#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,143 INFO L272 TraceCheckUtils]: 92: Hoare triple {23874#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,144 INFO L290 TraceCheckUtils]: 93: Hoare triple {23874#(<= ~counter~0 4)} ~cond := #in~cond; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,144 INFO L290 TraceCheckUtils]: 94: Hoare triple {23874#(<= ~counter~0 4)} assume !(0 == ~cond); {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,144 INFO L290 TraceCheckUtils]: 95: Hoare triple {23874#(<= ~counter~0 4)} assume true; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,145 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {23874#(<= ~counter~0 4)} {23874#(<= ~counter~0 4)} #59#return; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,145 INFO L272 TraceCheckUtils]: 97: Hoare triple {23874#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,145 INFO L290 TraceCheckUtils]: 98: Hoare triple {23874#(<= ~counter~0 4)} ~cond := #in~cond; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,146 INFO L290 TraceCheckUtils]: 99: Hoare triple {23874#(<= ~counter~0 4)} assume !(0 == ~cond); {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,146 INFO L290 TraceCheckUtils]: 100: Hoare triple {23874#(<= ~counter~0 4)} assume true; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,146 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {23874#(<= ~counter~0 4)} {23874#(<= ~counter~0 4)} #61#return; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,147 INFO L272 TraceCheckUtils]: 102: Hoare triple {23874#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,147 INFO L290 TraceCheckUtils]: 103: Hoare triple {23874#(<= ~counter~0 4)} ~cond := #in~cond; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,147 INFO L290 TraceCheckUtils]: 104: Hoare triple {23874#(<= ~counter~0 4)} assume !(0 == ~cond); {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,148 INFO L290 TraceCheckUtils]: 105: Hoare triple {23874#(<= ~counter~0 4)} assume true; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,148 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {23874#(<= ~counter~0 4)} {23874#(<= ~counter~0 4)} #63#return; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,149 INFO L272 TraceCheckUtils]: 107: Hoare triple {23874#(<= ~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)); {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,149 INFO L290 TraceCheckUtils]: 108: Hoare triple {23874#(<= ~counter~0 4)} ~cond := #in~cond; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,149 INFO L290 TraceCheckUtils]: 109: Hoare triple {23874#(<= ~counter~0 4)} assume !(0 == ~cond); {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,149 INFO L290 TraceCheckUtils]: 110: Hoare triple {23874#(<= ~counter~0 4)} assume true; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,150 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {23874#(<= ~counter~0 4)} {23874#(<= ~counter~0 4)} #65#return; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,150 INFO L272 TraceCheckUtils]: 112: Hoare triple {23874#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,151 INFO L290 TraceCheckUtils]: 113: Hoare triple {23874#(<= ~counter~0 4)} ~cond := #in~cond; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,151 INFO L290 TraceCheckUtils]: 114: Hoare triple {23874#(<= ~counter~0 4)} assume !(0 == ~cond); {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,151 INFO L290 TraceCheckUtils]: 115: Hoare triple {23874#(<= ~counter~0 4)} assume true; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,152 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {23874#(<= ~counter~0 4)} {23874#(<= ~counter~0 4)} #67#return; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,152 INFO L290 TraceCheckUtils]: 117: Hoare triple {23874#(<= ~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; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,152 INFO L290 TraceCheckUtils]: 118: Hoare triple {23874#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,153 INFO L290 TraceCheckUtils]: 119: Hoare triple {23959#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,153 INFO L272 TraceCheckUtils]: 120: Hoare triple {23959#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,153 INFO L290 TraceCheckUtils]: 121: Hoare triple {23959#(<= ~counter~0 5)} ~cond := #in~cond; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,154 INFO L290 TraceCheckUtils]: 122: Hoare triple {23959#(<= ~counter~0 5)} assume !(0 == ~cond); {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,154 INFO L290 TraceCheckUtils]: 123: Hoare triple {23959#(<= ~counter~0 5)} assume true; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,154 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {23959#(<= ~counter~0 5)} {23959#(<= ~counter~0 5)} #59#return; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,155 INFO L272 TraceCheckUtils]: 125: Hoare triple {23959#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,155 INFO L290 TraceCheckUtils]: 126: Hoare triple {23959#(<= ~counter~0 5)} ~cond := #in~cond; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,155 INFO L290 TraceCheckUtils]: 127: Hoare triple {23959#(<= ~counter~0 5)} assume !(0 == ~cond); {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,156 INFO L290 TraceCheckUtils]: 128: Hoare triple {23959#(<= ~counter~0 5)} assume true; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,156 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {23959#(<= ~counter~0 5)} {23959#(<= ~counter~0 5)} #61#return; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,156 INFO L272 TraceCheckUtils]: 130: Hoare triple {23959#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,157 INFO L290 TraceCheckUtils]: 131: Hoare triple {23959#(<= ~counter~0 5)} ~cond := #in~cond; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,157 INFO L290 TraceCheckUtils]: 132: Hoare triple {23959#(<= ~counter~0 5)} assume !(0 == ~cond); {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,157 INFO L290 TraceCheckUtils]: 133: Hoare triple {23959#(<= ~counter~0 5)} assume true; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,158 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {23959#(<= ~counter~0 5)} {23959#(<= ~counter~0 5)} #63#return; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,158 INFO L272 TraceCheckUtils]: 135: Hoare triple {23959#(<= ~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)); {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,158 INFO L290 TraceCheckUtils]: 136: Hoare triple {23959#(<= ~counter~0 5)} ~cond := #in~cond; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,159 INFO L290 TraceCheckUtils]: 137: Hoare triple {23959#(<= ~counter~0 5)} assume !(0 == ~cond); {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,159 INFO L290 TraceCheckUtils]: 138: Hoare triple {23959#(<= ~counter~0 5)} assume true; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,160 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {23959#(<= ~counter~0 5)} {23959#(<= ~counter~0 5)} #65#return; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,160 INFO L272 TraceCheckUtils]: 140: Hoare triple {23959#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,160 INFO L290 TraceCheckUtils]: 141: Hoare triple {23959#(<= ~counter~0 5)} ~cond := #in~cond; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,161 INFO L290 TraceCheckUtils]: 142: Hoare triple {23959#(<= ~counter~0 5)} assume !(0 == ~cond); {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,161 INFO L290 TraceCheckUtils]: 143: Hoare triple {23959#(<= ~counter~0 5)} assume true; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,161 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {23959#(<= ~counter~0 5)} {23959#(<= ~counter~0 5)} #67#return; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,162 INFO L290 TraceCheckUtils]: 145: Hoare triple {23959#(<= ~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; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,162 INFO L290 TraceCheckUtils]: 146: Hoare triple {23959#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,162 INFO L290 TraceCheckUtils]: 147: Hoare triple {24044#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,163 INFO L272 TraceCheckUtils]: 148: Hoare triple {24044#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,163 INFO L290 TraceCheckUtils]: 149: Hoare triple {24044#(<= ~counter~0 6)} ~cond := #in~cond; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,163 INFO L290 TraceCheckUtils]: 150: Hoare triple {24044#(<= ~counter~0 6)} assume !(0 == ~cond); {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,164 INFO L290 TraceCheckUtils]: 151: Hoare triple {24044#(<= ~counter~0 6)} assume true; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,164 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {24044#(<= ~counter~0 6)} {24044#(<= ~counter~0 6)} #59#return; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,164 INFO L272 TraceCheckUtils]: 153: Hoare triple {24044#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,165 INFO L290 TraceCheckUtils]: 154: Hoare triple {24044#(<= ~counter~0 6)} ~cond := #in~cond; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,165 INFO L290 TraceCheckUtils]: 155: Hoare triple {24044#(<= ~counter~0 6)} assume !(0 == ~cond); {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,165 INFO L290 TraceCheckUtils]: 156: Hoare triple {24044#(<= ~counter~0 6)} assume true; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,166 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {24044#(<= ~counter~0 6)} {24044#(<= ~counter~0 6)} #61#return; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,166 INFO L272 TraceCheckUtils]: 158: Hoare triple {24044#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,166 INFO L290 TraceCheckUtils]: 159: Hoare triple {24044#(<= ~counter~0 6)} ~cond := #in~cond; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,166 INFO L290 TraceCheckUtils]: 160: Hoare triple {24044#(<= ~counter~0 6)} assume !(0 == ~cond); {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,167 INFO L290 TraceCheckUtils]: 161: Hoare triple {24044#(<= ~counter~0 6)} assume true; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,167 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {24044#(<= ~counter~0 6)} {24044#(<= ~counter~0 6)} #63#return; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,167 INFO L272 TraceCheckUtils]: 163: Hoare triple {24044#(<= ~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)); {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,168 INFO L290 TraceCheckUtils]: 164: Hoare triple {24044#(<= ~counter~0 6)} ~cond := #in~cond; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,168 INFO L290 TraceCheckUtils]: 165: Hoare triple {24044#(<= ~counter~0 6)} assume !(0 == ~cond); {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,168 INFO L290 TraceCheckUtils]: 166: Hoare triple {24044#(<= ~counter~0 6)} assume true; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,169 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {24044#(<= ~counter~0 6)} {24044#(<= ~counter~0 6)} #65#return; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,169 INFO L272 TraceCheckUtils]: 168: Hoare triple {24044#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,169 INFO L290 TraceCheckUtils]: 169: Hoare triple {24044#(<= ~counter~0 6)} ~cond := #in~cond; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,169 INFO L290 TraceCheckUtils]: 170: Hoare triple {24044#(<= ~counter~0 6)} assume !(0 == ~cond); {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,170 INFO L290 TraceCheckUtils]: 171: Hoare triple {24044#(<= ~counter~0 6)} assume true; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,170 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {24044#(<= ~counter~0 6)} {24044#(<= ~counter~0 6)} #67#return; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,170 INFO L290 TraceCheckUtils]: 173: Hoare triple {24044#(<= ~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; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,171 INFO L290 TraceCheckUtils]: 174: Hoare triple {24044#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,171 INFO L290 TraceCheckUtils]: 175: Hoare triple {24129#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,171 INFO L272 TraceCheckUtils]: 176: Hoare triple {24129#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,172 INFO L290 TraceCheckUtils]: 177: Hoare triple {24129#(<= ~counter~0 7)} ~cond := #in~cond; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,172 INFO L290 TraceCheckUtils]: 178: Hoare triple {24129#(<= ~counter~0 7)} assume !(0 == ~cond); {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,172 INFO L290 TraceCheckUtils]: 179: Hoare triple {24129#(<= ~counter~0 7)} assume true; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,172 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {24129#(<= ~counter~0 7)} {24129#(<= ~counter~0 7)} #59#return; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,173 INFO L272 TraceCheckUtils]: 181: Hoare triple {24129#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,173 INFO L290 TraceCheckUtils]: 182: Hoare triple {24129#(<= ~counter~0 7)} ~cond := #in~cond; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,173 INFO L290 TraceCheckUtils]: 183: Hoare triple {24129#(<= ~counter~0 7)} assume !(0 == ~cond); {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,174 INFO L290 TraceCheckUtils]: 184: Hoare triple {24129#(<= ~counter~0 7)} assume true; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,174 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {24129#(<= ~counter~0 7)} {24129#(<= ~counter~0 7)} #61#return; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,174 INFO L272 TraceCheckUtils]: 186: Hoare triple {24129#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,175 INFO L290 TraceCheckUtils]: 187: Hoare triple {24129#(<= ~counter~0 7)} ~cond := #in~cond; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,175 INFO L290 TraceCheckUtils]: 188: Hoare triple {24129#(<= ~counter~0 7)} assume !(0 == ~cond); {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,175 INFO L290 TraceCheckUtils]: 189: Hoare triple {24129#(<= ~counter~0 7)} assume true; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,175 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {24129#(<= ~counter~0 7)} {24129#(<= ~counter~0 7)} #63#return; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,176 INFO L272 TraceCheckUtils]: 191: Hoare triple {24129#(<= ~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)); {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,176 INFO L290 TraceCheckUtils]: 192: Hoare triple {24129#(<= ~counter~0 7)} ~cond := #in~cond; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,176 INFO L290 TraceCheckUtils]: 193: Hoare triple {24129#(<= ~counter~0 7)} assume !(0 == ~cond); {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,177 INFO L290 TraceCheckUtils]: 194: Hoare triple {24129#(<= ~counter~0 7)} assume true; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,177 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {24129#(<= ~counter~0 7)} {24129#(<= ~counter~0 7)} #65#return; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,177 INFO L272 TraceCheckUtils]: 196: Hoare triple {24129#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,178 INFO L290 TraceCheckUtils]: 197: Hoare triple {24129#(<= ~counter~0 7)} ~cond := #in~cond; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,178 INFO L290 TraceCheckUtils]: 198: Hoare triple {24129#(<= ~counter~0 7)} assume !(0 == ~cond); {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,178 INFO L290 TraceCheckUtils]: 199: Hoare triple {24129#(<= ~counter~0 7)} assume true; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,178 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {24129#(<= ~counter~0 7)} {24129#(<= ~counter~0 7)} #67#return; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,179 INFO L290 TraceCheckUtils]: 201: Hoare triple {24129#(<= ~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; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,179 INFO L290 TraceCheckUtils]: 202: Hoare triple {24129#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,179 INFO L290 TraceCheckUtils]: 203: Hoare triple {24214#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,180 INFO L272 TraceCheckUtils]: 204: Hoare triple {24214#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,180 INFO L290 TraceCheckUtils]: 205: Hoare triple {24214#(<= ~counter~0 8)} ~cond := #in~cond; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,180 INFO L290 TraceCheckUtils]: 206: Hoare triple {24214#(<= ~counter~0 8)} assume !(0 == ~cond); {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,180 INFO L290 TraceCheckUtils]: 207: Hoare triple {24214#(<= ~counter~0 8)} assume true; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,181 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {24214#(<= ~counter~0 8)} {24214#(<= ~counter~0 8)} #59#return; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,181 INFO L272 TraceCheckUtils]: 209: Hoare triple {24214#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,181 INFO L290 TraceCheckUtils]: 210: Hoare triple {24214#(<= ~counter~0 8)} ~cond := #in~cond; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,182 INFO L290 TraceCheckUtils]: 211: Hoare triple {24214#(<= ~counter~0 8)} assume !(0 == ~cond); {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,184 INFO L290 TraceCheckUtils]: 212: Hoare triple {24214#(<= ~counter~0 8)} assume true; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,184 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {24214#(<= ~counter~0 8)} {24214#(<= ~counter~0 8)} #61#return; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,184 INFO L272 TraceCheckUtils]: 214: Hoare triple {24214#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,185 INFO L290 TraceCheckUtils]: 215: Hoare triple {24214#(<= ~counter~0 8)} ~cond := #in~cond; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,185 INFO L290 TraceCheckUtils]: 216: Hoare triple {24214#(<= ~counter~0 8)} assume !(0 == ~cond); {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,185 INFO L290 TraceCheckUtils]: 217: Hoare triple {24214#(<= ~counter~0 8)} assume true; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,185 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {24214#(<= ~counter~0 8)} {24214#(<= ~counter~0 8)} #63#return; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,186 INFO L272 TraceCheckUtils]: 219: Hoare triple {24214#(<= ~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)); {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,186 INFO L290 TraceCheckUtils]: 220: Hoare triple {24214#(<= ~counter~0 8)} ~cond := #in~cond; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,186 INFO L290 TraceCheckUtils]: 221: Hoare triple {24214#(<= ~counter~0 8)} assume !(0 == ~cond); {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,186 INFO L290 TraceCheckUtils]: 222: Hoare triple {24214#(<= ~counter~0 8)} assume true; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,187 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {24214#(<= ~counter~0 8)} {24214#(<= ~counter~0 8)} #65#return; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,187 INFO L272 TraceCheckUtils]: 224: Hoare triple {24214#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,187 INFO L290 TraceCheckUtils]: 225: Hoare triple {24214#(<= ~counter~0 8)} ~cond := #in~cond; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,188 INFO L290 TraceCheckUtils]: 226: Hoare triple {24214#(<= ~counter~0 8)} assume !(0 == ~cond); {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,188 INFO L290 TraceCheckUtils]: 227: Hoare triple {24214#(<= ~counter~0 8)} assume true; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,188 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {24214#(<= ~counter~0 8)} {24214#(<= ~counter~0 8)} #67#return; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,189 INFO L290 TraceCheckUtils]: 229: Hoare triple {24214#(<= ~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; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,189 INFO L290 TraceCheckUtils]: 230: Hoare triple {24214#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,189 INFO L290 TraceCheckUtils]: 231: Hoare triple {24299#(<= ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,190 INFO L272 TraceCheckUtils]: 232: Hoare triple {24299#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,190 INFO L290 TraceCheckUtils]: 233: Hoare triple {24299#(<= ~counter~0 9)} ~cond := #in~cond; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,190 INFO L290 TraceCheckUtils]: 234: Hoare triple {24299#(<= ~counter~0 9)} assume !(0 == ~cond); {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,190 INFO L290 TraceCheckUtils]: 235: Hoare triple {24299#(<= ~counter~0 9)} assume true; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,191 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {24299#(<= ~counter~0 9)} {24299#(<= ~counter~0 9)} #59#return; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,191 INFO L272 TraceCheckUtils]: 237: Hoare triple {24299#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,191 INFO L290 TraceCheckUtils]: 238: Hoare triple {24299#(<= ~counter~0 9)} ~cond := #in~cond; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,191 INFO L290 TraceCheckUtils]: 239: Hoare triple {24299#(<= ~counter~0 9)} assume !(0 == ~cond); {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,192 INFO L290 TraceCheckUtils]: 240: Hoare triple {24299#(<= ~counter~0 9)} assume true; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,192 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {24299#(<= ~counter~0 9)} {24299#(<= ~counter~0 9)} #61#return; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,192 INFO L272 TraceCheckUtils]: 242: Hoare triple {24299#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,193 INFO L290 TraceCheckUtils]: 243: Hoare triple {24299#(<= ~counter~0 9)} ~cond := #in~cond; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,193 INFO L290 TraceCheckUtils]: 244: Hoare triple {24299#(<= ~counter~0 9)} assume !(0 == ~cond); {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,193 INFO L290 TraceCheckUtils]: 245: Hoare triple {24299#(<= ~counter~0 9)} assume true; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,193 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {24299#(<= ~counter~0 9)} {24299#(<= ~counter~0 9)} #63#return; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,194 INFO L272 TraceCheckUtils]: 247: Hoare triple {24299#(<= ~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)); {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,194 INFO L290 TraceCheckUtils]: 248: Hoare triple {24299#(<= ~counter~0 9)} ~cond := #in~cond; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,194 INFO L290 TraceCheckUtils]: 249: Hoare triple {24299#(<= ~counter~0 9)} assume !(0 == ~cond); {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,195 INFO L290 TraceCheckUtils]: 250: Hoare triple {24299#(<= ~counter~0 9)} assume true; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,195 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {24299#(<= ~counter~0 9)} {24299#(<= ~counter~0 9)} #65#return; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,195 INFO L272 TraceCheckUtils]: 252: Hoare triple {24299#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,196 INFO L290 TraceCheckUtils]: 253: Hoare triple {24299#(<= ~counter~0 9)} ~cond := #in~cond; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,196 INFO L290 TraceCheckUtils]: 254: Hoare triple {24299#(<= ~counter~0 9)} assume !(0 == ~cond); {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,196 INFO L290 TraceCheckUtils]: 255: Hoare triple {24299#(<= ~counter~0 9)} assume true; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,196 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {24299#(<= ~counter~0 9)} {24299#(<= ~counter~0 9)} #67#return; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,197 INFO L290 TraceCheckUtils]: 257: Hoare triple {24299#(<= ~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; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,197 INFO L290 TraceCheckUtils]: 258: Hoare triple {24299#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24384#(<= |main_#t~post5| 9)} is VALID [2022-04-08 11:15:33,197 INFO L290 TraceCheckUtils]: 259: Hoare triple {24384#(<= |main_#t~post5| 9)} assume !(#t~post5 < 10);havoc #t~post5; {23596#false} is VALID [2022-04-08 11:15:33,197 INFO L272 TraceCheckUtils]: 260: Hoare triple {23596#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23596#false} is VALID [2022-04-08 11:15:33,197 INFO L290 TraceCheckUtils]: 261: Hoare triple {23596#false} ~cond := #in~cond; {23596#false} is VALID [2022-04-08 11:15:33,197 INFO L290 TraceCheckUtils]: 262: Hoare triple {23596#false} assume !(0 == ~cond); {23596#false} is VALID [2022-04-08 11:15:33,197 INFO L290 TraceCheckUtils]: 263: Hoare triple {23596#false} assume true; {23596#false} is VALID [2022-04-08 11:15:33,198 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {23596#false} {23596#false} #69#return; {23596#false} is VALID [2022-04-08 11:15:33,198 INFO L272 TraceCheckUtils]: 265: Hoare triple {23596#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {23596#false} is VALID [2022-04-08 11:15:33,198 INFO L290 TraceCheckUtils]: 266: Hoare triple {23596#false} ~cond := #in~cond; {23596#false} is VALID [2022-04-08 11:15:33,198 INFO L290 TraceCheckUtils]: 267: Hoare triple {23596#false} assume 0 == ~cond; {23596#false} is VALID [2022-04-08 11:15:33,198 INFO L290 TraceCheckUtils]: 268: Hoare triple {23596#false} assume !false; {23596#false} is VALID [2022-04-08 11:15:33,200 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-08 11:15:33,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:15:33,868 INFO L290 TraceCheckUtils]: 268: Hoare triple {23596#false} assume !false; {23596#false} is VALID [2022-04-08 11:15:33,868 INFO L290 TraceCheckUtils]: 267: Hoare triple {23596#false} assume 0 == ~cond; {23596#false} is VALID [2022-04-08 11:15:33,868 INFO L290 TraceCheckUtils]: 266: Hoare triple {23596#false} ~cond := #in~cond; {23596#false} is VALID [2022-04-08 11:15:33,868 INFO L272 TraceCheckUtils]: 265: Hoare triple {23596#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {23596#false} is VALID [2022-04-08 11:15:33,869 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {23595#true} {23596#false} #69#return; {23596#false} is VALID [2022-04-08 11:15:33,869 INFO L290 TraceCheckUtils]: 263: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,869 INFO L290 TraceCheckUtils]: 262: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,869 INFO L290 TraceCheckUtils]: 261: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,869 INFO L272 TraceCheckUtils]: 260: Hoare triple {23596#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,869 INFO L290 TraceCheckUtils]: 259: Hoare triple {24384#(<= |main_#t~post5| 9)} assume !(#t~post5 < 10);havoc #t~post5; {23596#false} is VALID [2022-04-08 11:15:33,869 INFO L290 TraceCheckUtils]: 258: Hoare triple {24299#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24384#(<= |main_#t~post5| 9)} is VALID [2022-04-08 11:15:33,869 INFO L290 TraceCheckUtils]: 257: Hoare triple {24299#(<= ~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; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,870 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {23595#true} {24299#(<= ~counter~0 9)} #67#return; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,870 INFO L290 TraceCheckUtils]: 255: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,870 INFO L290 TraceCheckUtils]: 254: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,870 INFO L290 TraceCheckUtils]: 253: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,870 INFO L272 TraceCheckUtils]: 252: Hoare triple {24299#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,870 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {23595#true} {24299#(<= ~counter~0 9)} #65#return; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,870 INFO L290 TraceCheckUtils]: 250: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,870 INFO L290 TraceCheckUtils]: 249: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,871 INFO L290 TraceCheckUtils]: 248: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,871 INFO L272 TraceCheckUtils]: 247: Hoare triple {24299#(<= ~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)); {23595#true} is VALID [2022-04-08 11:15:33,871 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {23595#true} {24299#(<= ~counter~0 9)} #63#return; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,871 INFO L290 TraceCheckUtils]: 245: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,871 INFO L290 TraceCheckUtils]: 244: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,871 INFO L290 TraceCheckUtils]: 243: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,871 INFO L272 TraceCheckUtils]: 242: Hoare triple {24299#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,871 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {23595#true} {24299#(<= ~counter~0 9)} #61#return; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,871 INFO L290 TraceCheckUtils]: 240: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,872 INFO L290 TraceCheckUtils]: 239: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,872 INFO L290 TraceCheckUtils]: 238: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,872 INFO L272 TraceCheckUtils]: 237: Hoare triple {24299#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,872 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {23595#true} {24299#(<= ~counter~0 9)} #59#return; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,872 INFO L290 TraceCheckUtils]: 235: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,872 INFO L290 TraceCheckUtils]: 234: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,872 INFO L290 TraceCheckUtils]: 233: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,872 INFO L272 TraceCheckUtils]: 232: Hoare triple {24299#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,872 INFO L290 TraceCheckUtils]: 231: Hoare triple {24299#(<= ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,873 INFO L290 TraceCheckUtils]: 230: Hoare triple {24214#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24299#(<= ~counter~0 9)} is VALID [2022-04-08 11:15:33,873 INFO L290 TraceCheckUtils]: 229: Hoare triple {24214#(<= ~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; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,873 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {23595#true} {24214#(<= ~counter~0 8)} #67#return; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,874 INFO L290 TraceCheckUtils]: 227: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,874 INFO L290 TraceCheckUtils]: 226: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,874 INFO L290 TraceCheckUtils]: 225: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,874 INFO L272 TraceCheckUtils]: 224: Hoare triple {24214#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,874 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {23595#true} {24214#(<= ~counter~0 8)} #65#return; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,874 INFO L290 TraceCheckUtils]: 222: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,874 INFO L290 TraceCheckUtils]: 221: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,874 INFO L290 TraceCheckUtils]: 220: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,874 INFO L272 TraceCheckUtils]: 219: Hoare triple {24214#(<= ~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)); {23595#true} is VALID [2022-04-08 11:15:33,875 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {23595#true} {24214#(<= ~counter~0 8)} #63#return; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,875 INFO L290 TraceCheckUtils]: 217: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,875 INFO L290 TraceCheckUtils]: 216: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,875 INFO L290 TraceCheckUtils]: 215: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,875 INFO L272 TraceCheckUtils]: 214: Hoare triple {24214#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,875 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {23595#true} {24214#(<= ~counter~0 8)} #61#return; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,875 INFO L290 TraceCheckUtils]: 212: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,875 INFO L290 TraceCheckUtils]: 211: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,875 INFO L290 TraceCheckUtils]: 210: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,875 INFO L272 TraceCheckUtils]: 209: Hoare triple {24214#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,876 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {23595#true} {24214#(<= ~counter~0 8)} #59#return; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,876 INFO L290 TraceCheckUtils]: 207: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,876 INFO L290 TraceCheckUtils]: 206: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,876 INFO L290 TraceCheckUtils]: 205: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,876 INFO L272 TraceCheckUtils]: 204: Hoare triple {24214#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,876 INFO L290 TraceCheckUtils]: 203: Hoare triple {24214#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,876 INFO L290 TraceCheckUtils]: 202: Hoare triple {24129#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24214#(<= ~counter~0 8)} is VALID [2022-04-08 11:15:33,877 INFO L290 TraceCheckUtils]: 201: Hoare triple {24129#(<= ~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; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,877 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {23595#true} {24129#(<= ~counter~0 7)} #67#return; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,877 INFO L290 TraceCheckUtils]: 199: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,877 INFO L290 TraceCheckUtils]: 198: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,877 INFO L290 TraceCheckUtils]: 197: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,877 INFO L272 TraceCheckUtils]: 196: Hoare triple {24129#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,877 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {23595#true} {24129#(<= ~counter~0 7)} #65#return; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,878 INFO L290 TraceCheckUtils]: 194: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,878 INFO L290 TraceCheckUtils]: 193: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,878 INFO L290 TraceCheckUtils]: 192: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,878 INFO L272 TraceCheckUtils]: 191: Hoare triple {24129#(<= ~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)); {23595#true} is VALID [2022-04-08 11:15:33,878 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {23595#true} {24129#(<= ~counter~0 7)} #63#return; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,878 INFO L290 TraceCheckUtils]: 189: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,878 INFO L290 TraceCheckUtils]: 188: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,878 INFO L290 TraceCheckUtils]: 187: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,878 INFO L272 TraceCheckUtils]: 186: Hoare triple {24129#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,879 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {23595#true} {24129#(<= ~counter~0 7)} #61#return; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,879 INFO L290 TraceCheckUtils]: 184: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,879 INFO L290 TraceCheckUtils]: 183: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,879 INFO L290 TraceCheckUtils]: 182: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,879 INFO L272 TraceCheckUtils]: 181: Hoare triple {24129#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,879 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {23595#true} {24129#(<= ~counter~0 7)} #59#return; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,879 INFO L290 TraceCheckUtils]: 179: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,879 INFO L290 TraceCheckUtils]: 178: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,879 INFO L290 TraceCheckUtils]: 177: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,879 INFO L272 TraceCheckUtils]: 176: Hoare triple {24129#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,880 INFO L290 TraceCheckUtils]: 175: Hoare triple {24129#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,880 INFO L290 TraceCheckUtils]: 174: Hoare triple {24044#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24129#(<= ~counter~0 7)} is VALID [2022-04-08 11:15:33,880 INFO L290 TraceCheckUtils]: 173: Hoare triple {24044#(<= ~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; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,880 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {23595#true} {24044#(<= ~counter~0 6)} #67#return; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,880 INFO L290 TraceCheckUtils]: 171: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,880 INFO L290 TraceCheckUtils]: 170: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,881 INFO L290 TraceCheckUtils]: 169: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,881 INFO L272 TraceCheckUtils]: 168: Hoare triple {24044#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,881 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {23595#true} {24044#(<= ~counter~0 6)} #65#return; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,881 INFO L290 TraceCheckUtils]: 166: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,881 INFO L290 TraceCheckUtils]: 165: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,881 INFO L290 TraceCheckUtils]: 164: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,881 INFO L272 TraceCheckUtils]: 163: Hoare triple {24044#(<= ~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)); {23595#true} is VALID [2022-04-08 11:15:33,881 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {23595#true} {24044#(<= ~counter~0 6)} #63#return; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,881 INFO L290 TraceCheckUtils]: 161: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,882 INFO L290 TraceCheckUtils]: 160: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,882 INFO L290 TraceCheckUtils]: 159: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,882 INFO L272 TraceCheckUtils]: 158: Hoare triple {24044#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,882 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {23595#true} {24044#(<= ~counter~0 6)} #61#return; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,882 INFO L290 TraceCheckUtils]: 156: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,882 INFO L290 TraceCheckUtils]: 155: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,882 INFO L290 TraceCheckUtils]: 154: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,882 INFO L272 TraceCheckUtils]: 153: Hoare triple {24044#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,882 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {23595#true} {24044#(<= ~counter~0 6)} #59#return; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,883 INFO L290 TraceCheckUtils]: 151: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,883 INFO L290 TraceCheckUtils]: 150: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,883 INFO L290 TraceCheckUtils]: 149: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,883 INFO L272 TraceCheckUtils]: 148: Hoare triple {24044#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,883 INFO L290 TraceCheckUtils]: 147: Hoare triple {24044#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,883 INFO L290 TraceCheckUtils]: 146: Hoare triple {23959#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24044#(<= ~counter~0 6)} is VALID [2022-04-08 11:15:33,883 INFO L290 TraceCheckUtils]: 145: Hoare triple {23959#(<= ~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; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,884 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {23595#true} {23959#(<= ~counter~0 5)} #67#return; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,884 INFO L290 TraceCheckUtils]: 143: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,884 INFO L290 TraceCheckUtils]: 142: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,884 INFO L290 TraceCheckUtils]: 141: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,884 INFO L272 TraceCheckUtils]: 140: Hoare triple {23959#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,884 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {23595#true} {23959#(<= ~counter~0 5)} #65#return; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,884 INFO L290 TraceCheckUtils]: 138: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,884 INFO L290 TraceCheckUtils]: 137: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,885 INFO L290 TraceCheckUtils]: 136: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,885 INFO L272 TraceCheckUtils]: 135: Hoare triple {23959#(<= ~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)); {23595#true} is VALID [2022-04-08 11:15:33,885 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {23595#true} {23959#(<= ~counter~0 5)} #63#return; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,885 INFO L290 TraceCheckUtils]: 133: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,885 INFO L290 TraceCheckUtils]: 132: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,885 INFO L290 TraceCheckUtils]: 131: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,885 INFO L272 TraceCheckUtils]: 130: Hoare triple {23959#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,885 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {23595#true} {23959#(<= ~counter~0 5)} #61#return; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,885 INFO L290 TraceCheckUtils]: 128: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,886 INFO L290 TraceCheckUtils]: 127: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,886 INFO L290 TraceCheckUtils]: 126: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,886 INFO L272 TraceCheckUtils]: 125: Hoare triple {23959#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,886 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {23595#true} {23959#(<= ~counter~0 5)} #59#return; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,886 INFO L290 TraceCheckUtils]: 123: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,886 INFO L290 TraceCheckUtils]: 122: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,886 INFO L290 TraceCheckUtils]: 121: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,886 INFO L272 TraceCheckUtils]: 120: Hoare triple {23959#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,886 INFO L290 TraceCheckUtils]: 119: Hoare triple {23959#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,887 INFO L290 TraceCheckUtils]: 118: Hoare triple {23874#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23959#(<= ~counter~0 5)} is VALID [2022-04-08 11:15:33,887 INFO L290 TraceCheckUtils]: 117: Hoare triple {23874#(<= ~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; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,887 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {23595#true} {23874#(<= ~counter~0 4)} #67#return; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,887 INFO L290 TraceCheckUtils]: 115: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,887 INFO L290 TraceCheckUtils]: 114: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,887 INFO L290 TraceCheckUtils]: 113: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,887 INFO L272 TraceCheckUtils]: 112: Hoare triple {23874#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,888 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {23595#true} {23874#(<= ~counter~0 4)} #65#return; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,888 INFO L290 TraceCheckUtils]: 110: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,888 INFO L290 TraceCheckUtils]: 109: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,888 INFO L290 TraceCheckUtils]: 108: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,888 INFO L272 TraceCheckUtils]: 107: Hoare triple {23874#(<= ~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)); {23595#true} is VALID [2022-04-08 11:15:33,888 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {23595#true} {23874#(<= ~counter~0 4)} #63#return; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,888 INFO L290 TraceCheckUtils]: 105: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,888 INFO L290 TraceCheckUtils]: 104: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,888 INFO L290 TraceCheckUtils]: 103: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,889 INFO L272 TraceCheckUtils]: 102: Hoare triple {23874#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,889 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {23595#true} {23874#(<= ~counter~0 4)} #61#return; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,889 INFO L290 TraceCheckUtils]: 100: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,889 INFO L290 TraceCheckUtils]: 99: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,889 INFO L290 TraceCheckUtils]: 98: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,889 INFO L272 TraceCheckUtils]: 97: Hoare triple {23874#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,889 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {23595#true} {23874#(<= ~counter~0 4)} #59#return; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,889 INFO L290 TraceCheckUtils]: 95: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,889 INFO L290 TraceCheckUtils]: 94: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,890 INFO L290 TraceCheckUtils]: 93: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,890 INFO L272 TraceCheckUtils]: 92: Hoare triple {23874#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,890 INFO L290 TraceCheckUtils]: 91: Hoare triple {23874#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,890 INFO L290 TraceCheckUtils]: 90: Hoare triple {23789#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23874#(<= ~counter~0 4)} is VALID [2022-04-08 11:15:33,890 INFO L290 TraceCheckUtils]: 89: Hoare triple {23789#(<= ~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; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,891 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {23595#true} {23789#(<= ~counter~0 3)} #67#return; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,891 INFO L290 TraceCheckUtils]: 87: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,891 INFO L290 TraceCheckUtils]: 86: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,891 INFO L290 TraceCheckUtils]: 85: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,891 INFO L272 TraceCheckUtils]: 84: Hoare triple {23789#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,891 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {23595#true} {23789#(<= ~counter~0 3)} #65#return; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,891 INFO L290 TraceCheckUtils]: 82: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,891 INFO L290 TraceCheckUtils]: 81: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,891 INFO L290 TraceCheckUtils]: 80: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,891 INFO L272 TraceCheckUtils]: 79: Hoare triple {23789#(<= ~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)); {23595#true} is VALID [2022-04-08 11:15:33,892 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {23595#true} {23789#(<= ~counter~0 3)} #63#return; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,892 INFO L290 TraceCheckUtils]: 77: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,892 INFO L290 TraceCheckUtils]: 76: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,892 INFO L290 TraceCheckUtils]: 75: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,892 INFO L272 TraceCheckUtils]: 74: Hoare triple {23789#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,892 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {23595#true} {23789#(<= ~counter~0 3)} #61#return; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,892 INFO L290 TraceCheckUtils]: 72: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,892 INFO L290 TraceCheckUtils]: 71: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,892 INFO L290 TraceCheckUtils]: 70: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,892 INFO L272 TraceCheckUtils]: 69: Hoare triple {23789#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,893 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {23595#true} {23789#(<= ~counter~0 3)} #59#return; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,893 INFO L290 TraceCheckUtils]: 67: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,893 INFO L290 TraceCheckUtils]: 66: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,893 INFO L290 TraceCheckUtils]: 65: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,893 INFO L272 TraceCheckUtils]: 64: Hoare triple {23789#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,893 INFO L290 TraceCheckUtils]: 63: Hoare triple {23789#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,894 INFO L290 TraceCheckUtils]: 62: Hoare triple {23704#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23789#(<= ~counter~0 3)} is VALID [2022-04-08 11:15:33,894 INFO L290 TraceCheckUtils]: 61: Hoare triple {23704#(<= ~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; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,894 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {23595#true} {23704#(<= ~counter~0 2)} #67#return; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,894 INFO L290 TraceCheckUtils]: 59: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,894 INFO L290 TraceCheckUtils]: 58: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,894 INFO L290 TraceCheckUtils]: 57: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,894 INFO L272 TraceCheckUtils]: 56: Hoare triple {23704#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,895 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23595#true} {23704#(<= ~counter~0 2)} #65#return; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,895 INFO L290 TraceCheckUtils]: 54: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,895 INFO L290 TraceCheckUtils]: 53: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,895 INFO L290 TraceCheckUtils]: 52: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,895 INFO L272 TraceCheckUtils]: 51: Hoare triple {23704#(<= ~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)); {23595#true} is VALID [2022-04-08 11:15:33,895 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23595#true} {23704#(<= ~counter~0 2)} #63#return; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,895 INFO L290 TraceCheckUtils]: 49: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,895 INFO L290 TraceCheckUtils]: 48: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,895 INFO L290 TraceCheckUtils]: 47: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,895 INFO L272 TraceCheckUtils]: 46: Hoare triple {23704#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,896 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {23595#true} {23704#(<= ~counter~0 2)} #61#return; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,896 INFO L272 TraceCheckUtils]: 41: Hoare triple {23704#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,896 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {23595#true} {23704#(<= ~counter~0 2)} #59#return; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,896 INFO L290 TraceCheckUtils]: 39: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,896 INFO L272 TraceCheckUtils]: 36: Hoare triple {23704#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,897 INFO L290 TraceCheckUtils]: 35: Hoare triple {23704#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {23619#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23704#(<= ~counter~0 2)} is VALID [2022-04-08 11:15:33,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {23619#(<= ~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; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,897 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23595#true} {23619#(<= ~counter~0 1)} #67#return; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,898 INFO L272 TraceCheckUtils]: 28: Hoare triple {23619#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,898 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {23595#true} {23619#(<= ~counter~0 1)} #65#return; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,898 INFO L272 TraceCheckUtils]: 23: Hoare triple {23619#(<= ~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)); {23595#true} is VALID [2022-04-08 11:15:33,899 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {23595#true} {23619#(<= ~counter~0 1)} #63#return; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,899 INFO L272 TraceCheckUtils]: 18: Hoare triple {23619#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,899 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {23595#true} {23619#(<= ~counter~0 1)} #61#return; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,903 INFO L272 TraceCheckUtils]: 13: Hoare triple {23619#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,903 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {23595#true} {23619#(<= ~counter~0 1)} #59#return; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-08 11:15:33,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {23595#true} assume !(0 == ~cond); {23595#true} is VALID [2022-04-08 11:15:33,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {23595#true} ~cond := #in~cond; {23595#true} is VALID [2022-04-08 11:15:33,904 INFO L272 TraceCheckUtils]: 8: Hoare triple {23619#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23595#true} is VALID [2022-04-08 11:15:33,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {23619#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {23603#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23619#(<= ~counter~0 1)} is VALID [2022-04-08 11:15:33,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {23603#(<= ~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; {23603#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:33,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {23603#(<= ~counter~0 0)} call #t~ret6 := main(); {23603#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:33,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23603#(<= ~counter~0 0)} {23595#true} #81#return; {23603#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:33,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {23603#(<= ~counter~0 0)} assume true; {23603#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:33,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {23595#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; {23603#(<= ~counter~0 0)} is VALID [2022-04-08 11:15:33,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {23595#true} call ULTIMATE.init(); {23595#true} is VALID [2022-04-08 11:15:33,918 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-08 11:15:33,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:15:33,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935585581] [2022-04-08 11:15:33,921 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:15:33,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798586974] [2022-04-08 11:15:33,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798586974] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:15:33,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:15:33,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-08 11:15:33,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:15:33,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [180884034] [2022-04-08 11:15:33,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [180884034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:15:33,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:15:33,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 11:15:33,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682117671] [2022-04-08 11:15:33,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:15:33,923 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-08 11:15:33,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:15:33,923 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-08 11:15:34,059 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-08 11:15:34,059 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 11:15:34,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:15:34,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 11:15:34,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:15:34,060 INFO L87 Difference]: Start difference. First operand 181 states and 205 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-08 11:15:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:15:35,928 INFO L93 Difference]: Finished difference Result 210 states and 238 transitions. [2022-04-08 11:15:35,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 11:15:35,928 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-08 11:15:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:15:35,929 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-08 11:15:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 187 transitions. [2022-04-08 11:15:35,931 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-08 11:15:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 187 transitions. [2022-04-08 11:15:35,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 187 transitions. [2022-04-08 11:15:36,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:15:36,082 INFO L225 Difference]: With dead ends: 210 [2022-04-08 11:15:36,082 INFO L226 Difference]: Without dead ends: 197 [2022-04-08 11:15:36,082 INFO L912 BasicCegarLoop]: 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-08 11:15:36,083 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 8 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 11:15:36,083 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 204 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 11:15:36,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-08 11:15:36,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-04-08 11:15:36,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:15:36,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 197 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 115 states have internal predecessors, (116), 55 states have call successors, (55), 28 states have call predecessors, (55), 27 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 11:15:36,336 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 197 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 115 states have internal predecessors, (116), 55 states have call successors, (55), 28 states have call predecessors, (55), 27 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 11:15:36,336 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 197 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 115 states have internal predecessors, (116), 55 states have call successors, (55), 28 states have call predecessors, (55), 27 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 11:15:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:15:36,339 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2022-04-08 11:15:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 224 transitions. [2022-04-08 11:15:36,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:15:36,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:15:36,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 115 states have internal predecessors, (116), 55 states have call successors, (55), 28 states have call predecessors, (55), 27 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand 197 states. [2022-04-08 11:15:36,340 INFO L87 Difference]: Start difference. First operand has 197 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 115 states have internal predecessors, (116), 55 states have call successors, (55), 28 states have call predecessors, (55), 27 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand 197 states. [2022-04-08 11:15:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:15:36,342 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2022-04-08 11:15:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 224 transitions. [2022-04-08 11:15:36,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:15:36,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:15:36,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:15:36,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:15:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 115 states have internal predecessors, (116), 55 states have call successors, (55), 28 states have call predecessors, (55), 27 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 11:15:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 224 transitions. [2022-04-08 11:15:36,346 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 224 transitions. Word has length 269 [2022-04-08 11:15:36,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:15:36,346 INFO L478 AbstractCegarLoop]: Abstraction has 197 states and 224 transitions. [2022-04-08 11:15:36,347 INFO L479 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-08 11:15:36,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 197 states and 224 transitions. [2022-04-08 11:15:45,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 221 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 11:15:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 224 transitions. [2022-04-08 11:15:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-04-08 11:15:45,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:15:45,675 INFO L499 BasicCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:15:45,681 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-08 11:15:45,875 WARN L460 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-08 11:15:45,875 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:15:45,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:15:45,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1533533153, now seen corresponding path program 19 times [2022-04-08 11:15:45,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:15:45,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [222511112] [2022-04-08 11:15:46,097 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:15:46,097 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:15:46,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1533533153, now seen corresponding path program 20 times [2022-04-08 11:15:46,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:15:46,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929768547] [2022-04-08 11:15:46,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:15:46,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:15:46,110 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:15:46,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [614191739] [2022-04-08 11:15:46,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:15:46,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:15:46,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:15:46,128 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-08 11:15:46,128 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-08 11:15:46,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:15:46,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-08 11:15:46,245 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 11:15:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 11:15:46,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 11:15:46,459 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 11:15:46,459 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 11:15:46,463 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 11:15:46,497 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-08 11:15:46,680 WARN L460 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-08 11:15:46,682 INFO L719 BasicCegarLoop]: Path program histogram: [20, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 11:15:46,685 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 11:15:46,718 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 11:15:46,718 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 11:15:46,718 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-08 11:15:46,719 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-08 11:15:46,720 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-08 11:15:46,721 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-08 11:15:46,721 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-08 11:15:46,721 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-08 11:15:46,721 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 11:15:46,721 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 11:15:46,721 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-08 11:15:46,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 11:15:46 BoogieIcfgContainer [2022-04-08 11:15:46,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 11:15:46,722 INFO L158 Benchmark]: Toolchain (without parser) took 330610.67ms. Allocated memory was 220.2MB in the beginning and 349.2MB in the end (delta: 129.0MB). Free memory was 167.8MB in the beginning and 215.3MB in the end (delta: -47.5MB). Peak memory consumption was 82.2MB. Max. memory is 8.0GB. [2022-04-08 11:15:46,722 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 220.2MB. Free memory was 183.9MB in the beginning and 183.7MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 11:15:46,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.50ms. Allocated memory is still 220.2MB. Free memory was 167.7MB in the beginning and 191.1MB in the end (delta: -23.4MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-08 11:15:46,722 INFO L158 Benchmark]: Boogie Preprocessor took 35.38ms. Allocated memory is still 220.2MB. Free memory was 191.1MB in the beginning and 189.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 11:15:46,722 INFO L158 Benchmark]: RCFGBuilder took 219.34ms. Allocated memory is still 220.2MB. Free memory was 189.4MB in the beginning and 177.4MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 11:15:46,724 INFO L158 Benchmark]: TraceAbstraction took 330156.06ms. Allocated memory was 220.2MB in the beginning and 349.2MB in the end (delta: 129.0MB). Free memory was 176.8MB in the beginning and 215.3MB in the end (delta: -38.5MB). Peak memory consumption was 90.9MB. Max. memory is 8.0GB. [2022-04-08 11:15:46,726 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.14ms. Allocated memory is still 220.2MB. Free memory was 183.9MB in the beginning and 183.7MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 194.50ms. Allocated memory is still 220.2MB. Free memory was 167.7MB in the beginning and 191.1MB in the end (delta: -23.4MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.38ms. Allocated memory is still 220.2MB. Free memory was 191.1MB in the beginning and 189.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 219.34ms. Allocated memory is still 220.2MB. Free memory was 189.4MB in the beginning and 177.4MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 330156.06ms. Allocated memory was 220.2MB in the beginning and 349.2MB in the end (delta: 129.0MB). Free memory was 176.8MB in the beginning and 215.3MB in the end (delta: -38.5MB). Peak memory consumption was 90.9MB. 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: 330.1s, OverallIterations: 24, TraceHistogramMax: 52, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 88.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 270 SdHoareTripleChecker+Valid, 44.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 3218 SdHoareTripleChecker+Invalid, 44.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2180 mSDsCounter, 320 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2855 IncrementalHoareTripleChecker+Invalid, 3189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 320 mSolverCounterUnsat, 1038 mSDtfsCounter, 2855 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4202 GetRequests, 3903 SyntacticMatches, 24 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=23, InterpolantAutomatonStates: 223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s 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-08 11:15:46,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...