/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_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:14:46,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:14:46,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:14:46,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:14:46,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:14:46,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:14:46,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:14:46,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:14:46,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:14:46,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:14:46,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:14:46,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:14:46,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:14:46,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:14:46,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:14:46,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:14:46,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:14:46,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:14:46,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:14:46,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:14:46,114 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:14:46,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:14:46,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:14:46,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:14:46,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:14:46,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:14:46,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:14:46,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:14:46,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:14:46,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:14:46,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:14:46,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:14:46,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:14:46,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:14:46,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:14:46,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:14:46,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:14:46,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:14:46,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:14:46,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:14:46,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:14:46,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:14:46,128 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 11:14:46,137 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:14:46,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:14:46,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:14:46,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:14:46,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:14:46,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:14:46,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:14:46,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:14:46,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:14:46,140 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:14:46,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:14:46,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:14:46,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:14:46,140 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:14:46,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:14:46,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:14:46,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:14:46,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:14:46,140 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:14:46,140 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:14:46,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:14:46,141 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:14:46,141 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 11:14:46,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:14:46,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:14:46,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:14:46,330 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:14:46,330 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:14:46,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound10.c [2022-04-28 11:14:46,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/413596f64/e73d5dc49b534d03997c5ebc1878497c/FLAGcc7909333 [2022-04-28 11:14:46,748 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:14:46,748 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound10.c [2022-04-28 11:14:46,754 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/413596f64/e73d5dc49b534d03997c5ebc1878497c/FLAGcc7909333 [2022-04-28 11:14:46,762 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/413596f64/e73d5dc49b534d03997c5ebc1878497c [2022-04-28 11:14:46,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:14:46,764 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:14:46,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:14:46,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:14:46,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:14:46,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:14:46" (1/1) ... [2022-04-28 11:14:46,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e040a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:46, skipping insertion in model container [2022-04-28 11:14:46,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:14:46" (1/1) ... [2022-04-28 11:14:46,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:14:46,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:14:46,913 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_valuebound10.c[588,601] [2022-04-28 11:14:46,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:14:46,934 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:14:46,941 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_valuebound10.c[588,601] [2022-04-28 11:14:46,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:14:46,956 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:14:46,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:46 WrapperNode [2022-04-28 11:14:46,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:14:46,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:14:46,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:14:46,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:14:46,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:46" (1/1) ... [2022-04-28 11:14:46,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:46" (1/1) ... [2022-04-28 11:14:46,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:46" (1/1) ... [2022-04-28 11:14:46,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:46" (1/1) ... [2022-04-28 11:14:46,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:46" (1/1) ... [2022-04-28 11:14:46,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:46" (1/1) ... [2022-04-28 11:14:46,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:46" (1/1) ... [2022-04-28 11:14:46,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:14:46,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:14:46,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:14:46,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:14:46,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:46" (1/1) ... [2022-04-28 11:14:46,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:14:46,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:47,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 11:14:47,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 11:14:47,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:14:47,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:14:47,040 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:14:47,040 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:14:47,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:14:47,040 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:14:47,040 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:14:47,040 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:14:47,040 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:14:47,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:14:47,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-28 11:14:47,040 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:14:47,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:14:47,041 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:14:47,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:14:47,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:14:47,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:14:47,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:14:47,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:14:47,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:14:47,079 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:14:47,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:14:47,178 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:14:47,183 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:14:47,183 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 11:14:47,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:14:47 BoogieIcfgContainer [2022-04-28 11:14:47,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:14:47,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:14:47,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:14:47,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:14:47,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:14:46" (1/3) ... [2022-04-28 11:14:47,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1bc431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:14:47, skipping insertion in model container [2022-04-28 11:14:47,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:46" (2/3) ... [2022-04-28 11:14:47,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1bc431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:14:47, skipping insertion in model container [2022-04-28 11:14:47,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:14:47" (3/3) ... [2022-04-28 11:14:47,204 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound10.c [2022-04-28 11:14:47,216 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:14:47,217 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:14:47,269 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:14:47,276 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@64ade046, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@37cb451b [2022-04-28 11:14:47,276 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:14:47,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:14:47,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:14:47,298 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:47,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:47,298 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:47,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:47,308 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 1 times [2022-04-28 11:14:47,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:47,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [549717678] [2022-04-28 11:14:47,327 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:47,327 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 2 times [2022-04-28 11:14:47,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:47,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88172088] [2022-04-28 11:14:47,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:47,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:14:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:47,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#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); {39#true} is VALID [2022-04-28 11:14:47,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 11:14:47,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-28 11:14:47,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:14:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:47,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 11:14:47,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 11:14:47,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 11:14:47,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-28 11:14:47,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:14:47,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#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); {39#true} is VALID [2022-04-28 11:14:47,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 11:14:47,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-28 11:14:47,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret5 := main(); {39#true} is VALID [2022-04-28 11:14:47,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#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; {39#true} is VALID [2022-04-28 11:14:47,471 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {39#true} is VALID [2022-04-28 11:14:47,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 11:14:47,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 11:14:47,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 11:14:47,472 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-28 11:14:47,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {40#false} is VALID [2022-04-28 11:14:47,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-04-28 11:14:47,473 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {40#false} is VALID [2022-04-28 11:14:47,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-28 11:14:47,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-28 11:14:47,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-28 11:14:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:14:47,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:47,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88172088] [2022-04-28 11:14:47,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88172088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:47,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:47,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:14:47,477 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:47,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [549717678] [2022-04-28 11:14:47,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [549717678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:47,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:47,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:14:47,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770022087] [2022-04-28 11:14:47,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:47,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:14:47,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:47,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:47,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:47,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:14:47,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:47,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:14:47,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:14:47,525 INFO L87 Difference]: Start difference. First operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:47,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:47,717 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-04-28 11:14:47,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:14:47,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:14:47,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:14:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:14:47,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 11:14:47,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:47,871 INFO L225 Difference]: With dead ends: 63 [2022-04-28 11:14:47,871 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 11:14:47,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:14:47,876 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:47,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:14:47,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 11:14:47,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 11:14:47,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:47,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:14:47,902 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:14:47,903 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:14:47,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:47,907 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-28 11:14:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:14:47,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:47,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:47,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-28 11:14:47,908 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-28 11:14:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:47,911 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-28 11:14:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:14:47,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:47,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:47,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:47,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:14:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-04-28 11:14:47,916 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 17 [2022-04-28 11:14:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:47,917 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-04-28 11:14:47,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:47,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 41 transitions. [2022-04-28 11:14:47,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:14:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:14:47,963 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:47,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:47,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:14:47,964 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:47,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:47,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 1 times [2022-04-28 11:14:47,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:47,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [104448443] [2022-04-28 11:14:47,965 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:47,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 2 times [2022-04-28 11:14:47,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:47,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142156694] [2022-04-28 11:14:47,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:47,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:48,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:14:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:48,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#(and (= |#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); {301#true} is VALID [2022-04-28 11:14:48,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:14:48,077 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-28 11:14:48,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:14:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:48,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 11:14:48,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 11:14:48,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:14:48,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-28 11:14:48,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:14:48,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#(and (= |#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); {301#true} is VALID [2022-04-28 11:14:48,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:14:48,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-28 11:14:48,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-28 11:14:48,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#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; {301#true} is VALID [2022-04-28 11:14:48,082 INFO L272 TraceCheckUtils]: 6: Hoare triple {301#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {301#true} is VALID [2022-04-28 11:14:48,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 11:14:48,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 11:14:48,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:14:48,083 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-28 11:14:48,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:14:48,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !false; {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:14:48,084 INFO L272 TraceCheckUtils]: 13: Hoare triple {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {311#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:48,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {311#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {312#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:14:48,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {302#false} is VALID [2022-04-28 11:14:48,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-28 11:14:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:14:48,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:48,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142156694] [2022-04-28 11:14:48,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142156694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:48,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:48,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:14:48,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:48,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [104448443] [2022-04-28 11:14:48,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [104448443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:48,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:48,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:14:48,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263197624] [2022-04-28 11:14:48,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:48,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:14:48,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:48,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:48,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:48,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:14:48,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:48,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:14:48,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:14:48,100 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:48,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:48,428 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-28 11:14:48,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:14:48,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:14:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 11:14:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:48,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 11:14:48,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-28 11:14:48,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:48,479 INFO L225 Difference]: With dead ends: 37 [2022-04-28 11:14:48,479 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 11:14:48,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:14:48,480 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:48,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 11:14:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 11:14:48,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:48,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:14:48,488 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:14:48,488 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:14:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:48,490 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:14:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:14:48,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:48,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:48,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-28 11:14:48,491 INFO L87 Difference]: Start difference. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-28 11:14:48,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:48,493 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:14:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:14:48,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:48,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:48,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:48,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:14:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-28 11:14:48,496 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 17 [2022-04-28 11:14:48,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:48,496 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-28 11:14:48,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:48,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-28 11:14:48,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:48,535 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:14:48,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 11:14:48,536 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:48,536 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:48,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 11:14:48,536 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:48,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:48,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 1 times [2022-04-28 11:14:48,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:48,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1103943102] [2022-04-28 11:14:48,537 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:48,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 2 times [2022-04-28 11:14:48,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:48,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100269863] [2022-04-28 11:14:48,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:48,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:48,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:48,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [931409123] [2022-04-28 11:14:48,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:48,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:48,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:48,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:14:48,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 11:14:48,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:48,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:48,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:14:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:48,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:48,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-28 11:14:48,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#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); {538#true} is VALID [2022-04-28 11:14:48,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:14:48,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #84#return; {538#true} is VALID [2022-04-28 11:14:48,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-28 11:14:48,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#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; {538#true} is VALID [2022-04-28 11:14:48,742 INFO L272 TraceCheckUtils]: 6: Hoare triple {538#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {538#true} is VALID [2022-04-28 11:14:48,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-28 11:14:48,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-28 11:14:48,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:14:48,743 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {538#true} {538#true} #60#return; {538#true} is VALID [2022-04-28 11:14:48,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:48,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:48,750 INFO L272 TraceCheckUtils]: 13: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {538#true} is VALID [2022-04-28 11:14:48,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-28 11:14:48,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-28 11:14:48,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:14:48,751 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {538#true} {576#(and (= main_~n~0 0) (= main_~y~0 1))} #62#return; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:48,751 INFO L272 TraceCheckUtils]: 18: Hoare triple {576#(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)); {598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:48,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:48,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-28 11:14:48,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-28 11:14:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:14:48,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:14:48,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:48,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100269863] [2022-04-28 11:14:48,753 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:48,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931409123] [2022-04-28 11:14:48,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931409123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:48,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:48,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:48,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:48,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1103943102] [2022-04-28 11:14:48,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1103943102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:48,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:48,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:48,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613146808] [2022-04-28 11:14:48,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:48,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 11:14:48,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:48,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:14:48,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:48,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:14:48,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:48,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:14:48,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:14:48,778 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:14:49,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:49,013 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 11:14:49,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:14:49,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 11:14:49,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:14:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:14:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:14:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:14:49,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:14:49,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:49,109 INFO L225 Difference]: With dead ends: 54 [2022-04-28 11:14:49,109 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 11:14:49,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:14:49,112 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:49,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 148 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:14:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 11:14:49,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-28 11:14:49,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:49,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:14:49,127 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:14:49,128 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:14:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:49,135 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:14:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:14:49,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:49,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:49,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-28 11:14:49,142 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-28 11:14:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:49,149 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:14:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:14:49,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:49,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:49,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:49,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:14:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-04-28 11:14:49,152 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2022-04-28 11:14:49,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:49,152 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-04-28 11:14:49,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:14:49,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 52 transitions. [2022-04-28 11:14:49,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-28 11:14:49,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 11:14:49,207 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:49,207 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:49,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 11:14:49,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:49,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:49,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:49,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 1 times [2022-04-28 11:14:49,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:49,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [939429411] [2022-04-28 11:14:49,445 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:49,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 2 times [2022-04-28 11:14:49,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:49,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382400829] [2022-04-28 11:14:49,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:49,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:49,462 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:49,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1388946657] [2022-04-28 11:14:49,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:49,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:49,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:49,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:14:49,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 11:14:49,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:49,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:49,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:14:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:49,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:49,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {906#true} is VALID [2022-04-28 11:14:49,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {906#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); {906#true} is VALID [2022-04-28 11:14:49,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:14:49,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #84#return; {906#true} is VALID [2022-04-28 11:14:49,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret5 := main(); {906#true} is VALID [2022-04-28 11:14:49,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {906#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; {906#true} is VALID [2022-04-28 11:14:49,613 INFO L272 TraceCheckUtils]: 6: Hoare triple {906#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {906#true} is VALID [2022-04-28 11:14:49,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:14:49,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:14:49,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:14:49,613 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {906#true} {906#true} #60#return; {906#true} is VALID [2022-04-28 11:14:49,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {906#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:14:49,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} assume !false; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:14:49,614 INFO L272 TraceCheckUtils]: 13: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {906#true} is VALID [2022-04-28 11:14:49,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:14:49,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:14:49,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:14:49,615 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {906#true} {944#(and (= main_~x~0 0) (= main_~n~0 0))} #62#return; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:14:49,616 INFO L272 TraceCheckUtils]: 18: Hoare triple {944#(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)); {906#true} is VALID [2022-04-28 11:14:49,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:14:49,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:14:49,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:14:49,617 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {906#true} {944#(and (= main_~x~0 0) (= main_~n~0 0))} #64#return; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:14:49,617 INFO L272 TraceCheckUtils]: 23: Hoare triple {944#(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)); {981#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:49,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {981#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {985#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:49,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {985#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {907#false} is VALID [2022-04-28 11:14:49,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-28 11:14:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:14:49,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:14:49,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:49,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382400829] [2022-04-28 11:14:49,619 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:49,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388946657] [2022-04-28 11:14:49,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388946657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:49,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:49,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:49,620 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:49,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [939429411] [2022-04-28 11:14:49,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [939429411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:49,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:49,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:49,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127575928] [2022-04-28 11:14:49,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:49,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 11:14:49,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:49,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:14:49,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:49,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:14:49,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:49,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:14:49,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:14:49,649 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:14:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:49,852 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-28 11:14:49,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:14:49,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 11:14:49,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:14:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:14:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:14:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:14:49,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:14:49,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:49,914 INFO L225 Difference]: With dead ends: 58 [2022-04-28 11:14:49,914 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 11:14:49,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:14:49,915 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:49,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:14:49,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 11:14:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-28 11:14:49,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:49,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:49,947 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:49,949 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:49,951 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 11:14:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 11:14:49,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:49,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:49,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-28 11:14:49,954 INFO L87 Difference]: Start difference. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-28 11:14:49,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:49,958 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 11:14:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 11:14:49,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:49,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:49,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:49,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:49,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-04-28 11:14:49,962 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 27 [2022-04-28 11:14:49,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:49,962 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-04-28 11:14:49,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:14:49,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 67 transitions. [2022-04-28 11:14:50,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:50,041 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-04-28 11:14:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 11:14:50,042 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:50,042 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:50,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 11:14:50,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 11:14:50,258 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:50,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 1 times [2022-04-28 11:14:50,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:50,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [617395766] [2022-04-28 11:14:50,259 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:50,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 2 times [2022-04-28 11:14:50,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:50,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617176669] [2022-04-28 11:14:50,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:50,280 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:50,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2047420057] [2022-04-28 11:14:50,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:50,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:50,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:50,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:14:50,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 11:14:50,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:50,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:50,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:14:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:50,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:50,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2022-04-28 11:14:50,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {1325#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); {1325#true} is VALID [2022-04-28 11:14:50,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:14:50,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #84#return; {1325#true} is VALID [2022-04-28 11:14:50,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret5 := main(); {1325#true} is VALID [2022-04-28 11:14:50,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {1325#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; {1325#true} is VALID [2022-04-28 11:14:50,480 INFO L272 TraceCheckUtils]: 6: Hoare triple {1325#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1325#true} is VALID [2022-04-28 11:14:50,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:14:50,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:14:50,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:14:50,481 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1325#true} {1325#true} #60#return; {1325#true} is VALID [2022-04-28 11:14:50,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {1325#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:50,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:50,482 INFO L272 TraceCheckUtils]: 13: Hoare triple {1363#(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)); {1325#true} is VALID [2022-04-28 11:14:50,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:14:50,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:14:50,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:14:50,484 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:50,484 INFO L272 TraceCheckUtils]: 18: Hoare triple {1363#(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)); {1325#true} is VALID [2022-04-28 11:14:50,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:14:50,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:14:50,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:14:50,488 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:50,495 INFO L272 TraceCheckUtils]: 23: Hoare triple {1363#(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)); {1325#true} is VALID [2022-04-28 11:14:50,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:14:50,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:14:50,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:14:50,496 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:50,497 INFO L272 TraceCheckUtils]: 28: Hoare triple {1363#(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)); {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:50,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:50,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {1419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1326#false} is VALID [2022-04-28 11:14:50,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2022-04-28 11:14:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 11:14:50,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:14:50,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:50,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617176669] [2022-04-28 11:14:50,499 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:50,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047420057] [2022-04-28 11:14:50,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047420057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:50,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:50,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:50,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:50,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [617395766] [2022-04-28 11:14:50,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [617395766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:50,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:50,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:50,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010070234] [2022-04-28 11:14:50,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:50,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 11:14:50,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:50,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:14:50,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:50,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:14:50,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:50,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:14:50,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:14:50,522 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:14:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:50,766 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-04-28 11:14:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:14:50,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 11:14:50,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:14:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:14:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:14:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:14:50,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:14:50,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:50,826 INFO L225 Difference]: With dead ends: 66 [2022-04-28 11:14:50,826 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 11:14:50,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:14:50,827 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:50,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 135 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 11:14:50,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 11:14:50,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:50,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:14:50,842 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:14:50,843 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:14:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:50,844 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 11:14:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:14:50,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:50,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:50,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-28 11:14:50,845 INFO L87 Difference]: Start difference. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-28 11:14:50,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:50,847 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 11:14:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:14:50,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:50,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:50,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:50,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:14:50,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-28 11:14:50,849 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-28 11:14:50,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:50,849 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-28 11:14:50,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:14:50,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 65 transitions. [2022-04-28 11:14:50,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:14:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 11:14:50,923 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:50,923 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:50,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 11:14:51,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:51,124 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:51,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:51,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 1 times [2022-04-28 11:14:51,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:51,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [698444501] [2022-04-28 11:14:51,490 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:51,490 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:51,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 2 times [2022-04-28 11:14:51,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:51,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786554246] [2022-04-28 11:14:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:51,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:51,499 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:51,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1258949538] [2022-04-28 11:14:51,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:51,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:51,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:51,515 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:14:51,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 11:14:51,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:51,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:51,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:14:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:51,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:51,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-28 11:14:51,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#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); {1775#true} is VALID [2022-04-28 11:14:51,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:51,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-28 11:14:51,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-28 11:14:51,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#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; {1775#true} is VALID [2022-04-28 11:14:51,775 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:51,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:51,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:51,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:51,775 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-28 11:14:51,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:51,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:51,777 INFO L272 TraceCheckUtils]: 13: Hoare triple {1813#(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)); {1775#true} is VALID [2022-04-28 11:14:51,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:51,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:51,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:51,778 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:51,778 INFO L272 TraceCheckUtils]: 18: Hoare triple {1813#(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)); {1775#true} is VALID [2022-04-28 11:14:51,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:51,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:51,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:51,779 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:51,779 INFO L272 TraceCheckUtils]: 23: Hoare triple {1813#(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)); {1775#true} is VALID [2022-04-28 11:14:51,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:51,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:51,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:51,780 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:51,780 INFO L272 TraceCheckUtils]: 28: Hoare triple {1813#(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)); {1775#true} is VALID [2022-04-28 11:14:51,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:51,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:51,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:51,781 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:51,781 INFO L272 TraceCheckUtils]: 33: Hoare triple {1813#(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)); {1775#true} is VALID [2022-04-28 11:14:51,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:51,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:51,781 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:51,782 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:51,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {1813#(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; {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:51,783 INFO L290 TraceCheckUtils]: 39: Hoare triple {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} assume !false; {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:51,783 INFO L272 TraceCheckUtils]: 40: Hoare triple {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:51,783 INFO L290 TraceCheckUtils]: 41: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:51,783 INFO L290 TraceCheckUtils]: 42: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:51,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:51,784 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1775#true} {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} #62#return; {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:51,785 INFO L272 TraceCheckUtils]: 45: Hoare triple {1895#(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)); {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:51,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:51,785 INFO L290 TraceCheckUtils]: 47: Hoare triple {1921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 11:14:51,785 INFO L290 TraceCheckUtils]: 48: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 11:14:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:14:51,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:51,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 11:14:51,962 INFO L290 TraceCheckUtils]: 47: Hoare triple {1921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 11:14:51,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:51,963 INFO L272 TraceCheckUtils]: 45: Hoare triple {1937#(= (+ (* 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)); {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:51,963 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1775#true} {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:51,964 INFO L290 TraceCheckUtils]: 43: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:51,964 INFO L290 TraceCheckUtils]: 42: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:51,964 INFO L290 TraceCheckUtils]: 41: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:51,964 INFO L272 TraceCheckUtils]: 40: Hoare triple {1937#(= (+ (* 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)); {1775#true} is VALID [2022-04-28 11:14:51,965 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:51,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {1959#(= (+ (* 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; {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:51,970 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #70#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:51,970 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:51,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:51,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:51,971 INFO L272 TraceCheckUtils]: 33: Hoare triple {1959#(= (+ (* 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)); {1775#true} is VALID [2022-04-28 11:14:51,971 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #68#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:51,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:51,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:51,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:51,971 INFO L272 TraceCheckUtils]: 28: Hoare triple {1959#(= (+ (* 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)); {1775#true} is VALID [2022-04-28 11:14:51,972 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #66#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:51,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:51,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:51,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:51,973 INFO L272 TraceCheckUtils]: 23: Hoare triple {1959#(= (+ (* 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)); {1775#true} is VALID [2022-04-28 11:14:51,973 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #64#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:51,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:51,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:51,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:51,974 INFO L272 TraceCheckUtils]: 18: Hoare triple {1959#(= (+ (* 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)); {1775#true} is VALID [2022-04-28 11:14:51,974 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #62#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:51,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:51,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:51,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:51,974 INFO L272 TraceCheckUtils]: 13: Hoare triple {1959#(= (+ (* 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)); {1775#true} is VALID [2022-04-28 11:14:51,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !false; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:51,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:51,975 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-28 11:14:51,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:51,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:51,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:51,976 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:51,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#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; {1775#true} is VALID [2022-04-28 11:14:51,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-28 11:14:51,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-28 11:14:51,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:51,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#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); {1775#true} is VALID [2022-04-28 11:14:51,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-28 11:14:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:14:51,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:51,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786554246] [2022-04-28 11:14:51,977 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:51,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258949538] [2022-04-28 11:14:51,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258949538] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:51,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:51,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:14:51,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:51,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [698444501] [2022-04-28 11:14:51,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [698444501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:51,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:51,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:14:51,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798776561] [2022-04-28 11:14:51,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:51,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 49 [2022-04-28 11:14:51,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:51,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:14:52,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:52,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:14:52,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:52,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:14:52,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:14:52,002 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:14:52,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:52,319 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 11:14:52,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:14:52,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 49 [2022-04-28 11:14:52,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:14:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:14:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:14:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:14:52,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:14:52,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:52,385 INFO L225 Difference]: With dead ends: 81 [2022-04-28 11:14:52,385 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 11:14:52,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:14:52,386 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:52,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 180 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:52,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 11:14:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-04-28 11:14:52,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:52,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:52,410 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:52,411 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:52,413 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-28 11:14:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 11:14:52,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:52,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:52,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-28 11:14:52,414 INFO L87 Difference]: Start difference. First operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-28 11:14:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:52,416 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-28 11:14:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 11:14:52,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:52,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:52,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:52,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:52,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-04-28 11:14:52,418 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 49 [2022-04-28 11:14:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:52,418 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-04-28 11:14:52,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:14:52,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 79 transitions. [2022-04-28 11:14:52,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-28 11:14:52,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 11:14:52,497 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:52,497 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:52,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 11:14:52,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:52,707 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:52,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:52,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 3 times [2022-04-28 11:14:52,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:52,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1859473602] [2022-04-28 11:14:52,976 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:52,976 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 4 times [2022-04-28 11:14:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:52,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429591196] [2022-04-28 11:14:52,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:52,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:52,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [690898670] [2022-04-28 11:14:52,984 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:14:52,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:52,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:52,989 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:14:53,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 11:14:53,041 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:14:53,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:53,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 11:14:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:53,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:53,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2022-04-28 11:14:53,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {2536#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); {2536#true} is VALID [2022-04-28 11:14:53,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #84#return; {2536#true} is VALID [2022-04-28 11:14:53,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret5 := main(); {2536#true} is VALID [2022-04-28 11:14:53,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {2536#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; {2536#true} is VALID [2022-04-28 11:14:53,257 INFO L272 TraceCheckUtils]: 6: Hoare triple {2536#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:53,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:53,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:53,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,258 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2536#true} {2536#true} #60#return; {2536#true} is VALID [2022-04-28 11:14:53,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {2536#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:53,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !false; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:53,259 INFO L272 TraceCheckUtils]: 13: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:53,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:53,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:53,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,264 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #62#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:53,265 INFO L272 TraceCheckUtils]: 18: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:53,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:53,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:53,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,269 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #64#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:53,269 INFO L272 TraceCheckUtils]: 23: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:53,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:53,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:53,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,273 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #66#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:53,273 INFO L272 TraceCheckUtils]: 28: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:53,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:53,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:53,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,276 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #68#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:53,276 INFO L272 TraceCheckUtils]: 33: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:53,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:53,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:53,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,276 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #70#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:53,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:14:53,277 INFO L290 TraceCheckUtils]: 39: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} assume !false; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:14:53,277 INFO L272 TraceCheckUtils]: 40: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:53,277 INFO L290 TraceCheckUtils]: 41: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:53,277 INFO L290 TraceCheckUtils]: 42: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:53,277 INFO L290 TraceCheckUtils]: 43: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,278 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2536#true} {2656#(and (= main_~x~0 1) (= main_~n~0 1))} #62#return; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:14:53,278 INFO L272 TraceCheckUtils]: 45: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:53,278 INFO L290 TraceCheckUtils]: 46: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:53,278 INFO L290 TraceCheckUtils]: 47: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:53,278 INFO L290 TraceCheckUtils]: 48: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,278 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2536#true} {2656#(and (= main_~x~0 1) (= main_~n~0 1))} #64#return; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:14:53,279 INFO L272 TraceCheckUtils]: 50: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:53,279 INFO L290 TraceCheckUtils]: 51: Hoare triple {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:53,280 INFO L290 TraceCheckUtils]: 52: Hoare triple {2697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2537#false} is VALID [2022-04-28 11:14:53,280 INFO L290 TraceCheckUtils]: 53: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-04-28 11:14:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 11:14:53,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:53,452 INFO L290 TraceCheckUtils]: 53: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-04-28 11:14:53,453 INFO L290 TraceCheckUtils]: 52: Hoare triple {2697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2537#false} is VALID [2022-04-28 11:14:53,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:53,453 INFO L272 TraceCheckUtils]: 50: Hoare triple {2713#(= (* 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)); {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:53,454 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2536#true} {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:14:53,454 INFO L290 TraceCheckUtils]: 48: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,454 INFO L290 TraceCheckUtils]: 47: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:53,454 INFO L290 TraceCheckUtils]: 46: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:53,454 INFO L272 TraceCheckUtils]: 45: Hoare triple {2713#(= (* 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)); {2536#true} is VALID [2022-04-28 11:14:53,455 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2536#true} {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:14:53,455 INFO L290 TraceCheckUtils]: 43: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,455 INFO L290 TraceCheckUtils]: 42: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:53,455 INFO L290 TraceCheckUtils]: 41: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:53,455 INFO L272 TraceCheckUtils]: 40: Hoare triple {2713#(= (* 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)); {2536#true} is VALID [2022-04-28 11:14:53,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:14:53,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:14:53,457 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:53,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:53,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:53,458 INFO L272 TraceCheckUtils]: 33: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:53,458 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:53,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:53,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:53,459 INFO L272 TraceCheckUtils]: 28: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:53,459 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:53,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:53,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:53,459 INFO L272 TraceCheckUtils]: 23: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:53,460 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:53,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:53,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:53,461 INFO L272 TraceCheckUtils]: 18: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:53,461 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:53,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:53,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:53,462 INFO L272 TraceCheckUtils]: 13: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:53,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:53,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {2536#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:53,462 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2536#true} {2536#true} #60#return; {2536#true} is VALID [2022-04-28 11:14:53,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:53,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:53,467 INFO L272 TraceCheckUtils]: 6: Hoare triple {2536#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:53,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {2536#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; {2536#true} is VALID [2022-04-28 11:14:53,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret5 := main(); {2536#true} is VALID [2022-04-28 11:14:53,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #84#return; {2536#true} is VALID [2022-04-28 11:14:53,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:53,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {2536#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); {2536#true} is VALID [2022-04-28 11:14:53,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2022-04-28 11:14:53,468 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 11:14:53,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:53,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429591196] [2022-04-28 11:14:53,468 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:53,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690898670] [2022-04-28 11:14:53,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690898670] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:53,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:53,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:14:53,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:53,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1859473602] [2022-04-28 11:14:53,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1859473602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:53,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:53,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:14:53,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564674227] [2022-04-28 11:14:53,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:53,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-28 11:14:53,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:53,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:14:53,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:53,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:14:53,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:53,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:14:53,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:14:53,495 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:14:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:53,907 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-28 11:14:53,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:14:53,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-28 11:14:53,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:14:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:14:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:14:53,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:14:53,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:14:53,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:53,985 INFO L225 Difference]: With dead ends: 85 [2022-04-28 11:14:53,985 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 11:14:53,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:14:53,986 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:53,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 196 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:53,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 11:14:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2022-04-28 11:14:54,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:54,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:54,017 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:54,017 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:54,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:54,020 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-04-28 11:14:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-04-28 11:14:54,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:54,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:54,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 83 states. [2022-04-28 11:14:54,021 INFO L87 Difference]: Start difference. First operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 83 states. [2022-04-28 11:14:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:54,023 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-04-28 11:14:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-04-28 11:14:54,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:54,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:54,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:54,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-04-28 11:14:54,026 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 54 [2022-04-28 11:14:54,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:54,026 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-04-28 11:14:54,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:14:54,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 84 transitions. [2022-04-28 11:14:54,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-04-28 11:14:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 11:14:54,100 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:54,100 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:54,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 11:14:54,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:54,315 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:54,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:54,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 5 times [2022-04-28 11:14:54,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:54,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1014256286] [2022-04-28 11:14:54,524 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:54,524 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:54,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 6 times [2022-04-28 11:14:54,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:54,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491861878] [2022-04-28 11:14:54,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:54,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:54,542 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:54,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526516201] [2022-04-28 11:14:54,543 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:14:54,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:54,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:54,544 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:14:54,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 11:14:54,575 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 11:14:54,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:54,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 11:14:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:54,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:54,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 11:14:54,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#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); {3353#true} is VALID [2022-04-28 11:14:54,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:54,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #84#return; {3353#true} is VALID [2022-04-28 11:14:54,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret5 := main(); {3353#true} is VALID [2022-04-28 11:14:54,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {3353#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; {3353#true} is VALID [2022-04-28 11:14:54,808 INFO L272 TraceCheckUtils]: 6: Hoare triple {3353#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:54,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:54,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:54,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:54,808 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3353#true} {3353#true} #60#return; {3353#true} is VALID [2022-04-28 11:14:54,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:54,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:54,809 INFO L272 TraceCheckUtils]: 13: Hoare triple {3391#(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)); {3353#true} is VALID [2022-04-28 11:14:54,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:54,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:54,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:54,810 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:54,810 INFO L272 TraceCheckUtils]: 18: Hoare triple {3391#(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)); {3353#true} is VALID [2022-04-28 11:14:54,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:54,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:54,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:54,810 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:54,811 INFO L272 TraceCheckUtils]: 23: Hoare triple {3391#(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)); {3353#true} is VALID [2022-04-28 11:14:54,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:54,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:54,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:54,811 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:54,811 INFO L272 TraceCheckUtils]: 28: Hoare triple {3391#(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)); {3353#true} is VALID [2022-04-28 11:14:54,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:54,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:54,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:54,812 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:54,812 INFO L272 TraceCheckUtils]: 33: Hoare triple {3391#(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)); {3353#true} is VALID [2022-04-28 11:14:54,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:54,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:54,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:54,814 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:54,814 INFO L290 TraceCheckUtils]: 38: Hoare triple {3391#(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; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:54,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} assume !false; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:54,816 INFO L272 TraceCheckUtils]: 40: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:54,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:54,816 INFO L290 TraceCheckUtils]: 42: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:54,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:54,817 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3353#true} {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} #62#return; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:54,817 INFO L272 TraceCheckUtils]: 45: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:54,817 INFO L290 TraceCheckUtils]: 46: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:54,817 INFO L290 TraceCheckUtils]: 47: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:54,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:54,818 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3353#true} {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} #64#return; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:54,818 INFO L272 TraceCheckUtils]: 50: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:54,818 INFO L290 TraceCheckUtils]: 51: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:54,818 INFO L290 TraceCheckUtils]: 52: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:54,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:54,819 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3353#true} {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} #66#return; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:54,819 INFO L272 TraceCheckUtils]: 55: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:54,819 INFO L290 TraceCheckUtils]: 56: Hoare triple {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:54,820 INFO L290 TraceCheckUtils]: 57: Hoare triple {3529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 11:14:54,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 11:14:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 11:14:54,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:55,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 11:14:55,058 INFO L290 TraceCheckUtils]: 57: Hoare triple {3529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 11:14:55,058 INFO L290 TraceCheckUtils]: 56: Hoare triple {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:55,058 INFO L272 TraceCheckUtils]: 55: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:55,059 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3353#true} {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:14:55,059 INFO L290 TraceCheckUtils]: 53: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:55,059 INFO L290 TraceCheckUtils]: 52: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:55,059 INFO L290 TraceCheckUtils]: 51: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:55,059 INFO L272 TraceCheckUtils]: 50: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:55,060 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3353#true} {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:14:55,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:55,060 INFO L290 TraceCheckUtils]: 47: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:55,060 INFO L290 TraceCheckUtils]: 46: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:55,060 INFO L272 TraceCheckUtils]: 45: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:55,060 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3353#true} {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #62#return; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:14:55,060 INFO L290 TraceCheckUtils]: 43: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:55,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:55,061 INFO L290 TraceCheckUtils]: 41: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:55,061 INFO L272 TraceCheckUtils]: 40: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:55,061 INFO L290 TraceCheckUtils]: 39: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !false; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:14:55,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:14:55,064 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3353#true} {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #70#return; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:14:55,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:55,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:55,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:55,065 INFO L272 TraceCheckUtils]: 33: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:55,065 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3353#true} {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #68#return; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:14:55,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:55,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:55,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:55,065 INFO L272 TraceCheckUtils]: 28: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:55,066 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3353#true} {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #66#return; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:14:55,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:55,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:55,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:55,066 INFO L272 TraceCheckUtils]: 23: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:55,067 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3353#true} {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #64#return; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:14:55,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:55,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:55,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:55,067 INFO L272 TraceCheckUtils]: 18: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:55,067 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3353#true} {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #62#return; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:14:55,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:55,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:55,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:55,068 INFO L272 TraceCheckUtils]: 13: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:55,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !false; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:14:55,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:14:55,068 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3353#true} {3353#true} #60#return; {3353#true} is VALID [2022-04-28 11:14:55,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:55,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:55,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:55,069 INFO L272 TraceCheckUtils]: 6: Hoare triple {3353#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:55,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {3353#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; {3353#true} is VALID [2022-04-28 11:14:55,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret5 := main(); {3353#true} is VALID [2022-04-28 11:14:55,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #84#return; {3353#true} is VALID [2022-04-28 11:14:55,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:55,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#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); {3353#true} is VALID [2022-04-28 11:14:55,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 11:14:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 11:14:55,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:55,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491861878] [2022-04-28 11:14:55,070 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:55,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526516201] [2022-04-28 11:14:55,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526516201] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:55,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:55,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:14:55,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:55,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1014256286] [2022-04-28 11:14:55,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1014256286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:55,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:55,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:14:55,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784439762] [2022-04-28 11:14:55,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:55,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2022-04-28 11:14:55,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:55,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:14:55,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:55,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:14:55,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:55,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:14:55,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:14:55,099 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:14:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:55,501 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-04-28 11:14:55,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:14:55,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2022-04-28 11:14:55,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:14:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:14:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:14:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:14:55,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:14:55,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:55,572 INFO L225 Difference]: With dead ends: 89 [2022-04-28 11:14:55,572 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 11:14:55,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:14:55,573 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:55,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 167 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 11:14:55,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-28 11:14:55,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:55,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:55,604 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:55,604 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:55,606 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2022-04-28 11:14:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:14:55,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:55,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:55,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 84 states. [2022-04-28 11:14:55,607 INFO L87 Difference]: Start difference. First operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 84 states. [2022-04-28 11:14:55,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:55,609 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2022-04-28 11:14:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:14:55,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:55,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:55,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:55,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:55,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2022-04-28 11:14:55,611 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 59 [2022-04-28 11:14:55,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:55,611 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2022-04-28 11:14:55,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:14:55,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 98 transitions. [2022-04-28 11:14:55,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:55,714 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:14:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 11:14:55,714 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:55,714 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 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, 1, 1] [2022-04-28 11:14:55,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 11:14:55,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:55,915 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:55,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:55,915 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 1 times [2022-04-28 11:14:55,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:55,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1785396162] [2022-04-28 11:14:56,156 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:56,156 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:56,156 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 2 times [2022-04-28 11:14:56,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:56,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548710916] [2022-04-28 11:14:56,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:56,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:56,164 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:56,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [446793094] [2022-04-28 11:14:56,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:56,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:56,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:56,165 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:14:56,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 11:14:56,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:56,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:56,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 11:14:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:56,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:56,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {4230#true} call ULTIMATE.init(); {4230#true} is VALID [2022-04-28 11:14:56,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {4230#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); {4230#true} is VALID [2022-04-28 11:14:56,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:56,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4230#true} {4230#true} #84#return; {4230#true} is VALID [2022-04-28 11:14:56,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {4230#true} call #t~ret5 := main(); {4230#true} is VALID [2022-04-28 11:14:56,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {4230#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; {4230#true} is VALID [2022-04-28 11:14:56,695 INFO L272 TraceCheckUtils]: 6: Hoare triple {4230#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:14:56,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:56,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:56,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:56,695 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4230#true} {4230#true} #60#return; {4230#true} is VALID [2022-04-28 11:14:56,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {4230#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:56,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:56,696 INFO L272 TraceCheckUtils]: 13: Hoare triple {4268#(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)); {4230#true} is VALID [2022-04-28 11:14:56,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:56,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:56,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:56,697 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:56,697 INFO L272 TraceCheckUtils]: 18: Hoare triple {4268#(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)); {4230#true} is VALID [2022-04-28 11:14:56,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:56,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:56,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:56,697 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:56,697 INFO L272 TraceCheckUtils]: 23: Hoare triple {4268#(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)); {4230#true} is VALID [2022-04-28 11:14:56,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:56,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:56,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:56,698 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:56,698 INFO L272 TraceCheckUtils]: 28: Hoare triple {4268#(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)); {4230#true} is VALID [2022-04-28 11:14:56,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:56,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:56,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:56,699 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:56,699 INFO L272 TraceCheckUtils]: 33: Hoare triple {4268#(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)); {4230#true} is VALID [2022-04-28 11:14:56,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:56,699 INFO L290 TraceCheckUtils]: 35: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:56,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:56,700 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:56,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {4268#(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; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:56,700 INFO L290 TraceCheckUtils]: 39: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !false; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:56,700 INFO L272 TraceCheckUtils]: 40: Hoare triple {4350#(and (= main_~z~0 12) (= 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)); {4230#true} is VALID [2022-04-28 11:14:56,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:56,700 INFO L290 TraceCheckUtils]: 42: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:56,701 INFO L290 TraceCheckUtils]: 43: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:56,701 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #62#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:56,701 INFO L272 TraceCheckUtils]: 45: Hoare triple {4350#(and (= main_~z~0 12) (= 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)); {4230#true} is VALID [2022-04-28 11:14:56,701 INFO L290 TraceCheckUtils]: 46: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:56,701 INFO L290 TraceCheckUtils]: 47: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:56,701 INFO L290 TraceCheckUtils]: 48: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:56,702 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #64#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:56,702 INFO L272 TraceCheckUtils]: 50: Hoare triple {4350#(and (= main_~z~0 12) (= 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)); {4230#true} is VALID [2022-04-28 11:14:56,702 INFO L290 TraceCheckUtils]: 51: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:56,702 INFO L290 TraceCheckUtils]: 52: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:56,702 INFO L290 TraceCheckUtils]: 53: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:56,702 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #66#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:56,703 INFO L272 TraceCheckUtils]: 55: Hoare triple {4350#(and (= main_~z~0 12) (= 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)); {4230#true} is VALID [2022-04-28 11:14:56,703 INFO L290 TraceCheckUtils]: 56: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:56,703 INFO L290 TraceCheckUtils]: 57: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:56,703 INFO L290 TraceCheckUtils]: 58: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:56,703 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #68#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:56,703 INFO L272 TraceCheckUtils]: 60: Hoare triple {4350#(and (= main_~z~0 12) (= 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)); {4230#true} is VALID [2022-04-28 11:14:56,703 INFO L290 TraceCheckUtils]: 61: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:56,703 INFO L290 TraceCheckUtils]: 62: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:56,704 INFO L290 TraceCheckUtils]: 63: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:56,704 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #70#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:56,705 INFO L290 TraceCheckUtils]: 65: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:56,705 INFO L272 TraceCheckUtils]: 66: Hoare triple {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:14:56,705 INFO L290 TraceCheckUtils]: 67: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:56,705 INFO L290 TraceCheckUtils]: 68: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:56,705 INFO L290 TraceCheckUtils]: 69: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:56,705 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4230#true} {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #72#return; {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:56,706 INFO L272 TraceCheckUtils]: 71: Hoare triple {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4451#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:56,706 INFO L290 TraceCheckUtils]: 72: Hoare triple {4451#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4455#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:56,707 INFO L290 TraceCheckUtils]: 73: Hoare triple {4455#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4231#false} is VALID [2022-04-28 11:14:56,707 INFO L290 TraceCheckUtils]: 74: Hoare triple {4231#false} assume !false; {4231#false} is VALID [2022-04-28 11:14:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:14:56,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:57,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:57,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548710916] [2022-04-28 11:14:57,023 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:57,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446793094] [2022-04-28 11:14:57,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446793094] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:14:57,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:14:57,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:14:57,023 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:57,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1785396162] [2022-04-28 11:14:57,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1785396162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:57,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:57,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:14:57,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661955960] [2022-04-28 11:14:57,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:57,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 75 [2022-04-28 11:14:57,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:57,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:57,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:57,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:14:57,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:57,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:14:57,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:14:57,060 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:57,599 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-04-28 11:14:57,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:14:57,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 75 [2022-04-28 11:14:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:14:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:14:57,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 11:14:57,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:57,662 INFO L225 Difference]: With dead ends: 94 [2022-04-28 11:14:57,662 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 11:14:57,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:14:57,662 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:57,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 186 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:57,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 11:14:57,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 11:14:57,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:57,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:57,708 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:57,709 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:57,711 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-28 11:14:57,711 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:14:57,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:57,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:57,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 92 states. [2022-04-28 11:14:57,712 INFO L87 Difference]: Start difference. First operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 92 states. [2022-04-28 11:14:57,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:57,715 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-28 11:14:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:14:57,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:57,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:57,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:57,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:57,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-04-28 11:14:57,718 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 75 [2022-04-28 11:14:57,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:57,719 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-04-28 11:14:57,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:57,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 104 transitions. [2022-04-28 11:14:57,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:14:57,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 11:14:57,825 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:57,825 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:57,843 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-28 11:14:58,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:58,026 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:58,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:58,026 INFO L85 PathProgramCache]: Analyzing trace with hash -63758730, now seen corresponding path program 7 times [2022-04-28 11:14:58,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:58,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [561288598] [2022-04-28 11:14:58,301 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:58,301 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:58,301 INFO L85 PathProgramCache]: Analyzing trace with hash -63758730, now seen corresponding path program 8 times [2022-04-28 11:14:58,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:58,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199033585] [2022-04-28 11:14:58,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:58,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:58,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:58,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [259857659] [2022-04-28 11:14:58,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:58,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:58,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:58,310 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:14:58,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 11:14:58,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:58,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:58,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 11:14:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:58,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:58,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5138#true} is VALID [2022-04-28 11:14:58,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {5138#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); {5138#true} is VALID [2022-04-28 11:14:58,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #84#return; {5138#true} is VALID [2022-04-28 11:14:58,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret5 := main(); {5138#true} is VALID [2022-04-28 11:14:58,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {5138#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; {5138#true} is VALID [2022-04-28 11:14:58,662 INFO L272 TraceCheckUtils]: 6: Hoare triple {5138#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:58,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,662 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5138#true} {5138#true} #60#return; {5138#true} is VALID [2022-04-28 11:14:58,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {5138#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:58,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:58,663 INFO L272 TraceCheckUtils]: 13: Hoare triple {5176#(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)); {5138#true} is VALID [2022-04-28 11:14:58,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,663 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:58,664 INFO L272 TraceCheckUtils]: 18: Hoare triple {5176#(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)); {5138#true} is VALID [2022-04-28 11:14:58,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,664 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:58,664 INFO L272 TraceCheckUtils]: 23: Hoare triple {5176#(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)); {5138#true} is VALID [2022-04-28 11:14:58,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,665 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:58,665 INFO L272 TraceCheckUtils]: 28: Hoare triple {5176#(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)); {5138#true} is VALID [2022-04-28 11:14:58,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,666 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:58,666 INFO L272 TraceCheckUtils]: 33: Hoare triple {5176#(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)); {5138#true} is VALID [2022-04-28 11:14:58,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,666 INFO L290 TraceCheckUtils]: 35: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,666 INFO L290 TraceCheckUtils]: 36: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,667 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:58,667 INFO L290 TraceCheckUtils]: 38: Hoare triple {5176#(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; {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:58,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} assume !false; {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:58,668 INFO L272 TraceCheckUtils]: 40: Hoare triple {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:58,668 INFO L290 TraceCheckUtils]: 41: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,668 INFO L290 TraceCheckUtils]: 42: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,668 INFO L290 TraceCheckUtils]: 43: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,668 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5138#true} {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #62#return; {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:58,668 INFO L272 TraceCheckUtils]: 45: Hoare triple {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:58,669 INFO L290 TraceCheckUtils]: 46: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,669 INFO L290 TraceCheckUtils]: 47: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,669 INFO L290 TraceCheckUtils]: 48: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,669 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5138#true} {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #64#return; {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:58,669 INFO L272 TraceCheckUtils]: 50: Hoare triple {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:58,669 INFO L290 TraceCheckUtils]: 51: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,669 INFO L290 TraceCheckUtils]: 52: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,669 INFO L290 TraceCheckUtils]: 53: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,670 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5138#true} {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #66#return; {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:58,670 INFO L272 TraceCheckUtils]: 55: Hoare triple {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= 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)); {5138#true} is VALID [2022-04-28 11:14:58,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,670 INFO L290 TraceCheckUtils]: 57: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,670 INFO L290 TraceCheckUtils]: 58: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,671 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5138#true} {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #68#return; {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:58,671 INFO L272 TraceCheckUtils]: 60: Hoare triple {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:58,671 INFO L290 TraceCheckUtils]: 61: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,671 INFO L290 TraceCheckUtils]: 62: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,671 INFO L290 TraceCheckUtils]: 63: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,671 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5138#true} {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #70#return; {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:58,672 INFO L290 TraceCheckUtils]: 65: Hoare triple {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~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; {5340#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-28 11:14:58,672 INFO L290 TraceCheckUtils]: 66: Hoare triple {5340#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !false; {5340#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-28 11:14:58,672 INFO L272 TraceCheckUtils]: 67: Hoare triple {5340#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:58,672 INFO L290 TraceCheckUtils]: 68: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,672 INFO L290 TraceCheckUtils]: 69: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,673 INFO L290 TraceCheckUtils]: 70: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,673 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5138#true} {5340#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #62#return; {5340#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-28 11:14:58,673 INFO L272 TraceCheckUtils]: 72: Hoare triple {5340#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5362#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:58,674 INFO L290 TraceCheckUtils]: 73: Hoare triple {5362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:58,674 INFO L290 TraceCheckUtils]: 74: Hoare triple {5366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5139#false} is VALID [2022-04-28 11:14:58,674 INFO L290 TraceCheckUtils]: 75: Hoare triple {5139#false} assume !false; {5139#false} is VALID [2022-04-28 11:14:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:14:58,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:58,935 INFO L290 TraceCheckUtils]: 75: Hoare triple {5139#false} assume !false; {5139#false} is VALID [2022-04-28 11:14:58,936 INFO L290 TraceCheckUtils]: 74: Hoare triple {5366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5139#false} is VALID [2022-04-28 11:14:58,936 INFO L290 TraceCheckUtils]: 73: Hoare triple {5362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:58,937 INFO L272 TraceCheckUtils]: 72: Hoare triple {5382#(= (+ (* 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)); {5362#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:58,937 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5138#true} {5382#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {5382#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:58,937 INFO L290 TraceCheckUtils]: 70: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,937 INFO L290 TraceCheckUtils]: 69: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,937 INFO L290 TraceCheckUtils]: 68: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,937 INFO L272 TraceCheckUtils]: 67: Hoare triple {5382#(= (+ (* 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)); {5138#true} is VALID [2022-04-28 11:14:58,938 INFO L290 TraceCheckUtils]: 66: Hoare triple {5382#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {5382#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:58,942 INFO L290 TraceCheckUtils]: 65: Hoare triple {5404#(= (+ (* 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; {5382#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:58,942 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5138#true} {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #70#return; {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:58,942 INFO L290 TraceCheckUtils]: 63: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,942 INFO L290 TraceCheckUtils]: 62: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,942 INFO L290 TraceCheckUtils]: 61: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,943 INFO L272 TraceCheckUtils]: 60: Hoare triple {5404#(= (+ (* 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)); {5138#true} is VALID [2022-04-28 11:14:58,943 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5138#true} {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #68#return; {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:58,943 INFO L290 TraceCheckUtils]: 58: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,943 INFO L290 TraceCheckUtils]: 57: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,943 INFO L290 TraceCheckUtils]: 56: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,943 INFO L272 TraceCheckUtils]: 55: Hoare triple {5404#(= (+ (* 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)); {5138#true} is VALID [2022-04-28 11:14:58,944 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5138#true} {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #66#return; {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:58,944 INFO L290 TraceCheckUtils]: 53: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,944 INFO L290 TraceCheckUtils]: 52: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,944 INFO L290 TraceCheckUtils]: 51: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,944 INFO L272 TraceCheckUtils]: 50: Hoare triple {5404#(= (+ (* 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)); {5138#true} is VALID [2022-04-28 11:14:58,945 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5138#true} {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #64#return; {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:58,945 INFO L290 TraceCheckUtils]: 48: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,945 INFO L290 TraceCheckUtils]: 47: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,945 INFO L290 TraceCheckUtils]: 46: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,945 INFO L272 TraceCheckUtils]: 45: Hoare triple {5404#(= (+ (* 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)); {5138#true} is VALID [2022-04-28 11:14:58,945 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5138#true} {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #62#return; {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:58,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,946 INFO L290 TraceCheckUtils]: 41: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,946 INFO L272 TraceCheckUtils]: 40: Hoare triple {5404#(= (+ (* 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)); {5138#true} is VALID [2022-04-28 11:14:58,946 INFO L290 TraceCheckUtils]: 39: Hoare triple {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !false; {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:58,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~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; {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:58,951 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5138#true} {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #70#return; {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:14:58,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,951 INFO L272 TraceCheckUtils]: 33: Hoare triple {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:58,952 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5138#true} {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #68#return; {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:14:58,952 INFO L290 TraceCheckUtils]: 31: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,952 INFO L272 TraceCheckUtils]: 28: Hoare triple {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~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)); {5138#true} is VALID [2022-04-28 11:14:58,952 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5138#true} {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #66#return; {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:14:58,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,953 INFO L272 TraceCheckUtils]: 23: Hoare triple {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:58,953 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5138#true} {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #64#return; {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:14:58,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,953 INFO L272 TraceCheckUtils]: 18: Hoare triple {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:58,954 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5138#true} {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #62#return; {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:14:58,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,954 INFO L272 TraceCheckUtils]: 13: Hoare triple {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:58,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} assume !false; {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:14:58,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {5138#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:14:58,955 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5138#true} {5138#true} #60#return; {5138#true} is VALID [2022-04-28 11:14:58,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:58,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:58,955 INFO L272 TraceCheckUtils]: 6: Hoare triple {5138#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:58,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {5138#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; {5138#true} is VALID [2022-04-28 11:14:58,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret5 := main(); {5138#true} is VALID [2022-04-28 11:14:58,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #84#return; {5138#true} is VALID [2022-04-28 11:14:58,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:58,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {5138#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); {5138#true} is VALID [2022-04-28 11:14:58,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5138#true} is VALID [2022-04-28 11:14:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:14:58,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:58,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199033585] [2022-04-28 11:14:58,956 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:58,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259857659] [2022-04-28 11:14:58,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259857659] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:58,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:58,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 11:14:58,957 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:58,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [561288598] [2022-04-28 11:14:58,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [561288598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:58,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:58,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:14:58,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205124818] [2022-04-28 11:14:58,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:58,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:14:58,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:58,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:58,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:58,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:14:58,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:58,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:14:58,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:14:58,996 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:59,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:59,638 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2022-04-28 11:14:59,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:14:59,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:14:59,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:59,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2022-04-28 11:14:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2022-04-28 11:14:59,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 100 transitions. [2022-04-28 11:14:59,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:59,723 INFO L225 Difference]: With dead ends: 115 [2022-04-28 11:14:59,723 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 11:14:59,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:14:59,724 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 7 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:59,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 227 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:14:59,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 11:14:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2022-04-28 11:14:59,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:59,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:14:59,760 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:14:59,761 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:14:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:59,763 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-04-28 11:14:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-04-28 11:14:59,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:59,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:59,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 113 states. [2022-04-28 11:14:59,763 INFO L87 Difference]: Start difference. First operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 113 states. [2022-04-28 11:14:59,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:59,766 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-04-28 11:14:59,766 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-04-28 11:14:59,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:59,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:59,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:59,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:14:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-04-28 11:14:59,768 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 76 [2022-04-28 11:14:59,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:59,768 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-04-28 11:14:59,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:59,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 115 transitions. [2022-04-28 11:14:59,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-28 11:14:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 11:14:59,883 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:59,883 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 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, 1, 1, 1, 1] [2022-04-28 11:14:59,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 11:15:00,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 11:15:00,084 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:00,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:00,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 1 times [2022-04-28 11:15:00,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:00,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [835146044] [2022-04-28 11:15:00,333 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:00,333 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:00,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 2 times [2022-04-28 11:15:00,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:00,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663676074] [2022-04-28 11:15:00,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:00,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:00,349 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:00,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [900137631] [2022-04-28 11:15:00,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:00,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:00,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:00,363 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:15:00,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 11:15:00,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:00,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:00,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 11:15:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:00,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:00,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {6267#true} call ULTIMATE.init(); {6267#true} is VALID [2022-04-28 11:15:00,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {6267#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); {6267#true} is VALID [2022-04-28 11:15:00,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:00,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6267#true} {6267#true} #84#return; {6267#true} is VALID [2022-04-28 11:15:00,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {6267#true} call #t~ret5 := main(); {6267#true} is VALID [2022-04-28 11:15:00,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {6267#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; {6267#true} is VALID [2022-04-28 11:15:00,816 INFO L272 TraceCheckUtils]: 6: Hoare triple {6267#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:00,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:00,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:00,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:00,817 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6267#true} {6267#true} #60#return; {6267#true} is VALID [2022-04-28 11:15:00,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {6267#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:00,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:00,817 INFO L272 TraceCheckUtils]: 13: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:00,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:00,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:00,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:00,818 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #62#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:00,818 INFO L272 TraceCheckUtils]: 18: Hoare triple {6305#(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)); {6267#true} is VALID [2022-04-28 11:15:00,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:00,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:00,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:00,818 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #64#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:00,818 INFO L272 TraceCheckUtils]: 23: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:00,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:00,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:00,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:00,840 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #66#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:00,840 INFO L272 TraceCheckUtils]: 28: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:00,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:00,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:00,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:00,840 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #68#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:00,840 INFO L272 TraceCheckUtils]: 33: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:00,840 INFO L290 TraceCheckUtils]: 34: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:00,840 INFO L290 TraceCheckUtils]: 35: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:00,840 INFO L290 TraceCheckUtils]: 36: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:00,841 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #70#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:00,842 INFO L290 TraceCheckUtils]: 38: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:00,842 INFO L290 TraceCheckUtils]: 39: Hoare triple {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !false; {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:00,842 INFO L272 TraceCheckUtils]: 40: Hoare triple {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:00,842 INFO L290 TraceCheckUtils]: 41: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:00,842 INFO L290 TraceCheckUtils]: 42: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:00,842 INFO L290 TraceCheckUtils]: 43: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:00,842 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6267#true} {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} #62#return; {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:00,843 INFO L272 TraceCheckUtils]: 45: Hoare triple {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 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)); {6267#true} is VALID [2022-04-28 11:15:00,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:00,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:00,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:00,843 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6267#true} {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} #64#return; {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:00,843 INFO L272 TraceCheckUtils]: 50: Hoare triple {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:00,843 INFO L290 TraceCheckUtils]: 51: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:00,843 INFO L290 TraceCheckUtils]: 52: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:00,843 INFO L290 TraceCheckUtils]: 53: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:00,844 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6267#true} {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} #66#return; {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:00,844 INFO L272 TraceCheckUtils]: 55: Hoare triple {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 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)); {6267#true} is VALID [2022-04-28 11:15:00,844 INFO L290 TraceCheckUtils]: 56: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:00,844 INFO L290 TraceCheckUtils]: 57: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:00,844 INFO L290 TraceCheckUtils]: 58: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:00,844 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6267#true} {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} #68#return; {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:00,845 INFO L272 TraceCheckUtils]: 60: Hoare triple {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 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)); {6267#true} is VALID [2022-04-28 11:15:00,845 INFO L290 TraceCheckUtils]: 61: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:00,845 INFO L290 TraceCheckUtils]: 62: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:00,845 INFO L290 TraceCheckUtils]: 63: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:00,845 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6267#true} {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} #70#return; {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:00,845 INFO L290 TraceCheckUtils]: 65: Hoare triple {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {6469#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:15:00,846 INFO L272 TraceCheckUtils]: 66: Hoare triple {6469#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:00,846 INFO L290 TraceCheckUtils]: 67: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:00,846 INFO L290 TraceCheckUtils]: 68: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:00,846 INFO L290 TraceCheckUtils]: 69: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:00,846 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {6267#true} {6469#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (< main_~a~0 1))} #72#return; {6469#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:15:00,846 INFO L272 TraceCheckUtils]: 71: Hoare triple {6469#(and (= (+ 5 main_~y~0) main_~z~0) (<= 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)); {6267#true} is VALID [2022-04-28 11:15:00,846 INFO L290 TraceCheckUtils]: 72: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:00,846 INFO L290 TraceCheckUtils]: 73: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:00,846 INFO L290 TraceCheckUtils]: 74: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:00,847 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6267#true} {6469#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (< main_~a~0 1))} #74#return; {6469#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:15:00,848 INFO L272 TraceCheckUtils]: 76: Hoare triple {6469#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~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)); {6503#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:00,848 INFO L290 TraceCheckUtils]: 77: Hoare triple {6503#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6507#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:00,848 INFO L290 TraceCheckUtils]: 78: Hoare triple {6507#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6268#false} is VALID [2022-04-28 11:15:00,848 INFO L290 TraceCheckUtils]: 79: Hoare triple {6268#false} assume !false; {6268#false} is VALID [2022-04-28 11:15:00,849 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:15:00,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:12,048 INFO L290 TraceCheckUtils]: 79: Hoare triple {6268#false} assume !false; {6268#false} is VALID [2022-04-28 11:15:12,049 INFO L290 TraceCheckUtils]: 78: Hoare triple {6507#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6268#false} is VALID [2022-04-28 11:15:12,049 INFO L290 TraceCheckUtils]: 77: Hoare triple {6503#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6507#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:12,049 INFO L272 TraceCheckUtils]: 76: Hoare triple {6523#(= (+ (* 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)); {6503#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:12,050 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6267#true} {6523#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #74#return; {6523#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:15:12,050 INFO L290 TraceCheckUtils]: 74: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:12,050 INFO L290 TraceCheckUtils]: 73: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:12,050 INFO L290 TraceCheckUtils]: 72: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:12,050 INFO L272 TraceCheckUtils]: 71: Hoare triple {6523#(= (+ (* 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)); {6267#true} is VALID [2022-04-28 11:15:12,051 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {6267#true} {6523#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #72#return; {6523#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:15:12,051 INFO L290 TraceCheckUtils]: 69: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:12,051 INFO L290 TraceCheckUtils]: 68: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:12,051 INFO L290 TraceCheckUtils]: 67: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:12,051 INFO L272 TraceCheckUtils]: 66: Hoare triple {6523#(= (+ (* 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)); {6267#true} is VALID [2022-04-28 11:15:12,051 INFO L290 TraceCheckUtils]: 65: Hoare triple {6557#(or (= (+ (* 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); {6523#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:15:12,052 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6267#true} {6557#(or (= (+ (* 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))} #70#return; {6557#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:15:12,052 INFO L290 TraceCheckUtils]: 63: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:12,052 INFO L290 TraceCheckUtils]: 62: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:12,052 INFO L290 TraceCheckUtils]: 61: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:12,052 INFO L272 TraceCheckUtils]: 60: Hoare triple {6557#(or (= (+ (* 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)); {6267#true} is VALID [2022-04-28 11:15:12,052 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6267#true} {6557#(or (= (+ (* 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))} #68#return; {6557#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:15:12,053 INFO L290 TraceCheckUtils]: 58: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:12,053 INFO L290 TraceCheckUtils]: 57: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:12,053 INFO L290 TraceCheckUtils]: 56: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:12,053 INFO L272 TraceCheckUtils]: 55: Hoare triple {6557#(or (= (+ (* 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)); {6267#true} is VALID [2022-04-28 11:15:12,053 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6267#true} {6557#(or (= (+ (* 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))} #66#return; {6557#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:15:12,053 INFO L290 TraceCheckUtils]: 53: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:12,053 INFO L290 TraceCheckUtils]: 52: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:12,053 INFO L290 TraceCheckUtils]: 51: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:12,053 INFO L272 TraceCheckUtils]: 50: Hoare triple {6557#(or (= (+ (* 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)); {6267#true} is VALID [2022-04-28 11:15:12,054 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6267#true} {6557#(or (= (+ (* 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))} #64#return; {6557#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:15:12,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:12,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:12,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:12,054 INFO L272 TraceCheckUtils]: 45: Hoare triple {6557#(or (= (+ (* 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)); {6267#true} is VALID [2022-04-28 11:15:12,055 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6267#true} {6557#(or (= (+ (* 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))} #62#return; {6557#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:15:12,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:12,055 INFO L290 TraceCheckUtils]: 42: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:12,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:12,055 INFO L272 TraceCheckUtils]: 40: Hoare triple {6557#(or (= (+ (* 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)); {6267#true} is VALID [2022-04-28 11:15:12,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {6557#(or (= (+ (* 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 !false; {6557#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:15:12,056 INFO L290 TraceCheckUtils]: 38: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6557#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:15:12,057 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #70#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:12,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:12,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:12,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:12,057 INFO L272 TraceCheckUtils]: 33: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:12,057 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #68#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:12,057 INFO L290 TraceCheckUtils]: 31: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:12,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:12,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:12,058 INFO L272 TraceCheckUtils]: 28: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:12,058 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #66#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:12,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:12,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:12,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:12,058 INFO L272 TraceCheckUtils]: 23: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:12,059 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #64#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:12,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:12,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:12,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:12,059 INFO L272 TraceCheckUtils]: 18: Hoare triple {6305#(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)); {6267#true} is VALID [2022-04-28 11:15:12,059 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #62#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:12,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:12,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:12,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:12,060 INFO L272 TraceCheckUtils]: 13: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:12,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:12,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {6267#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:12,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6267#true} {6267#true} #60#return; {6267#true} is VALID [2022-04-28 11:15:12,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:12,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:12,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:12,060 INFO L272 TraceCheckUtils]: 6: Hoare triple {6267#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:12,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {6267#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; {6267#true} is VALID [2022-04-28 11:15:12,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {6267#true} call #t~ret5 := main(); {6267#true} is VALID [2022-04-28 11:15:12,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6267#true} {6267#true} #84#return; {6267#true} is VALID [2022-04-28 11:15:12,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:12,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {6267#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); {6267#true} is VALID [2022-04-28 11:15:12,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {6267#true} call ULTIMATE.init(); {6267#true} is VALID [2022-04-28 11:15:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:15:12,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:12,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663676074] [2022-04-28 11:15:12,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:12,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900137631] [2022-04-28 11:15:12,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900137631] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:12,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:12,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 11:15:12,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:12,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [835146044] [2022-04-28 11:15:12,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [835146044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:12,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:12,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:15:12,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95325936] [2022-04-28 11:15:12,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:12,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 80 [2022-04-28 11:15:12,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:12,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:12,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:12,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:15:12,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:12,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:15:12,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:15:12,099 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:12,580 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-04-28 11:15:12,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:15:12,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 80 [2022-04-28 11:15:12,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:15:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:15:12,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 11:15:12,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:12,645 INFO L225 Difference]: With dead ends: 109 [2022-04-28 11:15:12,645 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 11:15:12,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:15:12,646 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 6 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:12,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 216 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:15:12,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 11:15:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-28 11:15:12,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:12,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:12,690 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:12,691 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:12,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:12,692 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-04-28 11:15:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:15:12,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:12,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:12,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 96 states. [2022-04-28 11:15:12,693 INFO L87 Difference]: Start difference. First operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 96 states. [2022-04-28 11:15:12,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:12,695 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-04-28 11:15:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:15:12,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:12,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:12,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:12,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:12,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2022-04-28 11:15:12,697 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 80 [2022-04-28 11:15:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:12,697 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2022-04-28 11:15:12,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:12,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 106 transitions. [2022-04-28 11:15:12,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:15:12,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 11:15:12,815 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:12,815 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:12,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 11:15:13,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:13,015 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:13,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 9 times [2022-04-28 11:15:13,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:13,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [292487692] [2022-04-28 11:15:13,338 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:13,338 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:13,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 10 times [2022-04-28 11:15:13,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:13,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69027489] [2022-04-28 11:15:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:13,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:13,346 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:13,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124767026] [2022-04-28 11:15:13,346 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:15:13,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:13,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:13,347 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:15:13,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 11:15:13,401 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:15:13,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:13,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 11:15:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:13,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:13,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {7361#true} call ULTIMATE.init(); {7361#true} is VALID [2022-04-28 11:15:13,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {7361#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); {7361#true} is VALID [2022-04-28 11:15:13,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:13,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7361#true} {7361#true} #84#return; {7361#true} is VALID [2022-04-28 11:15:13,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {7361#true} call #t~ret5 := main(); {7361#true} is VALID [2022-04-28 11:15:13,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {7361#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; {7361#true} is VALID [2022-04-28 11:15:13,752 INFO L272 TraceCheckUtils]: 6: Hoare triple {7361#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:13,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:13,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:13,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:13,752 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7361#true} {7361#true} #60#return; {7361#true} is VALID [2022-04-28 11:15:13,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {7361#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:13,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:13,753 INFO L272 TraceCheckUtils]: 13: Hoare triple {7399#(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)); {7361#true} is VALID [2022-04-28 11:15:13,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:13,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:13,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:13,754 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7361#true} {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:13,754 INFO L272 TraceCheckUtils]: 18: Hoare triple {7399#(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)); {7361#true} is VALID [2022-04-28 11:15:13,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:13,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:13,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:13,755 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7361#true} {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:13,755 INFO L272 TraceCheckUtils]: 23: Hoare triple {7399#(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)); {7361#true} is VALID [2022-04-28 11:15:13,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:13,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:13,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:13,756 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7361#true} {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:13,756 INFO L272 TraceCheckUtils]: 28: Hoare triple {7399#(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)); {7361#true} is VALID [2022-04-28 11:15:13,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:13,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:13,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:13,756 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7361#true} {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:13,757 INFO L272 TraceCheckUtils]: 33: Hoare triple {7399#(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)); {7361#true} is VALID [2022-04-28 11:15:13,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:13,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:13,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:13,757 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7361#true} {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:13,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {7399#(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; {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:15:13,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} assume !false; {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:15:13,758 INFO L272 TraceCheckUtils]: 40: Hoare triple {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:13,759 INFO L290 TraceCheckUtils]: 41: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:13,759 INFO L290 TraceCheckUtils]: 42: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:13,759 INFO L290 TraceCheckUtils]: 43: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:13,759 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7361#true} {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #62#return; {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:15:13,759 INFO L272 TraceCheckUtils]: 45: Hoare triple {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:13,759 INFO L290 TraceCheckUtils]: 46: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:13,759 INFO L290 TraceCheckUtils]: 47: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:13,759 INFO L290 TraceCheckUtils]: 48: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:13,760 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7361#true} {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #64#return; {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:15:13,760 INFO L272 TraceCheckUtils]: 50: Hoare triple {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:13,760 INFO L290 TraceCheckUtils]: 51: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:13,760 INFO L290 TraceCheckUtils]: 52: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:13,760 INFO L290 TraceCheckUtils]: 53: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:13,761 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7361#true} {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #66#return; {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:15:13,761 INFO L272 TraceCheckUtils]: 55: Hoare triple {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 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)); {7361#true} is VALID [2022-04-28 11:15:13,761 INFO L290 TraceCheckUtils]: 56: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:13,761 INFO L290 TraceCheckUtils]: 57: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:13,761 INFO L290 TraceCheckUtils]: 58: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:13,762 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7361#true} {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #68#return; {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:15:13,762 INFO L272 TraceCheckUtils]: 60: Hoare triple {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:13,762 INFO L290 TraceCheckUtils]: 61: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:13,762 INFO L290 TraceCheckUtils]: 62: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:13,762 INFO L290 TraceCheckUtils]: 63: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:13,763 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7361#true} {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #70#return; {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:15:13,763 INFO L290 TraceCheckUtils]: 65: Hoare triple {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 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; {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} is VALID [2022-04-28 11:15:13,764 INFO L290 TraceCheckUtils]: 66: Hoare triple {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} assume !false; {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} is VALID [2022-04-28 11:15:13,764 INFO L272 TraceCheckUtils]: 67: Hoare triple {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:13,764 INFO L290 TraceCheckUtils]: 68: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:13,764 INFO L290 TraceCheckUtils]: 69: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:13,764 INFO L290 TraceCheckUtils]: 70: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:13,764 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7361#true} {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} #62#return; {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} is VALID [2022-04-28 11:15:13,764 INFO L272 TraceCheckUtils]: 72: Hoare triple {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:13,765 INFO L290 TraceCheckUtils]: 73: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:13,765 INFO L290 TraceCheckUtils]: 74: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:13,765 INFO L290 TraceCheckUtils]: 75: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:13,765 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7361#true} {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} #64#return; {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} is VALID [2022-04-28 11:15:13,766 INFO L272 TraceCheckUtils]: 77: Hoare triple {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7600#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:13,766 INFO L290 TraceCheckUtils]: 78: Hoare triple {7600#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7604#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:13,766 INFO L290 TraceCheckUtils]: 79: Hoare triple {7604#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7362#false} is VALID [2022-04-28 11:15:13,766 INFO L290 TraceCheckUtils]: 80: Hoare triple {7362#false} assume !false; {7362#false} is VALID [2022-04-28 11:15:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:15:13,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:14,034 INFO L290 TraceCheckUtils]: 80: Hoare triple {7362#false} assume !false; {7362#false} is VALID [2022-04-28 11:15:14,035 INFO L290 TraceCheckUtils]: 79: Hoare triple {7604#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7362#false} is VALID [2022-04-28 11:15:14,035 INFO L290 TraceCheckUtils]: 78: Hoare triple {7600#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7604#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:14,035 INFO L272 TraceCheckUtils]: 77: Hoare triple {7620#(= (* 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)); {7600#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:14,036 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7361#true} {7620#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {7620#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:15:14,036 INFO L290 TraceCheckUtils]: 75: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:14,036 INFO L290 TraceCheckUtils]: 74: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:14,036 INFO L290 TraceCheckUtils]: 73: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:14,036 INFO L272 TraceCheckUtils]: 72: Hoare triple {7620#(= (* 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)); {7361#true} is VALID [2022-04-28 11:15:14,036 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7361#true} {7620#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {7620#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:15:14,037 INFO L290 TraceCheckUtils]: 70: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:14,037 INFO L290 TraceCheckUtils]: 69: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:14,037 INFO L290 TraceCheckUtils]: 68: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:14,037 INFO L272 TraceCheckUtils]: 67: Hoare triple {7620#(= (* 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)); {7361#true} is VALID [2022-04-28 11:15:14,037 INFO L290 TraceCheckUtils]: 66: Hoare triple {7620#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {7620#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:15:14,039 INFO L290 TraceCheckUtils]: 65: Hoare triple {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7620#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:15:14,039 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7361#true} {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:14,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:14,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:14,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:14,039 INFO L272 TraceCheckUtils]: 60: Hoare triple {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:14,040 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7361#true} {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:14,040 INFO L290 TraceCheckUtils]: 58: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:14,040 INFO L290 TraceCheckUtils]: 57: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:14,040 INFO L290 TraceCheckUtils]: 56: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:14,040 INFO L272 TraceCheckUtils]: 55: Hoare triple {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:14,041 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7361#true} {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:14,041 INFO L290 TraceCheckUtils]: 53: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:14,041 INFO L290 TraceCheckUtils]: 52: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:14,041 INFO L290 TraceCheckUtils]: 51: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:14,041 INFO L272 TraceCheckUtils]: 50: Hoare triple {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:14,041 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7361#true} {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:14,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:14,041 INFO L290 TraceCheckUtils]: 47: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:14,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:14,042 INFO L272 TraceCheckUtils]: 45: Hoare triple {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:14,042 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7361#true} {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:14,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:14,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:14,042 INFO L290 TraceCheckUtils]: 41: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:14,042 INFO L272 TraceCheckUtils]: 40: Hoare triple {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:14,043 INFO L290 TraceCheckUtils]: 39: Hoare triple {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:14,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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; {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:14,045 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7361#true} {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:15:14,045 INFO L290 TraceCheckUtils]: 36: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:14,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:14,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:14,045 INFO L272 TraceCheckUtils]: 33: Hoare triple {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:14,046 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7361#true} {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:15:14,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:14,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:14,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:14,046 INFO L272 TraceCheckUtils]: 28: Hoare triple {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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)); {7361#true} is VALID [2022-04-28 11:15:14,047 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7361#true} {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:15:14,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:14,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:14,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:14,047 INFO L272 TraceCheckUtils]: 23: Hoare triple {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:14,047 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7361#true} {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:15:14,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:14,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:14,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:14,048 INFO L272 TraceCheckUtils]: 18: Hoare triple {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:14,048 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7361#true} {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:15:14,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:14,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:14,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:14,048 INFO L272 TraceCheckUtils]: 13: Hoare triple {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:14,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:15:14,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {7361#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:15:14,049 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7361#true} {7361#true} #60#return; {7361#true} is VALID [2022-04-28 11:15:14,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:14,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:14,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:14,049 INFO L272 TraceCheckUtils]: 6: Hoare triple {7361#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:14,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {7361#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; {7361#true} is VALID [2022-04-28 11:15:14,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {7361#true} call #t~ret5 := main(); {7361#true} is VALID [2022-04-28 11:15:14,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7361#true} {7361#true} #84#return; {7361#true} is VALID [2022-04-28 11:15:14,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:14,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {7361#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); {7361#true} is VALID [2022-04-28 11:15:14,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {7361#true} call ULTIMATE.init(); {7361#true} is VALID [2022-04-28 11:15:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:15:14,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:14,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69027489] [2022-04-28 11:15:14,050 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:14,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124767026] [2022-04-28 11:15:14,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124767026] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:14,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:14,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 11:15:14,051 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:14,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [292487692] [2022-04-28 11:15:14,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [292487692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:14,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:14,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:15:14,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547029016] [2022-04-28 11:15:14,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:14,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 81 [2022-04-28 11:15:14,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:14,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:14,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:14,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:15:14,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:14,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:15:14,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:15:14,090 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:15,049 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2022-04-28 11:15:15,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:15:15,049 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 81 [2022-04-28 11:15:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-04-28 11:15:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-04-28 11:15:15,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 94 transitions. [2022-04-28 11:15:15,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:15,143 INFO L225 Difference]: With dead ends: 112 [2022-04-28 11:15:15,143 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 11:15:15,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:15:15,144 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 6 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:15,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 222 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 11:15:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 11:15:15,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2022-04-28 11:15:15,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:15,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:15:15,194 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:15:15,195 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:15:15,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:15,197 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 11:15:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-28 11:15:15,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:15,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:15,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 110 states. [2022-04-28 11:15:15,198 INFO L87 Difference]: Start difference. First operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 110 states. [2022-04-28 11:15:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:15,199 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 11:15:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-28 11:15:15,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:15,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:15,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:15,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:15,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:15:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-04-28 11:15:15,202 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 81 [2022-04-28 11:15:15,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:15,202 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-04-28 11:15:15,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:15,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 111 transitions. [2022-04-28 11:15:15,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:15,318 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 11:15:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 11:15:15,319 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:15,319 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:15,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 11:15:15,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 11:15:15,520 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:15,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:15,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1087104342, now seen corresponding path program 11 times [2022-04-28 11:15:15,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:15,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1392544197] [2022-04-28 11:15:15,805 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:15,805 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1087104342, now seen corresponding path program 12 times [2022-04-28 11:15:15,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:15,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309562749] [2022-04-28 11:15:15,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:15,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:15,813 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:15,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1469762431] [2022-04-28 11:15:15,813 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:15:15,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:15,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:15,814 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:15:15,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 11:15:15,889 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:15:15,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:15,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 11:15:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:15,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:16,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {8504#true} call ULTIMATE.init(); {8504#true} is VALID [2022-04-28 11:15:16,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {8504#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); {8504#true} is VALID [2022-04-28 11:15:16,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8504#true} {8504#true} #84#return; {8504#true} is VALID [2022-04-28 11:15:16,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {8504#true} call #t~ret5 := main(); {8504#true} is VALID [2022-04-28 11:15:16,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {8504#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; {8504#true} is VALID [2022-04-28 11:15:16,293 INFO L272 TraceCheckUtils]: 6: Hoare triple {8504#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:16,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,293 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8504#true} {8504#true} #60#return; {8504#true} is VALID [2022-04-28 11:15:16,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {8504#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:16,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:16,294 INFO L272 TraceCheckUtils]: 13: Hoare triple {8542#(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)); {8504#true} is VALID [2022-04-28 11:15:16,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,295 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8504#true} {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:16,295 INFO L272 TraceCheckUtils]: 18: Hoare triple {8542#(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)); {8504#true} is VALID [2022-04-28 11:15:16,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,296 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8504#true} {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:16,296 INFO L272 TraceCheckUtils]: 23: Hoare triple {8542#(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)); {8504#true} is VALID [2022-04-28 11:15:16,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,297 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8504#true} {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:16,297 INFO L272 TraceCheckUtils]: 28: Hoare triple {8542#(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)); {8504#true} is VALID [2022-04-28 11:15:16,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,297 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8504#true} {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:16,297 INFO L272 TraceCheckUtils]: 33: Hoare triple {8542#(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)); {8504#true} is VALID [2022-04-28 11:15:16,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,298 INFO L290 TraceCheckUtils]: 36: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,298 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8504#true} {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:16,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {8542#(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; {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:16,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} assume !false; {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:16,299 INFO L272 TraceCheckUtils]: 40: Hoare triple {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:16,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,300 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8504#true} {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #62#return; {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:16,300 INFO L272 TraceCheckUtils]: 45: Hoare triple {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:16,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,300 INFO L290 TraceCheckUtils]: 47: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,300 INFO L290 TraceCheckUtils]: 48: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,301 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8504#true} {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #64#return; {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:16,301 INFO L272 TraceCheckUtils]: 50: Hoare triple {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:16,301 INFO L290 TraceCheckUtils]: 51: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,301 INFO L290 TraceCheckUtils]: 52: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,301 INFO L290 TraceCheckUtils]: 53: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,301 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8504#true} {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #66#return; {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:16,301 INFO L272 TraceCheckUtils]: 55: Hoare triple {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:16,301 INFO L290 TraceCheckUtils]: 56: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,301 INFO L290 TraceCheckUtils]: 57: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,302 INFO L290 TraceCheckUtils]: 58: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,302 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8504#true} {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #68#return; {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:16,302 INFO L272 TraceCheckUtils]: 60: Hoare triple {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:16,302 INFO L290 TraceCheckUtils]: 61: Hoare triple {8504#true} ~cond := #in~cond; {8694#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:16,303 INFO L290 TraceCheckUtils]: 62: Hoare triple {8694#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8698#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:16,303 INFO L290 TraceCheckUtils]: 63: Hoare triple {8698#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8698#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:16,303 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8698#(not (= |__VERIFIER_assert_#in~cond| 0))} {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #70#return; {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:16,304 INFO L290 TraceCheckUtils]: 65: Hoare triple {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} is VALID [2022-04-28 11:15:16,304 INFO L290 TraceCheckUtils]: 66: Hoare triple {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} assume !false; {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} is VALID [2022-04-28 11:15:16,304 INFO L272 TraceCheckUtils]: 67: Hoare triple {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:16,304 INFO L290 TraceCheckUtils]: 68: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,304 INFO L290 TraceCheckUtils]: 69: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,304 INFO L290 TraceCheckUtils]: 70: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,305 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8504#true} {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} #62#return; {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} is VALID [2022-04-28 11:15:16,305 INFO L272 TraceCheckUtils]: 72: Hoare triple {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:16,305 INFO L290 TraceCheckUtils]: 73: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,305 INFO L290 TraceCheckUtils]: 74: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,305 INFO L290 TraceCheckUtils]: 75: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,306 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8504#true} {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} #64#return; {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} is VALID [2022-04-28 11:15:16,306 INFO L272 TraceCheckUtils]: 77: Hoare triple {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:16,306 INFO L290 TraceCheckUtils]: 78: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,306 INFO L290 TraceCheckUtils]: 79: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,306 INFO L290 TraceCheckUtils]: 80: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,306 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8504#true} {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} #66#return; {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} is VALID [2022-04-28 11:15:16,307 INFO L272 TraceCheckUtils]: 82: Hoare triple {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= 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)); {8760#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:16,307 INFO L290 TraceCheckUtils]: 83: Hoare triple {8760#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8764#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:16,308 INFO L290 TraceCheckUtils]: 84: Hoare triple {8764#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8505#false} is VALID [2022-04-28 11:15:16,308 INFO L290 TraceCheckUtils]: 85: Hoare triple {8505#false} assume !false; {8505#false} is VALID [2022-04-28 11:15:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 52 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-28 11:15:16,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:16,902 INFO L290 TraceCheckUtils]: 85: Hoare triple {8505#false} assume !false; {8505#false} is VALID [2022-04-28 11:15:16,902 INFO L290 TraceCheckUtils]: 84: Hoare triple {8764#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8505#false} is VALID [2022-04-28 11:15:16,903 INFO L290 TraceCheckUtils]: 83: Hoare triple {8760#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8764#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:16,903 INFO L272 TraceCheckUtils]: 82: Hoare triple {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8760#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:16,904 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8504#true} {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:15:16,904 INFO L290 TraceCheckUtils]: 80: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,904 INFO L290 TraceCheckUtils]: 79: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,904 INFO L290 TraceCheckUtils]: 78: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,904 INFO L272 TraceCheckUtils]: 77: Hoare triple {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:16,905 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8504#true} {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:15:16,905 INFO L290 TraceCheckUtils]: 75: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,905 INFO L290 TraceCheckUtils]: 74: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,905 INFO L290 TraceCheckUtils]: 73: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,905 INFO L272 TraceCheckUtils]: 72: Hoare triple {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:16,905 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8504#true} {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #62#return; {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:15:16,905 INFO L290 TraceCheckUtils]: 70: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,905 INFO L290 TraceCheckUtils]: 69: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,905 INFO L290 TraceCheckUtils]: 68: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,906 INFO L272 TraceCheckUtils]: 67: Hoare triple {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:16,906 INFO L290 TraceCheckUtils]: 66: Hoare triple {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !false; {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:15:16,909 INFO L290 TraceCheckUtils]: 65: Hoare triple {8832#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:15:16,909 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8698#(not (= |__VERIFIER_assert_#in~cond| 0))} {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #70#return; {8832#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:15:16,910 INFO L290 TraceCheckUtils]: 63: Hoare triple {8698#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8698#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:16,910 INFO L290 TraceCheckUtils]: 62: Hoare triple {8846#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8698#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:16,910 INFO L290 TraceCheckUtils]: 61: Hoare triple {8504#true} ~cond := #in~cond; {8846#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:15:16,910 INFO L272 TraceCheckUtils]: 60: Hoare triple {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (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)); {8504#true} is VALID [2022-04-28 11:15:16,911 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8504#true} {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #68#return; {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:16,911 INFO L290 TraceCheckUtils]: 58: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,911 INFO L290 TraceCheckUtils]: 57: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,911 INFO L290 TraceCheckUtils]: 56: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,911 INFO L272 TraceCheckUtils]: 55: Hoare triple {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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)); {8504#true} is VALID [2022-04-28 11:15:16,912 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8504#true} {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #66#return; {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:16,912 INFO L290 TraceCheckUtils]: 53: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,912 INFO L290 TraceCheckUtils]: 52: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,912 INFO L290 TraceCheckUtils]: 51: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,912 INFO L272 TraceCheckUtils]: 50: Hoare triple {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:16,912 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8504#true} {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #64#return; {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:16,912 INFO L290 TraceCheckUtils]: 48: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,912 INFO L290 TraceCheckUtils]: 47: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,912 INFO L290 TraceCheckUtils]: 46: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,912 INFO L272 TraceCheckUtils]: 45: Hoare triple {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:16,913 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8504#true} {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #62#return; {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:16,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:16,913 INFO L290 TraceCheckUtils]: 42: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:16,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:16,913 INFO L272 TraceCheckUtils]: 40: Hoare triple {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:16,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !false; {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:18,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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; {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:18,120 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8504#true} {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #70#return; {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:18,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:18,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:18,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:18,120 INFO L272 TraceCheckUtils]: 33: Hoare triple {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (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)); {8504#true} is VALID [2022-04-28 11:15:18,120 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8504#true} {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #68#return; {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:18,121 INFO L290 TraceCheckUtils]: 31: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:18,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:18,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:18,121 INFO L272 TraceCheckUtils]: 28: Hoare triple {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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)); {8504#true} is VALID [2022-04-28 11:15:18,121 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8504#true} {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #66#return; {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:18,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:18,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:18,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:18,121 INFO L272 TraceCheckUtils]: 23: Hoare triple {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:18,122 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8504#true} {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #64#return; {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:18,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:18,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:18,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:18,122 INFO L272 TraceCheckUtils]: 18: Hoare triple {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:18,123 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8504#true} {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #62#return; {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:18,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:18,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:18,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:18,123 INFO L272 TraceCheckUtils]: 13: Hoare triple {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:18,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !false; {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:18,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {8504#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8836#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:18,124 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8504#true} {8504#true} #60#return; {8504#true} is VALID [2022-04-28 11:15:18,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:18,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:18,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:18,124 INFO L272 TraceCheckUtils]: 6: Hoare triple {8504#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:18,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {8504#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; {8504#true} is VALID [2022-04-28 11:15:18,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {8504#true} call #t~ret5 := main(); {8504#true} is VALID [2022-04-28 11:15:18,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8504#true} {8504#true} #84#return; {8504#true} is VALID [2022-04-28 11:15:18,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:18,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {8504#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); {8504#true} is VALID [2022-04-28 11:15:18,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {8504#true} call ULTIMATE.init(); {8504#true} is VALID [2022-04-28 11:15:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 63 proven. 10 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2022-04-28 11:15:18,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:18,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309562749] [2022-04-28 11:15:18,125 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:18,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469762431] [2022-04-28 11:15:18,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469762431] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:18,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:18,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-04-28 11:15:18,126 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:18,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1392544197] [2022-04-28 11:15:18,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1392544197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:18,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:18,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:15:18,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444052997] [2022-04-28 11:15:18,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:18,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 86 [2022-04-28 11:15:18,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:18,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:15:18,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:18,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:15:18,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:18,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:15:18,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:15:18,169 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:15:19,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:19,195 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2022-04-28 11:15:19,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:15:19,195 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 86 [2022-04-28 11:15:19,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:15:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-28 11:15:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:15:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-28 11:15:19,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-28 11:15:19,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:19,292 INFO L225 Difference]: With dead ends: 116 [2022-04-28 11:15:19,292 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 11:15:19,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:15:19,292 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:19,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 134 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 11:15:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 11:15:19,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-28 11:15:19,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:19,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:19,368 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:19,368 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:19,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:19,371 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-28 11:15:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:15:19,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:19,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:19,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 111 states. [2022-04-28 11:15:19,372 INFO L87 Difference]: Start difference. First operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 111 states. [2022-04-28 11:15:19,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:19,375 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-28 11:15:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:15:19,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:19,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:19,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:19,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-04-28 11:15:19,382 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 86 [2022-04-28 11:15:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:19,382 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-04-28 11:15:19,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:15:19,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 125 transitions. [2022-04-28 11:15:19,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:15:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 11:15:19,504 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:19,504 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:19,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 11:15:19,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 11:15:19,721 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:19,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:19,721 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 3 times [2022-04-28 11:15:19,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:19,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1197703492] [2022-04-28 11:15:20,003 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:20,003 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:20,003 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 4 times [2022-04-28 11:15:20,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:20,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601689463] [2022-04-28 11:15:20,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:20,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:20,011 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:20,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1543424965] [2022-04-28 11:15:20,012 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:15:20,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:20,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:20,013 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:15:20,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 11:15:20,070 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:15:20,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:20,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 11:15:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:20,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:20,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {9712#true} call ULTIMATE.init(); {9712#true} is VALID [2022-04-28 11:15:20,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {9712#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); {9712#true} is VALID [2022-04-28 11:15:20,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9712#true} {9712#true} #84#return; {9712#true} is VALID [2022-04-28 11:15:20,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {9712#true} call #t~ret5 := main(); {9712#true} is VALID [2022-04-28 11:15:20,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {9712#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; {9712#true} is VALID [2022-04-28 11:15:20,764 INFO L272 TraceCheckUtils]: 6: Hoare triple {9712#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:20,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,764 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9712#true} {9712#true} #60#return; {9712#true} is VALID [2022-04-28 11:15:20,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {9712#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:20,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:20,765 INFO L272 TraceCheckUtils]: 13: Hoare triple {9750#(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)); {9712#true} is VALID [2022-04-28 11:15:20,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,766 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9712#true} {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:20,766 INFO L272 TraceCheckUtils]: 18: Hoare triple {9750#(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)); {9712#true} is VALID [2022-04-28 11:15:20,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,766 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9712#true} {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:20,766 INFO L272 TraceCheckUtils]: 23: Hoare triple {9750#(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)); {9712#true} is VALID [2022-04-28 11:15:20,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,767 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9712#true} {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:20,767 INFO L272 TraceCheckUtils]: 28: Hoare triple {9750#(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)); {9712#true} is VALID [2022-04-28 11:15:20,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,768 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9712#true} {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:20,768 INFO L272 TraceCheckUtils]: 33: Hoare triple {9750#(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)); {9712#true} is VALID [2022-04-28 11:15:20,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,769 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9712#true} {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:20,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {9750#(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; {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:20,769 INFO L290 TraceCheckUtils]: 39: Hoare triple {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} assume !false; {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:20,769 INFO L272 TraceCheckUtils]: 40: Hoare triple {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:20,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,770 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9712#true} {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #62#return; {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:20,770 INFO L272 TraceCheckUtils]: 45: Hoare triple {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:20,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,770 INFO L290 TraceCheckUtils]: 48: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,771 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9712#true} {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #64#return; {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:20,771 INFO L272 TraceCheckUtils]: 50: Hoare triple {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:20,771 INFO L290 TraceCheckUtils]: 51: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,771 INFO L290 TraceCheckUtils]: 52: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,771 INFO L290 TraceCheckUtils]: 53: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,772 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9712#true} {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #66#return; {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:20,772 INFO L272 TraceCheckUtils]: 55: Hoare triple {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:20,772 INFO L290 TraceCheckUtils]: 56: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,772 INFO L290 TraceCheckUtils]: 57: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,772 INFO L290 TraceCheckUtils]: 58: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,772 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9712#true} {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #68#return; {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:20,772 INFO L272 TraceCheckUtils]: 60: Hoare triple {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:20,772 INFO L290 TraceCheckUtils]: 61: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,773 INFO L290 TraceCheckUtils]: 62: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,773 INFO L290 TraceCheckUtils]: 63: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,773 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9712#true} {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #70#return; {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:20,773 INFO L290 TraceCheckUtils]: 65: Hoare triple {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:20,774 INFO L290 TraceCheckUtils]: 66: Hoare triple {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} assume !false; {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:20,774 INFO L272 TraceCheckUtils]: 67: Hoare triple {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:20,774 INFO L290 TraceCheckUtils]: 68: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,774 INFO L290 TraceCheckUtils]: 69: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,774 INFO L290 TraceCheckUtils]: 70: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,775 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9712#true} {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} #62#return; {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:20,775 INFO L272 TraceCheckUtils]: 72: Hoare triple {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:20,775 INFO L290 TraceCheckUtils]: 73: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,775 INFO L290 TraceCheckUtils]: 74: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,775 INFO L290 TraceCheckUtils]: 75: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,775 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9712#true} {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} #64#return; {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:20,775 INFO L272 TraceCheckUtils]: 77: Hoare triple {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:20,775 INFO L290 TraceCheckUtils]: 78: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,776 INFO L290 TraceCheckUtils]: 79: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,776 INFO L290 TraceCheckUtils]: 80: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,776 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9712#true} {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} #66#return; {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:20,776 INFO L272 TraceCheckUtils]: 82: Hoare triple {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~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)); {9712#true} is VALID [2022-04-28 11:15:20,776 INFO L290 TraceCheckUtils]: 83: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,776 INFO L290 TraceCheckUtils]: 84: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,776 INFO L290 TraceCheckUtils]: 85: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,777 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9712#true} {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} #68#return; {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:20,777 INFO L272 TraceCheckUtils]: 87: Hoare triple {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:20,777 INFO L290 TraceCheckUtils]: 88: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,777 INFO L290 TraceCheckUtils]: 89: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,777 INFO L290 TraceCheckUtils]: 90: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,778 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {9712#true} {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} #70#return; {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:20,778 INFO L290 TraceCheckUtils]: 92: Hoare triple {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} assume !(~n~0 <= ~a~0); {9996#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:20,778 INFO L272 TraceCheckUtils]: 93: Hoare triple {9996#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ (- 1) main_~x~0) 7))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:20,778 INFO L290 TraceCheckUtils]: 94: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:20,778 INFO L290 TraceCheckUtils]: 95: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:20,778 INFO L290 TraceCheckUtils]: 96: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:20,779 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {9712#true} {9996#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ (- 1) main_~x~0) 7))} #72#return; {9996#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:20,779 INFO L272 TraceCheckUtils]: 98: Hoare triple {9996#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ (- 1) main_~x~0) 7))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10015#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:20,780 INFO L290 TraceCheckUtils]: 99: Hoare triple {10015#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10019#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:20,780 INFO L290 TraceCheckUtils]: 100: Hoare triple {10019#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9713#false} is VALID [2022-04-28 11:15:20,780 INFO L290 TraceCheckUtils]: 101: Hoare triple {9713#false} assume !false; {9713#false} is VALID [2022-04-28 11:15:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 11:15:20,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:21,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:21,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601689463] [2022-04-28 11:15:21,136 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:21,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543424965] [2022-04-28 11:15:21,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543424965] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:15:21,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:15:21,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 11:15:21,136 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:21,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1197703492] [2022-04-28 11:15:21,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1197703492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:21,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:21,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:15:21,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497567628] [2022-04-28 11:15:21,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:21,137 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 102 [2022-04-28 11:15:21,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:21,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:15:21,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:21,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:15:21,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:21,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:15:21,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:15:21,185 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:15:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:21,965 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2022-04-28 11:15:21,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:15:21,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 102 [2022-04-28 11:15:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:15:21,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:15:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:15:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:15:21,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2022-04-28 11:15:22,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:22,043 INFO L225 Difference]: With dead ends: 117 [2022-04-28 11:15:22,043 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 11:15:22,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:15:22,044 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:22,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 225 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:15:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 11:15:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-28 11:15:22,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:22,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:22,107 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:22,107 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:22,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:22,109 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-04-28 11:15:22,109 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:15:22,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:22,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:22,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 115 states. [2022-04-28 11:15:22,109 INFO L87 Difference]: Start difference. First operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 115 states. [2022-04-28 11:15:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:22,111 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-04-28 11:15:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:15:22,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:22,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:22,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:22,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:22,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:22,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2022-04-28 11:15:22,114 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 102 [2022-04-28 11:15:22,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:22,115 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2022-04-28 11:15:22,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:15:22,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 128 transitions. [2022-04-28 11:15:22,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:15:22,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 11:15:22,265 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:22,265 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:22,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 11:15:22,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 11:15:22,466 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:22,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:22,466 INFO L85 PathProgramCache]: Analyzing trace with hash -360684101, now seen corresponding path program 13 times [2022-04-28 11:15:22,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:22,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [669575677] [2022-04-28 11:15:22,706 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:22,706 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:22,706 INFO L85 PathProgramCache]: Analyzing trace with hash -360684101, now seen corresponding path program 14 times [2022-04-28 11:15:22,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:22,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222589101] [2022-04-28 11:15:22,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:22,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:22,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:22,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1915195518] [2022-04-28 11:15:22,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:22,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:22,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:22,714 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:15:22,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 11:15:22,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:22,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:22,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 11:15:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:22,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:23,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {10840#true} call ULTIMATE.init(); {10840#true} is VALID [2022-04-28 11:15:23,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {10840#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); {10840#true} is VALID [2022-04-28 11:15:23,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10840#true} {10840#true} #84#return; {10840#true} is VALID [2022-04-28 11:15:23,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {10840#true} call #t~ret5 := main(); {10840#true} is VALID [2022-04-28 11:15:23,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {10840#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; {10840#true} is VALID [2022-04-28 11:15:23,325 INFO L272 TraceCheckUtils]: 6: Hoare triple {10840#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:23,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:23,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:23,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,325 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10840#true} {10840#true} #60#return; {10840#true} is VALID [2022-04-28 11:15:23,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {10840#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} is VALID [2022-04-28 11:15:23,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} assume !false; {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} is VALID [2022-04-28 11:15:23,326 INFO L272 TraceCheckUtils]: 13: Hoare triple {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:23,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:23,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:23,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,327 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10840#true} {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} #62#return; {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} is VALID [2022-04-28 11:15:23,327 INFO L272 TraceCheckUtils]: 18: Hoare triple {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:23,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:23,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:23,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,327 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10840#true} {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} #64#return; {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} is VALID [2022-04-28 11:15:23,328 INFO L272 TraceCheckUtils]: 23: Hoare triple {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:23,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:23,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:23,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,328 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10840#true} {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} #66#return; {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} is VALID [2022-04-28 11:15:23,328 INFO L272 TraceCheckUtils]: 28: Hoare triple {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 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)); {10840#true} is VALID [2022-04-28 11:15:23,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:23,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:23,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,329 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10840#true} {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} #68#return; {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} is VALID [2022-04-28 11:15:23,329 INFO L272 TraceCheckUtils]: 33: Hoare triple {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:23,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:23,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:23,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,330 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10840#true} {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} #70#return; {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} is VALID [2022-04-28 11:15:23,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 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; {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:15:23,331 INFO L290 TraceCheckUtils]: 39: Hoare triple {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} assume !false; {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:15:23,331 INFO L272 TraceCheckUtils]: 40: Hoare triple {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:23,331 INFO L290 TraceCheckUtils]: 41: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:23,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:23,331 INFO L290 TraceCheckUtils]: 43: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,331 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10840#true} {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #62#return; {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:15:23,332 INFO L272 TraceCheckUtils]: 45: Hoare triple {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:23,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:23,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:23,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,332 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10840#true} {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #64#return; {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:15:23,332 INFO L272 TraceCheckUtils]: 50: Hoare triple {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:23,332 INFO L290 TraceCheckUtils]: 51: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:23,332 INFO L290 TraceCheckUtils]: 52: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:23,332 INFO L290 TraceCheckUtils]: 53: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,333 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10840#true} {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #66#return; {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:15:23,333 INFO L272 TraceCheckUtils]: 55: Hoare triple {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= 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)); {10840#true} is VALID [2022-04-28 11:15:23,333 INFO L290 TraceCheckUtils]: 56: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:23,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:23,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,334 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10840#true} {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #68#return; {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:15:23,334 INFO L272 TraceCheckUtils]: 60: Hoare triple {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:23,334 INFO L290 TraceCheckUtils]: 61: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:23,334 INFO L290 TraceCheckUtils]: 62: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:23,334 INFO L290 TraceCheckUtils]: 63: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,334 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10840#true} {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #70#return; {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:15:23,335 INFO L290 TraceCheckUtils]: 65: Hoare triple {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~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; {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} is VALID [2022-04-28 11:15:23,335 INFO L290 TraceCheckUtils]: 66: Hoare triple {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} assume !false; {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} is VALID [2022-04-28 11:15:23,335 INFO L272 TraceCheckUtils]: 67: Hoare triple {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:23,336 INFO L290 TraceCheckUtils]: 68: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:23,336 INFO L290 TraceCheckUtils]: 69: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:23,336 INFO L290 TraceCheckUtils]: 70: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,336 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10840#true} {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} #62#return; {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} is VALID [2022-04-28 11:15:23,336 INFO L272 TraceCheckUtils]: 72: Hoare triple {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:23,336 INFO L290 TraceCheckUtils]: 73: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:23,336 INFO L290 TraceCheckUtils]: 74: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:23,336 INFO L290 TraceCheckUtils]: 75: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,337 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10840#true} {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} #64#return; {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} is VALID [2022-04-28 11:15:23,337 INFO L272 TraceCheckUtils]: 77: Hoare triple {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:23,337 INFO L290 TraceCheckUtils]: 78: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:23,337 INFO L290 TraceCheckUtils]: 79: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:23,337 INFO L290 TraceCheckUtils]: 80: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,338 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10840#true} {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} #66#return; {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} is VALID [2022-04-28 11:15:23,338 INFO L272 TraceCheckUtils]: 82: Hoare triple {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~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)); {10840#true} is VALID [2022-04-28 11:15:23,338 INFO L290 TraceCheckUtils]: 83: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:23,338 INFO L290 TraceCheckUtils]: 84: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:23,338 INFO L290 TraceCheckUtils]: 85: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,338 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10840#true} {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} #68#return; {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} is VALID [2022-04-28 11:15:23,338 INFO L272 TraceCheckUtils]: 87: Hoare triple {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:23,339 INFO L290 TraceCheckUtils]: 88: Hoare triple {10840#true} ~cond := #in~cond; {11112#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:23,339 INFO L290 TraceCheckUtils]: 89: Hoare triple {11112#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11116#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:23,339 INFO L290 TraceCheckUtils]: 90: Hoare triple {11116#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11116#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:23,340 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {11116#(not (= |__VERIFIER_assert_#in~cond| 0))} {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} #70#return; {11123#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))))} is VALID [2022-04-28 11:15:23,341 INFO L290 TraceCheckUtils]: 92: Hoare triple {11123#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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; {11127#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} is VALID [2022-04-28 11:15:23,341 INFO L290 TraceCheckUtils]: 93: Hoare triple {11127#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} assume !false; {11127#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} is VALID [2022-04-28 11:15:23,341 INFO L272 TraceCheckUtils]: 94: Hoare triple {11127#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:23,341 INFO L290 TraceCheckUtils]: 95: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:23,341 INFO L290 TraceCheckUtils]: 96: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:23,341 INFO L290 TraceCheckUtils]: 97: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:23,342 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10840#true} {11127#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} #62#return; {11127#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} is VALID [2022-04-28 11:15:23,342 INFO L272 TraceCheckUtils]: 99: Hoare triple {11127#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11149#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:23,342 INFO L290 TraceCheckUtils]: 100: Hoare triple {11149#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11153#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:23,343 INFO L290 TraceCheckUtils]: 101: Hoare triple {11153#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10841#false} is VALID [2022-04-28 11:15:23,343 INFO L290 TraceCheckUtils]: 102: Hoare triple {10841#false} assume !false; {10841#false} is VALID [2022-04-28 11:15:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 73 proven. 34 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-04-28 11:15:23,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:25,023 INFO L290 TraceCheckUtils]: 102: Hoare triple {10841#false} assume !false; {10841#false} is VALID [2022-04-28 11:15:25,023 INFO L290 TraceCheckUtils]: 101: Hoare triple {11153#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10841#false} is VALID [2022-04-28 11:15:25,023 INFO L290 TraceCheckUtils]: 100: Hoare triple {11149#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11153#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:25,024 INFO L272 TraceCheckUtils]: 99: Hoare triple {11169#(= (+ (* 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)); {11149#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:25,024 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10840#true} {11169#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {11169#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:15:25,024 INFO L290 TraceCheckUtils]: 97: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,024 INFO L290 TraceCheckUtils]: 96: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:25,024 INFO L290 TraceCheckUtils]: 95: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:25,024 INFO L272 TraceCheckUtils]: 94: Hoare triple {11169#(= (+ (* 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)); {10840#true} is VALID [2022-04-28 11:15:25,025 INFO L290 TraceCheckUtils]: 93: Hoare triple {11169#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {11169#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:15:25,030 INFO L290 TraceCheckUtils]: 92: Hoare triple {11191#(= (+ (* 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; {11169#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:15:25,030 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {11116#(not (= |__VERIFIER_assert_#in~cond| 0))} {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #70#return; {11191#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:15:25,031 INFO L290 TraceCheckUtils]: 90: Hoare triple {11116#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11116#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:25,031 INFO L290 TraceCheckUtils]: 89: Hoare triple {11205#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11116#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:25,031 INFO L290 TraceCheckUtils]: 88: Hoare triple {10840#true} ~cond := #in~cond; {11205#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:15:25,031 INFO L272 TraceCheckUtils]: 87: Hoare triple {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~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)); {10840#true} is VALID [2022-04-28 11:15:25,032 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10840#true} {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #68#return; {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:25,032 INFO L290 TraceCheckUtils]: 85: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,032 INFO L290 TraceCheckUtils]: 84: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:25,032 INFO L290 TraceCheckUtils]: 83: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:25,032 INFO L272 TraceCheckUtils]: 82: Hoare triple {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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)); {10840#true} is VALID [2022-04-28 11:15:25,032 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10840#true} {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #66#return; {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:25,032 INFO L290 TraceCheckUtils]: 80: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,032 INFO L290 TraceCheckUtils]: 79: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:25,032 INFO L290 TraceCheckUtils]: 78: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:25,032 INFO L272 TraceCheckUtils]: 77: Hoare triple {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:25,033 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10840#true} {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #64#return; {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:25,033 INFO L290 TraceCheckUtils]: 75: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,033 INFO L290 TraceCheckUtils]: 74: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:25,033 INFO L290 TraceCheckUtils]: 73: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:25,033 INFO L272 TraceCheckUtils]: 72: Hoare triple {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:25,033 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10840#true} {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #62#return; {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:25,033 INFO L290 TraceCheckUtils]: 70: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,033 INFO L290 TraceCheckUtils]: 69: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:25,034 INFO L290 TraceCheckUtils]: 68: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:25,034 INFO L272 TraceCheckUtils]: 67: Hoare triple {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:25,034 INFO L290 TraceCheckUtils]: 66: Hoare triple {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !false; {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:25,043 INFO L290 TraceCheckUtils]: 65: Hoare triple {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:25,055 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10840#true} {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #70#return; {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:15:25,055 INFO L290 TraceCheckUtils]: 63: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,055 INFO L290 TraceCheckUtils]: 62: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:25,055 INFO L290 TraceCheckUtils]: 61: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:25,055 INFO L272 TraceCheckUtils]: 60: Hoare triple {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:25,056 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10840#true} {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #68#return; {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:15:25,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:25,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:25,056 INFO L272 TraceCheckUtils]: 55: Hoare triple {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:25,057 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10840#true} {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #66#return; {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:15:25,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:25,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:25,057 INFO L272 TraceCheckUtils]: 50: Hoare triple {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:25,058 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10840#true} {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #64#return; {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:15:25,058 INFO L290 TraceCheckUtils]: 48: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:25,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:25,058 INFO L272 TraceCheckUtils]: 45: Hoare triple {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:25,058 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10840#true} {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #62#return; {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:15:25,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:25,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:25,059 INFO L272 TraceCheckUtils]: 40: Hoare triple {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:25,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} assume !false; {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:15:25,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:15:25,065 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10840#true} {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} #70#return; {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} is VALID [2022-04-28 11:15:25,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:25,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:25,066 INFO L272 TraceCheckUtils]: 33: Hoare triple {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:25,066 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10840#true} {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} #68#return; {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} is VALID [2022-04-28 11:15:25,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:25,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:25,066 INFO L272 TraceCheckUtils]: 28: Hoare triple {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:25,067 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10840#true} {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} #66#return; {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} is VALID [2022-04-28 11:15:25,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:25,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:25,067 INFO L272 TraceCheckUtils]: 23: Hoare triple {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:25,068 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10840#true} {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} #64#return; {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} is VALID [2022-04-28 11:15:25,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:25,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:25,068 INFO L272 TraceCheckUtils]: 18: Hoare triple {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:25,068 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10840#true} {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} #62#return; {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} is VALID [2022-04-28 11:15:25,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:25,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:25,068 INFO L272 TraceCheckUtils]: 13: Hoare triple {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:25,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} assume !false; {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} is VALID [2022-04-28 11:15:25,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {10840#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} is VALID [2022-04-28 11:15:25,069 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10840#true} {10840#true} #60#return; {10840#true} is VALID [2022-04-28 11:15:25,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:15:25,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:15:25,070 INFO L272 TraceCheckUtils]: 6: Hoare triple {10840#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:15:25,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {10840#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; {10840#true} is VALID [2022-04-28 11:15:25,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {10840#true} call #t~ret5 := main(); {10840#true} is VALID [2022-04-28 11:15:25,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10840#true} {10840#true} #84#return; {10840#true} is VALID [2022-04-28 11:15:25,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:15:25,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {10840#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); {10840#true} is VALID [2022-04-28 11:15:25,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {10840#true} call ULTIMATE.init(); {10840#true} is VALID [2022-04-28 11:15:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 73 proven. 34 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-04-28 11:15:25,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:25,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222589101] [2022-04-28 11:15:25,071 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:25,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915195518] [2022-04-28 11:15:25,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915195518] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:25,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:25,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-04-28 11:15:25,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:25,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [669575677] [2022-04-28 11:15:25,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [669575677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:25,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:25,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 11:15:25,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690262689] [2022-04-28 11:15:25,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:25,072 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) Word has length 103 [2022-04-28 11:15:25,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:25,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:15:25,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:25,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 11:15:25,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:25,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 11:15:25,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:15:25,122 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:15:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:26,865 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2022-04-28 11:15:26,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:15:26,865 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) Word has length 103 [2022-04-28 11:15:26,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:15:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-28 11:15:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:15:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-28 11:15:26,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2022-04-28 11:15:26,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:26,977 INFO L225 Difference]: With dead ends: 142 [2022-04-28 11:15:26,978 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 11:15:26,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-28 11:15:26,978 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:26,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 179 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 11:15:26,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 11:15:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-04-28 11:15:27,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:27,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:15:27,055 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:15:27,056 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:15:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:27,058 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2022-04-28 11:15:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2022-04-28 11:15:27,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:27,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:27,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 140 states. [2022-04-28 11:15:27,059 INFO L87 Difference]: Start difference. First operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 140 states. [2022-04-28 11:15:27,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:27,061 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2022-04-28 11:15:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2022-04-28 11:15:27,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:27,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:27,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:27,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:27,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:15:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2022-04-28 11:15:27,064 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 103 [2022-04-28 11:15:27,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:27,064 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2022-04-28 11:15:27,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:15:27,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 142 transitions. [2022-04-28 11:15:27,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-04-28 11:15:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 11:15:27,237 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:27,237 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:27,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 11:15:27,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 11:15:27,437 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:27,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:27,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 3 times [2022-04-28 11:15:27,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:27,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1371943384] [2022-04-28 11:15:27,695 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:27,696 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:27,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 4 times [2022-04-28 11:15:27,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:27,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068002215] [2022-04-28 11:15:27,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:27,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:27,709 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:27,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1951743880] [2022-04-28 11:15:27,710 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:15:27,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:27,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:27,732 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:15:27,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 11:15:27,777 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:15:27,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:27,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 11:15:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:27,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:28,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {12302#true} call ULTIMATE.init(); {12302#true} is VALID [2022-04-28 11:15:28,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {12302#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); {12302#true} is VALID [2022-04-28 11:15:28,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12302#true} {12302#true} #84#return; {12302#true} is VALID [2022-04-28 11:15:28,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {12302#true} call #t~ret5 := main(); {12302#true} is VALID [2022-04-28 11:15:28,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {12302#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; {12302#true} is VALID [2022-04-28 11:15:28,404 INFO L272 TraceCheckUtils]: 6: Hoare triple {12302#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {12302#true} is VALID [2022-04-28 11:15:28,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,404 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12302#true} {12302#true} #60#return; {12302#true} is VALID [2022-04-28 11:15:28,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {12302#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:28,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:28,405 INFO L272 TraceCheckUtils]: 13: Hoare triple {12340#(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)); {12302#true} is VALID [2022-04-28 11:15:28,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,406 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12302#true} {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:28,406 INFO L272 TraceCheckUtils]: 18: Hoare triple {12340#(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)); {12302#true} is VALID [2022-04-28 11:15:28,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,407 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12302#true} {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:28,407 INFO L272 TraceCheckUtils]: 23: Hoare triple {12340#(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)); {12302#true} is VALID [2022-04-28 11:15:28,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,407 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12302#true} {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:28,408 INFO L272 TraceCheckUtils]: 28: Hoare triple {12340#(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)); {12302#true} is VALID [2022-04-28 11:15:28,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,408 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12302#true} {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:28,408 INFO L272 TraceCheckUtils]: 33: Hoare triple {12340#(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)); {12302#true} is VALID [2022-04-28 11:15:28,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,409 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12302#true} {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:28,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {12340#(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; {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:28,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} assume !false; {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:28,410 INFO L272 TraceCheckUtils]: 40: Hoare triple {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12302#true} is VALID [2022-04-28 11:15:28,410 INFO L290 TraceCheckUtils]: 41: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,410 INFO L290 TraceCheckUtils]: 42: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,410 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {12302#true} {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} #62#return; {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:28,410 INFO L272 TraceCheckUtils]: 45: Hoare triple {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12302#true} is VALID [2022-04-28 11:15:28,410 INFO L290 TraceCheckUtils]: 46: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,411 INFO L290 TraceCheckUtils]: 47: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,411 INFO L290 TraceCheckUtils]: 48: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,411 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {12302#true} {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} #64#return; {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:28,411 INFO L272 TraceCheckUtils]: 50: Hoare triple {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12302#true} is VALID [2022-04-28 11:15:28,411 INFO L290 TraceCheckUtils]: 51: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,411 INFO L290 TraceCheckUtils]: 52: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,411 INFO L290 TraceCheckUtils]: 53: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,412 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12302#true} {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} #66#return; {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:28,412 INFO L272 TraceCheckUtils]: 55: Hoare triple {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12302#true} is VALID [2022-04-28 11:15:28,412 INFO L290 TraceCheckUtils]: 56: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,412 INFO L290 TraceCheckUtils]: 57: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,412 INFO L290 TraceCheckUtils]: 58: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,412 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12302#true} {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} #68#return; {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:28,413 INFO L272 TraceCheckUtils]: 60: Hoare triple {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12302#true} is VALID [2022-04-28 11:15:28,413 INFO L290 TraceCheckUtils]: 61: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,413 INFO L290 TraceCheckUtils]: 62: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,413 INFO L290 TraceCheckUtils]: 63: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,413 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12302#true} {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} #70#return; {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:28,414 INFO L290 TraceCheckUtils]: 65: Hoare triple {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} is VALID [2022-04-28 11:15:28,414 INFO L290 TraceCheckUtils]: 66: Hoare triple {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} assume !false; {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} is VALID [2022-04-28 11:15:28,414 INFO L272 TraceCheckUtils]: 67: Hoare triple {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12302#true} is VALID [2022-04-28 11:15:28,414 INFO L290 TraceCheckUtils]: 68: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,414 INFO L290 TraceCheckUtils]: 69: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,414 INFO L290 TraceCheckUtils]: 70: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,415 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12302#true} {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} #62#return; {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} is VALID [2022-04-28 11:15:28,415 INFO L272 TraceCheckUtils]: 72: Hoare triple {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12302#true} is VALID [2022-04-28 11:15:28,415 INFO L290 TraceCheckUtils]: 73: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,415 INFO L290 TraceCheckUtils]: 74: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,415 INFO L290 TraceCheckUtils]: 75: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,415 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {12302#true} {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} #64#return; {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} is VALID [2022-04-28 11:15:28,415 INFO L272 TraceCheckUtils]: 77: Hoare triple {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12302#true} is VALID [2022-04-28 11:15:28,416 INFO L290 TraceCheckUtils]: 78: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,416 INFO L290 TraceCheckUtils]: 79: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,416 INFO L290 TraceCheckUtils]: 80: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,416 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {12302#true} {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} #66#return; {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} is VALID [2022-04-28 11:15:28,416 INFO L272 TraceCheckUtils]: 82: Hoare triple {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12302#true} is VALID [2022-04-28 11:15:28,416 INFO L290 TraceCheckUtils]: 83: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,416 INFO L290 TraceCheckUtils]: 84: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,416 INFO L290 TraceCheckUtils]: 85: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,417 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {12302#true} {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} #68#return; {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} is VALID [2022-04-28 11:15:28,417 INFO L272 TraceCheckUtils]: 87: Hoare triple {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12302#true} is VALID [2022-04-28 11:15:28,417 INFO L290 TraceCheckUtils]: 88: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,417 INFO L290 TraceCheckUtils]: 89: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,417 INFO L290 TraceCheckUtils]: 90: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,418 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {12302#true} {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} #70#return; {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} is VALID [2022-04-28 11:15:28,418 INFO L290 TraceCheckUtils]: 92: Hoare triple {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} assume !(~n~0 <= ~a~0); {12586#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= 19 main_~y~0))} is VALID [2022-04-28 11:15:28,418 INFO L272 TraceCheckUtils]: 93: Hoare triple {12586#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= 19 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12302#true} is VALID [2022-04-28 11:15:28,418 INFO L290 TraceCheckUtils]: 94: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,418 INFO L290 TraceCheckUtils]: 95: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,418 INFO L290 TraceCheckUtils]: 96: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,419 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {12302#true} {12586#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= 19 main_~y~0))} #72#return; {12586#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= 19 main_~y~0))} is VALID [2022-04-28 11:15:28,419 INFO L272 TraceCheckUtils]: 98: Hoare triple {12586#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {12302#true} is VALID [2022-04-28 11:15:28,419 INFO L290 TraceCheckUtils]: 99: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:15:28,419 INFO L290 TraceCheckUtils]: 100: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:15:28,419 INFO L290 TraceCheckUtils]: 101: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:15:28,419 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {12302#true} {12586#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= 19 main_~y~0))} #74#return; {12586#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= 19 main_~y~0))} is VALID [2022-04-28 11:15:28,420 INFO L272 TraceCheckUtils]: 103: Hoare triple {12586#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {12620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:28,420 INFO L290 TraceCheckUtils]: 104: Hoare triple {12620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:28,421 INFO L290 TraceCheckUtils]: 105: Hoare triple {12624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12303#false} is VALID [2022-04-28 11:15:28,421 INFO L290 TraceCheckUtils]: 106: Hoare triple {12303#false} assume !false; {12303#false} is VALID [2022-04-28 11:15:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 11:15:28,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:37,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:37,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068002215] [2022-04-28 11:15:37,096 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:37,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951743880] [2022-04-28 11:15:37,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951743880] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:15:37,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:15:37,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 11:15:37,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:37,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1371943384] [2022-04-28 11:15:37,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1371943384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:37,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:37,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:15:37,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483429008] [2022-04-28 11:15:37,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:37,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 107 [2022-04-28 11:15:37,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:37,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:15:37,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:37,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:15:37,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:37,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:15:37,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:15:37,146 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:15:37,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:37,943 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-04-28 11:15:37,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:15:37,943 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 107 [2022-04-28 11:15:37,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:15:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:15:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:15:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:15:37,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2022-04-28 11:15:38,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:38,026 INFO L225 Difference]: With dead ends: 136 [2022-04-28 11:15:38,026 INFO L226 Difference]: Without dead ends: 123 [2022-04-28 11:15:38,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:15:38,026 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:38,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:15:38,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-28 11:15:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-04-28 11:15:38,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:38,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:38,103 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:38,107 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:38,124 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-04-28 11:15:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:15:38,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:38,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:38,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand 123 states. [2022-04-28 11:15:38,125 INFO L87 Difference]: Start difference. First operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand 123 states. [2022-04-28 11:15:38,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:38,129 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-04-28 11:15:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:15:38,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:38,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:38,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:38,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-04-28 11:15:38,131 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 107 [2022-04-28 11:15:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:38,131 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-04-28 11:15:38,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:15:38,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 133 transitions. [2022-04-28 11:15:38,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:15:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 11:15:38,274 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:38,274 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:38,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 11:15:38,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:38,487 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:38,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:38,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1388085622, now seen corresponding path program 15 times [2022-04-28 11:15:38,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:38,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [414000592] [2022-04-28 11:15:38,696 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:38,696 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:38,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1388085622, now seen corresponding path program 16 times [2022-04-28 11:15:38,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:38,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196460598] [2022-04-28 11:15:38,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:38,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:38,709 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:38,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723982127] [2022-04-28 11:15:38,709 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:15:38,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:38,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:38,710 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:15:38,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 11:15:38,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:15:38,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:38,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 11:15:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:38,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:39,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {13530#true} call ULTIMATE.init(); {13530#true} is VALID [2022-04-28 11:15:39,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {13530#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); {13530#true} is VALID [2022-04-28 11:15:39,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13530#true} {13530#true} #84#return; {13530#true} is VALID [2022-04-28 11:15:39,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {13530#true} call #t~ret5 := main(); {13530#true} is VALID [2022-04-28 11:15:39,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {13530#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; {13530#true} is VALID [2022-04-28 11:15:39,314 INFO L272 TraceCheckUtils]: 6: Hoare triple {13530#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:39,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:39,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:39,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,314 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13530#true} {13530#true} #60#return; {13530#true} is VALID [2022-04-28 11:15:39,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {13530#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:15:39,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} assume !false; {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:15:39,315 INFO L272 TraceCheckUtils]: 13: Hoare triple {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:39,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:39,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:39,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,315 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13530#true} {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} #62#return; {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:15:39,315 INFO L272 TraceCheckUtils]: 18: Hoare triple {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:39,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:39,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:39,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,316 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13530#true} {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} #64#return; {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:15:39,316 INFO L272 TraceCheckUtils]: 23: Hoare triple {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:39,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:39,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:39,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,316 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13530#true} {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} #66#return; {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:15:39,316 INFO L272 TraceCheckUtils]: 28: Hoare triple {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~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)); {13530#true} is VALID [2022-04-28 11:15:39,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:39,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:39,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,317 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13530#true} {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} #68#return; {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:15:39,317 INFO L272 TraceCheckUtils]: 33: Hoare triple {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~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)); {13530#true} is VALID [2022-04-28 11:15:39,317 INFO L290 TraceCheckUtils]: 34: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:39,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:39,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,317 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13530#true} {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} #70#return; {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:15:39,318 INFO L290 TraceCheckUtils]: 38: Hoare triple {13568#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~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; {13650#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:39,318 INFO L290 TraceCheckUtils]: 39: Hoare triple {13650#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !false; {13650#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:39,318 INFO L272 TraceCheckUtils]: 40: Hoare triple {13650#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:39,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:39,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:39,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,318 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13530#true} {13650#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #62#return; {13650#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:39,319 INFO L272 TraceCheckUtils]: 45: Hoare triple {13650#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:39,319 INFO L290 TraceCheckUtils]: 46: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:39,319 INFO L290 TraceCheckUtils]: 47: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:39,319 INFO L290 TraceCheckUtils]: 48: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,319 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13530#true} {13650#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #64#return; {13650#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:39,319 INFO L272 TraceCheckUtils]: 50: Hoare triple {13650#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:39,319 INFO L290 TraceCheckUtils]: 51: Hoare triple {13530#true} ~cond := #in~cond; {13690#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:39,319 INFO L290 TraceCheckUtils]: 52: Hoare triple {13690#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13694#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:39,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {13694#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13694#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:39,320 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13694#(not (= |__VERIFIER_assert_#in~cond| 0))} {13650#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #66#return; {13701#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:15:39,320 INFO L272 TraceCheckUtils]: 55: Hoare triple {13701#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= (* 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)); {13530#true} is VALID [2022-04-28 11:15:39,320 INFO L290 TraceCheckUtils]: 56: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:39,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:39,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,321 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13530#true} {13701#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #68#return; {13701#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:15:39,321 INFO L272 TraceCheckUtils]: 60: Hoare triple {13701#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= (* 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)); {13530#true} is VALID [2022-04-28 11:15:39,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:39,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:39,321 INFO L290 TraceCheckUtils]: 63: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,321 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13530#true} {13701#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #70#return; {13701#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:15:39,321 INFO L290 TraceCheckUtils]: 65: Hoare triple {13701#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= (* 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; {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-28 11:15:39,322 INFO L290 TraceCheckUtils]: 66: Hoare triple {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} assume !false; {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-28 11:15:39,322 INFO L272 TraceCheckUtils]: 67: Hoare triple {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:39,322 INFO L290 TraceCheckUtils]: 68: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:39,322 INFO L290 TraceCheckUtils]: 69: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:39,322 INFO L290 TraceCheckUtils]: 70: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,322 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13530#true} {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #62#return; {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-28 11:15:39,322 INFO L272 TraceCheckUtils]: 72: Hoare triple {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:39,322 INFO L290 TraceCheckUtils]: 73: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:39,322 INFO L290 TraceCheckUtils]: 74: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:39,323 INFO L290 TraceCheckUtils]: 75: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,323 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13530#true} {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #64#return; {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-28 11:15:39,323 INFO L272 TraceCheckUtils]: 77: Hoare triple {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:39,323 INFO L290 TraceCheckUtils]: 78: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:39,323 INFO L290 TraceCheckUtils]: 79: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:39,323 INFO L290 TraceCheckUtils]: 80: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,323 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13530#true} {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #66#return; {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-28 11:15:39,323 INFO L272 TraceCheckUtils]: 82: Hoare triple {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:39,323 INFO L290 TraceCheckUtils]: 83: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:39,324 INFO L290 TraceCheckUtils]: 84: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:39,324 INFO L290 TraceCheckUtils]: 85: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,324 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13530#true} {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #68#return; {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-28 11:15:39,324 INFO L272 TraceCheckUtils]: 87: Hoare triple {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:39,324 INFO L290 TraceCheckUtils]: 88: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:39,324 INFO L290 TraceCheckUtils]: 89: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:39,324 INFO L290 TraceCheckUtils]: 90: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,324 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {13530#true} {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #70#return; {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-28 11:15:39,325 INFO L290 TraceCheckUtils]: 92: Hoare triple {13735#(and (= (+ (- 17) (* main_~z~0 2)) main_~y~0) (= (+ (- 1) main_~n~0) 1) (= 7 (+ (- 11) main_~z~0)) (= main_~x~0 (+ (- 11) main_~z~0 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13817#(and (= 19 (+ main_~y~0 (- 18))) (= (+ 7 (* (+ (- 2) main_~n~0) (+ (- 2) main_~n~0) (+ (- 2) main_~n~0))) (+ main_~x~0 18 (* (- 1) main_~y~0))) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-28 11:15:39,325 INFO L290 TraceCheckUtils]: 93: Hoare triple {13817#(and (= 19 (+ main_~y~0 (- 18))) (= (+ 7 (* (+ (- 2) main_~n~0) (+ (- 2) main_~n~0) (+ (- 2) main_~n~0))) (+ main_~x~0 18 (* (- 1) main_~y~0))) (= (+ (- 2) main_~n~0) 1))} assume !false; {13817#(and (= 19 (+ main_~y~0 (- 18))) (= (+ 7 (* (+ (- 2) main_~n~0) (+ (- 2) main_~n~0) (+ (- 2) main_~n~0))) (+ main_~x~0 18 (* (- 1) main_~y~0))) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-28 11:15:39,325 INFO L272 TraceCheckUtils]: 94: Hoare triple {13817#(and (= 19 (+ main_~y~0 (- 18))) (= (+ 7 (* (+ (- 2) main_~n~0) (+ (- 2) main_~n~0) (+ (- 2) main_~n~0))) (+ main_~x~0 18 (* (- 1) main_~y~0))) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:39,325 INFO L290 TraceCheckUtils]: 95: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:39,325 INFO L290 TraceCheckUtils]: 96: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:39,325 INFO L290 TraceCheckUtils]: 97: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:39,326 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {13530#true} {13817#(and (= 19 (+ main_~y~0 (- 18))) (= (+ 7 (* (+ (- 2) main_~n~0) (+ (- 2) main_~n~0) (+ (- 2) main_~n~0))) (+ main_~x~0 18 (* (- 1) main_~y~0))) (= (+ (- 2) main_~n~0) 1))} #62#return; {13817#(and (= 19 (+ main_~y~0 (- 18))) (= (+ 7 (* (+ (- 2) main_~n~0) (+ (- 2) main_~n~0) (+ (- 2) main_~n~0))) (+ main_~x~0 18 (* (- 1) main_~y~0))) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-28 11:15:39,326 INFO L272 TraceCheckUtils]: 99: Hoare triple {13817#(and (= 19 (+ main_~y~0 (- 18))) (= (+ 7 (* (+ (- 2) main_~n~0) (+ (- 2) main_~n~0) (+ (- 2) main_~n~0))) (+ main_~x~0 18 (* (- 1) main_~y~0))) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:39,326 INFO L290 TraceCheckUtils]: 100: Hoare triple {13530#true} ~cond := #in~cond; {13690#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:39,326 INFO L290 TraceCheckUtils]: 101: Hoare triple {13690#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13694#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:39,326 INFO L290 TraceCheckUtils]: 102: Hoare triple {13694#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13694#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:39,327 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {13694#(not (= |__VERIFIER_assert_#in~cond| 0))} {13817#(and (= 19 (+ main_~y~0 (- 18))) (= (+ 7 (* (+ (- 2) main_~n~0) (+ (- 2) main_~n~0) (+ (- 2) main_~n~0))) (+ main_~x~0 18 (* (- 1) main_~y~0))) (= (+ (- 2) main_~n~0) 1))} #64#return; {13851#(and (= main_~n~0 3) (= (+ main_~x~0 (* 6 (* main_~n~0 main_~n~0))) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) 18)))} is VALID [2022-04-28 11:15:39,327 INFO L272 TraceCheckUtils]: 104: Hoare triple {13851#(and (= main_~n~0 3) (= (+ main_~x~0 (* 6 (* main_~n~0 main_~n~0))) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) 18)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13855#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:39,327 INFO L290 TraceCheckUtils]: 105: Hoare triple {13855#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13859#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:39,328 INFO L290 TraceCheckUtils]: 106: Hoare triple {13859#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13531#false} is VALID [2022-04-28 11:15:39,328 INFO L290 TraceCheckUtils]: 107: Hoare triple {13531#false} assume !false; {13531#false} is VALID [2022-04-28 11:15:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 98 proven. 59 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-04-28 11:15:39,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:39,998 INFO L290 TraceCheckUtils]: 107: Hoare triple {13531#false} assume !false; {13531#false} is VALID [2022-04-28 11:15:39,999 INFO L290 TraceCheckUtils]: 106: Hoare triple {13859#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13531#false} is VALID [2022-04-28 11:15:39,999 INFO L290 TraceCheckUtils]: 105: Hoare triple {13855#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13859#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:39,999 INFO L272 TraceCheckUtils]: 104: Hoare triple {13875#(= (* 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)); {13855#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:40,000 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {13694#(not (= |__VERIFIER_assert_#in~cond| 0))} {13879#(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))} #64#return; {13875#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:15:40,000 INFO L290 TraceCheckUtils]: 102: Hoare triple {13694#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13694#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:40,000 INFO L290 TraceCheckUtils]: 101: Hoare triple {13889#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13694#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:40,000 INFO L290 TraceCheckUtils]: 100: Hoare triple {13530#true} ~cond := #in~cond; {13889#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:15:40,000 INFO L272 TraceCheckUtils]: 99: Hoare triple {13879#(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)); {13530#true} is VALID [2022-04-28 11:15:40,001 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {13530#true} {13879#(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))} #62#return; {13879#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:15:40,001 INFO L290 TraceCheckUtils]: 97: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:40,001 INFO L290 TraceCheckUtils]: 96: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:40,001 INFO L290 TraceCheckUtils]: 95: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:40,001 INFO L272 TraceCheckUtils]: 94: Hoare triple {13879#(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 ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:40,001 INFO L290 TraceCheckUtils]: 93: Hoare triple {13879#(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))} assume !false; {13879#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:15:40,007 INFO L290 TraceCheckUtils]: 92: Hoare triple {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13879#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:15:40,007 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {13530#true} {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} #70#return; {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 11:15:40,007 INFO L290 TraceCheckUtils]: 90: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:40,007 INFO L290 TraceCheckUtils]: 89: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:40,007 INFO L290 TraceCheckUtils]: 88: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:40,008 INFO L272 TraceCheckUtils]: 87: Hoare triple {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:40,008 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13530#true} {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} #68#return; {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 11:15:40,008 INFO L290 TraceCheckUtils]: 85: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:40,008 INFO L290 TraceCheckUtils]: 84: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:40,008 INFO L290 TraceCheckUtils]: 83: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:40,008 INFO L272 TraceCheckUtils]: 82: Hoare triple {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:40,009 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13530#true} {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} #66#return; {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 11:15:40,009 INFO L290 TraceCheckUtils]: 80: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:40,009 INFO L290 TraceCheckUtils]: 79: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:40,009 INFO L290 TraceCheckUtils]: 78: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:40,009 INFO L272 TraceCheckUtils]: 77: Hoare triple {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:40,009 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13530#true} {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} #64#return; {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 11:15:40,009 INFO L290 TraceCheckUtils]: 75: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:40,009 INFO L290 TraceCheckUtils]: 74: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:40,010 INFO L290 TraceCheckUtils]: 73: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:40,010 INFO L272 TraceCheckUtils]: 72: Hoare triple {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:40,010 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13530#true} {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} #62#return; {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 11:15:40,010 INFO L290 TraceCheckUtils]: 70: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:40,010 INFO L290 TraceCheckUtils]: 69: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:40,010 INFO L290 TraceCheckUtils]: 68: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:40,010 INFO L272 TraceCheckUtils]: 67: Hoare triple {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:40,011 INFO L290 TraceCheckUtils]: 66: Hoare triple {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} assume !false; {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 11:15:40,017 INFO L290 TraceCheckUtils]: 65: Hoare triple {13996#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ 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; {13914#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 11:15:40,017 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13530#true} {13996#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ main_~z~0 main_~y~0))))} #70#return; {13996#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:15:40,018 INFO L290 TraceCheckUtils]: 63: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:40,018 INFO L290 TraceCheckUtils]: 62: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:40,018 INFO L290 TraceCheckUtils]: 61: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:40,018 INFO L272 TraceCheckUtils]: 60: Hoare triple {13996#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ 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)); {13530#true} is VALID [2022-04-28 11:15:40,018 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13530#true} {13996#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ main_~z~0 main_~y~0))))} #68#return; {13996#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:15:40,018 INFO L290 TraceCheckUtils]: 58: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:40,018 INFO L290 TraceCheckUtils]: 57: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:40,018 INFO L290 TraceCheckUtils]: 56: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:40,018 INFO L272 TraceCheckUtils]: 55: Hoare triple {13996#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ 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)); {13530#true} is VALID [2022-04-28 11:15:40,019 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13694#(not (= |__VERIFIER_assert_#in~cond| 0))} {14030#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ main_~z~0 main_~y~0))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)))} #66#return; {13996#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:15:40,019 INFO L290 TraceCheckUtils]: 53: Hoare triple {13694#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13694#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:40,020 INFO L290 TraceCheckUtils]: 52: Hoare triple {13889#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13694#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:40,020 INFO L290 TraceCheckUtils]: 51: Hoare triple {13530#true} ~cond := #in~cond; {13889#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:15:40,020 INFO L272 TraceCheckUtils]: 50: Hoare triple {14030#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ main_~z~0 main_~y~0))) (not (= (* 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)); {13530#true} is VALID [2022-04-28 11:15:40,020 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13530#true} {14030#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ main_~z~0 main_~y~0))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)))} #64#return; {14030#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ main_~z~0 main_~y~0))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)))} is VALID [2022-04-28 11:15:40,020 INFO L290 TraceCheckUtils]: 48: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:40,020 INFO L290 TraceCheckUtils]: 47: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:40,021 INFO L290 TraceCheckUtils]: 46: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:40,021 INFO L272 TraceCheckUtils]: 45: Hoare triple {14030#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ main_~z~0 main_~y~0))) (not (= (* 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)); {13530#true} is VALID [2022-04-28 11:15:40,021 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13530#true} {14030#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ main_~z~0 main_~y~0))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)))} #62#return; {14030#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ main_~z~0 main_~y~0))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)))} is VALID [2022-04-28 11:15:40,021 INFO L290 TraceCheckUtils]: 43: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:40,021 INFO L290 TraceCheckUtils]: 42: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:40,021 INFO L290 TraceCheckUtils]: 41: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:40,021 INFO L272 TraceCheckUtils]: 40: Hoare triple {14030#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ main_~z~0 main_~y~0))) (not (= (* 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)); {13530#true} is VALID [2022-04-28 11:15:40,022 INFO L290 TraceCheckUtils]: 39: Hoare triple {14030#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ main_~z~0 main_~y~0))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)))} assume !false; {14030#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ main_~z~0 main_~y~0))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)))} is VALID [2022-04-28 11:15:42,023 WARN L290 TraceCheckUtils]: 38: Hoare triple {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 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; {14030#(or (= (+ (* main_~n~0 9) main_~y~0 main_~x~0 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (not (= (+ (* main_~n~0 9) (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) 10) (+ main_~z~0 main_~y~0))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)))} is UNKNOWN [2022-04-28 11:15:42,024 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13530#true} {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} #70#return; {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} is VALID [2022-04-28 11:15:42,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:42,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:42,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:42,024 INFO L272 TraceCheckUtils]: 33: Hoare triple {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:42,025 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13530#true} {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} #68#return; {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} is VALID [2022-04-28 11:15:42,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:42,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:42,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:42,025 INFO L272 TraceCheckUtils]: 28: Hoare triple {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:42,026 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13530#true} {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} #66#return; {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} is VALID [2022-04-28 11:15:42,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:42,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:42,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:42,026 INFO L272 TraceCheckUtils]: 23: Hoare triple {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:42,026 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13530#true} {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} #64#return; {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} is VALID [2022-04-28 11:15:42,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:42,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:42,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:42,026 INFO L272 TraceCheckUtils]: 18: Hoare triple {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:42,027 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13530#true} {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} #62#return; {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} is VALID [2022-04-28 11:15:42,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:42,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:42,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:42,027 INFO L272 TraceCheckUtils]: 13: Hoare triple {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:42,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} assume !false; {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} is VALID [2022-04-28 11:15:42,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {13530#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {14079#(or (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) main_~y~0 13) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) (* main_~n~0 9) (* (- 1) main_~z~0) 13) (+ main_~y~0 6 (* main_~z~0 2)))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))))} is VALID [2022-04-28 11:15:42,028 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13530#true} {13530#true} #60#return; {13530#true} is VALID [2022-04-28 11:15:42,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:42,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:15:42,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:15:42,029 INFO L272 TraceCheckUtils]: 6: Hoare triple {13530#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:15:42,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {13530#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; {13530#true} is VALID [2022-04-28 11:15:42,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {13530#true} call #t~ret5 := main(); {13530#true} is VALID [2022-04-28 11:15:42,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13530#true} {13530#true} #84#return; {13530#true} is VALID [2022-04-28 11:15:42,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:15:42,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {13530#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); {13530#true} is VALID [2022-04-28 11:15:42,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {13530#true} call ULTIMATE.init(); {13530#true} is VALID [2022-04-28 11:15:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 98 proven. 59 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-04-28 11:15:42,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:42,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196460598] [2022-04-28 11:15:42,030 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:42,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723982127] [2022-04-28 11:15:42,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723982127] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:42,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:42,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-28 11:15:42,031 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:42,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [414000592] [2022-04-28 11:15:42,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [414000592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:42,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:42,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 11:15:42,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981139447] [2022-04-28 11:15:42,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:42,031 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) Word has length 108 [2022-04-28 11:15:42,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:42,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-28 11:15:42,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:42,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 11:15:42,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:42,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 11:15:42,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-28 11:15:42,087 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-28 11:15:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:44,685 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2022-04-28 11:15:44,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:15:44,686 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) Word has length 108 [2022-04-28 11:15:44,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-28 11:15:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2022-04-28 11:15:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-28 11:15:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2022-04-28 11:15:44,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 106 transitions. [2022-04-28 11:15:44,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:44,785 INFO L225 Difference]: With dead ends: 139 [2022-04-28 11:15:44,785 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 11:15:44,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-04-28 11:15:44,786 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:44,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 174 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 11:15:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 11:15:44,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2022-04-28 11:15:44,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:44,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:15:44,884 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:15:44,884 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:15:44,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:44,886 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-04-28 11:15:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2022-04-28 11:15:44,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:44,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:44,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 137 states. [2022-04-28 11:15:44,887 INFO L87 Difference]: Start difference. First operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 137 states. [2022-04-28 11:15:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:44,889 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-04-28 11:15:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2022-04-28 11:15:44,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:44,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:44,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:44,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:44,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:15:44,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2022-04-28 11:15:44,891 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 108 [2022-04-28 11:15:44,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:44,892 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2022-04-28 11:15:44,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-28 11:15:44,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 138 transitions. [2022-04-28 11:15:45,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2022-04-28 11:15:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 11:15:45,057 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:45,058 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:45,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 11:15:45,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 11:15:45,258 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:45,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:45,258 INFO L85 PathProgramCache]: Analyzing trace with hash 34642523, now seen corresponding path program 17 times [2022-04-28 11:15:45,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:45,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1050166047] [2022-04-28 11:15:45,497 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:45,498 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash 34642523, now seen corresponding path program 18 times [2022-04-28 11:15:45,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:45,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684354156] [2022-04-28 11:15:45,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:45,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:45,508 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:45,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [62654577] [2022-04-28 11:15:45,509 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:15:45,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:45,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:45,510 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:15:45,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 11:15:46,125 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:15:46,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:46,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 11:15:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:46,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:51,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {15008#true} call ULTIMATE.init(); {15008#true} is VALID [2022-04-28 11:15:51,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {15008#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); {15008#true} is VALID [2022-04-28 11:15:51,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15008#true} {15008#true} #84#return; {15008#true} is VALID [2022-04-28 11:15:51,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {15008#true} call #t~ret5 := main(); {15008#true} is VALID [2022-04-28 11:15:51,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {15008#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; {15008#true} is VALID [2022-04-28 11:15:51,749 INFO L272 TraceCheckUtils]: 6: Hoare triple {15008#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:15:51,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:15:51,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,749 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15008#true} {15008#true} #60#return; {15008#true} is VALID [2022-04-28 11:15:51,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {15008#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {15008#true} assume !false; {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L272 TraceCheckUtils]: 13: Hoare triple {15008#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15008#true} {15008#true} #62#return; {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L272 TraceCheckUtils]: 18: Hoare triple {15008#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15008#true} {15008#true} #64#return; {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L272 TraceCheckUtils]: 23: Hoare triple {15008#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15008#true} {15008#true} #66#return; {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L272 TraceCheckUtils]: 28: Hoare triple {15008#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15008#true} {15008#true} #68#return; {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L272 TraceCheckUtils]: 33: Hoare triple {15008#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {15008#true} {15008#true} #70#return; {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {15008#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; {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {15008#true} assume !false; {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L272 TraceCheckUtils]: 40: Hoare triple {15008#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L290 TraceCheckUtils]: 41: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L290 TraceCheckUtils]: 42: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L290 TraceCheckUtils]: 43: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {15008#true} {15008#true} #62#return; {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L272 TraceCheckUtils]: 45: Hoare triple {15008#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L290 TraceCheckUtils]: 46: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:15:51,751 INFO L290 TraceCheckUtils]: 47: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L290 TraceCheckUtils]: 48: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {15008#true} {15008#true} #64#return; {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L272 TraceCheckUtils]: 50: Hoare triple {15008#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L290 TraceCheckUtils]: 51: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L290 TraceCheckUtils]: 52: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L290 TraceCheckUtils]: 53: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {15008#true} {15008#true} #66#return; {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L272 TraceCheckUtils]: 55: Hoare triple {15008#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L290 TraceCheckUtils]: 58: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15008#true} {15008#true} #68#return; {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L272 TraceCheckUtils]: 60: Hoare triple {15008#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L290 TraceCheckUtils]: 61: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L290 TraceCheckUtils]: 62: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L290 TraceCheckUtils]: 63: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {15008#true} {15008#true} #70#return; {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {15008#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; {15008#true} is VALID [2022-04-28 11:15:51,752 INFO L290 TraceCheckUtils]: 66: Hoare triple {15008#true} assume !false; {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L272 TraceCheckUtils]: 67: Hoare triple {15008#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15008#true} {15008#true} #62#return; {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L272 TraceCheckUtils]: 72: Hoare triple {15008#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L290 TraceCheckUtils]: 73: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L290 TraceCheckUtils]: 74: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L290 TraceCheckUtils]: 75: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {15008#true} {15008#true} #64#return; {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L272 TraceCheckUtils]: 77: Hoare triple {15008#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L290 TraceCheckUtils]: 78: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L290 TraceCheckUtils]: 79: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L290 TraceCheckUtils]: 80: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {15008#true} {15008#true} #66#return; {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L272 TraceCheckUtils]: 82: Hoare triple {15008#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L290 TraceCheckUtils]: 83: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:15:51,753 INFO L290 TraceCheckUtils]: 84: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:15:51,754 INFO L290 TraceCheckUtils]: 85: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,754 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {15008#true} {15008#true} #68#return; {15008#true} is VALID [2022-04-28 11:15:51,754 INFO L272 TraceCheckUtils]: 87: Hoare triple {15008#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,754 INFO L290 TraceCheckUtils]: 88: Hoare triple {15008#true} ~cond := #in~cond; {15277#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:51,754 INFO L290 TraceCheckUtils]: 89: Hoare triple {15277#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:51,754 INFO L290 TraceCheckUtils]: 90: Hoare triple {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:51,755 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} {15008#true} #70#return; {15288#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} is VALID [2022-04-28 11:15:51,757 INFO L290 TraceCheckUtils]: 92: Hoare triple {15288#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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; {15288#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} is VALID [2022-04-28 11:15:51,757 INFO L290 TraceCheckUtils]: 93: Hoare triple {15288#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} assume !false; {15288#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} is VALID [2022-04-28 11:15:51,757 INFO L272 TraceCheckUtils]: 94: Hoare triple {15288#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,757 INFO L290 TraceCheckUtils]: 95: Hoare triple {15008#true} ~cond := #in~cond; {15277#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:51,758 INFO L290 TraceCheckUtils]: 96: Hoare triple {15277#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:51,758 INFO L290 TraceCheckUtils]: 97: Hoare triple {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:51,758 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} {15288#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} #62#return; {15310#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:15:51,759 INFO L272 TraceCheckUtils]: 99: Hoare triple {15310#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* 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)); {15008#true} is VALID [2022-04-28 11:15:51,759 INFO L290 TraceCheckUtils]: 100: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:15:51,759 INFO L290 TraceCheckUtils]: 101: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:15:51,759 INFO L290 TraceCheckUtils]: 102: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:15:51,759 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {15008#true} {15310#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} #64#return; {15310#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:15:51,759 INFO L272 TraceCheckUtils]: 104: Hoare triple {15310#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:15:51,759 INFO L290 TraceCheckUtils]: 105: Hoare triple {15008#true} ~cond := #in~cond; {15277#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:51,760 INFO L290 TraceCheckUtils]: 106: Hoare triple {15277#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:51,760 INFO L290 TraceCheckUtils]: 107: Hoare triple {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:53,762 WARN L284 TraceCheckUtils]: 108: Hoare quadruple {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} {15310#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} #66#return; {15341#(and (= main_~x~0 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (mod main_~z~0 6) 0))} is UNKNOWN [2022-04-28 11:15:55,764 WARN L272 TraceCheckUtils]: 109: Hoare triple {15341#(and (= main_~x~0 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15345#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-28 11:15:55,764 INFO L290 TraceCheckUtils]: 110: Hoare triple {15345#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15349#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:55,765 INFO L290 TraceCheckUtils]: 111: Hoare triple {15349#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15009#false} is VALID [2022-04-28 11:15:55,765 INFO L290 TraceCheckUtils]: 112: Hoare triple {15009#false} assume !false; {15009#false} is VALID [2022-04-28 11:15:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 179 proven. 9 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-28 11:15:55,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:01,296 INFO L290 TraceCheckUtils]: 112: Hoare triple {15009#false} assume !false; {15009#false} is VALID [2022-04-28 11:16:01,297 INFO L290 TraceCheckUtils]: 111: Hoare triple {15349#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15009#false} is VALID [2022-04-28 11:16:01,297 INFO L290 TraceCheckUtils]: 110: Hoare triple {15345#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15349#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:01,298 INFO L272 TraceCheckUtils]: 109: Hoare triple {15365#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15345#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:01,298 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} {15369#(or (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #66#return; {15365#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:16:01,299 INFO L290 TraceCheckUtils]: 107: Hoare triple {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:01,299 INFO L290 TraceCheckUtils]: 106: Hoare triple {15379#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:01,299 INFO L290 TraceCheckUtils]: 105: Hoare triple {15008#true} ~cond := #in~cond; {15379#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:16:01,299 INFO L272 TraceCheckUtils]: 104: Hoare triple {15369#(or (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:01,300 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {15008#true} {15369#(or (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #64#return; {15369#(or (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:16:01,300 INFO L290 TraceCheckUtils]: 102: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:01,300 INFO L290 TraceCheckUtils]: 101: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:16:01,300 INFO L290 TraceCheckUtils]: 100: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:16:01,300 INFO L272 TraceCheckUtils]: 99: Hoare triple {15369#(or (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:01,301 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} {15401#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #62#return; {15369#(or (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:16:01,301 INFO L290 TraceCheckUtils]: 97: Hoare triple {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:01,301 INFO L290 TraceCheckUtils]: 96: Hoare triple {15379#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:01,302 INFO L290 TraceCheckUtils]: 95: Hoare triple {15008#true} ~cond := #in~cond; {15379#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:16:01,302 INFO L272 TraceCheckUtils]: 94: Hoare triple {15401#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:01,302 INFO L290 TraceCheckUtils]: 93: Hoare triple {15401#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !false; {15401#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:16:05,561 WARN L290 TraceCheckUtils]: 92: Hoare triple {15420#(or (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 3) 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18) (* main_~z~0 12) (* main_~n~0 54) 24) (+ (* (+ main_~z~0 6) (+ main_~z~0 main_~y~0)) (* main_~z~0 2) 12)) (not (= (+ (* main_~n~0 6) 12) (+ 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; {15401#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is UNKNOWN [2022-04-28 11:16:06,146 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} {15008#true} #70#return; {15420#(or (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 3) 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18) (* main_~z~0 12) (* main_~n~0 54) 24) (+ (* (+ main_~z~0 6) (+ main_~z~0 main_~y~0)) (* main_~z~0 2) 12)) (not (= (+ (* main_~n~0 6) 12) (+ main_~z~0 6))))} is VALID [2022-04-28 11:16:06,147 INFO L290 TraceCheckUtils]: 90: Hoare triple {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:06,147 INFO L290 TraceCheckUtils]: 89: Hoare triple {15379#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:06,147 INFO L290 TraceCheckUtils]: 88: Hoare triple {15008#true} ~cond := #in~cond; {15379#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:16:06,147 INFO L272 TraceCheckUtils]: 87: Hoare triple {15008#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {15008#true} {15008#true} #68#return; {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L290 TraceCheckUtils]: 85: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L290 TraceCheckUtils]: 84: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L290 TraceCheckUtils]: 83: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L272 TraceCheckUtils]: 82: Hoare triple {15008#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {15008#true} {15008#true} #66#return; {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L290 TraceCheckUtils]: 80: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L290 TraceCheckUtils]: 79: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L290 TraceCheckUtils]: 78: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L272 TraceCheckUtils]: 77: Hoare triple {15008#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {15008#true} {15008#true} #64#return; {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L290 TraceCheckUtils]: 75: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L290 TraceCheckUtils]: 74: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L290 TraceCheckUtils]: 73: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L272 TraceCheckUtils]: 72: Hoare triple {15008#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15008#true} {15008#true} #62#return; {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L290 TraceCheckUtils]: 70: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:06,148 INFO L290 TraceCheckUtils]: 69: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L290 TraceCheckUtils]: 68: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L272 TraceCheckUtils]: 67: Hoare triple {15008#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L290 TraceCheckUtils]: 66: Hoare triple {15008#true} assume !false; {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L290 TraceCheckUtils]: 65: Hoare triple {15008#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; {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {15008#true} {15008#true} #70#return; {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L290 TraceCheckUtils]: 63: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L290 TraceCheckUtils]: 62: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L290 TraceCheckUtils]: 61: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L272 TraceCheckUtils]: 60: Hoare triple {15008#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15008#true} {15008#true} #68#return; {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L290 TraceCheckUtils]: 58: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L290 TraceCheckUtils]: 57: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L290 TraceCheckUtils]: 56: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L272 TraceCheckUtils]: 55: Hoare triple {15008#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {15008#true} {15008#true} #66#return; {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L290 TraceCheckUtils]: 53: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L290 TraceCheckUtils]: 51: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:16:06,149 INFO L272 TraceCheckUtils]: 50: Hoare triple {15008#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {15008#true} {15008#true} #64#return; {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L290 TraceCheckUtils]: 48: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L290 TraceCheckUtils]: 47: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L272 TraceCheckUtils]: 45: Hoare triple {15008#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {15008#true} {15008#true} #62#return; {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L272 TraceCheckUtils]: 40: Hoare triple {15008#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L290 TraceCheckUtils]: 39: Hoare triple {15008#true} assume !false; {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {15008#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; {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {15008#true} {15008#true} #70#return; {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L272 TraceCheckUtils]: 33: Hoare triple {15008#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15008#true} {15008#true} #68#return; {15008#true} is VALID [2022-04-28 11:16:06,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L272 TraceCheckUtils]: 28: Hoare triple {15008#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15008#true} {15008#true} #66#return; {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L272 TraceCheckUtils]: 23: Hoare triple {15008#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15008#true} {15008#true} #64#return; {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L272 TraceCheckUtils]: 18: Hoare triple {15008#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15008#true} {15008#true} #62#return; {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L272 TraceCheckUtils]: 13: Hoare triple {15008#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:06,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {15008#true} assume !false; {15008#true} is VALID [2022-04-28 11:16:06,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {15008#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {15008#true} is VALID [2022-04-28 11:16:06,152 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15008#true} {15008#true} #60#return; {15008#true} is VALID [2022-04-28 11:16:06,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:06,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {15008#true} assume !(0 == ~cond); {15008#true} is VALID [2022-04-28 11:16:06,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {15008#true} ~cond := #in~cond; {15008#true} is VALID [2022-04-28 11:16:06,152 INFO L272 TraceCheckUtils]: 6: Hoare triple {15008#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {15008#true} is VALID [2022-04-28 11:16:06,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {15008#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; {15008#true} is VALID [2022-04-28 11:16:06,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {15008#true} call #t~ret5 := main(); {15008#true} is VALID [2022-04-28 11:16:06,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15008#true} {15008#true} #84#return; {15008#true} is VALID [2022-04-28 11:16:06,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {15008#true} assume true; {15008#true} is VALID [2022-04-28 11:16:06,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {15008#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); {15008#true} is VALID [2022-04-28 11:16:06,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {15008#true} call ULTIMATE.init(); {15008#true} is VALID [2022-04-28 11:16:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 179 proven. 9 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-28 11:16:06,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:06,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684354156] [2022-04-28 11:16:06,153 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:06,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62654577] [2022-04-28 11:16:06,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62654577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:16:06,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:16:06,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2022-04-28 11:16:06,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:06,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1050166047] [2022-04-28 11:16:06,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1050166047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:06,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:06,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:16:06,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029605689] [2022-04-28 11:16:06,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:06,154 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 113 [2022-04-28 11:16:06,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:06,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:16:09,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:09,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:16:09,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:09,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:16:09,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=139, Unknown=2, NotChecked=0, Total=182 [2022-04-28 11:16:09,457 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:16:15,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:17,619 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:19,620 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:21,622 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:23,624 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:27,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:29,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:34,429 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:36,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:39,861 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:41,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:43,865 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:45,867 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:47,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:54,534 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:55,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:57,683 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:57,685 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2022-04-28 11:16:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:16:57,687 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 113 [2022-04-28 11:16:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:16:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:16:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-28 11:16:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:16:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-28 11:16:57,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-28 11:17:03,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 50 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:03,754 INFO L225 Difference]: With dead ends: 134 [2022-04-28 11:17:03,754 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 11:17:03,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=62, Invalid=207, Unknown=3, NotChecked=0, Total=272 [2022-04-28 11:17:03,755 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 42 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:03,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 96 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 120 Invalid, 14 Unknown, 0 Unchecked, 33.3s Time] [2022-04-28 11:17:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 11:17:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-04-28 11:17:03,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:03,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 130 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 30 states have call successors, (30), 23 states have call predecessors, (30), 22 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:17:03,858 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 130 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 30 states have call successors, (30), 23 states have call predecessors, (30), 22 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:17:03,858 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 130 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 30 states have call successors, (30), 23 states have call predecessors, (30), 22 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:17:03,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:03,860 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-04-28 11:17:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-28 11:17:03,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:03,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:03,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 30 states have call successors, (30), 23 states have call predecessors, (30), 22 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 130 states. [2022-04-28 11:17:03,860 INFO L87 Difference]: Start difference. First operand has 130 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 30 states have call successors, (30), 23 states have call predecessors, (30), 22 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 130 states. [2022-04-28 11:17:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:03,862 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-04-28 11:17:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-28 11:17:03,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:03,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:03,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:03,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 30 states have call successors, (30), 23 states have call predecessors, (30), 22 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:17:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2022-04-28 11:17:03,865 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 113 [2022-04-28 11:17:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:03,865 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2022-04-28 11:17:03,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:17:03,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 137 transitions. [2022-04-28 11:17:08,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 135 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-28 11:17:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-28 11:17:08,033 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:08,033 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 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, 1, 1, 1, 1] [2022-04-28 11:17:08,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 11:17:08,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 11:17:08,234 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:08,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2063139367, now seen corresponding path program 5 times [2022-04-28 11:17:08,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:08,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1116589408] [2022-04-28 11:17:08,534 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:08,534 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:08,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2063139367, now seen corresponding path program 6 times [2022-04-28 11:17:08,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:08,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011342796] [2022-04-28 11:17:08,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:08,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:08,542 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:08,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1934621911] [2022-04-28 11:17:08,542 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:17:08,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:08,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:08,544 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:08,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 11:17:08,920 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:17:08,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:08,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 11:17:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:08,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:12,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {16494#true} call ULTIMATE.init(); {16494#true} is VALID [2022-04-28 11:17:12,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {16494#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); {16494#true} is VALID [2022-04-28 11:17:12,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16494#true} {16494#true} #84#return; {16494#true} is VALID [2022-04-28 11:17:12,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {16494#true} call #t~ret5 := main(); {16494#true} is VALID [2022-04-28 11:17:12,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {16494#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; {16514#(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)))} is VALID [2022-04-28 11:17:12,730 INFO L272 TraceCheckUtils]: 6: Hoare triple {16514#(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)))} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {16494#true} ~cond := #in~cond; {16521#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:17:12,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {16521#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {16525#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:17:12,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {16525#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {16525#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:17:12,733 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16525#(not (= |assume_abort_if_not_#in~cond| 0))} {16514#(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)))} #60#return; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,734 INFO L272 TraceCheckUtils]: 13: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,735 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16494#true} {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,735 INFO L272 TraceCheckUtils]: 18: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,735 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16494#true} {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,735 INFO L272 TraceCheckUtils]: 23: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,736 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16494#true} {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,736 INFO L272 TraceCheckUtils]: 28: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~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)); {16494#true} is VALID [2022-04-28 11:17:12,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,737 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16494#true} {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,737 INFO L272 TraceCheckUtils]: 33: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,747 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16494#true} {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~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; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,752 INFO L272 TraceCheckUtils]: 40: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,752 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16494#true} {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,752 INFO L272 TraceCheckUtils]: 45: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,752 INFO L290 TraceCheckUtils]: 46: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,752 INFO L290 TraceCheckUtils]: 47: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,752 INFO L290 TraceCheckUtils]: 48: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,753 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {16494#true} {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,753 INFO L272 TraceCheckUtils]: 50: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,753 INFO L290 TraceCheckUtils]: 51: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,753 INFO L290 TraceCheckUtils]: 52: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,753 INFO L290 TraceCheckUtils]: 53: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,753 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16494#true} {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,753 INFO L272 TraceCheckUtils]: 55: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~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)); {16494#true} is VALID [2022-04-28 11:17:12,753 INFO L290 TraceCheckUtils]: 56: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,753 INFO L290 TraceCheckUtils]: 57: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,753 INFO L290 TraceCheckUtils]: 58: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,754 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16494#true} {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,754 INFO L272 TraceCheckUtils]: 60: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,754 INFO L290 TraceCheckUtils]: 61: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,754 INFO L290 TraceCheckUtils]: 62: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,754 INFO L290 TraceCheckUtils]: 63: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,754 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16494#true} {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,755 INFO L290 TraceCheckUtils]: 65: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~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; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,755 INFO L290 TraceCheckUtils]: 66: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,755 INFO L272 TraceCheckUtils]: 67: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,755 INFO L290 TraceCheckUtils]: 68: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,755 INFO L290 TraceCheckUtils]: 69: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,755 INFO L290 TraceCheckUtils]: 70: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,756 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16494#true} {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,756 INFO L272 TraceCheckUtils]: 72: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,756 INFO L290 TraceCheckUtils]: 73: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,756 INFO L290 TraceCheckUtils]: 74: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,756 INFO L290 TraceCheckUtils]: 75: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,756 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16494#true} {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,756 INFO L272 TraceCheckUtils]: 77: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,756 INFO L290 TraceCheckUtils]: 78: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,756 INFO L290 TraceCheckUtils]: 79: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,756 INFO L290 TraceCheckUtils]: 80: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,757 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {16494#true} {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,757 INFO L272 TraceCheckUtils]: 82: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~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)); {16494#true} is VALID [2022-04-28 11:17:12,757 INFO L290 TraceCheckUtils]: 83: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,757 INFO L290 TraceCheckUtils]: 84: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,757 INFO L290 TraceCheckUtils]: 85: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,757 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16494#true} {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,757 INFO L272 TraceCheckUtils]: 87: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,757 INFO L290 TraceCheckUtils]: 88: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,757 INFO L290 TraceCheckUtils]: 89: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,757 INFO L290 TraceCheckUtils]: 90: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,758 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {16494#true} {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {16532#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,759 INFO L290 TraceCheckUtils]: 92: Hoare triple {16532#(and (<= 0 main_~a~0) (<= main_~a~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; {16779#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,759 INFO L290 TraceCheckUtils]: 93: Hoare triple {16779#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {16779#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,759 INFO L272 TraceCheckUtils]: 94: Hoare triple {16779#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,759 INFO L290 TraceCheckUtils]: 95: Hoare triple {16494#true} ~cond := #in~cond; {16789#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:12,760 INFO L290 TraceCheckUtils]: 96: Hoare triple {16789#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:12,760 INFO L290 TraceCheckUtils]: 97: Hoare triple {16793#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:12,760 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16793#(not (= |__VERIFIER_assert_#in~cond| 0))} {16779#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {16800#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,760 INFO L272 TraceCheckUtils]: 99: Hoare triple {16800#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,760 INFO L290 TraceCheckUtils]: 100: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,760 INFO L290 TraceCheckUtils]: 101: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,761 INFO L290 TraceCheckUtils]: 102: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,761 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {16494#true} {16800#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {16800#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,761 INFO L272 TraceCheckUtils]: 104: Hoare triple {16800#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,761 INFO L290 TraceCheckUtils]: 105: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,761 INFO L290 TraceCheckUtils]: 106: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,761 INFO L290 TraceCheckUtils]: 107: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,762 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16494#true} {16800#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {16800#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,762 INFO L272 TraceCheckUtils]: 109: Hoare triple {16800#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~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)); {16494#true} is VALID [2022-04-28 11:17:12,762 INFO L290 TraceCheckUtils]: 110: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,762 INFO L290 TraceCheckUtils]: 111: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,762 INFO L290 TraceCheckUtils]: 112: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,762 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {16494#true} {16800#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {16800#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,762 INFO L272 TraceCheckUtils]: 114: Hoare triple {16800#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,762 INFO L290 TraceCheckUtils]: 115: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,762 INFO L290 TraceCheckUtils]: 116: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,762 INFO L290 TraceCheckUtils]: 117: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,763 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {16494#true} {16800#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {16800#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:12,764 INFO L290 TraceCheckUtils]: 119: Hoare triple {16800#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} assume !(~n~0 <= ~a~0); {16864#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= main_~a~0 10) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:17:12,764 INFO L272 TraceCheckUtils]: 120: Hoare triple {16864#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= main_~a~0 10) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16494#true} is VALID [2022-04-28 11:17:12,764 INFO L290 TraceCheckUtils]: 121: Hoare triple {16494#true} ~cond := #in~cond; {16494#true} is VALID [2022-04-28 11:17:12,764 INFO L290 TraceCheckUtils]: 122: Hoare triple {16494#true} assume !(0 == ~cond); {16494#true} is VALID [2022-04-28 11:17:12,764 INFO L290 TraceCheckUtils]: 123: Hoare triple {16494#true} assume true; {16494#true} is VALID [2022-04-28 11:17:12,764 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {16494#true} {16864#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= main_~a~0 10) (= (mod main_~z~0 6) 0))} #72#return; {16864#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= main_~a~0 10) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:17:12,778 INFO L272 TraceCheckUtils]: 125: Hoare triple {16864#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= main_~a~0 10) (= (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)); {16883#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:12,778 INFO L290 TraceCheckUtils]: 126: Hoare triple {16883#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16887#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:12,780 INFO L290 TraceCheckUtils]: 127: Hoare triple {16887#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16495#false} is VALID [2022-04-28 11:17:12,780 INFO L290 TraceCheckUtils]: 128: Hoare triple {16495#false} assume !false; {16495#false} is VALID [2022-04-28 11:17:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 107 proven. 16 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2022-04-28 11:17:12,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:12,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:12,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011342796] [2022-04-28 11:17:12,858 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:12,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934621911] [2022-04-28 11:17:12,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934621911] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:17:12,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:17:12,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 11:17:12,858 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:12,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1116589408] [2022-04-28 11:17:12,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1116589408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:12,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:12,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 11:17:12,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164951215] [2022-04-28 11:17:12,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:12,859 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) Word has length 129 [2022-04-28 11:17:12,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:12,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:17:12,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:12,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 11:17:12,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:12,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 11:17:12,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:17:12,905 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:17:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:14,322 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2022-04-28 11:17:14,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:17:14,322 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) Word has length 129 [2022-04-28 11:17:14,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:17:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2022-04-28 11:17:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:17:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2022-04-28 11:17:14,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 42 transitions. [2022-04-28 11:17:14,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:14,377 INFO L225 Difference]: With dead ends: 136 [2022-04-28 11:17:14,378 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 11:17:14,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:17:14,378 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:14,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 95 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 11:17:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 11:17:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-04-28 11:17:14,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:14,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 134 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 30 states have call successors, (30), 24 states have call predecessors, (30), 23 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:17:14,512 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 134 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 30 states have call successors, (30), 24 states have call predecessors, (30), 23 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:17:14,512 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 134 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 30 states have call successors, (30), 24 states have call predecessors, (30), 23 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:17:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:14,514 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2022-04-28 11:17:14,514 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2022-04-28 11:17:14,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:14,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:14,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 30 states have call successors, (30), 24 states have call predecessors, (30), 23 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 134 states. [2022-04-28 11:17:14,515 INFO L87 Difference]: Start difference. First operand has 134 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 30 states have call successors, (30), 24 states have call predecessors, (30), 23 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 134 states. [2022-04-28 11:17:14,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:14,516 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2022-04-28 11:17:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2022-04-28 11:17:14,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:14,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:14,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:14,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 30 states have call successors, (30), 24 states have call predecessors, (30), 23 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:17:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2022-04-28 11:17:14,519 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 129 [2022-04-28 11:17:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:14,519 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2022-04-28 11:17:14,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:17:14,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 140 transitions. [2022-04-28 11:17:17,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 139 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2022-04-28 11:17:17,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 11:17:17,437 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:17,438 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 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, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:17,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 11:17:17,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:17,638 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:17,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:17,639 INFO L85 PathProgramCache]: Analyzing trace with hash -262683944, now seen corresponding path program 5 times [2022-04-28 11:17:17,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:17,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [841880728] [2022-04-28 11:17:17,894 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:17,895 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:17,895 INFO L85 PathProgramCache]: Analyzing trace with hash -262683944, now seen corresponding path program 6 times [2022-04-28 11:17:17,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:17,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824433658] [2022-04-28 11:17:17,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:17,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:17,909 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:17,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1235215265] [2022-04-28 11:17:17,910 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:17:17,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:17,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:17,916 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:17,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 11:17:18,304 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:17:18,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:18,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 11:17:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:18,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:26,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {17725#true} call ULTIMATE.init(); {17725#true} is VALID [2022-04-28 11:17:26,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {17725#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); {17725#true} is VALID [2022-04-28 11:17:26,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17725#true} {17725#true} #84#return; {17725#true} is VALID [2022-04-28 11:17:26,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {17725#true} call #t~ret5 := main(); {17725#true} is VALID [2022-04-28 11:17:26,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {17725#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; {17745#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} is VALID [2022-04-28 11:17:26,909 INFO L272 TraceCheckUtils]: 6: Hoare triple {17745#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {17725#true} ~cond := #in~cond; {17752#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:17:26,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {17752#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {17756#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:17:26,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {17756#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {17756#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:17:26,910 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17756#(not (= |assume_abort_if_not_#in~cond| 0))} {17745#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} #60#return; {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,911 INFO L272 TraceCheckUtils]: 13: Hoare triple {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,912 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17725#true} {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,912 INFO L272 TraceCheckUtils]: 18: Hoare triple {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,912 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17725#true} {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,912 INFO L272 TraceCheckUtils]: 23: Hoare triple {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,913 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17725#true} {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,913 INFO L272 TraceCheckUtils]: 28: Hoare triple {17763#(and (<= 0 main_~a~0) (<= main_~a~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)); {17725#true} is VALID [2022-04-28 11:17:26,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,913 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17725#true} {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,914 INFO L272 TraceCheckUtils]: 33: Hoare triple {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,914 INFO L290 TraceCheckUtils]: 36: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,914 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17725#true} {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {17763#(and (<= 0 main_~a~0) (<= main_~a~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; {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,915 INFO L272 TraceCheckUtils]: 40: Hoare triple {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,915 INFO L290 TraceCheckUtils]: 43: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,915 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17725#true} {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,915 INFO L272 TraceCheckUtils]: 45: Hoare triple {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,916 INFO L290 TraceCheckUtils]: 47: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,916 INFO L290 TraceCheckUtils]: 48: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,916 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17725#true} {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,916 INFO L272 TraceCheckUtils]: 50: Hoare triple {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,916 INFO L290 TraceCheckUtils]: 51: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,916 INFO L290 TraceCheckUtils]: 52: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,916 INFO L290 TraceCheckUtils]: 53: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,917 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17725#true} {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,917 INFO L272 TraceCheckUtils]: 55: Hoare triple {17763#(and (<= 0 main_~a~0) (<= main_~a~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)); {17725#true} is VALID [2022-04-28 11:17:26,917 INFO L290 TraceCheckUtils]: 56: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,917 INFO L290 TraceCheckUtils]: 57: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,917 INFO L290 TraceCheckUtils]: 58: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,917 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17725#true} {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,917 INFO L272 TraceCheckUtils]: 60: Hoare triple {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,918 INFO L290 TraceCheckUtils]: 61: Hoare triple {17725#true} ~cond := #in~cond; {17917#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:26,918 INFO L290 TraceCheckUtils]: 62: Hoare triple {17917#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:26,918 INFO L290 TraceCheckUtils]: 63: Hoare triple {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:26,919 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} {17763#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,921 INFO L290 TraceCheckUtils]: 65: Hoare triple {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~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; {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,921 INFO L290 TraceCheckUtils]: 66: Hoare triple {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,921 INFO L272 TraceCheckUtils]: 67: Hoare triple {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,921 INFO L290 TraceCheckUtils]: 68: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,921 INFO L290 TraceCheckUtils]: 69: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,921 INFO L290 TraceCheckUtils]: 70: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,922 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17725#true} {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,922 INFO L272 TraceCheckUtils]: 72: Hoare triple {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,922 INFO L290 TraceCheckUtils]: 73: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,922 INFO L290 TraceCheckUtils]: 74: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,922 INFO L290 TraceCheckUtils]: 75: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,922 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {17725#true} {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,923 INFO L272 TraceCheckUtils]: 77: Hoare triple {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,923 INFO L290 TraceCheckUtils]: 78: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,923 INFO L290 TraceCheckUtils]: 79: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,923 INFO L290 TraceCheckUtils]: 80: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,923 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17725#true} {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,923 INFO L272 TraceCheckUtils]: 82: Hoare triple {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~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)); {17725#true} is VALID [2022-04-28 11:17:26,923 INFO L290 TraceCheckUtils]: 83: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,923 INFO L290 TraceCheckUtils]: 84: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,923 INFO L290 TraceCheckUtils]: 85: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,924 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17725#true} {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,924 INFO L272 TraceCheckUtils]: 87: Hoare triple {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,924 INFO L290 TraceCheckUtils]: 88: Hoare triple {17725#true} ~cond := #in~cond; {17917#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:26,925 INFO L290 TraceCheckUtils]: 89: Hoare triple {17917#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:26,925 INFO L290 TraceCheckUtils]: 90: Hoare triple {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:26,925 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,927 INFO L290 TraceCheckUtils]: 92: Hoare triple {17928#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~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; {18013#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,928 INFO L290 TraceCheckUtils]: 93: Hoare triple {18013#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {18013#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,928 INFO L272 TraceCheckUtils]: 94: Hoare triple {18013#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,928 INFO L290 TraceCheckUtils]: 95: Hoare triple {17725#true} ~cond := #in~cond; {17917#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:26,928 INFO L290 TraceCheckUtils]: 96: Hoare triple {17917#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:26,929 INFO L290 TraceCheckUtils]: 97: Hoare triple {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:26,929 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} {18013#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {18032#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,929 INFO L272 TraceCheckUtils]: 99: Hoare triple {18032#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,930 INFO L290 TraceCheckUtils]: 100: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,930 INFO L290 TraceCheckUtils]: 101: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,930 INFO L290 TraceCheckUtils]: 102: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,930 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {17725#true} {18032#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {18032#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,930 INFO L272 TraceCheckUtils]: 104: Hoare triple {18032#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,930 INFO L290 TraceCheckUtils]: 105: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,930 INFO L290 TraceCheckUtils]: 106: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,930 INFO L290 TraceCheckUtils]: 107: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,931 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17725#true} {18032#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {18032#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,931 INFO L272 TraceCheckUtils]: 109: Hoare triple {18032#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~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)); {17725#true} is VALID [2022-04-28 11:17:26,931 INFO L290 TraceCheckUtils]: 110: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,931 INFO L290 TraceCheckUtils]: 111: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,931 INFO L290 TraceCheckUtils]: 112: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,932 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17725#true} {18032#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {18032#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,932 INFO L272 TraceCheckUtils]: 114: Hoare triple {18032#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,932 INFO L290 TraceCheckUtils]: 115: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,932 INFO L290 TraceCheckUtils]: 116: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,932 INFO L290 TraceCheckUtils]: 117: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,932 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {17725#true} {18032#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {18032#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,933 INFO L290 TraceCheckUtils]: 119: Hoare triple {18032#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} assume !(~n~0 <= ~a~0); {18096#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,933 INFO L272 TraceCheckUtils]: 120: Hoare triple {18096#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,933 INFO L290 TraceCheckUtils]: 121: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,933 INFO L290 TraceCheckUtils]: 122: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,933 INFO L290 TraceCheckUtils]: 123: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,934 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17725#true} {18096#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 10))} #72#return; {18096#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:26,934 INFO L272 TraceCheckUtils]: 125: Hoare triple {18096#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:26,934 INFO L290 TraceCheckUtils]: 126: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:26,934 INFO L290 TraceCheckUtils]: 127: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:26,934 INFO L290 TraceCheckUtils]: 128: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:26,934 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17725#true} {18096#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 10))} #74#return; {18096#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 10))} is VALID [2022-04-28 11:17:27,306 INFO L272 TraceCheckUtils]: 130: Hoare triple {18096#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {18130#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:27,307 INFO L290 TraceCheckUtils]: 131: Hoare triple {18130#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18134#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:27,307 INFO L290 TraceCheckUtils]: 132: Hoare triple {18134#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17726#false} is VALID [2022-04-28 11:17:27,307 INFO L290 TraceCheckUtils]: 133: Hoare triple {17726#false} assume !false; {17726#false} is VALID [2022-04-28 11:17:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 181 proven. 69 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-04-28 11:17:27,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:47,582 INFO L290 TraceCheckUtils]: 133: Hoare triple {17726#false} assume !false; {17726#false} is VALID [2022-04-28 11:17:47,583 INFO L290 TraceCheckUtils]: 132: Hoare triple {18134#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17726#false} is VALID [2022-04-28 11:17:47,583 INFO L290 TraceCheckUtils]: 131: Hoare triple {18130#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18134#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:47,584 INFO L272 TraceCheckUtils]: 130: Hoare triple {18150#(= (+ (* 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)); {18130#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:47,584 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17725#true} {18150#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #74#return; {18150#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:17:47,584 INFO L290 TraceCheckUtils]: 128: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:47,584 INFO L290 TraceCheckUtils]: 127: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:47,584 INFO L290 TraceCheckUtils]: 126: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:47,584 INFO L272 TraceCheckUtils]: 125: Hoare triple {18150#(= (+ (* 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)); {17725#true} is VALID [2022-04-28 11:17:47,585 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17725#true} {18150#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #72#return; {18150#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:17:47,585 INFO L290 TraceCheckUtils]: 123: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:47,585 INFO L290 TraceCheckUtils]: 122: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:47,585 INFO L290 TraceCheckUtils]: 121: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:47,585 INFO L272 TraceCheckUtils]: 120: Hoare triple {18150#(= (+ (* 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)); {17725#true} is VALID [2022-04-28 11:17:47,585 INFO L290 TraceCheckUtils]: 119: Hoare triple {18184#(or (= (+ (* 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); {18150#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:17:47,586 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {17725#true} {18184#(or (= (+ (* 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))} #70#return; {18184#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:17:47,586 INFO L290 TraceCheckUtils]: 117: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:47,586 INFO L290 TraceCheckUtils]: 116: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:47,586 INFO L290 TraceCheckUtils]: 115: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:47,586 INFO L272 TraceCheckUtils]: 114: Hoare triple {18184#(or (= (+ (* 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)); {17725#true} is VALID [2022-04-28 11:17:47,586 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17725#true} {18184#(or (= (+ (* 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))} #68#return; {18184#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:17:47,587 INFO L290 TraceCheckUtils]: 112: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:47,587 INFO L290 TraceCheckUtils]: 111: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:47,587 INFO L290 TraceCheckUtils]: 110: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:47,587 INFO L272 TraceCheckUtils]: 109: Hoare triple {18184#(or (= (+ (* 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)); {17725#true} is VALID [2022-04-28 11:17:47,587 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17725#true} {18184#(or (= (+ (* 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))} #66#return; {18184#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:17:47,587 INFO L290 TraceCheckUtils]: 107: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:47,587 INFO L290 TraceCheckUtils]: 106: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:47,587 INFO L290 TraceCheckUtils]: 105: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:47,587 INFO L272 TraceCheckUtils]: 104: Hoare triple {18184#(or (= (+ (* 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)); {17725#true} is VALID [2022-04-28 11:17:47,588 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {17725#true} {18184#(or (= (+ (* 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))} #64#return; {18184#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:17:47,588 INFO L290 TraceCheckUtils]: 102: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:47,588 INFO L290 TraceCheckUtils]: 101: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:47,588 INFO L290 TraceCheckUtils]: 100: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:47,588 INFO L272 TraceCheckUtils]: 99: Hoare triple {18184#(or (= (+ (* 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)); {17725#true} is VALID [2022-04-28 11:17:47,589 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} {18248#(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))} #62#return; {18184#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:17:47,589 INFO L290 TraceCheckUtils]: 97: Hoare triple {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:47,589 INFO L290 TraceCheckUtils]: 96: Hoare triple {18258#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:47,590 INFO L290 TraceCheckUtils]: 95: Hoare triple {17725#true} ~cond := #in~cond; {18258#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:17:47,590 INFO L272 TraceCheckUtils]: 94: Hoare triple {18248#(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 ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:47,590 INFO L290 TraceCheckUtils]: 93: Hoare triple {18248#(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 !false; {18248#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:17:47,594 INFO L290 TraceCheckUtils]: 92: Hoare triple {18268#(or (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 0)) (<= (+ (div (+ main_~z~0 (- 6)) 6) 1) main_~a~0) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 12) (* main_~a~0 (+ (* (div (+ main_~z~0 (- 6)) 6) 6) 12)) 24) (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 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; {18248#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:17:48,206 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} {17725#true} #70#return; {18268#(or (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 0)) (<= (+ (div (+ main_~z~0 (- 6)) 6) 1) main_~a~0) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 12) (* main_~a~0 (+ (* (div (+ main_~z~0 (- 6)) 6) 6) 12)) 24) (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10)))} is VALID [2022-04-28 11:17:48,206 INFO L290 TraceCheckUtils]: 90: Hoare triple {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:48,207 INFO L290 TraceCheckUtils]: 89: Hoare triple {18258#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17921#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:48,207 INFO L290 TraceCheckUtils]: 88: Hoare triple {17725#true} ~cond := #in~cond; {18258#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:17:48,207 INFO L272 TraceCheckUtils]: 87: Hoare triple {17725#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:48,207 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17725#true} {17725#true} #68#return; {17725#true} is VALID [2022-04-28 11:17:48,207 INFO L290 TraceCheckUtils]: 85: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:48,207 INFO L290 TraceCheckUtils]: 84: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:48,207 INFO L290 TraceCheckUtils]: 83: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:48,207 INFO L272 TraceCheckUtils]: 82: Hoare triple {17725#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:48,207 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17725#true} {17725#true} #66#return; {17725#true} is VALID [2022-04-28 11:17:48,207 INFO L290 TraceCheckUtils]: 80: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:48,207 INFO L290 TraceCheckUtils]: 79: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:48,207 INFO L290 TraceCheckUtils]: 78: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L272 TraceCheckUtils]: 77: Hoare triple {17725#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {17725#true} {17725#true} #64#return; {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L290 TraceCheckUtils]: 75: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L290 TraceCheckUtils]: 74: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L290 TraceCheckUtils]: 73: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L272 TraceCheckUtils]: 72: Hoare triple {17725#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17725#true} {17725#true} #62#return; {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L290 TraceCheckUtils]: 70: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L290 TraceCheckUtils]: 69: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L290 TraceCheckUtils]: 68: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L272 TraceCheckUtils]: 67: Hoare triple {17725#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L290 TraceCheckUtils]: 66: Hoare triple {17725#true} assume !false; {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L290 TraceCheckUtils]: 65: Hoare triple {17725#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; {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17725#true} {17725#true} #70#return; {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L290 TraceCheckUtils]: 63: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L290 TraceCheckUtils]: 62: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L290 TraceCheckUtils]: 61: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L272 TraceCheckUtils]: 60: Hoare triple {17725#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17725#true} {17725#true} #68#return; {17725#true} is VALID [2022-04-28 11:17:48,208 INFO L290 TraceCheckUtils]: 58: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L290 TraceCheckUtils]: 57: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L290 TraceCheckUtils]: 56: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L272 TraceCheckUtils]: 55: Hoare triple {17725#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17725#true} {17725#true} #66#return; {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L290 TraceCheckUtils]: 53: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L290 TraceCheckUtils]: 52: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L290 TraceCheckUtils]: 51: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L272 TraceCheckUtils]: 50: Hoare triple {17725#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17725#true} {17725#true} #64#return; {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L290 TraceCheckUtils]: 46: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L272 TraceCheckUtils]: 45: Hoare triple {17725#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17725#true} {17725#true} #62#return; {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L272 TraceCheckUtils]: 40: Hoare triple {17725#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:48,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {17725#true} assume !false; {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {17725#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; {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17725#true} {17725#true} #70#return; {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L272 TraceCheckUtils]: 33: Hoare triple {17725#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17725#true} {17725#true} #68#return; {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L272 TraceCheckUtils]: 28: Hoare triple {17725#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17725#true} {17725#true} #66#return; {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L272 TraceCheckUtils]: 23: Hoare triple {17725#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17725#true} {17725#true} #64#return; {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:48,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L272 TraceCheckUtils]: 18: Hoare triple {17725#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17725#true} {17725#true} #62#return; {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L272 TraceCheckUtils]: 13: Hoare triple {17725#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {17725#true} assume !false; {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {17725#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17725#true} {17725#true} #60#return; {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {17725#true} assume !(0 == ~cond); {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {17725#true} ~cond := #in~cond; {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L272 TraceCheckUtils]: 6: Hoare triple {17725#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {17725#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; {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {17725#true} call #t~ret5 := main(); {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17725#true} {17725#true} #84#return; {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {17725#true} assume true; {17725#true} is VALID [2022-04-28 11:17:48,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {17725#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); {17725#true} is VALID [2022-04-28 11:17:48,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {17725#true} call ULTIMATE.init(); {17725#true} is VALID [2022-04-28 11:17:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 148 proven. 39 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2022-04-28 11:17:48,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:48,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824433658] [2022-04-28 11:17:48,212 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:48,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235215265] [2022-04-28 11:17:48,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235215265] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:17:48,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:17:48,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2022-04-28 11:17:48,213 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:48,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [841880728] [2022-04-28 11:17:48,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [841880728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:48,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:48,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:17:48,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351127247] [2022-04-28 11:17:48,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:48,213 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) Word has length 134 [2022-04-28 11:17:48,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:48,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-28 11:17:49,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:49,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:17:49,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:49,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:17:49,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-28 11:17:49,151 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-28 11:17:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:51,114 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2022-04-28 11:17:51,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:17:51,114 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) Word has length 134 [2022-04-28 11:17:51,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-28 11:17:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2022-04-28 11:17:51,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-28 11:17:51,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2022-04-28 11:17:51,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 42 transitions. [2022-04-28 11:17:51,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:51,221 INFO L225 Difference]: With dead ends: 144 [2022-04-28 11:17:51,221 INFO L226 Difference]: Without dead ends: 142 [2022-04-28 11:17:51,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 248 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2022-04-28 11:17:51,221 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:51,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 106 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 11:17:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-28 11:17:51,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-04-28 11:17:51,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:51,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 142 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 30 states have call successors, (30), 26 states have call predecessors, (30), 25 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:17:51,381 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 142 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 30 states have call successors, (30), 26 states have call predecessors, (30), 25 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:17:51,381 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 142 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 30 states have call successors, (30), 26 states have call predecessors, (30), 25 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:17:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:51,383 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2022-04-28 11:17:51,383 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2022-04-28 11:17:51,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:51,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:51,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 30 states have call successors, (30), 26 states have call predecessors, (30), 25 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 142 states. [2022-04-28 11:17:51,383 INFO L87 Difference]: Start difference. First operand has 142 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 30 states have call successors, (30), 26 states have call predecessors, (30), 25 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 142 states. [2022-04-28 11:17:51,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:51,385 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2022-04-28 11:17:51,385 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2022-04-28 11:17:51,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:51,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:51,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:51,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 30 states have call successors, (30), 26 states have call predecessors, (30), 25 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:17:51,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 146 transitions. [2022-04-28 11:17:51,387 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 146 transitions. Word has length 134 [2022-04-28 11:17:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:51,388 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 146 transitions. [2022-04-28 11:17:51,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-28 11:17:51,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 146 transitions. [2022-04-28 11:17:54,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 145 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2022-04-28 11:17:54,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 11:17:54,699 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:54,699 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:54,715 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-28 11:17:54,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:54,899 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:54,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:54,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1923910469, now seen corresponding path program 19 times [2022-04-28 11:17:54,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:54,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [25876821] [2022-04-28 11:17:55,126 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:55,126 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:55,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1923910469, now seen corresponding path program 20 times [2022-04-28 11:17:55,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:55,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831161920] [2022-04-28 11:17:55,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:55,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:55,141 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:55,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1694951366] [2022-04-28 11:17:55,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:17:55,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:55,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:55,142 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:55,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 11:17:55,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:17:55,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:55,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 11:17:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:55,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:55,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {19411#true} call ULTIMATE.init(); {19411#true} is VALID [2022-04-28 11:17:55,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {19411#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); {19411#true} is VALID [2022-04-28 11:17:55,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19411#true} {19411#true} #84#return; {19411#true} is VALID [2022-04-28 11:17:55,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {19411#true} call #t~ret5 := main(); {19411#true} is VALID [2022-04-28 11:17:55,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {19411#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; {19411#true} is VALID [2022-04-28 11:17:55,819 INFO L272 TraceCheckUtils]: 6: Hoare triple {19411#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:55,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,820 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19411#true} {19411#true} #60#return; {19411#true} is VALID [2022-04-28 11:17:55,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {19411#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {19449#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:55,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {19449#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {19449#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:55,820 INFO L272 TraceCheckUtils]: 13: Hoare triple {19449#(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)); {19411#true} is VALID [2022-04-28 11:17:55,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,821 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19411#true} {19449#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {19449#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:55,821 INFO L272 TraceCheckUtils]: 18: Hoare triple {19449#(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)); {19411#true} is VALID [2022-04-28 11:17:55,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,822 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19411#true} {19449#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {19449#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:55,822 INFO L272 TraceCheckUtils]: 23: Hoare triple {19449#(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)); {19411#true} is VALID [2022-04-28 11:17:55,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,822 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19411#true} {19449#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {19449#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:55,822 INFO L272 TraceCheckUtils]: 28: Hoare triple {19449#(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)); {19411#true} is VALID [2022-04-28 11:17:55,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,823 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19411#true} {19449#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {19449#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:55,823 INFO L272 TraceCheckUtils]: 33: Hoare triple {19449#(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)); {19411#true} is VALID [2022-04-28 11:17:55,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,824 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {19411#true} {19449#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {19449#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:55,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {19449#(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; {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:17:55,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} assume !false; {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:17:55,824 INFO L272 TraceCheckUtils]: 40: Hoare triple {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:55,824 INFO L290 TraceCheckUtils]: 41: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,824 INFO L290 TraceCheckUtils]: 42: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,825 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19411#true} {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} #62#return; {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:17:55,825 INFO L272 TraceCheckUtils]: 45: Hoare triple {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:55,825 INFO L290 TraceCheckUtils]: 46: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,825 INFO L290 TraceCheckUtils]: 47: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,825 INFO L290 TraceCheckUtils]: 48: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,826 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {19411#true} {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} #64#return; {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:17:55,826 INFO L272 TraceCheckUtils]: 50: Hoare triple {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:55,826 INFO L290 TraceCheckUtils]: 51: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,826 INFO L290 TraceCheckUtils]: 52: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,826 INFO L290 TraceCheckUtils]: 53: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,826 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19411#true} {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} #66#return; {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:17:55,826 INFO L272 TraceCheckUtils]: 55: Hoare triple {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= 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)); {19411#true} is VALID [2022-04-28 11:17:55,826 INFO L290 TraceCheckUtils]: 56: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,826 INFO L290 TraceCheckUtils]: 57: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,826 INFO L290 TraceCheckUtils]: 58: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,827 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19411#true} {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} #68#return; {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:17:55,827 INFO L272 TraceCheckUtils]: 60: Hoare triple {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:55,827 INFO L290 TraceCheckUtils]: 61: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,827 INFO L290 TraceCheckUtils]: 62: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,827 INFO L290 TraceCheckUtils]: 63: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,828 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {19411#true} {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} #70#return; {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:17:55,828 INFO L290 TraceCheckUtils]: 65: Hoare triple {19531#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= main_~n~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; {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:17:55,828 INFO L290 TraceCheckUtils]: 66: Hoare triple {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} assume !false; {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:17:55,828 INFO L272 TraceCheckUtils]: 67: Hoare triple {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:55,828 INFO L290 TraceCheckUtils]: 68: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,829 INFO L290 TraceCheckUtils]: 69: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,829 INFO L290 TraceCheckUtils]: 70: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,829 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19411#true} {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} #62#return; {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:17:55,829 INFO L272 TraceCheckUtils]: 72: Hoare triple {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:55,829 INFO L290 TraceCheckUtils]: 73: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,829 INFO L290 TraceCheckUtils]: 74: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,829 INFO L290 TraceCheckUtils]: 75: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,830 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19411#true} {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} #64#return; {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:17:55,830 INFO L272 TraceCheckUtils]: 77: Hoare triple {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:55,830 INFO L290 TraceCheckUtils]: 78: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,830 INFO L290 TraceCheckUtils]: 79: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,830 INFO L290 TraceCheckUtils]: 80: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,830 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19411#true} {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} #66#return; {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:17:55,830 INFO L272 TraceCheckUtils]: 82: Hoare triple {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= 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)); {19411#true} is VALID [2022-04-28 11:17:55,830 INFO L290 TraceCheckUtils]: 83: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,830 INFO L290 TraceCheckUtils]: 84: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,831 INFO L290 TraceCheckUtils]: 85: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,831 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19411#true} {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} #68#return; {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:17:55,831 INFO L272 TraceCheckUtils]: 87: Hoare triple {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:55,831 INFO L290 TraceCheckUtils]: 88: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,831 INFO L290 TraceCheckUtils]: 89: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,831 INFO L290 TraceCheckUtils]: 90: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,832 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {19411#true} {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} #70#return; {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:17:55,832 INFO L290 TraceCheckUtils]: 92: Hoare triple {19613#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~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; {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-28 11:17:55,832 INFO L290 TraceCheckUtils]: 93: Hoare triple {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} assume !false; {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-28 11:17:55,832 INFO L272 TraceCheckUtils]: 94: Hoare triple {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:55,833 INFO L290 TraceCheckUtils]: 95: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,833 INFO L290 TraceCheckUtils]: 96: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,833 INFO L290 TraceCheckUtils]: 97: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,833 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {19411#true} {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} #62#return; {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-28 11:17:55,833 INFO L272 TraceCheckUtils]: 99: Hoare triple {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:55,833 INFO L290 TraceCheckUtils]: 100: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,833 INFO L290 TraceCheckUtils]: 101: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,833 INFO L290 TraceCheckUtils]: 102: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,834 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {19411#true} {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} #64#return; {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-28 11:17:55,834 INFO L272 TraceCheckUtils]: 104: Hoare triple {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:55,834 INFO L290 TraceCheckUtils]: 105: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,834 INFO L290 TraceCheckUtils]: 106: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,834 INFO L290 TraceCheckUtils]: 107: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,834 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19411#true} {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} #66#return; {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-28 11:17:55,834 INFO L272 TraceCheckUtils]: 109: Hoare triple {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:55,835 INFO L290 TraceCheckUtils]: 110: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,835 INFO L290 TraceCheckUtils]: 111: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,835 INFO L290 TraceCheckUtils]: 112: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,835 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19411#true} {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} #68#return; {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-28 11:17:55,835 INFO L272 TraceCheckUtils]: 114: Hoare triple {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:55,835 INFO L290 TraceCheckUtils]: 115: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,835 INFO L290 TraceCheckUtils]: 116: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,835 INFO L290 TraceCheckUtils]: 117: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,836 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {19411#true} {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} #70#return; {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-28 11:17:55,836 INFO L290 TraceCheckUtils]: 119: Hoare triple {19695#(and (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= main_~x~0 27) (= (+ (- 2) main_~n~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; {19777#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:17:55,836 INFO L290 TraceCheckUtils]: 120: Hoare triple {19777#(and (= main_~n~0 4) (= 64 main_~x~0))} assume !false; {19777#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:17:55,836 INFO L272 TraceCheckUtils]: 121: Hoare triple {19777#(and (= main_~n~0 4) (= 64 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:55,837 INFO L290 TraceCheckUtils]: 122: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,837 INFO L290 TraceCheckUtils]: 123: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,837 INFO L290 TraceCheckUtils]: 124: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,837 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {19411#true} {19777#(and (= main_~n~0 4) (= 64 main_~x~0))} #62#return; {19777#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:17:55,837 INFO L272 TraceCheckUtils]: 126: Hoare triple {19777#(and (= main_~n~0 4) (= 64 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:55,837 INFO L290 TraceCheckUtils]: 127: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:55,837 INFO L290 TraceCheckUtils]: 128: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:55,837 INFO L290 TraceCheckUtils]: 129: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:55,838 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {19411#true} {19777#(and (= main_~n~0 4) (= 64 main_~x~0))} #64#return; {19777#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:17:55,838 INFO L272 TraceCheckUtils]: 131: Hoare triple {19777#(and (= main_~n~0 4) (= 64 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19814#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:55,838 INFO L290 TraceCheckUtils]: 132: Hoare triple {19814#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19818#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:55,839 INFO L290 TraceCheckUtils]: 133: Hoare triple {19818#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19412#false} is VALID [2022-04-28 11:17:55,839 INFO L290 TraceCheckUtils]: 134: Hoare triple {19412#false} assume !false; {19412#false} is VALID [2022-04-28 11:17:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 44 proven. 58 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-28 11:17:55,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:56,316 INFO L290 TraceCheckUtils]: 134: Hoare triple {19412#false} assume !false; {19412#false} is VALID [2022-04-28 11:17:56,316 INFO L290 TraceCheckUtils]: 133: Hoare triple {19818#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19412#false} is VALID [2022-04-28 11:17:56,317 INFO L290 TraceCheckUtils]: 132: Hoare triple {19814#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19818#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:56,317 INFO L272 TraceCheckUtils]: 131: Hoare triple {19834#(= (* 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)); {19814#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:56,318 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {19411#true} {19834#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {19834#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:17:56,318 INFO L290 TraceCheckUtils]: 129: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,318 INFO L290 TraceCheckUtils]: 128: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,318 INFO L290 TraceCheckUtils]: 127: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,318 INFO L272 TraceCheckUtils]: 126: Hoare triple {19834#(= (* 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)); {19411#true} is VALID [2022-04-28 11:17:56,318 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {19411#true} {19834#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {19834#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:17:56,318 INFO L290 TraceCheckUtils]: 124: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,318 INFO L290 TraceCheckUtils]: 123: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,318 INFO L290 TraceCheckUtils]: 122: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,318 INFO L272 TraceCheckUtils]: 121: Hoare triple {19834#(= (* 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)); {19411#true} is VALID [2022-04-28 11:17:56,319 INFO L290 TraceCheckUtils]: 120: Hoare triple {19834#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {19834#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:17:56,321 INFO L290 TraceCheckUtils]: 119: Hoare triple {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {19834#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:17:56,322 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {19411#true} {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #70#return; {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:56,322 INFO L290 TraceCheckUtils]: 117: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,322 INFO L290 TraceCheckUtils]: 116: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,322 INFO L290 TraceCheckUtils]: 115: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,322 INFO L272 TraceCheckUtils]: 114: Hoare triple {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,322 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19411#true} {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #68#return; {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:56,322 INFO L290 TraceCheckUtils]: 112: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,322 INFO L290 TraceCheckUtils]: 111: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,322 INFO L290 TraceCheckUtils]: 110: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,322 INFO L272 TraceCheckUtils]: 109: Hoare triple {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,323 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19411#true} {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #66#return; {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:56,323 INFO L290 TraceCheckUtils]: 107: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,323 INFO L290 TraceCheckUtils]: 106: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,323 INFO L290 TraceCheckUtils]: 105: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,323 INFO L272 TraceCheckUtils]: 104: Hoare triple {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,323 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {19411#true} {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #64#return; {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:56,324 INFO L290 TraceCheckUtils]: 102: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,324 INFO L290 TraceCheckUtils]: 101: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,324 INFO L290 TraceCheckUtils]: 100: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,324 INFO L272 TraceCheckUtils]: 99: Hoare triple {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,324 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {19411#true} {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #62#return; {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:56,324 INFO L290 TraceCheckUtils]: 97: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,324 INFO L290 TraceCheckUtils]: 96: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,324 INFO L290 TraceCheckUtils]: 95: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,324 INFO L272 TraceCheckUtils]: 94: Hoare triple {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,325 INFO L290 TraceCheckUtils]: 93: Hoare triple {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} assume !false; {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:56,327 INFO L290 TraceCheckUtils]: 92: Hoare triple {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~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; {19871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:56,327 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {19411#true} {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #70#return; {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:17:56,327 INFO L290 TraceCheckUtils]: 90: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,327 INFO L290 TraceCheckUtils]: 89: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,327 INFO L290 TraceCheckUtils]: 88: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,327 INFO L272 TraceCheckUtils]: 87: Hoare triple {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,328 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19411#true} {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #68#return; {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:17:56,328 INFO L290 TraceCheckUtils]: 85: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,328 INFO L290 TraceCheckUtils]: 84: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,328 INFO L290 TraceCheckUtils]: 83: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,328 INFO L272 TraceCheckUtils]: 82: Hoare triple {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~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)); {19411#true} is VALID [2022-04-28 11:17:56,328 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19411#true} {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #66#return; {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:17:56,329 INFO L290 TraceCheckUtils]: 80: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,329 INFO L290 TraceCheckUtils]: 79: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,329 INFO L290 TraceCheckUtils]: 78: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,329 INFO L272 TraceCheckUtils]: 77: Hoare triple {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,329 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19411#true} {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #64#return; {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:17:56,329 INFO L290 TraceCheckUtils]: 75: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,329 INFO L290 TraceCheckUtils]: 74: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,329 INFO L290 TraceCheckUtils]: 73: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,329 INFO L272 TraceCheckUtils]: 72: Hoare triple {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,330 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19411#true} {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #62#return; {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:17:56,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,330 INFO L290 TraceCheckUtils]: 69: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,330 INFO L290 TraceCheckUtils]: 68: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,330 INFO L272 TraceCheckUtils]: 67: Hoare triple {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,330 INFO L290 TraceCheckUtils]: 66: Hoare triple {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} assume !false; {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:17:56,333 INFO L290 TraceCheckUtils]: 65: Hoare triple {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {19953#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:17:56,333 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {19411#true} {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #70#return; {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:17:56,333 INFO L290 TraceCheckUtils]: 63: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,333 INFO L290 TraceCheckUtils]: 62: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,333 INFO L290 TraceCheckUtils]: 61: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,333 INFO L272 TraceCheckUtils]: 60: Hoare triple {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,334 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19411#true} {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #68#return; {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:17:56,334 INFO L290 TraceCheckUtils]: 58: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,334 INFO L290 TraceCheckUtils]: 57: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,334 INFO L290 TraceCheckUtils]: 56: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,334 INFO L272 TraceCheckUtils]: 55: Hoare triple {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,334 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19411#true} {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #66#return; {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:17:56,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,334 INFO L290 TraceCheckUtils]: 52: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,335 INFO L290 TraceCheckUtils]: 51: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,335 INFO L272 TraceCheckUtils]: 50: Hoare triple {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,335 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {19411#true} {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #64#return; {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:17:56,335 INFO L290 TraceCheckUtils]: 48: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,335 INFO L290 TraceCheckUtils]: 47: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,335 INFO L290 TraceCheckUtils]: 46: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,335 INFO L272 TraceCheckUtils]: 45: Hoare triple {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,336 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19411#true} {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #62#return; {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:17:56,336 INFO L290 TraceCheckUtils]: 43: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,336 INFO L290 TraceCheckUtils]: 42: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,336 INFO L272 TraceCheckUtils]: 40: Hoare triple {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} assume !false; {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:17:56,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20035#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:17:56,339 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {19411#true} {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #70#return; {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:17:56,339 INFO L290 TraceCheckUtils]: 36: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,339 INFO L272 TraceCheckUtils]: 33: Hoare triple {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,339 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19411#true} {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #68#return; {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:17:56,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,340 INFO L272 TraceCheckUtils]: 28: Hoare triple {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,340 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19411#true} {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #66#return; {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:17:56,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,340 INFO L272 TraceCheckUtils]: 23: Hoare triple {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,341 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19411#true} {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #64#return; {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:17:56,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,341 INFO L272 TraceCheckUtils]: 18: Hoare triple {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,341 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19411#true} {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #62#return; {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:17:56,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,342 INFO L272 TraceCheckUtils]: 13: Hoare triple {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} assume !false; {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:17:56,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {19411#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {20117#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:17:56,342 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19411#true} {19411#true} #60#return; {19411#true} is VALID [2022-04-28 11:17:56,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {19411#true} assume !(0 == ~cond); {19411#true} is VALID [2022-04-28 11:17:56,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {19411#true} ~cond := #in~cond; {19411#true} is VALID [2022-04-28 11:17:56,343 INFO L272 TraceCheckUtils]: 6: Hoare triple {19411#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {19411#true} is VALID [2022-04-28 11:17:56,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {19411#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; {19411#true} is VALID [2022-04-28 11:17:56,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {19411#true} call #t~ret5 := main(); {19411#true} is VALID [2022-04-28 11:17:56,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19411#true} {19411#true} #84#return; {19411#true} is VALID [2022-04-28 11:17:56,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {19411#true} assume true; {19411#true} is VALID [2022-04-28 11:17:56,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {19411#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); {19411#true} is VALID [2022-04-28 11:17:56,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {19411#true} call ULTIMATE.init(); {19411#true} is VALID [2022-04-28 11:17:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 44 proven. 58 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-28 11:17:56,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:56,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831161920] [2022-04-28 11:17:56,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:56,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694951366] [2022-04-28 11:17:56,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694951366] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:17:56,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:17:56,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 11:17:56,344 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:56,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [25876821] [2022-04-28 11:17:56,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [25876821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:56,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:56,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:17:56,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515168273] [2022-04-28 11:17:56,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:56,345 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) Word has length 135 [2022-04-28 11:17:56,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:56,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:17:56,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:56,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:17:56,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:56,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:17:56,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:17:56,410 INFO L87 Difference]: Start difference. First operand 142 states and 146 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:17:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:58,366 INFO L93 Difference]: Finished difference Result 178 states and 193 transitions. [2022-04-28 11:17:58,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:17:58,366 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) Word has length 135 [2022-04-28 11:17:58,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:17:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2022-04-28 11:17:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:17:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2022-04-28 11:17:58,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 118 transitions. [2022-04-28 11:17:58,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:58,486 INFO L225 Difference]: With dead ends: 178 [2022-04-28 11:17:58,486 INFO L226 Difference]: Without dead ends: 172 [2022-04-28 11:17:58,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:17:58,487 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 7 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:58,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 273 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 11:17:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-28 11:17:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2022-04-28 11:17:58,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:58,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 165 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 35 states have call successors, (35), 30 states have call predecessors, (35), 29 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 11:17:58,634 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 165 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 35 states have call successors, (35), 30 states have call predecessors, (35), 29 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 11:17:58,634 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 165 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 35 states have call successors, (35), 30 states have call predecessors, (35), 29 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 11:17:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:58,636 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2022-04-28 11:17:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 183 transitions. [2022-04-28 11:17:58,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:58,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:58,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 35 states have call successors, (35), 30 states have call predecessors, (35), 29 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) Second operand 172 states. [2022-04-28 11:17:58,649 INFO L87 Difference]: Start difference. First operand has 165 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 35 states have call successors, (35), 30 states have call predecessors, (35), 29 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) Second operand 172 states. [2022-04-28 11:17:58,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:58,651 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2022-04-28 11:17:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 183 transitions. [2022-04-28 11:17:58,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:58,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:58,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:58,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 35 states have call successors, (35), 30 states have call predecessors, (35), 29 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 11:17:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 170 transitions. [2022-04-28 11:17:58,654 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 170 transitions. Word has length 135 [2022-04-28 11:17:58,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:58,654 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 170 transitions. [2022-04-28 11:17:58,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:17:58,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 165 states and 170 transitions. [2022-04-28 11:18:01,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 169 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:01,466 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 170 transitions. [2022-04-28 11:18:01,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-28 11:18:01,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:01,467 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:18:01,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 11:18:01,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:01,667 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:01,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:01,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1219256746, now seen corresponding path program 21 times [2022-04-28 11:18:01,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:01,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [231948107] [2022-04-28 11:18:01,888 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:01,888 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:01,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1219256746, now seen corresponding path program 22 times [2022-04-28 11:18:01,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:01,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26247185] [2022-04-28 11:18:01,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:01,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:01,899 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:01,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [996935467] [2022-04-28 11:18:01,899 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:18:01,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:01,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:01,916 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:18:01,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 11:18:02,003 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:18:02,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:02,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 11:18:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:02,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:02,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {21266#true} call ULTIMATE.init(); {21266#true} is VALID [2022-04-28 11:18:02,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {21266#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); {21266#true} is VALID [2022-04-28 11:18:02,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21266#true} {21266#true} #84#return; {21266#true} is VALID [2022-04-28 11:18:02,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {21266#true} call #t~ret5 := main(); {21266#true} is VALID [2022-04-28 11:18:02,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {21266#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; {21266#true} is VALID [2022-04-28 11:18:02,633 INFO L272 TraceCheckUtils]: 6: Hoare triple {21266#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,634 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21266#true} {21266#true} #60#return; {21266#true} is VALID [2022-04-28 11:18:02,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {21266#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {21304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:02,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {21304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {21304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:02,634 INFO L272 TraceCheckUtils]: 13: Hoare triple {21304#(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)); {21266#true} is VALID [2022-04-28 11:18:02,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,635 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21266#true} {21304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {21304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:02,635 INFO L272 TraceCheckUtils]: 18: Hoare triple {21304#(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)); {21266#true} is VALID [2022-04-28 11:18:02,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,635 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21266#true} {21304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {21304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:02,635 INFO L272 TraceCheckUtils]: 23: Hoare triple {21304#(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)); {21266#true} is VALID [2022-04-28 11:18:02,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,636 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {21266#true} {21304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {21304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:02,636 INFO L272 TraceCheckUtils]: 28: Hoare triple {21304#(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)); {21266#true} is VALID [2022-04-28 11:18:02,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,636 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21266#true} {21304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {21304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:02,636 INFO L272 TraceCheckUtils]: 33: Hoare triple {21304#(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)); {21266#true} is VALID [2022-04-28 11:18:02,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,637 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {21266#true} {21304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {21304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:02,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {21304#(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; {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:18:02,638 INFO L290 TraceCheckUtils]: 39: Hoare triple {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} assume !false; {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:18:02,638 INFO L272 TraceCheckUtils]: 40: Hoare triple {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,638 INFO L290 TraceCheckUtils]: 41: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,638 INFO L290 TraceCheckUtils]: 43: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,638 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {21266#true} {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #62#return; {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:18:02,638 INFO L272 TraceCheckUtils]: 45: Hoare triple {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,638 INFO L290 TraceCheckUtils]: 46: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,638 INFO L290 TraceCheckUtils]: 47: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,638 INFO L290 TraceCheckUtils]: 48: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,639 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {21266#true} {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #64#return; {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:18:02,639 INFO L272 TraceCheckUtils]: 50: Hoare triple {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,639 INFO L290 TraceCheckUtils]: 51: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,639 INFO L290 TraceCheckUtils]: 52: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,639 INFO L290 TraceCheckUtils]: 53: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,639 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21266#true} {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #66#return; {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:18:02,639 INFO L272 TraceCheckUtils]: 55: Hoare triple {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,639 INFO L290 TraceCheckUtils]: 56: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,639 INFO L290 TraceCheckUtils]: 57: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,639 INFO L290 TraceCheckUtils]: 58: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,640 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21266#true} {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #68#return; {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:18:02,640 INFO L272 TraceCheckUtils]: 60: Hoare triple {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,640 INFO L290 TraceCheckUtils]: 61: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,640 INFO L290 TraceCheckUtils]: 62: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,640 INFO L290 TraceCheckUtils]: 63: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,640 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21266#true} {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #70#return; {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:18:02,641 INFO L290 TraceCheckUtils]: 65: Hoare triple {21386#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-28 11:18:02,641 INFO L290 TraceCheckUtils]: 66: Hoare triple {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !false; {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-28 11:18:02,641 INFO L272 TraceCheckUtils]: 67: Hoare triple {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,641 INFO L290 TraceCheckUtils]: 68: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,641 INFO L290 TraceCheckUtils]: 69: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,641 INFO L290 TraceCheckUtils]: 70: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,642 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21266#true} {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #62#return; {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-28 11:18:02,642 INFO L272 TraceCheckUtils]: 72: Hoare triple {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,642 INFO L290 TraceCheckUtils]: 73: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,642 INFO L290 TraceCheckUtils]: 74: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,642 INFO L290 TraceCheckUtils]: 75: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,642 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {21266#true} {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #64#return; {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-28 11:18:02,642 INFO L272 TraceCheckUtils]: 77: Hoare triple {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,642 INFO L290 TraceCheckUtils]: 78: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,642 INFO L290 TraceCheckUtils]: 79: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,642 INFO L290 TraceCheckUtils]: 80: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,643 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {21266#true} {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #66#return; {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-28 11:18:02,643 INFO L272 TraceCheckUtils]: 82: Hoare triple {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,643 INFO L290 TraceCheckUtils]: 83: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,643 INFO L290 TraceCheckUtils]: 84: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,643 INFO L290 TraceCheckUtils]: 85: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,643 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21266#true} {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #68#return; {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-28 11:18:02,643 INFO L272 TraceCheckUtils]: 87: Hoare triple {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,643 INFO L290 TraceCheckUtils]: 88: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,643 INFO L290 TraceCheckUtils]: 89: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,643 INFO L290 TraceCheckUtils]: 90: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,644 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21266#true} {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #70#return; {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-28 11:18:02,644 INFO L290 TraceCheckUtils]: 92: Hoare triple {21468#(and (= main_~z~0 18) (= (+ main_~x~0 (- 8)) 0) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} is VALID [2022-04-28 11:18:02,645 INFO L290 TraceCheckUtils]: 93: Hoare triple {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} assume !false; {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} is VALID [2022-04-28 11:18:02,645 INFO L272 TraceCheckUtils]: 94: Hoare triple {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,645 INFO L290 TraceCheckUtils]: 95: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,645 INFO L290 TraceCheckUtils]: 96: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,645 INFO L290 TraceCheckUtils]: 97: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,645 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {21266#true} {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} #62#return; {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} is VALID [2022-04-28 11:18:02,645 INFO L272 TraceCheckUtils]: 99: Hoare triple {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,645 INFO L290 TraceCheckUtils]: 100: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,645 INFO L290 TraceCheckUtils]: 101: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,645 INFO L290 TraceCheckUtils]: 102: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,646 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {21266#true} {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} #64#return; {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} is VALID [2022-04-28 11:18:02,646 INFO L272 TraceCheckUtils]: 104: Hoare triple {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,646 INFO L290 TraceCheckUtils]: 105: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,646 INFO L290 TraceCheckUtils]: 106: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,646 INFO L290 TraceCheckUtils]: 107: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,646 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {21266#true} {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} #66#return; {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} is VALID [2022-04-28 11:18:02,646 INFO L272 TraceCheckUtils]: 109: Hoare triple {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ 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)); {21266#true} is VALID [2022-04-28 11:18:02,646 INFO L290 TraceCheckUtils]: 110: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,646 INFO L290 TraceCheckUtils]: 111: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,646 INFO L290 TraceCheckUtils]: 112: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,647 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {21266#true} {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} #68#return; {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} is VALID [2022-04-28 11:18:02,647 INFO L272 TraceCheckUtils]: 114: Hoare triple {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,647 INFO L290 TraceCheckUtils]: 115: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,647 INFO L290 TraceCheckUtils]: 116: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,647 INFO L290 TraceCheckUtils]: 117: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,647 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21266#true} {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} #70#return; {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))))} is VALID [2022-04-28 11:18:02,648 INFO L290 TraceCheckUtils]: 119: Hoare triple {21550#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= main_~n~0 3) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~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; {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} is VALID [2022-04-28 11:18:02,648 INFO L290 TraceCheckUtils]: 120: Hoare triple {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} assume !false; {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} is VALID [2022-04-28 11:18:02,648 INFO L272 TraceCheckUtils]: 121: Hoare triple {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,648 INFO L290 TraceCheckUtils]: 122: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,648 INFO L290 TraceCheckUtils]: 123: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,648 INFO L290 TraceCheckUtils]: 124: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,648 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {21266#true} {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} #62#return; {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} is VALID [2022-04-28 11:18:02,649 INFO L272 TraceCheckUtils]: 126: Hoare triple {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,649 INFO L290 TraceCheckUtils]: 127: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,649 INFO L290 TraceCheckUtils]: 128: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,649 INFO L290 TraceCheckUtils]: 129: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,649 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {21266#true} {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} #64#return; {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} is VALID [2022-04-28 11:18:02,649 INFO L272 TraceCheckUtils]: 131: Hoare triple {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,649 INFO L290 TraceCheckUtils]: 132: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,649 INFO L290 TraceCheckUtils]: 133: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,649 INFO L290 TraceCheckUtils]: 134: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,649 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {21266#true} {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} #66#return; {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} is VALID [2022-04-28 11:18:02,650 INFO L272 TraceCheckUtils]: 136: Hoare triple {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 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)); {21266#true} is VALID [2022-04-28 11:18:02,650 INFO L290 TraceCheckUtils]: 137: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,650 INFO L290 TraceCheckUtils]: 138: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,650 INFO L290 TraceCheckUtils]: 139: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,650 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {21266#true} {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} #68#return; {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} is VALID [2022-04-28 11:18:02,650 INFO L272 TraceCheckUtils]: 141: Hoare triple {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,650 INFO L290 TraceCheckUtils]: 142: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,650 INFO L290 TraceCheckUtils]: 143: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,650 INFO L290 TraceCheckUtils]: 144: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,651 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {21266#true} {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} #70#return; {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 main_~x~0))} is VALID [2022-04-28 11:18:02,651 INFO L290 TraceCheckUtils]: 146: Hoare triple {21632#(and (= main_~y~0 61) (= 3 (+ (- 1) main_~n~0)) (= 64 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; {21714#(and (= 64 (+ (- 61) main_~x~0)) (= 5 main_~n~0))} is VALID [2022-04-28 11:18:02,651 INFO L290 TraceCheckUtils]: 147: Hoare triple {21714#(and (= 64 (+ (- 61) main_~x~0)) (= 5 main_~n~0))} assume !false; {21714#(and (= 64 (+ (- 61) main_~x~0)) (= 5 main_~n~0))} is VALID [2022-04-28 11:18:02,651 INFO L272 TraceCheckUtils]: 148: Hoare triple {21714#(and (= 64 (+ (- 61) main_~x~0)) (= 5 main_~n~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,651 INFO L290 TraceCheckUtils]: 149: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,651 INFO L290 TraceCheckUtils]: 150: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,651 INFO L290 TraceCheckUtils]: 151: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,652 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {21266#true} {21714#(and (= 64 (+ (- 61) main_~x~0)) (= 5 main_~n~0))} #62#return; {21714#(and (= 64 (+ (- 61) main_~x~0)) (= 5 main_~n~0))} is VALID [2022-04-28 11:18:02,652 INFO L272 TraceCheckUtils]: 153: Hoare triple {21714#(and (= 64 (+ (- 61) main_~x~0)) (= 5 main_~n~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:02,652 INFO L290 TraceCheckUtils]: 154: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:02,652 INFO L290 TraceCheckUtils]: 155: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:02,652 INFO L290 TraceCheckUtils]: 156: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:02,652 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {21266#true} {21714#(and (= 64 (+ (- 61) main_~x~0)) (= 5 main_~n~0))} #64#return; {21714#(and (= 64 (+ (- 61) main_~x~0)) (= 5 main_~n~0))} is VALID [2022-04-28 11:18:02,653 INFO L272 TraceCheckUtils]: 158: Hoare triple {21714#(and (= 64 (+ (- 61) main_~x~0)) (= 5 main_~n~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21751#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:02,653 INFO L290 TraceCheckUtils]: 159: Hoare triple {21751#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21755#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:02,653 INFO L290 TraceCheckUtils]: 160: Hoare triple {21755#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21267#false} is VALID [2022-04-28 11:18:02,653 INFO L290 TraceCheckUtils]: 161: Hoare triple {21267#false} assume !false; {21267#false} is VALID [2022-04-28 11:18:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 54 proven. 90 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-04-28 11:18:02,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:03,023 INFO L290 TraceCheckUtils]: 161: Hoare triple {21267#false} assume !false; {21267#false} is VALID [2022-04-28 11:18:03,024 INFO L290 TraceCheckUtils]: 160: Hoare triple {21755#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21267#false} is VALID [2022-04-28 11:18:03,024 INFO L290 TraceCheckUtils]: 159: Hoare triple {21751#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21755#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:03,024 INFO L272 TraceCheckUtils]: 158: Hoare triple {21771#(= (* 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)); {21751#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:03,024 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {21266#true} {21771#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {21771#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:18:03,025 INFO L290 TraceCheckUtils]: 156: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,025 INFO L290 TraceCheckUtils]: 155: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,025 INFO L290 TraceCheckUtils]: 154: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,025 INFO L272 TraceCheckUtils]: 153: Hoare triple {21771#(= (* 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)); {21266#true} is VALID [2022-04-28 11:18:03,025 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {21266#true} {21771#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {21771#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:18:03,025 INFO L290 TraceCheckUtils]: 151: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,025 INFO L290 TraceCheckUtils]: 150: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,025 INFO L290 TraceCheckUtils]: 149: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,025 INFO L272 TraceCheckUtils]: 148: Hoare triple {21771#(= (* 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)); {21266#true} is VALID [2022-04-28 11:18:03,025 INFO L290 TraceCheckUtils]: 147: Hoare triple {21771#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {21771#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:18:03,027 INFO L290 TraceCheckUtils]: 146: Hoare triple {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21771#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:18:03,027 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {21266#true} {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:03,027 INFO L290 TraceCheckUtils]: 144: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,027 INFO L290 TraceCheckUtils]: 143: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,028 INFO L290 TraceCheckUtils]: 142: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,028 INFO L272 TraceCheckUtils]: 141: Hoare triple {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,028 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {21266#true} {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:03,028 INFO L290 TraceCheckUtils]: 139: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,028 INFO L290 TraceCheckUtils]: 138: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,028 INFO L290 TraceCheckUtils]: 137: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,028 INFO L272 TraceCheckUtils]: 136: Hoare triple {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,028 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {21266#true} {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:03,028 INFO L290 TraceCheckUtils]: 134: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,028 INFO L290 TraceCheckUtils]: 133: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,029 INFO L290 TraceCheckUtils]: 132: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,029 INFO L272 TraceCheckUtils]: 131: Hoare triple {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,029 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {21266#true} {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:03,029 INFO L290 TraceCheckUtils]: 129: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,029 INFO L290 TraceCheckUtils]: 128: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,029 INFO L290 TraceCheckUtils]: 127: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,029 INFO L272 TraceCheckUtils]: 126: Hoare triple {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,029 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {21266#true} {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:03,029 INFO L290 TraceCheckUtils]: 124: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,029 INFO L290 TraceCheckUtils]: 123: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,030 INFO L290 TraceCheckUtils]: 122: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,030 INFO L272 TraceCheckUtils]: 121: Hoare triple {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,030 INFO L290 TraceCheckUtils]: 120: Hoare triple {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:03,032 INFO L290 TraceCheckUtils]: 119: Hoare triple {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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; {21808#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:03,032 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21266#true} {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:18:03,032 INFO L290 TraceCheckUtils]: 117: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,032 INFO L290 TraceCheckUtils]: 116: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,032 INFO L290 TraceCheckUtils]: 115: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,033 INFO L272 TraceCheckUtils]: 114: Hoare triple {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,033 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {21266#true} {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:18:03,033 INFO L290 TraceCheckUtils]: 112: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,033 INFO L290 TraceCheckUtils]: 111: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,033 INFO L290 TraceCheckUtils]: 110: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,033 INFO L272 TraceCheckUtils]: 109: Hoare triple {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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)); {21266#true} is VALID [2022-04-28 11:18:03,033 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {21266#true} {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:18:03,033 INFO L290 TraceCheckUtils]: 107: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,033 INFO L290 TraceCheckUtils]: 106: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,033 INFO L290 TraceCheckUtils]: 105: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,033 INFO L272 TraceCheckUtils]: 104: Hoare triple {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,034 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {21266#true} {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:18:03,034 INFO L290 TraceCheckUtils]: 102: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,034 INFO L290 TraceCheckUtils]: 101: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,034 INFO L290 TraceCheckUtils]: 100: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,034 INFO L272 TraceCheckUtils]: 99: Hoare triple {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,034 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {21266#true} {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:18:03,034 INFO L290 TraceCheckUtils]: 97: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,034 INFO L290 TraceCheckUtils]: 96: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,034 INFO L290 TraceCheckUtils]: 95: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,034 INFO L272 TraceCheckUtils]: 94: Hoare triple {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,035 INFO L290 TraceCheckUtils]: 93: Hoare triple {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:18:03,038 INFO L290 TraceCheckUtils]: 92: Hoare triple {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~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; {21890#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:18:03,038 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21266#true} {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #70#return; {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:18:03,038 INFO L290 TraceCheckUtils]: 90: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,038 INFO L290 TraceCheckUtils]: 89: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,038 INFO L290 TraceCheckUtils]: 88: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,038 INFO L272 TraceCheckUtils]: 87: Hoare triple {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,038 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21266#true} {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #68#return; {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:18:03,038 INFO L290 TraceCheckUtils]: 85: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,038 INFO L290 TraceCheckUtils]: 84: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,039 INFO L290 TraceCheckUtils]: 83: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,039 INFO L272 TraceCheckUtils]: 82: Hoare triple {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ 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)); {21266#true} is VALID [2022-04-28 11:18:03,039 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {21266#true} {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #66#return; {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:18:03,039 INFO L290 TraceCheckUtils]: 80: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,039 INFO L290 TraceCheckUtils]: 79: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,039 INFO L290 TraceCheckUtils]: 78: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,039 INFO L272 TraceCheckUtils]: 77: Hoare triple {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,039 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {21266#true} {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #64#return; {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:18:03,039 INFO L290 TraceCheckUtils]: 75: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,039 INFO L290 TraceCheckUtils]: 74: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,040 INFO L290 TraceCheckUtils]: 73: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,040 INFO L272 TraceCheckUtils]: 72: Hoare triple {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,040 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21266#true} {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #62#return; {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:18:03,040 INFO L290 TraceCheckUtils]: 70: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,040 INFO L290 TraceCheckUtils]: 69: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,040 INFO L290 TraceCheckUtils]: 68: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,040 INFO L272 TraceCheckUtils]: 67: Hoare triple {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,040 INFO L290 TraceCheckUtils]: 66: Hoare triple {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} assume !false; {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:18:03,042 INFO L290 TraceCheckUtils]: 65: Hoare triple {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~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; {21972#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:18:03,043 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21266#true} {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #70#return; {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:18:03,043 INFO L290 TraceCheckUtils]: 63: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,043 INFO L290 TraceCheckUtils]: 62: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,043 INFO L272 TraceCheckUtils]: 60: Hoare triple {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,043 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21266#true} {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #68#return; {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:18:03,043 INFO L290 TraceCheckUtils]: 58: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,043 INFO L290 TraceCheckUtils]: 57: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,043 INFO L290 TraceCheckUtils]: 56: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,043 INFO L272 TraceCheckUtils]: 55: Hoare triple {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~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)); {21266#true} is VALID [2022-04-28 11:18:03,044 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21266#true} {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #66#return; {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:18:03,044 INFO L290 TraceCheckUtils]: 53: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,044 INFO L290 TraceCheckUtils]: 52: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,044 INFO L290 TraceCheckUtils]: 51: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,044 INFO L272 TraceCheckUtils]: 50: Hoare triple {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,044 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {21266#true} {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #64#return; {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:18:03,044 INFO L290 TraceCheckUtils]: 48: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,044 INFO L290 TraceCheckUtils]: 47: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,044 INFO L290 TraceCheckUtils]: 46: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,044 INFO L272 TraceCheckUtils]: 45: Hoare triple {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,045 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {21266#true} {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #62#return; {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:18:03,045 INFO L290 TraceCheckUtils]: 43: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,045 INFO L272 TraceCheckUtils]: 40: Hoare triple {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} assume !false; {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:18:03,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {22054#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:18:03,047 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {21266#true} {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #70#return; {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:18:03,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,048 INFO L272 TraceCheckUtils]: 33: Hoare triple {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,048 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21266#true} {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #68#return; {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:18:03,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,048 INFO L272 TraceCheckUtils]: 28: Hoare triple {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,048 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {21266#true} {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #66#return; {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:18:03,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,049 INFO L272 TraceCheckUtils]: 23: Hoare triple {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,049 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21266#true} {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #64#return; {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:18:03,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,049 INFO L272 TraceCheckUtils]: 18: Hoare triple {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,049 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21266#true} {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #62#return; {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:18:03,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,050 INFO L272 TraceCheckUtils]: 13: Hoare triple {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} assume !false; {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:18:03,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {21266#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {22136#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:18:03,050 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21266#true} {21266#true} #60#return; {21266#true} is VALID [2022-04-28 11:18:03,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {21266#true} assume !(0 == ~cond); {21266#true} is VALID [2022-04-28 11:18:03,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {21266#true} ~cond := #in~cond; {21266#true} is VALID [2022-04-28 11:18:03,050 INFO L272 TraceCheckUtils]: 6: Hoare triple {21266#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {21266#true} is VALID [2022-04-28 11:18:03,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {21266#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; {21266#true} is VALID [2022-04-28 11:18:03,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {21266#true} call #t~ret5 := main(); {21266#true} is VALID [2022-04-28 11:18:03,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21266#true} {21266#true} #84#return; {21266#true} is VALID [2022-04-28 11:18:03,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {21266#true} assume true; {21266#true} is VALID [2022-04-28 11:18:03,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {21266#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); {21266#true} is VALID [2022-04-28 11:18:03,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {21266#true} call ULTIMATE.init(); {21266#true} is VALID [2022-04-28 11:18:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 54 proven. 90 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-04-28 11:18:03,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:03,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26247185] [2022-04-28 11:18:03,051 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:03,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996935467] [2022-04-28 11:18:03,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996935467] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:18:03,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:18:03,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-28 11:18:03,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:03,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [231948107] [2022-04-28 11:18:03,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [231948107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:03,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:03,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:18:03,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838906721] [2022-04-28 11:18:03,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:03,053 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) Word has length 162 [2022-04-28 11:18:03,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:03,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:18:03,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:03,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:18:03,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:03,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:18:03,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:18:03,106 INFO L87 Difference]: Start difference. First operand 165 states and 170 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:18:06,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:06,993 INFO L93 Difference]: Finished difference Result 193 states and 211 transitions. [2022-04-28 11:18:06,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:18:06,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) Word has length 162 [2022-04-28 11:18:06,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:18:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2022-04-28 11:18:06,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:18:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2022-04-28 11:18:06,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 130 transitions. [2022-04-28 11:18:07,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:07,141 INFO L225 Difference]: With dead ends: 193 [2022-04-28 11:18:07,141 INFO L226 Difference]: Without dead ends: 191 [2022-04-28 11:18:07,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:18:07,142 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 7 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:18:07,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 324 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 11:18:07,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-28 11:18:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 180. [2022-04-28 11:18:07,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:07,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 180 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 40 states have call successors, (40), 32 states have call predecessors, (40), 31 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 11:18:07,345 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 180 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 40 states have call successors, (40), 32 states have call predecessors, (40), 31 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 11:18:07,345 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 180 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 40 states have call successors, (40), 32 states have call predecessors, (40), 31 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 11:18:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:07,349 INFO L93 Difference]: Finished difference Result 191 states and 209 transitions. [2022-04-28 11:18:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 209 transitions. [2022-04-28 11:18:07,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:07,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:07,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 40 states have call successors, (40), 32 states have call predecessors, (40), 31 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) Second operand 191 states. [2022-04-28 11:18:07,350 INFO L87 Difference]: Start difference. First operand has 180 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 40 states have call successors, (40), 32 states have call predecessors, (40), 31 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) Second operand 191 states. [2022-04-28 11:18:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:07,355 INFO L93 Difference]: Finished difference Result 191 states and 209 transitions. [2022-04-28 11:18:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 209 transitions. [2022-04-28 11:18:07,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:07,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:07,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:07,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 40 states have call successors, (40), 32 states have call predecessors, (40), 31 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 11:18:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 189 transitions. [2022-04-28 11:18:07,359 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 189 transitions. Word has length 162 [2022-04-28 11:18:07,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:07,359 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 189 transitions. [2022-04-28 11:18:07,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:18:07,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 180 states and 189 transitions. [2022-04-28 11:18:09,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 188 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 189 transitions. [2022-04-28 11:18:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-04-28 11:18:09,948 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:09,948 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:18:09,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 11:18:10,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 11:18:10,149 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:10,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1267842796, now seen corresponding path program 1 times [2022-04-28 11:18:10,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:10,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [918167571] [2022-04-28 11:18:10,451 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:10,451 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:10,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1267842796, now seen corresponding path program 2 times [2022-04-28 11:18:10,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:10,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212150510] [2022-04-28 11:18:10,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:10,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:10,459 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:10,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072850067] [2022-04-28 11:18:10,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:18:10,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:10,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:10,460 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:18:10,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 11:18:10,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:18:10,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:10,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 11:18:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:10,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:17,448 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:18:17,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {23383#true} call ULTIMATE.init(); {23383#true} is VALID [2022-04-28 11:18:17,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {23383#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); {23383#true} is VALID [2022-04-28 11:18:17,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23383#true} {23383#true} #84#return; {23383#true} is VALID [2022-04-28 11:18:17,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {23383#true} call #t~ret5 := main(); {23383#true} is VALID [2022-04-28 11:18:17,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {23383#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; {23383#true} is VALID [2022-04-28 11:18:17,521 INFO L272 TraceCheckUtils]: 6: Hoare triple {23383#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,521 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23383#true} {23383#true} #60#return; {23383#true} is VALID [2022-04-28 11:18:17,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {23383#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {23421#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:17,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {23421#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {23421#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:17,522 INFO L272 TraceCheckUtils]: 13: Hoare triple {23421#(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)); {23383#true} is VALID [2022-04-28 11:18:17,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,523 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {23383#true} {23421#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {23421#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:17,523 INFO L272 TraceCheckUtils]: 18: Hoare triple {23421#(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)); {23383#true} is VALID [2022-04-28 11:18:17,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,523 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {23383#true} {23421#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {23421#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:17,523 INFO L272 TraceCheckUtils]: 23: Hoare triple {23421#(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)); {23383#true} is VALID [2022-04-28 11:18:17,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,524 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {23383#true} {23421#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {23421#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:17,524 INFO L272 TraceCheckUtils]: 28: Hoare triple {23421#(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)); {23383#true} is VALID [2022-04-28 11:18:17,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,525 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23383#true} {23421#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {23421#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:17,525 INFO L272 TraceCheckUtils]: 33: Hoare triple {23421#(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)); {23383#true} is VALID [2022-04-28 11:18:17,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,525 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23383#true} {23421#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {23421#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:17,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {23421#(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; {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:17,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !false; {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:17,526 INFO L272 TraceCheckUtils]: 40: Hoare triple {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,527 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {23383#true} {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #62#return; {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:17,527 INFO L272 TraceCheckUtils]: 45: Hoare triple {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,527 INFO L290 TraceCheckUtils]: 48: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,528 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {23383#true} {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #64#return; {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:17,528 INFO L272 TraceCheckUtils]: 50: Hoare triple {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,528 INFO L290 TraceCheckUtils]: 51: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,528 INFO L290 TraceCheckUtils]: 52: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,528 INFO L290 TraceCheckUtils]: 53: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,528 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {23383#true} {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #66#return; {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:17,528 INFO L272 TraceCheckUtils]: 55: Hoare triple {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,528 INFO L290 TraceCheckUtils]: 56: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,529 INFO L290 TraceCheckUtils]: 57: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,529 INFO L290 TraceCheckUtils]: 58: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,529 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23383#true} {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #68#return; {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:17,529 INFO L272 TraceCheckUtils]: 60: Hoare triple {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,529 INFO L290 TraceCheckUtils]: 61: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,529 INFO L290 TraceCheckUtils]: 62: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,529 INFO L290 TraceCheckUtils]: 63: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,530 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {23383#true} {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #70#return; {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:17,530 INFO L290 TraceCheckUtils]: 65: Hoare triple {23503#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} is VALID [2022-04-28 11:18:17,531 INFO L290 TraceCheckUtils]: 66: Hoare triple {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} assume !false; {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} is VALID [2022-04-28 11:18:17,531 INFO L272 TraceCheckUtils]: 67: Hoare triple {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,531 INFO L290 TraceCheckUtils]: 68: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,531 INFO L290 TraceCheckUtils]: 69: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,531 INFO L290 TraceCheckUtils]: 70: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,531 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23383#true} {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} #62#return; {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} is VALID [2022-04-28 11:18:17,531 INFO L272 TraceCheckUtils]: 72: Hoare triple {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,531 INFO L290 TraceCheckUtils]: 73: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,531 INFO L290 TraceCheckUtils]: 74: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,531 INFO L290 TraceCheckUtils]: 75: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,532 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {23383#true} {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} #64#return; {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} is VALID [2022-04-28 11:18:17,532 INFO L272 TraceCheckUtils]: 77: Hoare triple {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,532 INFO L290 TraceCheckUtils]: 78: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,532 INFO L290 TraceCheckUtils]: 79: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,532 INFO L290 TraceCheckUtils]: 80: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,533 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {23383#true} {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} #66#return; {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} is VALID [2022-04-28 11:18:17,533 INFO L272 TraceCheckUtils]: 82: Hoare triple {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) 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)); {23383#true} is VALID [2022-04-28 11:18:17,533 INFO L290 TraceCheckUtils]: 83: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,533 INFO L290 TraceCheckUtils]: 84: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,533 INFO L290 TraceCheckUtils]: 85: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,533 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {23383#true} {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} #68#return; {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} is VALID [2022-04-28 11:18:17,533 INFO L272 TraceCheckUtils]: 87: Hoare triple {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,533 INFO L290 TraceCheckUtils]: 88: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,533 INFO L290 TraceCheckUtils]: 89: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,533 INFO L290 TraceCheckUtils]: 90: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,534 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {23383#true} {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} #70#return; {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0))} is VALID [2022-04-28 11:18:17,534 INFO L290 TraceCheckUtils]: 92: Hoare triple {23585#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) 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; {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:18:17,535 INFO L290 TraceCheckUtils]: 93: Hoare triple {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} assume !false; {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:18:17,535 INFO L272 TraceCheckUtils]: 94: Hoare triple {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,535 INFO L290 TraceCheckUtils]: 95: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,535 INFO L290 TraceCheckUtils]: 96: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,535 INFO L290 TraceCheckUtils]: 97: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,535 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23383#true} {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #62#return; {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:18:17,535 INFO L272 TraceCheckUtils]: 99: Hoare triple {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,535 INFO L290 TraceCheckUtils]: 100: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,535 INFO L290 TraceCheckUtils]: 101: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,536 INFO L290 TraceCheckUtils]: 102: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,536 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {23383#true} {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #64#return; {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:18:17,536 INFO L272 TraceCheckUtils]: 104: Hoare triple {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,536 INFO L290 TraceCheckUtils]: 105: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,536 INFO L290 TraceCheckUtils]: 106: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,536 INFO L290 TraceCheckUtils]: 107: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,537 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {23383#true} {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #66#return; {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:18:17,537 INFO L272 TraceCheckUtils]: 109: Hoare triple {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,537 INFO L290 TraceCheckUtils]: 110: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,537 INFO L290 TraceCheckUtils]: 111: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,537 INFO L290 TraceCheckUtils]: 112: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,537 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {23383#true} {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #68#return; {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:18:17,537 INFO L272 TraceCheckUtils]: 114: Hoare triple {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,537 INFO L290 TraceCheckUtils]: 115: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,537 INFO L290 TraceCheckUtils]: 116: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,538 INFO L290 TraceCheckUtils]: 117: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,538 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {23383#true} {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #70#return; {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:18:17,538 INFO L290 TraceCheckUtils]: 119: Hoare triple {23667#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} is VALID [2022-04-28 11:18:17,539 INFO L290 TraceCheckUtils]: 120: Hoare triple {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} assume !false; {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} is VALID [2022-04-28 11:18:17,539 INFO L272 TraceCheckUtils]: 121: Hoare triple {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,539 INFO L290 TraceCheckUtils]: 122: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,539 INFO L290 TraceCheckUtils]: 123: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,539 INFO L290 TraceCheckUtils]: 124: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,540 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {23383#true} {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} #62#return; {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} is VALID [2022-04-28 11:18:17,540 INFO L272 TraceCheckUtils]: 126: Hoare triple {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,540 INFO L290 TraceCheckUtils]: 127: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,540 INFO L290 TraceCheckUtils]: 128: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,540 INFO L290 TraceCheckUtils]: 129: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,540 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {23383#true} {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} #64#return; {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} is VALID [2022-04-28 11:18:17,540 INFO L272 TraceCheckUtils]: 131: Hoare triple {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,540 INFO L290 TraceCheckUtils]: 132: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,540 INFO L290 TraceCheckUtils]: 133: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,540 INFO L290 TraceCheckUtils]: 134: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,541 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {23383#true} {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} #66#return; {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} is VALID [2022-04-28 11:18:17,541 INFO L272 TraceCheckUtils]: 136: Hoare triple {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 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)); {23383#true} is VALID [2022-04-28 11:18:17,541 INFO L290 TraceCheckUtils]: 137: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,541 INFO L290 TraceCheckUtils]: 138: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,541 INFO L290 TraceCheckUtils]: 139: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,542 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {23383#true} {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} #68#return; {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} is VALID [2022-04-28 11:18:17,542 INFO L272 TraceCheckUtils]: 141: Hoare triple {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,542 INFO L290 TraceCheckUtils]: 142: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,542 INFO L290 TraceCheckUtils]: 143: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,542 INFO L290 TraceCheckUtils]: 144: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,542 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {23383#true} {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} #70#return; {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} is VALID [2022-04-28 11:18:17,543 INFO L290 TraceCheckUtils]: 146: Hoare triple {23749#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (<= main_~n~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} assume !(~n~0 <= ~a~0); {23831#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (< main_~a~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} is VALID [2022-04-28 11:18:17,543 INFO L272 TraceCheckUtils]: 147: Hoare triple {23831#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (< main_~a~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,543 INFO L290 TraceCheckUtils]: 148: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,543 INFO L290 TraceCheckUtils]: 149: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,543 INFO L290 TraceCheckUtils]: 150: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,544 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {23383#true} {23831#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (< main_~a~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} #72#return; {23831#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (< main_~a~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} is VALID [2022-04-28 11:18:17,544 INFO L272 TraceCheckUtils]: 152: Hoare triple {23831#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (< main_~a~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,544 INFO L290 TraceCheckUtils]: 153: Hoare triple {23383#true} ~cond := #in~cond; {23853#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:17,544 INFO L290 TraceCheckUtils]: 154: Hoare triple {23853#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23857#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:17,544 INFO L290 TraceCheckUtils]: 155: Hoare triple {23857#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23857#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:17,545 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {23857#(not (= |__VERIFIER_assert_#in~cond| 0))} {23831#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 3)) main_~y~0) (< main_~a~0 4) (= (+ (- 27) main_~x~0) 37) (= 30 main_~z~0))} #74#return; {23864#(and (= main_~x~0 (+ main_~y~0 3)) (= 64 main_~x~0) (= 30 main_~z~0))} is VALID [2022-04-28 11:18:17,545 INFO L272 TraceCheckUtils]: 157: Hoare triple {23864#(and (= main_~x~0 (+ main_~y~0 3)) (= 64 main_~x~0) (= 30 main_~z~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {23383#true} is VALID [2022-04-28 11:18:17,545 INFO L290 TraceCheckUtils]: 158: Hoare triple {23383#true} ~cond := #in~cond; {23383#true} is VALID [2022-04-28 11:18:17,545 INFO L290 TraceCheckUtils]: 159: Hoare triple {23383#true} assume !(0 == ~cond); {23383#true} is VALID [2022-04-28 11:18:17,545 INFO L290 TraceCheckUtils]: 160: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 11:18:17,546 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {23383#true} {23864#(and (= main_~x~0 (+ main_~y~0 3)) (= 64 main_~x~0) (= 30 main_~z~0))} #76#return; {23864#(and (= main_~x~0 (+ main_~y~0 3)) (= 64 main_~x~0) (= 30 main_~z~0))} is VALID [2022-04-28 11:18:17,551 INFO L272 TraceCheckUtils]: 162: Hoare triple {23864#(and (= main_~x~0 (+ main_~y~0 3)) (= 64 main_~x~0) (= 30 main_~z~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)); {23883#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:17,551 INFO L290 TraceCheckUtils]: 163: Hoare triple {23883#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23887#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:17,551 INFO L290 TraceCheckUtils]: 164: Hoare triple {23887#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23384#false} is VALID [2022-04-28 11:18:17,552 INFO L290 TraceCheckUtils]: 165: Hoare triple {23384#false} assume !false; {23384#false} is VALID [2022-04-28 11:18:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 133 proven. 74 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2022-04-28 11:18:17,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:34,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:34,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212150510] [2022-04-28 11:18:34,711 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:34,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072850067] [2022-04-28 11:18:34,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072850067] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:18:34,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:18:34,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 11:18:34,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:34,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [918167571] [2022-04-28 11:18:34,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [918167571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:34,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:34,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 11:18:34,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328146151] [2022-04-28 11:18:34,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:34,712 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) Word has length 166 [2022-04-28 11:18:34,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:34,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2022-04-28 11:18:34,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:34,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 11:18:34,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:34,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 11:18:34,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:18:34,794 INFO L87 Difference]: Start difference. First operand 180 states and 189 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2022-04-28 11:18:37,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:37,117 INFO L93 Difference]: Finished difference Result 206 states and 213 transitions. [2022-04-28 11:18:37,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:18:37,117 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) Word has length 166 [2022-04-28 11:18:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2022-04-28 11:18:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2022-04-28 11:18:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2022-04-28 11:18:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2022-04-28 11:18:37,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 110 transitions. [2022-04-28 11:18:37,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:37,210 INFO L225 Difference]: With dead ends: 206 [2022-04-28 11:18:37,210 INFO L226 Difference]: Without dead ends: 188 [2022-04-28 11:18:37,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-04-28 11:18:37,210 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 11:18:37,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 233 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 11:18:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-04-28 11:18:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-04-28 11:18:37,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:37,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 188 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 40 states have call successors, (40), 34 states have call predecessors, (40), 33 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 11:18:37,428 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 188 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 40 states have call successors, (40), 34 states have call predecessors, (40), 33 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 11:18:37,428 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 188 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 40 states have call successors, (40), 34 states have call predecessors, (40), 33 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 11:18:37,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:37,430 INFO L93 Difference]: Finished difference Result 188 states and 194 transitions. [2022-04-28 11:18:37,430 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 194 transitions. [2022-04-28 11:18:37,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:37,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:37,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 40 states have call successors, (40), 34 states have call predecessors, (40), 33 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) Second operand 188 states. [2022-04-28 11:18:37,431 INFO L87 Difference]: Start difference. First operand has 188 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 40 states have call successors, (40), 34 states have call predecessors, (40), 33 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) Second operand 188 states. [2022-04-28 11:18:37,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:37,433 INFO L93 Difference]: Finished difference Result 188 states and 194 transitions. [2022-04-28 11:18:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 194 transitions. [2022-04-28 11:18:37,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:37,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:37,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:37,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 40 states have call successors, (40), 34 states have call predecessors, (40), 33 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 11:18:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 194 transitions. [2022-04-28 11:18:37,436 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 194 transitions. Word has length 166 [2022-04-28 11:18:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:37,436 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 194 transitions. [2022-04-28 11:18:37,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2022-04-28 11:18:37,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 188 states and 194 transitions. [2022-04-28 11:18:40,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 193 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 194 transitions. [2022-04-28 11:18:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-04-28 11:18:40,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:40,713 INFO L195 NwaCegarLoop]: trace histogram [33, 32, 32, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:18:40,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 11:18:40,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-28 11:18:40,914 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:40,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:40,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1777251365, now seen corresponding path program 23 times [2022-04-28 11:18:40,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:40,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [773724156] [2022-04-28 11:18:41,166 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:41,166 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1777251365, now seen corresponding path program 24 times [2022-04-28 11:18:41,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:41,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173352222] [2022-04-28 11:18:41,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:41,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:41,175 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:41,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [535310782] [2022-04-28 11:18:41,175 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:18:41,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:41,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:41,176 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:18:41,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 11:18:42,050 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:18:42,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:42,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 11:18:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:42,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:43,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {25212#true} call ULTIMATE.init(); {25212#true} is VALID [2022-04-28 11:18:43,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {25212#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); {25212#true} is VALID [2022-04-28 11:18:43,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25212#true} {25212#true} #84#return; {25212#true} is VALID [2022-04-28 11:18:43,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {25212#true} call #t~ret5 := main(); {25212#true} is VALID [2022-04-28 11:18:43,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {25212#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; {25212#true} is VALID [2022-04-28 11:18:43,378 INFO L272 TraceCheckUtils]: 6: Hoare triple {25212#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {25212#true} ~cond := #in~cond; {25238#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:18:43,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {25238#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {25242#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:18:43,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {25242#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {25242#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:18:43,379 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25242#(not (= |assume_abort_if_not_#in~cond| 0))} {25212#true} #60#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,379 INFO L272 TraceCheckUtils]: 13: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,380 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,380 INFO L272 TraceCheckUtils]: 18: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,380 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,380 INFO L272 TraceCheckUtils]: 23: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,381 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,381 INFO L272 TraceCheckUtils]: 28: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~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)); {25212#true} is VALID [2022-04-28 11:18:43,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,381 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,381 INFO L272 TraceCheckUtils]: 33: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,382 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,382 INFO L290 TraceCheckUtils]: 38: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~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; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,382 INFO L272 TraceCheckUtils]: 40: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,382 INFO L290 TraceCheckUtils]: 42: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,383 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,383 INFO L272 TraceCheckUtils]: 45: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,383 INFO L290 TraceCheckUtils]: 46: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,383 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,383 INFO L272 TraceCheckUtils]: 50: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,383 INFO L290 TraceCheckUtils]: 52: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,383 INFO L290 TraceCheckUtils]: 53: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,384 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,384 INFO L272 TraceCheckUtils]: 55: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~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)); {25212#true} is VALID [2022-04-28 11:18:43,384 INFO L290 TraceCheckUtils]: 56: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,384 INFO L290 TraceCheckUtils]: 57: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,384 INFO L290 TraceCheckUtils]: 58: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,384 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,384 INFO L272 TraceCheckUtils]: 60: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,384 INFO L290 TraceCheckUtils]: 61: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,384 INFO L290 TraceCheckUtils]: 62: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,384 INFO L290 TraceCheckUtils]: 63: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,385 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,385 INFO L290 TraceCheckUtils]: 65: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~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; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,385 INFO L290 TraceCheckUtils]: 66: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,385 INFO L272 TraceCheckUtils]: 67: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,385 INFO L290 TraceCheckUtils]: 68: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,385 INFO L290 TraceCheckUtils]: 69: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,385 INFO L290 TraceCheckUtils]: 70: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,386 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,386 INFO L272 TraceCheckUtils]: 72: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,386 INFO L290 TraceCheckUtils]: 73: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,386 INFO L290 TraceCheckUtils]: 74: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,386 INFO L290 TraceCheckUtils]: 75: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,387 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,387 INFO L272 TraceCheckUtils]: 77: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,387 INFO L290 TraceCheckUtils]: 78: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,387 INFO L290 TraceCheckUtils]: 79: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,387 INFO L290 TraceCheckUtils]: 80: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,387 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,387 INFO L272 TraceCheckUtils]: 82: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~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)); {25212#true} is VALID [2022-04-28 11:18:43,387 INFO L290 TraceCheckUtils]: 83: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,387 INFO L290 TraceCheckUtils]: 84: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,387 INFO L290 TraceCheckUtils]: 85: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,388 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,388 INFO L272 TraceCheckUtils]: 87: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,388 INFO L290 TraceCheckUtils]: 88: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,388 INFO L290 TraceCheckUtils]: 89: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,388 INFO L290 TraceCheckUtils]: 90: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,388 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,388 INFO L290 TraceCheckUtils]: 92: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~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; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,389 INFO L290 TraceCheckUtils]: 93: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,389 INFO L272 TraceCheckUtils]: 94: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,389 INFO L290 TraceCheckUtils]: 95: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,389 INFO L290 TraceCheckUtils]: 96: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,389 INFO L290 TraceCheckUtils]: 97: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,389 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,389 INFO L272 TraceCheckUtils]: 99: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,389 INFO L290 TraceCheckUtils]: 100: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,389 INFO L290 TraceCheckUtils]: 101: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,389 INFO L290 TraceCheckUtils]: 102: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,390 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,390 INFO L272 TraceCheckUtils]: 104: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,390 INFO L290 TraceCheckUtils]: 105: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,390 INFO L290 TraceCheckUtils]: 106: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,390 INFO L290 TraceCheckUtils]: 107: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,390 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,390 INFO L272 TraceCheckUtils]: 109: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~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)); {25212#true} is VALID [2022-04-28 11:18:43,390 INFO L290 TraceCheckUtils]: 110: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,390 INFO L290 TraceCheckUtils]: 111: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,403 INFO L290 TraceCheckUtils]: 112: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,403 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,403 INFO L272 TraceCheckUtils]: 114: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,403 INFO L290 TraceCheckUtils]: 115: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,403 INFO L290 TraceCheckUtils]: 116: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,403 INFO L290 TraceCheckUtils]: 117: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,404 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,404 INFO L290 TraceCheckUtils]: 119: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~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; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,404 INFO L290 TraceCheckUtils]: 120: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,404 INFO L272 TraceCheckUtils]: 121: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,404 INFO L290 TraceCheckUtils]: 122: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,404 INFO L290 TraceCheckUtils]: 123: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,404 INFO L290 TraceCheckUtils]: 124: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,407 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,408 INFO L272 TraceCheckUtils]: 126: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,408 INFO L290 TraceCheckUtils]: 127: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,408 INFO L290 TraceCheckUtils]: 128: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,408 INFO L290 TraceCheckUtils]: 129: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,408 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,408 INFO L272 TraceCheckUtils]: 131: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,408 INFO L290 TraceCheckUtils]: 132: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,408 INFO L290 TraceCheckUtils]: 133: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,408 INFO L290 TraceCheckUtils]: 134: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,409 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,409 INFO L272 TraceCheckUtils]: 136: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~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)); {25212#true} is VALID [2022-04-28 11:18:43,409 INFO L290 TraceCheckUtils]: 137: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:43,409 INFO L290 TraceCheckUtils]: 138: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:43,409 INFO L290 TraceCheckUtils]: 139: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:43,410 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25212#true} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:43,410 INFO L272 TraceCheckUtils]: 141: Hoare triple {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:43,410 INFO L290 TraceCheckUtils]: 142: Hoare triple {25212#true} ~cond := #in~cond; {25646#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:43,410 INFO L290 TraceCheckUtils]: 143: Hoare triple {25646#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:43,410 INFO L290 TraceCheckUtils]: 144: Hoare triple {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:43,411 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} {25249#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {25657#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:45,414 WARN L290 TraceCheckUtils]: 146: Hoare triple {25657#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~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; {25661#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (<= 0 main_~a~0) (<= main_~a~0 10))} is UNKNOWN [2022-04-28 11:18:45,414 INFO L290 TraceCheckUtils]: 147: Hoare triple {25661#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {25661#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:45,415 INFO L272 TraceCheckUtils]: 148: Hoare triple {25661#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:45,415 INFO L290 TraceCheckUtils]: 149: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:45,415 INFO L290 TraceCheckUtils]: 150: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:45,415 INFO L290 TraceCheckUtils]: 151: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:45,415 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {25212#true} {25661#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {25661#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:45,415 INFO L272 TraceCheckUtils]: 153: Hoare triple {25661#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:45,415 INFO L290 TraceCheckUtils]: 154: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:45,415 INFO L290 TraceCheckUtils]: 155: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:45,415 INFO L290 TraceCheckUtils]: 156: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:45,416 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25212#true} {25661#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {25661#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:45,416 INFO L272 TraceCheckUtils]: 158: Hoare triple {25661#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:45,416 INFO L290 TraceCheckUtils]: 159: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:18:45,416 INFO L290 TraceCheckUtils]: 160: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:18:45,416 INFO L290 TraceCheckUtils]: 161: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:18:45,417 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {25212#true} {25661#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {25661#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:45,417 INFO L272 TraceCheckUtils]: 163: Hoare triple {25661#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (<= 0 main_~a~0) (<= main_~a~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)); {25212#true} is VALID [2022-04-28 11:18:45,417 INFO L290 TraceCheckUtils]: 164: Hoare triple {25212#true} ~cond := #in~cond; {25646#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:45,417 INFO L290 TraceCheckUtils]: 165: Hoare triple {25646#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:45,418 INFO L290 TraceCheckUtils]: 166: Hoare triple {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:45,418 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} {25661#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {25725#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:45,418 INFO L272 TraceCheckUtils]: 168: Hoare triple {25725#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:45,419 INFO L290 TraceCheckUtils]: 169: Hoare triple {25212#true} ~cond := #in~cond; {25646#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:45,419 INFO L290 TraceCheckUtils]: 170: Hoare triple {25646#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:45,419 INFO L290 TraceCheckUtils]: 171: Hoare triple {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:45,420 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} {25725#(and (= (mod (+ (* main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0) (<= (+ main_~z~0 (div (+ (* main_~z~0 main_~z~0) 84 (* main_~z~0 (- 18))) 12)) (+ main_~y~0 6)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {25741#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-28 11:18:45,440 INFO L290 TraceCheckUtils]: 173: Hoare triple {25741#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0) (<= main_~a~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; {25745#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~n~0 11))} is VALID [2022-04-28 11:18:45,441 INFO L290 TraceCheckUtils]: 174: Hoare triple {25745#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~n~0 11))} assume !false; {25745#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~n~0 11))} is VALID [2022-04-28 11:18:45,441 INFO L272 TraceCheckUtils]: 175: Hoare triple {25745#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~n~0 11))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:45,441 INFO L290 TraceCheckUtils]: 176: Hoare triple {25212#true} ~cond := #in~cond; {25646#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:45,441 INFO L290 TraceCheckUtils]: 177: Hoare triple {25646#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:45,442 INFO L290 TraceCheckUtils]: 178: Hoare triple {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:45,445 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} {25745#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~n~0 11))} #62#return; {25764#(and (= (+ (* main_~x~0 18) 6 (* main_~n~0 36) (* main_~y~0 (- 6))) (+ (* main_~n~0 12) (* (+ main_~y~0 (* main_~n~0 (- 6))) (* main_~n~0 6)))) (<= main_~n~0 11) (= (+ (* main_~y~0 12) (* main_~n~0 (- 36))) (+ (* (* main_~n~0 6) (* main_~n~0 6)) 12)))} is VALID [2022-04-28 11:18:45,445 INFO L272 TraceCheckUtils]: 180: Hoare triple {25764#(and (= (+ (* main_~x~0 18) 6 (* main_~n~0 36) (* main_~y~0 (- 6))) (+ (* main_~n~0 12) (* (+ main_~y~0 (* main_~n~0 (- 6))) (* main_~n~0 6)))) (<= main_~n~0 11) (= (+ (* main_~y~0 12) (* main_~n~0 (- 36))) (+ (* (* main_~n~0 6) (* main_~n~0 6)) 12)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:18:45,445 INFO L290 TraceCheckUtils]: 181: Hoare triple {25212#true} ~cond := #in~cond; {25646#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:45,446 INFO L290 TraceCheckUtils]: 182: Hoare triple {25646#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:45,446 INFO L290 TraceCheckUtils]: 183: Hoare triple {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:45,448 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} {25764#(and (= (+ (* main_~x~0 18) 6 (* main_~n~0 36) (* main_~y~0 (- 6))) (+ (* main_~n~0 12) (* (+ main_~y~0 (* main_~n~0 (- 6))) (* main_~n~0 6)))) (<= main_~n~0 11) (= (+ (* main_~y~0 12) (* main_~n~0 (- 36))) (+ (* (* main_~n~0 6) (* main_~n~0 6)) 12)))} #64#return; {25780#(and (= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18)) (<= main_~n~0 11))} is VALID [2022-04-28 11:18:45,448 INFO L272 TraceCheckUtils]: 185: Hoare triple {25780#(and (= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18)) (<= main_~n~0 11))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25784#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:45,449 INFO L290 TraceCheckUtils]: 186: Hoare triple {25784#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25788#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:45,449 INFO L290 TraceCheckUtils]: 187: Hoare triple {25788#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25213#false} is VALID [2022-04-28 11:18:45,449 INFO L290 TraceCheckUtils]: 188: Hoare triple {25213#false} assume !false; {25213#false} is VALID [2022-04-28 11:18:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 494 proven. 38 refuted. 0 times theorem prover too weak. 1645 trivial. 0 not checked. [2022-04-28 11:18:45,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:22:10,461 INFO L290 TraceCheckUtils]: 188: Hoare triple {25213#false} assume !false; {25213#false} is VALID [2022-04-28 11:22:10,461 INFO L290 TraceCheckUtils]: 187: Hoare triple {25788#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25213#false} is VALID [2022-04-28 11:22:10,462 INFO L290 TraceCheckUtils]: 186: Hoare triple {25784#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25788#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:10,462 INFO L272 TraceCheckUtils]: 185: Hoare triple {25804#(= (* 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)); {25784#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:10,463 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} {25808#(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))} #64#return; {25804#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:22:10,463 INFO L290 TraceCheckUtils]: 183: Hoare triple {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:10,463 INFO L290 TraceCheckUtils]: 182: Hoare triple {25818#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:10,463 INFO L290 TraceCheckUtils]: 181: Hoare triple {25212#true} ~cond := #in~cond; {25818#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:22:10,464 INFO L272 TraceCheckUtils]: 180: Hoare triple {25808#(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)); {25212#true} is VALID [2022-04-28 11:22:10,464 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} {25825#(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))} #62#return; {25808#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:22:10,464 INFO L290 TraceCheckUtils]: 178: Hoare triple {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:10,465 INFO L290 TraceCheckUtils]: 177: Hoare triple {25818#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:10,465 INFO L290 TraceCheckUtils]: 176: Hoare triple {25212#true} ~cond := #in~cond; {25818#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:22:10,465 INFO L272 TraceCheckUtils]: 175: Hoare triple {25825#(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)); {25212#true} is VALID [2022-04-28 11:22:10,466 INFO L290 TraceCheckUtils]: 174: Hoare triple {25825#(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 !false; {25825#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:22:10,547 INFO L290 TraceCheckUtils]: 173: Hoare triple {25844#(or (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 0)) (not (= (+ main_~z~0 main_~y~0) (+ (* (div (+ main_~z~0 (- 6)) 6) 3) 4 (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 3)))) (= (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) (+ main_~y~0 main_~x~0)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25825#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:22:10,547 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25212#true} {25844#(or (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 0)) (not (= (+ main_~z~0 main_~y~0) (+ (* (div (+ main_~z~0 (- 6)) 6) 3) 4 (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 3)))) (= (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) (+ main_~y~0 main_~x~0)))} #70#return; {25844#(or (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 0)) (not (= (+ main_~z~0 main_~y~0) (+ (* (div (+ main_~z~0 (- 6)) 6) 3) 4 (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 3)))) (= (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 11:22:10,547 INFO L290 TraceCheckUtils]: 171: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:10,547 INFO L290 TraceCheckUtils]: 170: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:10,547 INFO L290 TraceCheckUtils]: 169: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:10,548 INFO L272 TraceCheckUtils]: 168: Hoare triple {25844#(or (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 0)) (not (= (+ main_~z~0 main_~y~0) (+ (* (div (+ main_~z~0 (- 6)) 6) 3) 4 (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 3)))) (= (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) (+ main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,136 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} {25212#true} #68#return; {25844#(or (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 0)) (not (= (+ main_~z~0 main_~y~0) (+ (* (div (+ main_~z~0 (- 6)) 6) 3) 4 (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 3)))) (= (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 11:22:12,136 INFO L290 TraceCheckUtils]: 166: Hoare triple {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:12,137 INFO L290 TraceCheckUtils]: 165: Hoare triple {25818#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:12,137 INFO L290 TraceCheckUtils]: 164: Hoare triple {25212#true} ~cond := #in~cond; {25818#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:22:12,137 INFO L272 TraceCheckUtils]: 163: Hoare triple {25212#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,137 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {25212#true} {25212#true} #66#return; {25212#true} is VALID [2022-04-28 11:22:12,137 INFO L290 TraceCheckUtils]: 161: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,137 INFO L290 TraceCheckUtils]: 160: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,137 INFO L290 TraceCheckUtils]: 159: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,137 INFO L272 TraceCheckUtils]: 158: Hoare triple {25212#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,137 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25212#true} {25212#true} #64#return; {25212#true} is VALID [2022-04-28 11:22:12,137 INFO L290 TraceCheckUtils]: 156: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,137 INFO L290 TraceCheckUtils]: 155: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,137 INFO L290 TraceCheckUtils]: 154: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,137 INFO L272 TraceCheckUtils]: 153: Hoare triple {25212#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {25212#true} {25212#true} #62#return; {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L290 TraceCheckUtils]: 151: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L290 TraceCheckUtils]: 150: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L290 TraceCheckUtils]: 149: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L272 TraceCheckUtils]: 148: Hoare triple {25212#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L290 TraceCheckUtils]: 147: Hoare triple {25212#true} assume !false; {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L290 TraceCheckUtils]: 146: Hoare triple {25212#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; {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25212#true} {25212#true} #70#return; {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L290 TraceCheckUtils]: 144: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L290 TraceCheckUtils]: 143: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L290 TraceCheckUtils]: 142: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L272 TraceCheckUtils]: 141: Hoare triple {25212#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25212#true} {25212#true} #68#return; {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L290 TraceCheckUtils]: 139: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L290 TraceCheckUtils]: 138: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L290 TraceCheckUtils]: 137: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L272 TraceCheckUtils]: 136: Hoare triple {25212#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25212#true} {25212#true} #66#return; {25212#true} is VALID [2022-04-28 11:22:12,138 INFO L290 TraceCheckUtils]: 134: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L290 TraceCheckUtils]: 133: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L290 TraceCheckUtils]: 132: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L272 TraceCheckUtils]: 131: Hoare triple {25212#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25212#true} {25212#true} #64#return; {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L290 TraceCheckUtils]: 129: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L290 TraceCheckUtils]: 128: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L290 TraceCheckUtils]: 127: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L272 TraceCheckUtils]: 126: Hoare triple {25212#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {25212#true} {25212#true} #62#return; {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L290 TraceCheckUtils]: 124: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L290 TraceCheckUtils]: 123: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L290 TraceCheckUtils]: 122: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L272 TraceCheckUtils]: 121: Hoare triple {25212#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L290 TraceCheckUtils]: 120: Hoare triple {25212#true} assume !false; {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L290 TraceCheckUtils]: 119: Hoare triple {25212#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; {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {25212#true} {25212#true} #70#return; {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L290 TraceCheckUtils]: 117: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,139 INFO L290 TraceCheckUtils]: 116: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L290 TraceCheckUtils]: 115: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L272 TraceCheckUtils]: 114: Hoare triple {25212#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {25212#true} {25212#true} #68#return; {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L290 TraceCheckUtils]: 112: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L290 TraceCheckUtils]: 111: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L290 TraceCheckUtils]: 110: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L272 TraceCheckUtils]: 109: Hoare triple {25212#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {25212#true} {25212#true} #66#return; {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L290 TraceCheckUtils]: 107: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L290 TraceCheckUtils]: 106: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L290 TraceCheckUtils]: 105: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L272 TraceCheckUtils]: 104: Hoare triple {25212#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25212#true} {25212#true} #64#return; {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L290 TraceCheckUtils]: 102: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L290 TraceCheckUtils]: 101: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L290 TraceCheckUtils]: 100: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L272 TraceCheckUtils]: 99: Hoare triple {25212#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25212#true} {25212#true} #62#return; {25212#true} is VALID [2022-04-28 11:22:12,140 INFO L290 TraceCheckUtils]: 97: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L290 TraceCheckUtils]: 96: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L290 TraceCheckUtils]: 95: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L272 TraceCheckUtils]: 94: Hoare triple {25212#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L290 TraceCheckUtils]: 93: Hoare triple {25212#true} assume !false; {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L290 TraceCheckUtils]: 92: Hoare triple {25212#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; {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {25212#true} {25212#true} #70#return; {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L290 TraceCheckUtils]: 90: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L290 TraceCheckUtils]: 89: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L290 TraceCheckUtils]: 88: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L272 TraceCheckUtils]: 87: Hoare triple {25212#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {25212#true} {25212#true} #68#return; {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L290 TraceCheckUtils]: 85: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L290 TraceCheckUtils]: 84: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L290 TraceCheckUtils]: 83: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L272 TraceCheckUtils]: 82: Hoare triple {25212#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25212#true} {25212#true} #66#return; {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L290 TraceCheckUtils]: 80: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L290 TraceCheckUtils]: 79: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,141 INFO L290 TraceCheckUtils]: 78: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L272 TraceCheckUtils]: 77: Hoare triple {25212#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {25212#true} {25212#true} #64#return; {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L290 TraceCheckUtils]: 75: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L290 TraceCheckUtils]: 74: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L290 TraceCheckUtils]: 73: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L272 TraceCheckUtils]: 72: Hoare triple {25212#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25212#true} {25212#true} #62#return; {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L290 TraceCheckUtils]: 70: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L290 TraceCheckUtils]: 69: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L290 TraceCheckUtils]: 68: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L272 TraceCheckUtils]: 67: Hoare triple {25212#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {25212#true} assume !false; {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L290 TraceCheckUtils]: 65: Hoare triple {25212#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; {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25212#true} {25212#true} #70#return; {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L290 TraceCheckUtils]: 63: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L290 TraceCheckUtils]: 62: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L290 TraceCheckUtils]: 61: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,142 INFO L272 TraceCheckUtils]: 60: Hoare triple {25212#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25212#true} {25212#true} #68#return; {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L290 TraceCheckUtils]: 58: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L290 TraceCheckUtils]: 57: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L290 TraceCheckUtils]: 56: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L272 TraceCheckUtils]: 55: Hoare triple {25212#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {25212#true} {25212#true} #66#return; {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L290 TraceCheckUtils]: 53: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L290 TraceCheckUtils]: 52: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L290 TraceCheckUtils]: 51: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L272 TraceCheckUtils]: 50: Hoare triple {25212#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {25212#true} {25212#true} #64#return; {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L290 TraceCheckUtils]: 48: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L290 TraceCheckUtils]: 47: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L290 TraceCheckUtils]: 46: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L272 TraceCheckUtils]: 45: Hoare triple {25212#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {25212#true} {25212#true} #62#return; {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L290 TraceCheckUtils]: 43: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,143 INFO L290 TraceCheckUtils]: 42: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L272 TraceCheckUtils]: 40: Hoare triple {25212#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L290 TraceCheckUtils]: 39: Hoare triple {25212#true} assume !false; {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {25212#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; {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25212#true} {25212#true} #70#return; {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L290 TraceCheckUtils]: 36: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L272 TraceCheckUtils]: 33: Hoare triple {25212#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25212#true} {25212#true} #68#return; {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L272 TraceCheckUtils]: 28: Hoare triple {25212#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25212#true} {25212#true} #66#return; {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,144 INFO L272 TraceCheckUtils]: 23: Hoare triple {25212#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {25212#true} {25212#true} #64#return; {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L272 TraceCheckUtils]: 18: Hoare triple {25212#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25212#true} {25212#true} #62#return; {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L272 TraceCheckUtils]: 13: Hoare triple {25212#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {25212#true} assume !false; {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {25212#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25212#true} {25212#true} #60#return; {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {25212#true} assume !(0 == ~cond); {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {25212#true} ~cond := #in~cond; {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L272 TraceCheckUtils]: 6: Hoare triple {25212#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {25212#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; {25212#true} is VALID [2022-04-28 11:22:12,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {25212#true} call #t~ret5 := main(); {25212#true} is VALID [2022-04-28 11:22:12,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25212#true} {25212#true} #84#return; {25212#true} is VALID [2022-04-28 11:22:12,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {25212#true} assume true; {25212#true} is VALID [2022-04-28 11:22:12,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {25212#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); {25212#true} is VALID [2022-04-28 11:22:12,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {25212#true} call ULTIMATE.init(); {25212#true} is VALID [2022-04-28 11:22:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 353 proven. 6 refuted. 0 times theorem prover too weak. 1818 trivial. 0 not checked. [2022-04-28 11:22:12,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:12,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173352222] [2022-04-28 11:22:12,147 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:12,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535310782] [2022-04-28 11:22:12,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535310782] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:22:12,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:22:12,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 21 [2022-04-28 11:22:12,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:12,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [773724156] [2022-04-28 11:22:12,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [773724156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:12,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:12,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 11:22:12,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209629477] [2022-04-28 11:22:12,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:12,148 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) Word has length 189 [2022-04-28 11:22:12,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:12,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 11:22:14,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:14,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 11:22:14,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:14,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 11:22:14,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=352, Unknown=1, NotChecked=0, Total=420 [2022-04-28 11:22:14,258 INFO L87 Difference]: Start difference. First operand 188 states and 194 transitions. Second operand has 16 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 11:22:18,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:20,609 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:22,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:24,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:27,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:29,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:31,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:35,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:35,642 INFO L93 Difference]: Finished difference Result 188 states and 194 transitions. [2022-04-28 11:22:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:22:35,642 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) Word has length 189 [2022-04-28 11:22:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 11:22:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-28 11:22:35,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 11:22:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-28 11:22:35,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-04-28 11:22:35,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:35,916 INFO L225 Difference]: With dead ends: 188 [2022-04-28 11:22:35,916 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 11:22:35,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 357 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=98, Invalid=501, Unknown=1, NotChecked=0, Total=600 [2022-04-28 11:22:35,917 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 55 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:35,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 100 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 16.3s Time] [2022-04-28 11:22:35,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 11:22:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 11:22:35,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:35,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:22:35,918 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:22:35,918 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:22:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:35,918 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:22:35,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:22:35,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:35,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:35,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:22:35,918 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:22:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:35,918 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:22:35,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:22:35,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:35,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:35,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:35,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:22:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 11:22:35,918 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 189 [2022-04-28 11:22:35,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:35,919 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 11:22:35,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 11:22:35,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 11:22:35,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:35,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:22:35,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:35,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:22:35,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 11:22:36,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:36,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 11:22:47,382 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 11:22:47,382 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 11:22:47,382 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 11:22:47,382 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-28 11:22:47,382 INFO L895 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 11:22:47,382 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 11:22:47,383 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 11:22:47,383 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (let ((.cse0 (* main_~y~0 12))) (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) .cse0 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10) (= .cse0 (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36))))) [2022-04-28 11:22:47,383 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 46) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (= main_~x~0 (* .cse1 .cse1 .cse1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse1 (+ main_~a~0 1)) (< main_~a~0 .cse1) (<= main_~a~0 10))))) [2022-04-28 11:22:47,383 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 56) the Hoare annotation is: true [2022-04-28 11:22:47,383 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (= main_~x~0 (let ((.cse0 (div (+ main_~z~0 (- 6)) 6))) (* .cse0 .cse0 .cse0))) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0)) [2022-04-28 11:22:47,383 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (and .cse0 (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6))) (and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) .cse0 (= main_~x~0 8)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (= main_~x~0 (* .cse1 .cse1 .cse1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse1 (+ main_~a~0 1)) (< main_~a~0 .cse1) (<= main_~a~0 10))))) [2022-04-28 11:22:47,383 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (= main_~x~0 (* .cse1 .cse1 .cse1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse1 (+ main_~a~0 1)) (< main_~a~0 .cse1) (<= main_~a~0 10))))) [2022-04-28 11:22:47,383 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 56) the Hoare annotation is: true [2022-04-28 11:22:47,383 INFO L895 garLoopResultBuilder]: At program point L38(lines 33 46) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= main_~x~0 (let ((.cse0 (div (+ main_~z~0 (- 6)) 6))) (* .cse0 .cse0 .cse0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:22:47,383 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= main_~x~0 (let ((.cse0 (div (+ main_~z~0 (- 6)) 6))) (* .cse0 .cse0 .cse0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:22:47,383 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (* main_~y~0 12))) (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) .cse0 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10) (= .cse0 (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36))))) [2022-04-28 11:22:47,383 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (* main_~y~0 12))) (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) .cse0 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10) (= .cse0 (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36))))) [2022-04-28 11:22:47,384 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 56) the Hoare annotation is: true [2022-04-28 11:22:47,384 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (* (- 1) main_~a~0))) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ .cse0 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) .cse0) 65536) 1)) (< main_~a~0 0)))) [2022-04-28 11:22:47,384 INFO L895 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 0 main_~a~0) (<= main_~a~0 10)) [2022-04-28 11:22:47,384 INFO L902 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: true [2022-04-28 11:22:47,384 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (and (= main_~x~0 (let ((.cse0 (div (+ main_~z~0 (- 6)) 6))) (* .cse0 .cse0 .cse0))) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0)) [2022-04-28 11:22:47,384 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (= main_~x~0 (* .cse1 .cse1 .cse1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse1 (+ main_~a~0 1)) (< main_~a~0 .cse1) (<= main_~a~0 10))))) [2022-04-28 11:22:47,384 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= main_~x~0 (let ((.cse0 (div (+ main_~z~0 (- 6)) 6))) (* .cse0 .cse0 .cse0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:22:47,384 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (* main_~y~0 12))) (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) .cse0 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10) (= .cse0 (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36))))) [2022-04-28 11:22:47,384 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:22:47,384 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 11:22:47,384 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:22:47,384 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:22:47,384 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 11:22:47,384 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 11:22:47,384 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:22:47,384 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 11:22:47,384 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 11:22:47,384 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 11:22:47,384 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 11:22:47,385 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 11:22:47,385 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 11:22:47,388 INFO L356 BasicCegarLoop]: Path program histogram: [24, 6, 6, 2, 2, 2, 2, 2, 2] [2022-04-28 11:22:47,389 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:22:47,392 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:22:47,394 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 11:22:49,625 INFO L163 areAnnotationChecker]: CFG has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 11:22:49,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:22:49 BoogieIcfgContainer [2022-04-28 11:22:49,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:22:49,644 INFO L158 Benchmark]: Toolchain (without parser) took 482878.07ms. Allocated memory was 194.0MB in the beginning and 377.5MB in the end (delta: 183.5MB). Free memory was 147.1MB in the beginning and 282.9MB in the end (delta: -135.8MB). Peak memory consumption was 208.0MB. Max. memory is 8.0GB. [2022-04-28 11:22:49,644 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 194.0MB. Free memory is still 163.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:22:49,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.53ms. Allocated memory is still 194.0MB. Free memory was 146.9MB in the beginning and 171.1MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 11:22:49,646 INFO L158 Benchmark]: Boogie Preprocessor took 17.85ms. Allocated memory is still 194.0MB. Free memory was 171.1MB in the beginning and 169.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 11:22:49,646 INFO L158 Benchmark]: RCFGBuilder took 208.66ms. Allocated memory is still 194.0MB. Free memory was 169.4MB in the beginning and 158.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 11:22:49,646 INFO L158 Benchmark]: TraceAbstraction took 482456.68ms. Allocated memory was 194.0MB in the beginning and 377.5MB in the end (delta: 183.5MB). Free memory was 157.5MB in the beginning and 282.9MB in the end (delta: -125.4MB). Peak memory consumption was 218.9MB. Max. memory is 8.0GB. [2022-04-28 11:22:49,652 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.12ms. Allocated memory is still 194.0MB. Free memory is still 163.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.53ms. Allocated memory is still 194.0MB. Free memory was 146.9MB in the beginning and 171.1MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.85ms. Allocated memory is still 194.0MB. Free memory was 171.1MB in the beginning and 169.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 208.66ms. Allocated memory is still 194.0MB. Free memory was 169.4MB in the beginning and 158.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 482456.68ms. Allocated memory was 194.0MB in the beginning and 377.5MB in the end (delta: 183.5MB). Free memory was 157.5MB in the beginning and 282.9MB in the end (delta: -125.4MB). Peak memory consumption was 218.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 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 480.1s, OverallIterations: 24, TraceHistogramMax: 33, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 101.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 21 mSolverCounterUnknown, 383 SdHoareTripleChecker+Valid, 61.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 4079 SdHoareTripleChecker+Invalid, 61.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2951 mSDsCounter, 414 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5839 IncrementalHoareTripleChecker+Invalid, 6274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 414 mSolverCounterUnsat, 1128 mSDtfsCounter, 5839 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3734 GetRequests, 3436 SyntacticMatches, 26 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 23.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=23, InterpolantAutomatonStates: 191, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 89 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 486 PreInvPairs, 730 NumberOfFragments, 934 HoareAnnotationTreeSize, 486 FomulaSimplifications, 6195 FormulaSimplificationTreeSizeReduction, 7.2s HoareSimplificationTime, 36 FomulaSimplificationsInter, 211400 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((n <= a + 1 && x * 18 + y * 12 + 6 == z * 2 + z * y) && n * 6 + 6 == z) && 0 <= a) && a <= 10) && y * 12 == 36 * (n * n) + 12 + n * 36 - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (\old(cond) == cond || !(1 <= \old(cond))) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-04-28 11:22:49,712 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...