/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_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:15:39,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:15:39,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:15:39,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:15:39,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:15:39,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:15:39,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:15:39,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:15:39,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:15:39,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:15:39,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:15:39,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:15:39,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:15:39,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:15:39,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:15:39,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:15:39,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:15:39,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:15:39,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:15:39,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:15:39,969 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:15:39,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:15:39,970 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:15:39,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:15:39,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:15:39,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:15:39,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:15:39,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:15:39,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:15:39,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:15:39,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:15:39,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:15:39,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:15:39,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:15:39,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:15:39,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:15:39,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:15:39,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:15:39,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:15:39,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:15:39,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:15:39,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:15:39,985 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:15:39,992 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:15:39,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:15:39,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:15:39,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:15:39,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:15:39,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:15:39,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:15:39,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:15:39,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:15:39,995 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:15:39,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:15:39,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:15:39,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:15:39,995 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:15:39,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:15:39,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:15:39,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:15:39,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:15:39,995 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:15:39,995 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:15:39,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:15:39,996 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:15:39,996 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:15:40,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:15:40,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:15:40,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:15:40,203 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:15:40,204 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:15:40,204 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound2.c [2022-04-28 11:15:40,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b00920cd8/d763154d46b746fba74fb5eb95e65cfc/FLAG682143c78 [2022-04-28 11:15:40,636 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:15:40,636 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound2.c [2022-04-28 11:15:40,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b00920cd8/d763154d46b746fba74fb5eb95e65cfc/FLAG682143c78 [2022-04-28 11:15:40,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b00920cd8/d763154d46b746fba74fb5eb95e65cfc [2022-04-28 11:15:40,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:15:40,655 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:15:40,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:15:40,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:15:40,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:15:40,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:15:40" (1/1) ... [2022-04-28 11:15:40,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36b02a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:40, skipping insertion in model container [2022-04-28 11:15:40,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:15:40" (1/1) ... [2022-04-28 11:15:40,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:15:40,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:15:40,809 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_valuebound2.c[588,601] [2022-04-28 11:15:40,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:15:40,829 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:15:40,837 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_valuebound2.c[588,601] [2022-04-28 11:15:40,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:15:40,853 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:15:40,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:40 WrapperNode [2022-04-28 11:15:40,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:15:40,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:15:40,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:15:40,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:15:40,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:40" (1/1) ... [2022-04-28 11:15:40,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:40" (1/1) ... [2022-04-28 11:15:40,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:40" (1/1) ... [2022-04-28 11:15:40,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:40" (1/1) ... [2022-04-28 11:15:40,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:40" (1/1) ... [2022-04-28 11:15:40,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:40" (1/1) ... [2022-04-28 11:15:40,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:40" (1/1) ... [2022-04-28 11:15:40,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:15:40,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:15:40,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:15:40,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:15:40,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:40" (1/1) ... [2022-04-28 11:15:40,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:15:40,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:40,917 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:15:40,923 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:15:40,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:15:40,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:15:40,948 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:15:40,948 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:15:40,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:15:40,949 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:15:40,949 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:15:40,949 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:15:40,950 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:15:40,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:15:40,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-28 11:15:40,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:15:40,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:15:40,950 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:15:40,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:15:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:15:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:15:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:15:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:15:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:15:40,999 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:15:41,000 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:15:41,154 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:15:41,159 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:15:41,170 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 11:15:41,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:15:41 BoogieIcfgContainer [2022-04-28 11:15:41,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:15:41,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:15:41,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:15:41,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:15:41,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:15:40" (1/3) ... [2022-04-28 11:15:41,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20abf371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:15:41, skipping insertion in model container [2022-04-28 11:15:41,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:40" (2/3) ... [2022-04-28 11:15:41,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20abf371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:15:41, skipping insertion in model container [2022-04-28 11:15:41,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:15:41" (3/3) ... [2022-04-28 11:15:41,177 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound2.c [2022-04-28 11:15:41,186 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:15:41,186 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:15:41,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:15:41,224 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@4d1028cd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7cc38a3c [2022-04-28 11:15:41,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:15:41,236 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:15:41,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:15:41,240 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:41,241 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:15:41,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:41,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 1 times [2022-04-28 11:15:41,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:41,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [40004501] [2022-04-28 11:15:41,259 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:15:41,259 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 2 times [2022-04-28 11:15:41,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:41,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951858698] [2022-04-28 11:15:41,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:41,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:41,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:15:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:41,420 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:15:41,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 11:15:41,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-28 11:15:41,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:15:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:41,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 11:15:41,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 11:15:41,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 11:15:41,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-28 11:15:41,434 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:15:41,434 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:15:41,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 11:15:41,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-28 11:15:41,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret5 := main(); {39#true} is VALID [2022-04-28 11:15:41,436 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:15:41,436 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {39#true} is VALID [2022-04-28 11:15:41,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 11:15:41,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 11:15:41,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 11:15:41,437 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-28 11:15:41,438 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:15:41,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-04-28 11:15:41,438 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:15:41,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-28 11:15:41,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-28 11:15:41,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-28 11:15:41,439 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:15:41,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:41,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951858698] [2022-04-28 11:15:41,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951858698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:41,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:41,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:15:41,442 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:41,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [40004501] [2022-04-28 11:15:41,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [40004501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:41,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:41,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:15:41,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595666743] [2022-04-28 11:15:41,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:41,447 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:15:41,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:41,450 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:15:41,476 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:15:41,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:15:41,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:41,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:15:41,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:15:41,496 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:15:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:41,698 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-04-28 11:15:41,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:15:41,700 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:15:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:41,701 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:15:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:15:41,713 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:15:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:15:41,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 11:15:41,883 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:15:41,889 INFO L225 Difference]: With dead ends: 63 [2022-04-28 11:15:41,889 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 11:15:41,891 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:15:41,894 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:15:41,894 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:15:41,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 11:15:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 11:15:41,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:41,924 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:15:41,925 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:15:41,925 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:15:41,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:41,929 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-28 11:15:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:15:41,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:41,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:41,930 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:15:41,931 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:15:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:41,934 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-28 11:15:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:15:41,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:41,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:41,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:41,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:41,936 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:15:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-04-28 11:15:41,939 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 17 [2022-04-28 11:15:41,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:41,939 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-04-28 11:15:41,939 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:15:41,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 41 transitions. [2022-04-28 11:15:41,982 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:15:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:15:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:15:41,983 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:41,983 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:15:41,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:15:41,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:41,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:41,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 1 times [2022-04-28 11:15:41,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:41,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [170150176] [2022-04-28 11:15:41,985 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:15:41,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 2 times [2022-04-28 11:15:41,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:41,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570165421] [2022-04-28 11:15:41,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:41,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:42,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:15:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:42,125 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:15:42,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:15:42,125 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-28 11:15:42,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:15:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:42,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 11:15:42,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 11:15:42,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:15:42,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-28 11:15:42,133 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:15:42,133 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:15:42,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:15:42,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-28 11:15:42,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-28 11:15:42,133 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:15:42,134 INFO L272 TraceCheckUtils]: 6: Hoare triple {301#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {301#true} is VALID [2022-04-28 11:15:42,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 11:15:42,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 11:15:42,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:15:42,134 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-28 11:15:42,135 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:15:42,135 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:15:42,136 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:15:42,144 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:15:42,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {302#false} is VALID [2022-04-28 11:15:42,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-28 11:15:42,145 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:15:42,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:42,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570165421] [2022-04-28 11:15:42,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570165421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:42,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:42,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:15:42,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:42,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [170150176] [2022-04-28 11:15:42,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [170150176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:42,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:42,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:15:42,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400310175] [2022-04-28 11:15:42,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:42,147 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:15:42,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:42,148 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:15:42,161 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:15:42,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:15:42,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:42,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:15:42,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:15:42,163 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:15:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:42,609 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-28 11:15:42,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:15:42,610 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:15:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:42,610 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:15:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 11:15:42,612 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:15:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 11:15:42,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-28 11:15:42,669 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:15:42,671 INFO L225 Difference]: With dead ends: 37 [2022-04-28 11:15:42,671 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 11:15:42,672 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:15:42,672 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:42,673 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.2s Time] [2022-04-28 11:15:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 11:15:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 11:15:42,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:42,679 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:15:42,679 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:15:42,680 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:15:42,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:42,682 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:15:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:15:42,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:42,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:42,683 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:15:42,683 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:15:42,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:42,685 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:15:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:15:42,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:42,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:42,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:42,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:42,686 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:15:42,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-28 11:15:42,688 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 17 [2022-04-28 11:15:42,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:42,688 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-28 11:15:42,689 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:15:42,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-28 11:15:42,737 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:15:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:15:42,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 11:15:42,738 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:42,738 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:15:42,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 11:15:42,738 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:42,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:42,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 1 times [2022-04-28 11:15:42,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:42,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [430500097] [2022-04-28 11:15:42,740 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:15:42,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 2 times [2022-04-28 11:15:42,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:42,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089809217] [2022-04-28 11:15:42,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:42,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:42,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:42,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563965641] [2022-04-28 11:15:42,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:42,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:42,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:42,763 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:15:42,764 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:15:42,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:42,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:42,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:15:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:42,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:42,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-28 11:15:42,984 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:15:42,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:15:42,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #84#return; {538#true} is VALID [2022-04-28 11:15:42,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-28 11:15:42,984 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:15:42,985 INFO L272 TraceCheckUtils]: 6: Hoare triple {538#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {538#true} is VALID [2022-04-28 11:15:42,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-28 11:15:42,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-28 11:15:42,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:15:42,985 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {538#true} {538#true} #60#return; {538#true} is VALID [2022-04-28 11:15:42,987 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:15:42,988 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:15:42,988 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:15:42,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-28 11:15:42,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-28 11:15:42,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:15:42,989 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:15:42,990 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:15:42,990 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:15:42,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-28 11:15:42,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-28 11:15:42,991 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:15:42,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:15:42,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:42,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089809217] [2022-04-28 11:15:42,992 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:42,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563965641] [2022-04-28 11:15:42,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563965641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:42,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:42,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:15:42,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:42,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [430500097] [2022-04-28 11:15:42,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [430500097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:42,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:42,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:15:42,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539650507] [2022-04-28 11:15:42,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:42,994 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:15:42,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:42,994 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:15:43,008 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:15:43,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:15:43,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:43,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:15:43,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:15:43,009 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:15:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:43,258 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 11:15:43,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:15:43,258 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:15:43,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:43,259 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:15:43,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:15:43,261 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:15:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:15:43,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:15:43,314 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:15:43,316 INFO L225 Difference]: With dead ends: 54 [2022-04-28 11:15:43,316 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 11:15:43,317 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:15:43,318 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:15:43,318 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:15:43,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 11:15:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-28 11:15:43,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:43,329 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:15:43,329 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:15:43,329 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:15:43,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:43,332 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:15:43,332 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:15:43,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:43,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:43,334 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:15:43,334 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:15:43,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:43,340 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:15:43,340 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:15:43,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:43,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:43,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:43,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:43,341 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:15:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-04-28 11:15:43,346 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2022-04-28 11:15:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:43,347 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-04-28 11:15:43,347 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:15:43,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 52 transitions. [2022-04-28 11:15:43,411 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:15:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-28 11:15:43,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 11:15:43,413 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:43,413 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:15:43,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 11:15:43,629 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:15:43,629 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:43,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:43,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 1 times [2022-04-28 11:15:43,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:43,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [627969295] [2022-04-28 11:15:43,630 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:15:43,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 2 times [2022-04-28 11:15:43,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:43,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410386641] [2022-04-28 11:15:43,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:43,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:43,644 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:43,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474574261] [2022-04-28 11:15:43,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:43,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:43,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:43,646 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:15:43,647 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:15:43,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:43,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:43,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:15:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:43,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:43,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {906#true} is VALID [2022-04-28 11:15:43,799 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:15:43,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:15:43,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #84#return; {906#true} is VALID [2022-04-28 11:15:43,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret5 := main(); {906#true} is VALID [2022-04-28 11:15:43,800 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:15:43,800 INFO L272 TraceCheckUtils]: 6: Hoare triple {906#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {906#true} is VALID [2022-04-28 11:15:43,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:15:43,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:15:43,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:15:43,801 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {906#true} {906#true} #60#return; {906#true} is VALID [2022-04-28 11:15:43,803 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:15:43,804 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:15:43,804 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:15:43,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:15:43,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:15:43,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:15:43,806 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:15:43,806 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:15:43,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:15:43,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:15:43,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:15:43,808 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:15:43,808 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:15:43,809 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:15:43,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {985#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {907#false} is VALID [2022-04-28 11:15:43,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-28 11:15:43,810 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:15:43,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:15:43,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:43,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410386641] [2022-04-28 11:15:43,811 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:43,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474574261] [2022-04-28 11:15:43,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474574261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:43,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:43,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:15:43,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:43,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [627969295] [2022-04-28 11:15:43,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [627969295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:43,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:43,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:15:43,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767016996] [2022-04-28 11:15:43,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:43,813 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:15:43,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:43,814 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:15:43,827 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:15:43,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:15:43,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:43,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:15:43,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:15:43,829 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:15:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:44,030 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-28 11:15:44,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:15:44,030 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:15:44,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:44,030 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:15:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:15:44,032 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:15:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:15:44,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:15:44,087 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:15:44,089 INFO L225 Difference]: With dead ends: 58 [2022-04-28 11:15:44,089 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 11:15:44,089 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:15:44,090 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:15:44,090 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:15:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 11:15:44,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-28 11:15:44,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:44,105 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:15:44,105 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:15:44,106 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:15:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:44,108 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 11:15:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 11:15:44,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:44,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:44,109 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:15:44,109 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:15:44,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:44,111 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 11:15:44,111 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 11:15:44,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:44,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:44,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:44,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:44,112 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:15:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-04-28 11:15:44,114 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 27 [2022-04-28 11:15:44,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:44,114 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-04-28 11:15:44,115 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:15:44,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 67 transitions. [2022-04-28 11:15:44,176 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:15:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-04-28 11:15:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 11:15:44,177 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:44,177 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:15:44,195 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:15:44,389 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:15:44,390 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:44,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:44,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 1 times [2022-04-28 11:15:44,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:44,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1476780985] [2022-04-28 11:15:44,391 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:15:44,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 2 times [2022-04-28 11:15:44,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:44,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857511101] [2022-04-28 11:15:44,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:44,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:44,400 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:44,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [55900072] [2022-04-28 11:15:44,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:44,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:44,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:44,401 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:15:44,402 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:15:44,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:44,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:44,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:15:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:44,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:44,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2022-04-28 11:15:44,575 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:15:44,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:15:44,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #84#return; {1325#true} is VALID [2022-04-28 11:15:44,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret5 := main(); {1325#true} is VALID [2022-04-28 11:15:44,575 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:15:44,576 INFO L272 TraceCheckUtils]: 6: Hoare triple {1325#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {1325#true} is VALID [2022-04-28 11:15:44,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:15:44,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:15:44,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:15:44,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1325#true} {1325#true} #60#return; {1325#true} is VALID [2022-04-28 11:15:44,578 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:15:44,578 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:15:44,578 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:15:44,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:15:44,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:15:44,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:15:44,579 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:15:44,579 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:15:44,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:15:44,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:15:44,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:15:44,580 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:15:44,581 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:15:44,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:15:44,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:15:44,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:15:44,590 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:15:44,591 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:15:44,592 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:15:44,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {1419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1326#false} is VALID [2022-04-28 11:15:44,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2022-04-28 11:15:44,592 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:15:44,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:15:44,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:44,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857511101] [2022-04-28 11:15:44,593 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:44,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55900072] [2022-04-28 11:15:44,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55900072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:44,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:44,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:15:44,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:44,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1476780985] [2022-04-28 11:15:44,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1476780985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:44,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:44,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:15:44,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247112955] [2022-04-28 11:15:44,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:44,594 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:15:44,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:44,595 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:15:44,612 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:15:44,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:15:44,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:44,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:15:44,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:15:44,613 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:15:44,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:44,934 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-04-28 11:15:44,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:15:44,934 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:15:44,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:44,935 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:15:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:15:44,936 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:15:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:15:44,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:15:44,989 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:15:44,991 INFO L225 Difference]: With dead ends: 66 [2022-04-28 11:15:44,991 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 11:15:44,991 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:15:44,992 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:15:44,992 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:15:44,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 11:15:45,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 11:15:45,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:45,008 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:15:45,009 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:15:45,009 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:15:45,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:45,011 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 11:15:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:15:45,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:45,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:45,012 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:15:45,012 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:15:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:45,013 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 11:15:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:15:45,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:45,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:45,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:45,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:45,014 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:15:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-28 11:15:45,016 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-28 11:15:45,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:45,016 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-28 11:15:45,016 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:15:45,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 65 transitions. [2022-04-28 11:15:45,074 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:15:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:15:45,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 11:15:45,075 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:45,076 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:15:45,092 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:15:45,283 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:15:45,283 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:45,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 1 times [2022-04-28 11:15:45,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:45,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [754947196] [2022-04-28 11:15:45,719 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:45,719 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:45,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 2 times [2022-04-28 11:15:45,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:45,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782585106] [2022-04-28 11:15:45,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:45,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:45,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:45,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918002028] [2022-04-28 11:15:45,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:45,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:45,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:45,750 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:15:45,752 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:15:45,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:45,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:45,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:15:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:45,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:45,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-28 11:15:45,965 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:15:45,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:45,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-28 11:15:45,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-28 11:15:45,966 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:15:45,966 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:15:45,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:45,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:45,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:45,967 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-28 11:15:45,967 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:15:45,968 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:15:45,968 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:15:45,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:45,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:45,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:45,969 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:15:45,969 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:15:45,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:45,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:45,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:45,969 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:15:45,970 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:15:45,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:45,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:45,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:45,970 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:15:45,971 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:15:45,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:45,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:45,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:45,971 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:15:45,971 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:15:45,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:45,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:45,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:45,972 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:15:45,973 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:15:45,973 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:15:45,973 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:15:45,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:45,973 INFO L290 TraceCheckUtils]: 42: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:45,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:45,974 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:15:45,974 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:15:45,975 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:15:45,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {1921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 11:15:45,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 11:15:45,977 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:15:45,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:46,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 11:15:46,139 INFO L290 TraceCheckUtils]: 47: Hoare triple {1921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 11:15:46,139 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:15:46,141 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:15:46,142 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:15:46,142 INFO L290 TraceCheckUtils]: 43: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:46,142 INFO L290 TraceCheckUtils]: 42: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:46,142 INFO L290 TraceCheckUtils]: 41: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:46,142 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:15:46,143 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:15:46,147 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:15:46,147 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:15:46,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:46,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:46,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:46,148 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:15:46,148 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:15:46,148 INFO L290 TraceCheckUtils]: 31: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:46,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:46,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:46,149 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:15:46,150 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:15:46,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:46,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:46,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:46,151 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:15:46,151 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:15:46,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:46,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:46,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:46,151 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:15:46,152 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:15:46,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:46,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:46,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:46,152 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:15:46,153 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:15:46,153 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:15:46,153 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-28 11:15:46,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:46,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:46,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:46,154 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:15:46,154 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:15:46,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-28 11:15:46,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-28 11:15:46,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:46,154 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:15:46,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-28 11:15:46,155 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:15:46,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:46,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782585106] [2022-04-28 11:15:46,155 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:46,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918002028] [2022-04-28 11:15:46,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918002028] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:46,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:46,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:15:46,156 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:46,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [754947196] [2022-04-28 11:15:46,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [754947196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:46,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:46,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:15:46,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535634672] [2022-04-28 11:15:46,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:46,157 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:15:46,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:46,157 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:15:46,178 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:15:46,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:15:46,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:46,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:15:46,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:15:46,179 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:15:46,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:46,585 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 11:15:46,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:15:46,586 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:15:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:46,586 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:15:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:15:46,588 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:15:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:15:46,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:15:46,649 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:15:46,652 INFO L225 Difference]: With dead ends: 81 [2022-04-28 11:15:46,652 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 11:15:46,652 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:15:46,653 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:15:46,653 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:15:46,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 11:15:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-04-28 11:15:46,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:46,686 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:15:46,686 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:15:46,687 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:15:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:46,689 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-28 11:15:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 11:15:46,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:46,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:46,691 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:15:46,691 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:15:46,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:46,694 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-28 11:15:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 11:15:46,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:46,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:46,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:46,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:46,695 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:15:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-04-28 11:15:46,696 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 49 [2022-04-28 11:15:46,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:46,697 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-04-28 11:15:46,697 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:15:46,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 79 transitions. [2022-04-28 11:15:46,774 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:15:46,774 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-28 11:15:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 11:15:46,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:46,775 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:15:46,791 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:15:46,979 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:15:46,979 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:46,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:46,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 3 times [2022-04-28 11:15:46,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:46,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [934873046] [2022-04-28 11:15:47,256 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:47,256 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:47,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 4 times [2022-04-28 11:15:47,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:47,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95619061] [2022-04-28 11:15:47,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:47,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:47,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:47,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [762537524] [2022-04-28 11:15:47,264 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:15:47,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:47,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:47,265 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:15:47,266 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:15:47,298 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:15:47,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:47,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 11:15:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:47,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:47,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2022-04-28 11:15:47,471 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:15:47,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #84#return; {2536#true} is VALID [2022-04-28 11:15:47,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret5 := main(); {2536#true} is VALID [2022-04-28 11:15:47,472 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:15:47,472 INFO L272 TraceCheckUtils]: 6: Hoare triple {2536#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:15:47,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:47,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:47,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,472 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2536#true} {2536#true} #60#return; {2536#true} is VALID [2022-04-28 11:15:47,473 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:15:47,473 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:15:47,473 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:15:47,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:47,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:47,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,479 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:15:47,479 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:15:47,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:47,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:47,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,483 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:15:47,484 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:15:47,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:47,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:47,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,490 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:15:47,490 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:15:47,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:47,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:47,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,493 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:15:47,493 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:15:47,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:47,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:47,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,494 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:15:47,495 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:15:47,495 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:15:47,495 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:15:47,495 INFO L290 TraceCheckUtils]: 41: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:47,495 INFO L290 TraceCheckUtils]: 42: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:47,496 INFO L290 TraceCheckUtils]: 43: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,496 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:15:47,496 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:15:47,496 INFO L290 TraceCheckUtils]: 46: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:47,496 INFO L290 TraceCheckUtils]: 47: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:47,496 INFO L290 TraceCheckUtils]: 48: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,497 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:15:47,498 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:15:47,498 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:15:47,498 INFO L290 TraceCheckUtils]: 52: Hoare triple {2697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2537#false} is VALID [2022-04-28 11:15:47,498 INFO L290 TraceCheckUtils]: 53: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-04-28 11:15:47,499 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:15:47,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:47,656 INFO L290 TraceCheckUtils]: 53: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-04-28 11:15:47,657 INFO L290 TraceCheckUtils]: 52: Hoare triple {2697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2537#false} is VALID [2022-04-28 11:15:47,657 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:15:47,658 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:15:47,658 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:15:47,658 INFO L290 TraceCheckUtils]: 48: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,659 INFO L290 TraceCheckUtils]: 47: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:47,659 INFO L290 TraceCheckUtils]: 46: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:47,659 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:15:47,659 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:15:47,659 INFO L290 TraceCheckUtils]: 43: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,659 INFO L290 TraceCheckUtils]: 42: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:47,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:47,660 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:15:47,660 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:15:47,662 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:15:47,662 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:15:47,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,663 INFO L290 TraceCheckUtils]: 35: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:47,663 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:47,663 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:15:47,663 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:15:47,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:47,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:47,664 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:15:47,665 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:15:47,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:47,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:47,665 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:15:47,666 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:15:47,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:47,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:47,666 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:15:47,666 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:15:47,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:47,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:47,667 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:15:47,667 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:15:47,668 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:15:47,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2536#true} {2536#true} #60#return; {2536#true} is VALID [2022-04-28 11:15:47,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:47,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:47,668 INFO L272 TraceCheckUtils]: 6: Hoare triple {2536#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:15:47,668 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:15:47,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret5 := main(); {2536#true} is VALID [2022-04-28 11:15:47,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #84#return; {2536#true} is VALID [2022-04-28 11:15:47,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:47,669 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:15:47,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2022-04-28 11:15:47,669 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:15:47,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:47,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95619061] [2022-04-28 11:15:47,670 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:47,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762537524] [2022-04-28 11:15:47,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762537524] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:47,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:47,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:15:47,670 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:47,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [934873046] [2022-04-28 11:15:47,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [934873046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:47,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:47,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:15:47,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948443447] [2022-04-28 11:15:47,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:47,671 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:15:47,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:47,671 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:15:47,694 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:15:47,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:15:47,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:47,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:15:47,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:15:47,695 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:15:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:48,055 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-28 11:15:48,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:15:48,056 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:15:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:48,056 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:15:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:15:48,058 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:15:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:15:48,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:15:48,116 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:15:48,117 INFO L225 Difference]: With dead ends: 85 [2022-04-28 11:15:48,117 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 11:15:48,118 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:15:48,118 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:15:48,118 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:15:48,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 11:15:48,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2022-04-28 11:15:48,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:48,149 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:15:48,149 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:15:48,150 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:15:48,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:48,153 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-04-28 11:15:48,154 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-04-28 11:15:48,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:48,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:48,155 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:15:48,155 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:15:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:48,159 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-04-28 11:15:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-04-28 11:15:48,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:48,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:48,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:48,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:48,164 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:15:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-04-28 11:15:48,166 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 54 [2022-04-28 11:15:48,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:48,167 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-04-28 11:15:48,167 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:15:48,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 84 transitions. [2022-04-28 11:15:48,259 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:15:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-04-28 11:15:48,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 11:15:48,261 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:48,261 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:15:48,278 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:15:48,461 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:15:48,461 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:48,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:48,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 5 times [2022-04-28 11:15:48,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:48,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [882965542] [2022-04-28 11:15:48,753 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:48,753 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:48,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 6 times [2022-04-28 11:15:48,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:48,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577478111] [2022-04-28 11:15:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:48,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:48,762 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:48,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [52218091] [2022-04-28 11:15:48,762 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:15:48,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:48,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:48,763 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:15:48,764 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:15:48,795 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 11:15:48,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:48,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 11:15:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:48,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:49,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 11:15:49,005 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:15:49,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #84#return; {3353#true} is VALID [2022-04-28 11:15:49,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret5 := main(); {3353#true} is VALID [2022-04-28 11:15:49,005 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:15:49,006 INFO L272 TraceCheckUtils]: 6: Hoare triple {3353#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:15:49,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,006 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3353#true} {3353#true} #60#return; {3353#true} is VALID [2022-04-28 11:15:49,006 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:15:49,007 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:15:49,007 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:15:49,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,008 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:15:49,008 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:15:49,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,009 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:15:49,009 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:15:49,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,010 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:15:49,010 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:15:49,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,011 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:15:49,012 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:15:49,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,014 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:15:49,016 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:15:49,017 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:15:49,018 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:15:49,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,018 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:15:49,018 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:15:49,019 INFO L290 TraceCheckUtils]: 46: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,019 INFO L290 TraceCheckUtils]: 47: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,019 INFO L290 TraceCheckUtils]: 48: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,019 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:15:49,019 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:15:49,019 INFO L290 TraceCheckUtils]: 51: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,019 INFO L290 TraceCheckUtils]: 52: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,020 INFO L290 TraceCheckUtils]: 53: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,020 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:15:49,021 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:15:49,021 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:15:49,021 INFO L290 TraceCheckUtils]: 57: Hoare triple {3529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 11:15:49,021 INFO L290 TraceCheckUtils]: 58: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 11:15:49,022 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:15:49,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:49,269 INFO L290 TraceCheckUtils]: 58: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 11:15:49,269 INFO L290 TraceCheckUtils]: 57: Hoare triple {3529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 11:15:49,270 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:15:49,270 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:15:49,271 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:15:49,271 INFO L290 TraceCheckUtils]: 53: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,271 INFO L290 TraceCheckUtils]: 52: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,271 INFO L290 TraceCheckUtils]: 51: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,271 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:15:49,273 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:15:49,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,273 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:15:49,274 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:15:49,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,274 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:15:49,274 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:15:49,277 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:15:49,278 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:15:49,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,278 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:15:49,279 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:15:49,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,279 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:15:49,279 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:15:49,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,280 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:15:49,280 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:15:49,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,281 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:15:49,281 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:15:49,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,282 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:15:49,282 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:15:49,283 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:15:49,283 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3353#true} {3353#true} #60#return; {3353#true} is VALID [2022-04-28 11:15:49,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:49,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:49,283 INFO L272 TraceCheckUtils]: 6: Hoare triple {3353#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:15:49,283 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:15:49,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret5 := main(); {3353#true} is VALID [2022-04-28 11:15:49,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #84#return; {3353#true} is VALID [2022-04-28 11:15:49,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:49,284 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:15:49,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 11:15:49,284 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:15:49,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:49,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577478111] [2022-04-28 11:15:49,284 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:49,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52218091] [2022-04-28 11:15:49,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52218091] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:49,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:49,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:15:49,285 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:49,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [882965542] [2022-04-28 11:15:49,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [882965542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:49,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:49,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:15:49,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002805861] [2022-04-28 11:15:49,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:49,286 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:15:49,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:49,286 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:15:49,316 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:15:49,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:15:49,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:49,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:15:49,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:15:49,317 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:15:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:49,721 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-04-28 11:15:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:15:49,721 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:15:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:49,721 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:15:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:15:49,723 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:15:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:15:49,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:15:49,805 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:15:49,806 INFO L225 Difference]: With dead ends: 89 [2022-04-28 11:15:49,806 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 11:15:49,807 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:15:49,807 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:15:49,807 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:15:49,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 11:15:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-28 11:15:49,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:49,839 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:15:49,839 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:15:49,845 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:15:49,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:49,848 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2022-04-28 11:15:49,848 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:15:49,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:49,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:49,849 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:15:49,849 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:15:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:49,852 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2022-04-28 11:15:49,852 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:15:49,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:49,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:49,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:49,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:49,854 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:15:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2022-04-28 11:15:49,857 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 59 [2022-04-28 11:15:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:49,857 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2022-04-28 11:15:49,857 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:15:49,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 98 transitions. [2022-04-28 11:15:49,956 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:15:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:15:49,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 11:15:49,956 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:49,957 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:15:49,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 11:15:50,157 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:15:50,157 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:50,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:50,158 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 1 times [2022-04-28 11:15:50,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:50,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1527974335] [2022-04-28 11:15:50,387 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:50,388 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:50,388 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 2 times [2022-04-28 11:15:50,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:50,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244092189] [2022-04-28 11:15:50,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:50,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:50,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:50,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1222453513] [2022-04-28 11:15:50,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:50,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:50,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:50,397 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:15:50,398 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:15:50,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:50,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:50,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 11:15:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:50,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:50,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {4230#true} call ULTIMATE.init(); {4230#true} is VALID [2022-04-28 11:15:50,860 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:15:50,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:50,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4230#true} {4230#true} #84#return; {4230#true} is VALID [2022-04-28 11:15:50,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {4230#true} call #t~ret5 := main(); {4230#true} is VALID [2022-04-28 11:15:50,860 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:15:50,861 INFO L272 TraceCheckUtils]: 6: Hoare triple {4230#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:15:50,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:50,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:50,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:50,861 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4230#true} {4230#true} #60#return; {4230#true} is VALID [2022-04-28 11:15:50,861 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:15:50,862 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:15:50,862 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:15:50,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:50,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:50,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:50,863 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:15:50,863 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:15:50,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:50,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:50,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:50,864 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:15:50,864 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:15:50,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:50,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:50,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:50,865 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:15:50,865 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:15:50,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:50,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:50,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:50,866 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:15:50,866 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:15:50,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:50,866 INFO L290 TraceCheckUtils]: 35: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:50,866 INFO L290 TraceCheckUtils]: 36: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:50,867 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:15:50,867 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:15:50,868 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:15:50,868 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:15:50,868 INFO L290 TraceCheckUtils]: 41: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:50,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:50,868 INFO L290 TraceCheckUtils]: 43: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:50,868 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:15:50,869 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:15:50,869 INFO L290 TraceCheckUtils]: 46: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:50,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:50,869 INFO L290 TraceCheckUtils]: 48: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:50,869 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:15:50,869 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:15:50,869 INFO L290 TraceCheckUtils]: 51: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:50,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:50,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:50,870 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:15:50,870 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:15:50,870 INFO L290 TraceCheckUtils]: 56: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:50,870 INFO L290 TraceCheckUtils]: 57: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:50,870 INFO L290 TraceCheckUtils]: 58: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:50,871 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:15:50,871 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:15:50,871 INFO L290 TraceCheckUtils]: 61: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:50,871 INFO L290 TraceCheckUtils]: 62: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:50,871 INFO L290 TraceCheckUtils]: 63: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:50,872 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:15:50,872 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:15:50,872 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:15:50,873 INFO L290 TraceCheckUtils]: 67: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:50,873 INFO L290 TraceCheckUtils]: 68: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:50,873 INFO L290 TraceCheckUtils]: 69: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:50,873 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:15:50,874 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:15:50,874 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:15:50,874 INFO L290 TraceCheckUtils]: 73: Hoare triple {4455#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4231#false} is VALID [2022-04-28 11:15:50,874 INFO L290 TraceCheckUtils]: 74: Hoare triple {4231#false} assume !false; {4231#false} is VALID [2022-04-28 11:15:50,875 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:15:50,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:51,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:51,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244092189] [2022-04-28 11:15:51,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:51,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222453513] [2022-04-28 11:15:51,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222453513] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:15:51,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:15:51,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:15:51,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:51,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1527974335] [2022-04-28 11:15:51,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1527974335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:51,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:51,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:15:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553970155] [2022-04-28 11:15:51,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:51,325 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:15:51,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:51,325 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:15:51,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:51,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:15:51,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:51,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:15:51,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:15:51,371 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:15:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:51,887 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-04-28 11:15:51,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:15:51,887 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:15:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:51,888 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:15:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:15:51,891 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:15:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:15:51,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 11:15:51,963 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:51,965 INFO L225 Difference]: With dead ends: 94 [2022-04-28 11:15:51,965 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 11:15:51,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:15:51,966 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:15:51,966 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:15:51,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 11:15:52,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 11:15:52,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:52,027 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:15:52,027 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:15:52,027 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:15:52,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:52,029 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-28 11:15:52,029 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:15:52,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:52,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:52,030 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:15:52,030 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:15:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:52,032 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-28 11:15:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:15:52,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:52,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:52,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:52,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:52,033 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:15:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-04-28 11:15:52,035 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 75 [2022-04-28 11:15:52,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:52,035 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-04-28 11:15:52,035 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:15:52,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 104 transitions. [2022-04-28 11:15:52,145 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:15:52,145 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:15:52,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 11:15:52,146 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:52,146 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:15:52,165 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:15:52,351 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:15:52,351 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:52,352 INFO L85 PathProgramCache]: Analyzing trace with hash -63758730, now seen corresponding path program 7 times [2022-04-28 11:15:52,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:52,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1684774578] [2022-04-28 11:15:52,621 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:52,621 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:52,621 INFO L85 PathProgramCache]: Analyzing trace with hash -63758730, now seen corresponding path program 8 times [2022-04-28 11:15:52,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:52,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006613436] [2022-04-28 11:15:52,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:52,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:52,650 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:52,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [469006520] [2022-04-28 11:15:52,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:52,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:52,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:52,652 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:15:52,653 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:15:52,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:52,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:52,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 11:15:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:52,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:53,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5138#true} is VALID [2022-04-28 11:15:53,002 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:15:53,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #84#return; {5138#true} is VALID [2022-04-28 11:15:53,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret5 := main(); {5138#true} is VALID [2022-04-28 11:15:53,003 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:15:53,003 INFO L272 TraceCheckUtils]: 6: Hoare triple {5138#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:53,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,003 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5138#true} {5138#true} #60#return; {5138#true} is VALID [2022-04-28 11:15:53,004 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_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:15:53,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} assume !false; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:15:53,004 INFO L272 TraceCheckUtils]: 13: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:53,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,005 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #62#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:15:53,005 INFO L272 TraceCheckUtils]: 18: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~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:15:53,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,006 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #64#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:15:53,006 INFO L272 TraceCheckUtils]: 23: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~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:15:53,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,007 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #66#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:15:53,007 INFO L272 TraceCheckUtils]: 28: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= 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)); {5138#true} is VALID [2022-04-28 11:15:53,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,008 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #68#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:15:53,008 INFO L272 TraceCheckUtils]: 33: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~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:15:53,008 INFO L290 TraceCheckUtils]: 34: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,008 INFO L290 TraceCheckUtils]: 35: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,008 INFO L290 TraceCheckUtils]: 36: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,008 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #70#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:15:53,009 INFO L290 TraceCheckUtils]: 38: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= 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; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:15:53,009 INFO L290 TraceCheckUtils]: 39: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} assume !false; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:15:53,010 INFO L272 TraceCheckUtils]: 40: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= 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:15:53,010 INFO L290 TraceCheckUtils]: 41: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,010 INFO L290 TraceCheckUtils]: 42: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,010 INFO L290 TraceCheckUtils]: 43: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,010 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #62#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:15:53,010 INFO L272 TraceCheckUtils]: 45: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:53,010 INFO L290 TraceCheckUtils]: 46: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,011 INFO L290 TraceCheckUtils]: 47: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,011 INFO L290 TraceCheckUtils]: 48: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,011 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #64#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:15:53,011 INFO L272 TraceCheckUtils]: 50: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= 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:15:53,011 INFO L290 TraceCheckUtils]: 51: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,012 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #66#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:15:53,012 INFO L272 TraceCheckUtils]: 55: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:53,012 INFO L290 TraceCheckUtils]: 56: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,012 INFO L290 TraceCheckUtils]: 57: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,012 INFO L290 TraceCheckUtils]: 58: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,013 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #68#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:15:53,013 INFO L272 TraceCheckUtils]: 60: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:53,013 INFO L290 TraceCheckUtils]: 61: Hoare triple {5138#true} ~cond := #in~cond; {5328#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:53,013 INFO L290 TraceCheckUtils]: 62: Hoare triple {5328#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:53,014 INFO L290 TraceCheckUtils]: 63: Hoare triple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:53,014 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #70#return; {5339#(and (= main_~z~0 12) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~n~0 1))} is VALID [2022-04-28 11:15:53,015 INFO L290 TraceCheckUtils]: 65: Hoare triple {5339#(and (= main_~z~0 12) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 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; {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} is VALID [2022-04-28 11:15:53,015 INFO L290 TraceCheckUtils]: 66: Hoare triple {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} assume !false; {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} is VALID [2022-04-28 11:15:53,015 INFO L272 TraceCheckUtils]: 67: Hoare triple {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:53,015 INFO L290 TraceCheckUtils]: 68: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,015 INFO L290 TraceCheckUtils]: 69: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,015 INFO L290 TraceCheckUtils]: 70: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,016 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5138#true} {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} #62#return; {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} is VALID [2022-04-28 11:15:53,016 INFO L272 TraceCheckUtils]: 72: Hoare triple {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:53,016 INFO L290 TraceCheckUtils]: 73: Hoare triple {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5369#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:53,017 INFO L290 TraceCheckUtils]: 74: Hoare triple {5369#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5139#false} is VALID [2022-04-28 11:15:53,017 INFO L290 TraceCheckUtils]: 75: Hoare triple {5139#false} assume !false; {5139#false} is VALID [2022-04-28 11:15:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 48 proven. 17 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-28 11:15:53,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:53,944 INFO L290 TraceCheckUtils]: 75: Hoare triple {5139#false} assume !false; {5139#false} is VALID [2022-04-28 11:15:53,945 INFO L290 TraceCheckUtils]: 74: Hoare triple {5369#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5139#false} is VALID [2022-04-28 11:15:53,945 INFO L290 TraceCheckUtils]: 73: Hoare triple {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5369#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:53,945 INFO L272 TraceCheckUtils]: 72: Hoare triple {5385#(= (+ (* 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)); {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:53,946 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5138#true} {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:15:53,946 INFO L290 TraceCheckUtils]: 70: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,946 INFO L290 TraceCheckUtils]: 69: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,946 INFO L290 TraceCheckUtils]: 68: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,946 INFO L272 TraceCheckUtils]: 67: Hoare triple {5385#(= (+ (* 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:15:53,947 INFO L290 TraceCheckUtils]: 66: Hoare triple {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:15:53,950 INFO L290 TraceCheckUtils]: 65: Hoare triple {5407#(= (+ (* 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; {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:15:53,951 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} {5411#(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; {5407#(= (+ (* 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:53,951 INFO L290 TraceCheckUtils]: 63: Hoare triple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:53,952 INFO L290 TraceCheckUtils]: 62: Hoare triple {5421#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:53,952 INFO L290 TraceCheckUtils]: 61: Hoare triple {5138#true} ~cond := #in~cond; {5421#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:15:53,952 INFO L272 TraceCheckUtils]: 60: Hoare triple {5411#(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)); {5138#true} is VALID [2022-04-28 11:15:53,952 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5138#true} {5411#(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; {5411#(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:53,953 INFO L290 TraceCheckUtils]: 58: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,953 INFO L290 TraceCheckUtils]: 57: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,953 INFO L290 TraceCheckUtils]: 56: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,953 INFO L272 TraceCheckUtils]: 55: Hoare triple {5411#(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)); {5138#true} is VALID [2022-04-28 11:15:53,953 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5138#true} {5411#(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; {5411#(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:53,953 INFO L290 TraceCheckUtils]: 53: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,954 INFO L290 TraceCheckUtils]: 52: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,954 INFO L290 TraceCheckUtils]: 51: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,954 INFO L272 TraceCheckUtils]: 50: Hoare triple {5411#(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)); {5138#true} is VALID [2022-04-28 11:15:53,954 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5138#true} {5411#(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; {5411#(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:53,954 INFO L290 TraceCheckUtils]: 48: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,954 INFO L290 TraceCheckUtils]: 47: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,955 INFO L290 TraceCheckUtils]: 46: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,955 INFO L272 TraceCheckUtils]: 45: Hoare triple {5411#(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)); {5138#true} is VALID [2022-04-28 11:15:53,957 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5138#true} {5411#(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; {5411#(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:53,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,957 INFO L272 TraceCheckUtils]: 40: Hoare triple {5411#(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)); {5138#true} is VALID [2022-04-28 11:15:53,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {5411#(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; {5411#(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:53,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {5491#(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; {5411#(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:53,973 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5138#true} {5491#(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; {5491#(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:53,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,974 INFO L272 TraceCheckUtils]: 33: Hoare triple {5491#(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)); {5138#true} is VALID [2022-04-28 11:15:53,987 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5138#true} {5491#(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; {5491#(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:53,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,988 INFO L272 TraceCheckUtils]: 28: Hoare triple {5491#(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)); {5138#true} is VALID [2022-04-28 11:15:53,988 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5138#true} {5491#(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; {5491#(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:53,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,989 INFO L272 TraceCheckUtils]: 23: Hoare triple {5491#(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)); {5138#true} is VALID [2022-04-28 11:15:53,989 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5138#true} {5491#(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; {5491#(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:53,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,990 INFO L272 TraceCheckUtils]: 18: Hoare triple {5491#(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)); {5138#true} is VALID [2022-04-28 11:15:53,990 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5138#true} {5491#(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; {5491#(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:53,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,990 INFO L272 TraceCheckUtils]: 13: Hoare triple {5491#(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)); {5138#true} is VALID [2022-04-28 11:15:53,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {5491#(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; {5491#(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:53,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {5138#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5491#(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:53,992 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5138#true} {5138#true} #60#return; {5138#true} is VALID [2022-04-28 11:15:53,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:53,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:53,992 INFO L272 TraceCheckUtils]: 6: Hoare triple {5138#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:53,992 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:15:53,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret5 := main(); {5138#true} is VALID [2022-04-28 11:15:53,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #84#return; {5138#true} is VALID [2022-04-28 11:15:53,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:53,992 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:15:53,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5138#true} is VALID [2022-04-28 11:15:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 48 proven. 17 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-28 11:15:53,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:53,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006613436] [2022-04-28 11:15:53,993 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:53,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469006520] [2022-04-28 11:15:53,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469006520] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:53,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:53,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-04-28 11:15:53,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:53,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1684774578] [2022-04-28 11:15:53,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1684774578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:53,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:53,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:15:53,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554052372] [2022-04-28 11:15:53,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:53,995 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:15:53,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:53,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:15:54,035 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:15:54,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:15:54,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:54,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:15:54,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:15:54,036 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:15:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:55,349 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2022-04-28 11:15:55,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:15:55,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:15:55,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:15:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-28 11:15:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:15:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-28 11:15:55,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 100 transitions. [2022-04-28 11:15:55,430 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:15:55,432 INFO L225 Difference]: With dead ends: 115 [2022-04-28 11:15:55,432 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 11:15:55,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:15:55,433 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:55,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 151 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 11:15:55,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 11:15:55,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2022-04-28 11:15:55,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:55,482 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:15:55,482 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:15:55,482 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:15:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:55,485 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-04-28 11:15:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-04-28 11:15:55,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:55,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:55,486 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:15:55,486 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:15:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:55,488 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-04-28 11:15:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-04-28 11:15:55,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:55,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:55,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:55,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:55,489 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:15:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-04-28 11:15:55,491 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 76 [2022-04-28 11:15:55,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:55,491 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-04-28 11:15:55,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:15:55,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 115 transitions. [2022-04-28 11:15:55,601 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:15:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-28 11:15:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 11:15:55,601 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:55,602 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:15:55,617 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:55,802 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:55,802 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:55,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:55,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 1 times [2022-04-28 11:15:55,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:55,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1817485221] [2022-04-28 11:15:56,054 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:56,054 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:56,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 2 times [2022-04-28 11:15:56,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:56,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795498115] [2022-04-28 11:15:56,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:56,063 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:56,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1777274241] [2022-04-28 11:15:56,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:56,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:56,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:56,065 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:56,066 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:56,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:56,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:56,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:15:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:56,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:56,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {6274#true} call ULTIMATE.init(); {6274#true} is VALID [2022-04-28 11:15:56,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {6274#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); {6274#true} is VALID [2022-04-28 11:15:56,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:15:56,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6274#true} {6274#true} #84#return; {6274#true} is VALID [2022-04-28 11:15:56,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {6274#true} call #t~ret5 := main(); {6274#true} is VALID [2022-04-28 11:15:56,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {6274#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; {6274#true} is VALID [2022-04-28 11:15:56,713 INFO L272 TraceCheckUtils]: 6: Hoare triple {6274#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:15:56,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:15:56,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:15:56,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:15:56,713 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6274#true} {6274#true} #60#return; {6274#true} is VALID [2022-04-28 11:15:56,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {6274#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:15:56,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !false; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:15:56,714 INFO L272 TraceCheckUtils]: 13: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:15:56,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:15:56,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:15:56,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:15:56,715 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #62#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:15:56,715 INFO L272 TraceCheckUtils]: 18: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6274#true} is VALID [2022-04-28 11:15:56,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:15:56,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:15:56,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:15:56,716 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #64#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:15:56,716 INFO L272 TraceCheckUtils]: 23: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:15:56,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:15:56,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:15:56,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:15:56,717 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #66#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:15:56,717 INFO L272 TraceCheckUtils]: 28: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:15:56,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:15:56,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:15:56,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:15:56,717 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #68#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:15:56,718 INFO L272 TraceCheckUtils]: 33: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6274#true} is VALID [2022-04-28 11:15:56,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:15:56,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:15:56,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:15:56,718 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #70#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:15:56,719 INFO L290 TraceCheckUtils]: 38: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:56,719 INFO L290 TraceCheckUtils]: 39: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !false; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:56,719 INFO L272 TraceCheckUtils]: 40: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:15:56,720 INFO L290 TraceCheckUtils]: 41: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:15:56,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:15:56,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:15:56,720 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #62#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:56,720 INFO L272 TraceCheckUtils]: 45: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6274#true} is VALID [2022-04-28 11:15:56,720 INFO L290 TraceCheckUtils]: 46: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:15:56,721 INFO L290 TraceCheckUtils]: 47: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:15:56,721 INFO L290 TraceCheckUtils]: 48: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:15:56,721 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #64#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:56,721 INFO L272 TraceCheckUtils]: 50: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:15:56,721 INFO L290 TraceCheckUtils]: 51: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:15:56,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:15:56,722 INFO L290 TraceCheckUtils]: 53: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:15:56,722 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #66#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:56,722 INFO L272 TraceCheckUtils]: 55: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:15:56,722 INFO L290 TraceCheckUtils]: 56: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:15:56,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:15:56,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:15:56,723 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #68#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:56,723 INFO L272 TraceCheckUtils]: 60: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6274#true} is VALID [2022-04-28 11:15:56,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:15:56,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:15:56,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:15:56,724 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #70#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:56,724 INFO L290 TraceCheckUtils]: 65: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:15:56,724 INFO L272 TraceCheckUtils]: 66: Hoare triple {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:15:56,725 INFO L290 TraceCheckUtils]: 67: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:15:56,725 INFO L290 TraceCheckUtils]: 68: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:15:56,725 INFO L290 TraceCheckUtils]: 69: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:15:56,725 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {6274#true} {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #72#return; {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:15:56,725 INFO L272 TraceCheckUtils]: 71: Hoare triple {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:15:56,725 INFO L290 TraceCheckUtils]: 72: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:15:56,725 INFO L290 TraceCheckUtils]: 73: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:15:56,726 INFO L290 TraceCheckUtils]: 74: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:15:56,726 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6274#true} {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #74#return; {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:15:56,727 INFO L272 TraceCheckUtils]: 76: Hoare triple {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:56,728 INFO L290 TraceCheckUtils]: 77: Hoare triple {6510#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:56,728 INFO L290 TraceCheckUtils]: 78: Hoare triple {6514#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6275#false} is VALID [2022-04-28 11:15:56,728 INFO L290 TraceCheckUtils]: 79: Hoare triple {6275#false} assume !false; {6275#false} is VALID [2022-04-28 11:15:56,728 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:56,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:00,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:00,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795498115] [2022-04-28 11:16:00,713 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:00,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777274241] [2022-04-28 11:16:00,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777274241] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:16:00,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:16:00,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:16:00,719 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:00,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1817485221] [2022-04-28 11:16:00,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1817485221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:00,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:00,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:16:00,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877902619] [2022-04-28 11:16:00,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:00,720 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:16:00,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:00,721 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:16:00,758 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:16:00,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:16:00,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:00,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:16:00,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:16:00,759 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:16:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:01,234 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-04-28 11:16:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:16:01,234 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:16:01,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:16:01,234 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:16:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:16:01,235 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:16:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:16:01,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 11:16:01,291 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:16:01,293 INFO L225 Difference]: With dead ends: 109 [2022-04-28 11:16:01,293 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 11:16:01,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:16:01,294 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:16:01,294 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:16:01,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 11:16:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-28 11:16:01,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:16:01,352 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:16:01,352 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:16:01,352 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:16:01,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:01,354 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-04-28 11:16:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:16:01,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:01,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:01,355 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:16:01,355 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:16:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:01,356 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-04-28 11:16:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:16:01,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:01,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:01,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:16:01,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:16:01,357 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:16:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2022-04-28 11:16:01,359 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 80 [2022-04-28 11:16:01,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:16:01,359 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2022-04-28 11:16:01,359 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:16:01,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 106 transitions. [2022-04-28 11:16:01,477 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:16:01,477 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:16:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 11:16:01,477 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:16:01,478 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:16:01,494 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:16:01,687 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:16:01,687 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:16:01,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:16:01,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 9 times [2022-04-28 11:16:01,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:01,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1703421152] [2022-04-28 11:16:01,922 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:16:01,922 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:16:01,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 10 times [2022-04-28 11:16:01,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:16:01,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816810634] [2022-04-28 11:16:01,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:16:01,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:16:01,929 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:16:01,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [88061624] [2022-04-28 11:16:01,930 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:16:01,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:01,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:16:01,931 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:16:01,941 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:16:01,973 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:16:01,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:16:01,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 11:16:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:16:01,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:16:02,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {7258#true} call ULTIMATE.init(); {7258#true} is VALID [2022-04-28 11:16:02,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {7258#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); {7258#true} is VALID [2022-04-28 11:16:02,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7258#true} {7258#true} #84#return; {7258#true} is VALID [2022-04-28 11:16:02,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {7258#true} call #t~ret5 := main(); {7258#true} is VALID [2022-04-28 11:16:02,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {7258#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; {7258#true} is VALID [2022-04-28 11:16:02,263 INFO L272 TraceCheckUtils]: 6: Hoare triple {7258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:16:02,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,264 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7258#true} {7258#true} #60#return; {7258#true} is VALID [2022-04-28 11:16:02,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {7258#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:02,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:02,265 INFO L272 TraceCheckUtils]: 13: Hoare triple {7296#(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)); {7258#true} is VALID [2022-04-28 11:16:02,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,265 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:02,266 INFO L272 TraceCheckUtils]: 18: Hoare triple {7296#(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)); {7258#true} is VALID [2022-04-28 11:16:02,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,266 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:02,266 INFO L272 TraceCheckUtils]: 23: Hoare triple {7296#(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)); {7258#true} is VALID [2022-04-28 11:16:02,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,267 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:02,267 INFO L272 TraceCheckUtils]: 28: Hoare triple {7296#(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)); {7258#true} is VALID [2022-04-28 11:16:02,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,268 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:02,268 INFO L272 TraceCheckUtils]: 33: Hoare triple {7296#(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)); {7258#true} is VALID [2022-04-28 11:16:02,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,269 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:02,270 INFO L290 TraceCheckUtils]: 38: Hoare triple {7296#(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; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:02,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !false; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:02,270 INFO L272 TraceCheckUtils]: 40: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:16:02,270 INFO L290 TraceCheckUtils]: 41: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,270 INFO L290 TraceCheckUtils]: 43: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,271 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #62#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:02,271 INFO L272 TraceCheckUtils]: 45: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:16:02,271 INFO L290 TraceCheckUtils]: 46: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,271 INFO L290 TraceCheckUtils]: 47: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,271 INFO L290 TraceCheckUtils]: 48: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,283 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #64#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:02,283 INFO L272 TraceCheckUtils]: 50: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:16:02,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,284 INFO L290 TraceCheckUtils]: 53: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,284 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #66#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:02,284 INFO L272 TraceCheckUtils]: 55: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:16:02,284 INFO L290 TraceCheckUtils]: 56: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,285 INFO L290 TraceCheckUtils]: 57: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,285 INFO L290 TraceCheckUtils]: 58: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,285 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #68#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:02,285 INFO L272 TraceCheckUtils]: 60: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:16:02,285 INFO L290 TraceCheckUtils]: 61: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,285 INFO L290 TraceCheckUtils]: 62: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,286 INFO L290 TraceCheckUtils]: 63: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,286 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #70#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:02,286 INFO L290 TraceCheckUtils]: 65: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:16:02,287 INFO L290 TraceCheckUtils]: 66: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} assume !false; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:16:02,287 INFO L272 TraceCheckUtils]: 67: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:16:02,287 INFO L290 TraceCheckUtils]: 68: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,287 INFO L290 TraceCheckUtils]: 69: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,287 INFO L290 TraceCheckUtils]: 70: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,288 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7258#true} {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} #62#return; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:16:02,288 INFO L272 TraceCheckUtils]: 72: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:16:02,288 INFO L290 TraceCheckUtils]: 73: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,288 INFO L290 TraceCheckUtils]: 74: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,288 INFO L290 TraceCheckUtils]: 75: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,289 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7258#true} {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} #64#return; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:16:02,289 INFO L272 TraceCheckUtils]: 77: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:02,289 INFO L290 TraceCheckUtils]: 78: Hoare triple {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7501#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:02,290 INFO L290 TraceCheckUtils]: 79: Hoare triple {7501#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7259#false} is VALID [2022-04-28 11:16:02,290 INFO L290 TraceCheckUtils]: 80: Hoare triple {7259#false} assume !false; {7259#false} is VALID [2022-04-28 11:16:02,290 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:16:02,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:02,524 INFO L290 TraceCheckUtils]: 80: Hoare triple {7259#false} assume !false; {7259#false} is VALID [2022-04-28 11:16:02,524 INFO L290 TraceCheckUtils]: 79: Hoare triple {7501#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7259#false} is VALID [2022-04-28 11:16:02,525 INFO L290 TraceCheckUtils]: 78: Hoare triple {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7501#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:02,525 INFO L272 TraceCheckUtils]: 77: Hoare triple {7517#(= (* 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)); {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:02,526 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7258#true} {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:16:02,526 INFO L290 TraceCheckUtils]: 75: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,526 INFO L290 TraceCheckUtils]: 74: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,526 INFO L290 TraceCheckUtils]: 73: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,526 INFO L272 TraceCheckUtils]: 72: Hoare triple {7517#(= (* 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)); {7258#true} is VALID [2022-04-28 11:16:02,526 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7258#true} {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:16:02,527 INFO L290 TraceCheckUtils]: 70: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,527 INFO L290 TraceCheckUtils]: 69: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,527 INFO L290 TraceCheckUtils]: 68: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,527 INFO L272 TraceCheckUtils]: 67: Hoare triple {7517#(= (* 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)); {7258#true} is VALID [2022-04-28 11:16:02,527 INFO L290 TraceCheckUtils]: 66: Hoare triple {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:16:02,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {7554#(= (* (+ 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; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:16:02,530 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:16:02,530 INFO L290 TraceCheckUtils]: 63: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,530 INFO L290 TraceCheckUtils]: 62: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,530 INFO L290 TraceCheckUtils]: 61: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,530 INFO L272 TraceCheckUtils]: 60: Hoare triple {7554#(= (* (+ 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)); {7258#true} is VALID [2022-04-28 11:16:02,531 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:16:02,531 INFO L290 TraceCheckUtils]: 58: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,531 INFO L290 TraceCheckUtils]: 57: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,531 INFO L290 TraceCheckUtils]: 56: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,531 INFO L272 TraceCheckUtils]: 55: Hoare triple {7554#(= (* (+ 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)); {7258#true} is VALID [2022-04-28 11:16:02,531 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:16:02,532 INFO L290 TraceCheckUtils]: 53: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,532 INFO L290 TraceCheckUtils]: 52: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,532 INFO L290 TraceCheckUtils]: 51: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,532 INFO L272 TraceCheckUtils]: 50: Hoare triple {7554#(= (* (+ 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)); {7258#true} is VALID [2022-04-28 11:16:02,532 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:16:02,532 INFO L290 TraceCheckUtils]: 48: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,532 INFO L290 TraceCheckUtils]: 47: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,533 INFO L290 TraceCheckUtils]: 46: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,533 INFO L272 TraceCheckUtils]: 45: Hoare triple {7554#(= (* (+ 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)); {7258#true} is VALID [2022-04-28 11:16:02,533 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:16:02,533 INFO L290 TraceCheckUtils]: 43: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,533 INFO L290 TraceCheckUtils]: 42: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,533 INFO L290 TraceCheckUtils]: 41: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,533 INFO L272 TraceCheckUtils]: 40: Hoare triple {7554#(= (* (+ 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)); {7258#true} is VALID [2022-04-28 11:16:02,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:16:02,536 INFO L290 TraceCheckUtils]: 38: Hoare triple {7636#(= (+ 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; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:16:02,536 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {7636#(= (+ 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:16:02,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,537 INFO L272 TraceCheckUtils]: 33: Hoare triple {7636#(= (+ 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)); {7258#true} is VALID [2022-04-28 11:16:02,537 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {7636#(= (+ 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:16:02,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,539 INFO L272 TraceCheckUtils]: 28: Hoare triple {7636#(= (+ 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)); {7258#true} is VALID [2022-04-28 11:16:02,540 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {7636#(= (+ 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:16:02,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,540 INFO L272 TraceCheckUtils]: 23: Hoare triple {7636#(= (+ 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)); {7258#true} is VALID [2022-04-28 11:16:02,541 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {7636#(= (+ 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:16:02,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,541 INFO L272 TraceCheckUtils]: 18: Hoare triple {7636#(= (+ 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)); {7258#true} is VALID [2022-04-28 11:16:02,541 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {7636#(= (+ 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:16:02,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,542 INFO L272 TraceCheckUtils]: 13: Hoare triple {7636#(= (+ 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)); {7258#true} is VALID [2022-04-28 11:16:02,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {7636#(= (+ 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:16:02,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {7258#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7636#(= (+ 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:16:02,543 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7258#true} {7258#true} #60#return; {7258#true} is VALID [2022-04-28 11:16:02,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:16:02,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:16:02,543 INFO L272 TraceCheckUtils]: 6: Hoare triple {7258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:16:02,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {7258#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; {7258#true} is VALID [2022-04-28 11:16:02,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {7258#true} call #t~ret5 := main(); {7258#true} is VALID [2022-04-28 11:16:02,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7258#true} {7258#true} #84#return; {7258#true} is VALID [2022-04-28 11:16:02,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:16:02,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {7258#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); {7258#true} is VALID [2022-04-28 11:16:02,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {7258#true} call ULTIMATE.init(); {7258#true} is VALID [2022-04-28 11:16:02,548 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:16:02,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:02,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816810634] [2022-04-28 11:16:02,548 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:02,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88061624] [2022-04-28 11:16:02,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88061624] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:16:02,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:16:02,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 11:16:02,548 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:02,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1703421152] [2022-04-28 11:16:02,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1703421152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:02,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:02,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:16:02,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241685325] [2022-04-28 11:16:02,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:02,549 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:16:02,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:02,550 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:16:02,586 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:16:02,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:16:02,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:02,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:16:02,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:16:02,587 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:16:03,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:03,592 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2022-04-28 11:16:03,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:16:03,592 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:16:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:16:03,592 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:16:03,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-04-28 11:16:03,594 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:16:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-04-28 11:16:03,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 94 transitions. [2022-04-28 11:16:03,669 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:16:03,671 INFO L225 Difference]: With dead ends: 112 [2022-04-28 11:16:03,671 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 11:16:03,671 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:16:03,671 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:16:03,672 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:16:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 11:16:03,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2022-04-28 11:16:03,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:16:03,728 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:16:03,728 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:16:03,728 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:16:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:03,731 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 11:16:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-28 11:16:03,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:03,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:03,731 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:16:03,731 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:16:03,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:03,733 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 11:16:03,733 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-28 11:16:03,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:03,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:03,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:16:03,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:16:03,734 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:16:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-04-28 11:16:03,736 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 81 [2022-04-28 11:16:03,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:16:03,736 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-04-28 11:16:03,736 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:16:03,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 111 transitions. [2022-04-28 11:16:03,866 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:16:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 11:16:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 11:16:03,867 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:16:03,867 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:16:03,883 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:16:04,071 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:16:04,072 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:16:04,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:16:04,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1087104342, now seen corresponding path program 11 times [2022-04-28 11:16:04,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:04,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1383226722] [2022-04-28 11:16:04,310 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:16:04,310 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:16:04,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1087104342, now seen corresponding path program 12 times [2022-04-28 11:16:04,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:16:04,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063087572] [2022-04-28 11:16:04,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:16:04,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:16:04,317 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:16:04,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1532229299] [2022-04-28 11:16:04,318 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:16:04,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:04,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:16:04,319 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:16:04,320 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:16:04,359 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:16:04,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:16:04,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 11:16:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:16:04,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:16:04,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {8401#true} call ULTIMATE.init(); {8401#true} is VALID [2022-04-28 11:16:04,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {8401#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); {8401#true} is VALID [2022-04-28 11:16:04,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:04,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8401#true} {8401#true} #84#return; {8401#true} is VALID [2022-04-28 11:16:04,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {8401#true} call #t~ret5 := main(); {8401#true} is VALID [2022-04-28 11:16:04,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {8401#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; {8401#true} is VALID [2022-04-28 11:16:04,735 INFO L272 TraceCheckUtils]: 6: Hoare triple {8401#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:16:04,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:04,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:04,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:04,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8401#true} {8401#true} #60#return; {8401#true} is VALID [2022-04-28 11:16:04,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {8401#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:04,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:04,740 INFO L272 TraceCheckUtils]: 13: Hoare triple {8439#(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)); {8401#true} is VALID [2022-04-28 11:16:04,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:04,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:04,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:04,740 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:04,741 INFO L272 TraceCheckUtils]: 18: Hoare triple {8439#(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)); {8401#true} is VALID [2022-04-28 11:16:04,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:04,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:04,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:04,741 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:04,741 INFO L272 TraceCheckUtils]: 23: Hoare triple {8439#(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)); {8401#true} is VALID [2022-04-28 11:16:04,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:04,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:04,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:04,743 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:04,743 INFO L272 TraceCheckUtils]: 28: Hoare triple {8439#(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)); {8401#true} is VALID [2022-04-28 11:16:04,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:04,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:04,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:04,744 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:04,744 INFO L272 TraceCheckUtils]: 33: Hoare triple {8439#(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)); {8401#true} is VALID [2022-04-28 11:16:04,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:04,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:04,746 INFO L290 TraceCheckUtils]: 36: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:04,747 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:04,747 INFO L290 TraceCheckUtils]: 38: Hoare triple {8439#(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; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:04,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !false; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:04,748 INFO L272 TraceCheckUtils]: 40: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~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)); {8401#true} is VALID [2022-04-28 11:16:04,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:04,748 INFO L290 TraceCheckUtils]: 42: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:04,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:04,748 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #62#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:04,749 INFO L272 TraceCheckUtils]: 45: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~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)); {8401#true} is VALID [2022-04-28 11:16:04,749 INFO L290 TraceCheckUtils]: 46: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:04,749 INFO L290 TraceCheckUtils]: 47: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:04,749 INFO L290 TraceCheckUtils]: 48: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:04,749 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #64#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:04,749 INFO L272 TraceCheckUtils]: 50: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~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)); {8401#true} is VALID [2022-04-28 11:16:04,750 INFO L290 TraceCheckUtils]: 51: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:04,750 INFO L290 TraceCheckUtils]: 52: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:04,750 INFO L290 TraceCheckUtils]: 53: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:04,750 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #66#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:04,750 INFO L272 TraceCheckUtils]: 55: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) 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)); {8401#true} is VALID [2022-04-28 11:16:04,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:04,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:04,752 INFO L290 TraceCheckUtils]: 58: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:04,752 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #68#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:04,752 INFO L272 TraceCheckUtils]: 60: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) 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)); {8401#true} is VALID [2022-04-28 11:16:04,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {8401#true} ~cond := #in~cond; {8591#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:04,753 INFO L290 TraceCheckUtils]: 62: Hoare triple {8591#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:04,753 INFO L290 TraceCheckUtils]: 63: Hoare triple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:04,754 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #70#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:04,754 INFO L290 TraceCheckUtils]: 65: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) 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; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:16:04,755 INFO L290 TraceCheckUtils]: 66: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} assume !false; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:16:04,755 INFO L272 TraceCheckUtils]: 67: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:16:04,755 INFO L290 TraceCheckUtils]: 68: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:04,755 INFO L290 TraceCheckUtils]: 69: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:04,755 INFO L290 TraceCheckUtils]: 70: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:04,756 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8401#true} {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} #62#return; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:16:04,756 INFO L272 TraceCheckUtils]: 72: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:16:04,756 INFO L290 TraceCheckUtils]: 73: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:04,756 INFO L290 TraceCheckUtils]: 74: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:04,756 INFO L290 TraceCheckUtils]: 75: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:04,756 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8401#true} {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} #64#return; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:16:04,757 INFO L272 TraceCheckUtils]: 77: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:16:04,757 INFO L290 TraceCheckUtils]: 78: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:04,757 INFO L290 TraceCheckUtils]: 79: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:04,757 INFO L290 TraceCheckUtils]: 80: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:04,757 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8401#true} {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} #66#return; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:16:04,758 INFO L272 TraceCheckUtils]: 82: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~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)); {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:04,758 INFO L290 TraceCheckUtils]: 83: Hoare triple {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8661#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:04,759 INFO L290 TraceCheckUtils]: 84: Hoare triple {8661#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8402#false} is VALID [2022-04-28 11:16:04,759 INFO L290 TraceCheckUtils]: 85: Hoare triple {8402#false} assume !false; {8402#false} is VALID [2022-04-28 11:16:04,759 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:16:04,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:05,373 INFO L290 TraceCheckUtils]: 85: Hoare triple {8402#false} assume !false; {8402#false} is VALID [2022-04-28 11:16:05,373 INFO L290 TraceCheckUtils]: 84: Hoare triple {8661#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8402#false} is VALID [2022-04-28 11:16:05,374 INFO L290 TraceCheckUtils]: 83: Hoare triple {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8661#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:05,374 INFO L272 TraceCheckUtils]: 82: Hoare triple {8677#(= (+ (* 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)); {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:05,375 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8401#true} {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {8677#(= (+ (* 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,375 INFO L290 TraceCheckUtils]: 80: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:05,375 INFO L290 TraceCheckUtils]: 79: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:05,375 INFO L290 TraceCheckUtils]: 78: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:05,375 INFO L272 TraceCheckUtils]: 77: Hoare triple {8677#(= (+ (* 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)); {8401#true} is VALID [2022-04-28 11:16:05,376 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8401#true} {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {8677#(= (+ (* 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,376 INFO L290 TraceCheckUtils]: 75: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:05,376 INFO L290 TraceCheckUtils]: 74: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:05,376 INFO L290 TraceCheckUtils]: 73: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:05,376 INFO L272 TraceCheckUtils]: 72: Hoare triple {8677#(= (+ (* 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)); {8401#true} is VALID [2022-04-28 11:16:05,377 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8401#true} {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #62#return; {8677#(= (+ (* 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,377 INFO L290 TraceCheckUtils]: 70: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:05,377 INFO L290 TraceCheckUtils]: 69: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:05,377 INFO L290 TraceCheckUtils]: 68: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:05,377 INFO L272 TraceCheckUtils]: 67: Hoare triple {8677#(= (+ (* 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)); {8401#true} is VALID [2022-04-28 11:16:05,377 INFO L290 TraceCheckUtils]: 66: Hoare triple {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !false; {8677#(= (+ (* 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,380 INFO L290 TraceCheckUtils]: 65: Hoare triple {8729#(= (+ (* 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; {8677#(= (+ (* 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,381 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} {8733#(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; {8729#(= (+ (* 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:16:05,381 INFO L290 TraceCheckUtils]: 63: Hoare triple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:05,382 INFO L290 TraceCheckUtils]: 62: Hoare triple {8743#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:05,382 INFO L290 TraceCheckUtils]: 61: Hoare triple {8401#true} ~cond := #in~cond; {8743#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:16:05,382 INFO L272 TraceCheckUtils]: 60: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:16:05,383 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8401#true} {8733#(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; {8733#(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:16:05,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:05,383 INFO L290 TraceCheckUtils]: 57: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:05,383 INFO L290 TraceCheckUtils]: 56: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:05,383 INFO L272 TraceCheckUtils]: 55: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:16:05,383 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8401#true} {8733#(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; {8733#(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:16:05,384 INFO L290 TraceCheckUtils]: 53: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:05,384 INFO L290 TraceCheckUtils]: 52: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:05,384 INFO L290 TraceCheckUtils]: 51: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:05,384 INFO L272 TraceCheckUtils]: 50: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:16:05,384 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8401#true} {8733#(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; {8733#(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:16:05,384 INFO L290 TraceCheckUtils]: 48: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:05,385 INFO L290 TraceCheckUtils]: 47: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:05,385 INFO L290 TraceCheckUtils]: 46: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:05,385 INFO L272 TraceCheckUtils]: 45: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:16:05,385 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8401#true} {8733#(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; {8733#(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:16:05,385 INFO L290 TraceCheckUtils]: 43: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:05,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:05,385 INFO L290 TraceCheckUtils]: 41: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:05,386 INFO L272 TraceCheckUtils]: 40: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:16:05,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {8733#(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; {8733#(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:16:06,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {8733#(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; {8733#(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:16:06,559 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8401#true} {8733#(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; {8733#(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:16:06,560 INFO L290 TraceCheckUtils]: 36: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:06,560 INFO L290 TraceCheckUtils]: 35: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:06,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:06,560 INFO L272 TraceCheckUtils]: 33: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:16:06,560 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8401#true} {8733#(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; {8733#(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:16:06,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:06,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:06,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:06,561 INFO L272 TraceCheckUtils]: 28: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:16:06,561 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8401#true} {8733#(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; {8733#(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:16:06,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:06,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:06,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:06,562 INFO L272 TraceCheckUtils]: 23: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:16:06,562 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8401#true} {8733#(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; {8733#(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:16:06,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:06,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:06,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:06,562 INFO L272 TraceCheckUtils]: 18: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:16:06,563 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8401#true} {8733#(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; {8733#(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:16:06,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:06,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:06,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:06,563 INFO L272 TraceCheckUtils]: 13: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:16:06,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {8733#(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; {8733#(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:16:06,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {8401#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8733#(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:16:06,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8401#true} {8401#true} #60#return; {8401#true} is VALID [2022-04-28 11:16:06,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:06,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:16:06,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:16:06,576 INFO L272 TraceCheckUtils]: 6: Hoare triple {8401#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:16:06,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {8401#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; {8401#true} is VALID [2022-04-28 11:16:06,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {8401#true} call #t~ret5 := main(); {8401#true} is VALID [2022-04-28 11:16:06,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8401#true} {8401#true} #84#return; {8401#true} is VALID [2022-04-28 11:16:06,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:16:06,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {8401#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); {8401#true} is VALID [2022-04-28 11:16:06,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {8401#true} call ULTIMATE.init(); {8401#true} is VALID [2022-04-28 11:16:06,577 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:16:06,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:06,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063087572] [2022-04-28 11:16:06,578 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:06,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532229299] [2022-04-28 11:16:06,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532229299] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:16:06,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:16:06,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-04-28 11:16:06,578 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:06,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1383226722] [2022-04-28 11:16:06,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1383226722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:06,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:06,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:16:06,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782549341] [2022-04-28 11:16:06,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:06,579 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:16:06,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:06,580 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:16:06,619 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:16:06,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:16:06,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:06,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:16:06,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:16:06,620 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:16:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:07,774 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2022-04-28 11:16:07,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:16:07,775 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:16:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:16:07,775 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:16:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-28 11:16:07,776 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:16:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-28 11:16:07,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-28 11:16:07,859 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:16:07,861 INFO L225 Difference]: With dead ends: 116 [2022-04-28 11:16:07,861 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 11:16:07,861 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:16:07,861 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:16:07,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 151 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 11:16:07,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 11:16:07,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-28 11:16:07,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:16:07,937 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:16:07,937 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:16:07,937 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:16:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:07,939 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-28 11:16:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:16:07,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:07,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:07,940 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:16:07,940 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:16:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:07,942 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-28 11:16:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:16:07,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:07,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:07,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:16:07,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:16:07,942 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:16:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-04-28 11:16:07,944 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 86 [2022-04-28 11:16:07,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:16:07,944 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-04-28 11:16:07,944 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:16:07,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 125 transitions. [2022-04-28 11:16:08,087 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:16:08,087 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:16:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 11:16:08,088 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:16:08,088 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:16:08,104 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:16:08,291 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:16:08,291 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:16:08,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:16:08,292 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 3 times [2022-04-28 11:16:08,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:08,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [553306299] [2022-04-28 11:16:08,507 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:16:08,507 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:16:08,508 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 4 times [2022-04-28 11:16:08,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:16:08,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238015889] [2022-04-28 11:16:08,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:16:08,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:16:08,519 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:16:08,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172795934] [2022-04-28 11:16:08,520 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:16:08,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:08,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:16:08,525 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:16:08,526 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:16:08,573 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:16:08,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:16:08,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 11:16:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:16:08,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:16:09,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {9609#true} call ULTIMATE.init(); {9609#true} is VALID [2022-04-28 11:16:09,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {9609#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); {9609#true} is VALID [2022-04-28 11:16:09,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9609#true} {9609#true} #84#return; {9609#true} is VALID [2022-04-28 11:16:09,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {9609#true} call #t~ret5 := main(); {9609#true} is VALID [2022-04-28 11:16:09,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {9609#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; {9609#true} is VALID [2022-04-28 11:16:09,137 INFO L272 TraceCheckUtils]: 6: Hoare triple {9609#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:16:09,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,137 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9609#true} {9609#true} #60#return; {9609#true} is VALID [2022-04-28 11:16:09,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {9609#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:09,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:09,138 INFO L272 TraceCheckUtils]: 13: Hoare triple {9647#(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)); {9609#true} is VALID [2022-04-28 11:16:09,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,138 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:09,139 INFO L272 TraceCheckUtils]: 18: Hoare triple {9647#(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)); {9609#true} is VALID [2022-04-28 11:16:09,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,140 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:09,140 INFO L272 TraceCheckUtils]: 23: Hoare triple {9647#(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)); {9609#true} is VALID [2022-04-28 11:16:09,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,140 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:09,140 INFO L272 TraceCheckUtils]: 28: Hoare triple {9647#(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)); {9609#true} is VALID [2022-04-28 11:16:09,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,142 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:09,142 INFO L272 TraceCheckUtils]: 33: Hoare triple {9647#(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)); {9609#true} is VALID [2022-04-28 11:16:09,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,142 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:09,143 INFO L290 TraceCheckUtils]: 38: Hoare triple {9647#(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; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:09,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !false; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:09,157 INFO L272 TraceCheckUtils]: 40: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:16:09,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,157 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #62#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:09,158 INFO L272 TraceCheckUtils]: 45: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 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)); {9609#true} is VALID [2022-04-28 11:16:09,158 INFO L290 TraceCheckUtils]: 46: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,158 INFO L290 TraceCheckUtils]: 47: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,158 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #64#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:09,159 INFO L272 TraceCheckUtils]: 50: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 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)); {9609#true} is VALID [2022-04-28 11:16:09,159 INFO L290 TraceCheckUtils]: 51: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,159 INFO L290 TraceCheckUtils]: 52: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,159 INFO L290 TraceCheckUtils]: 53: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,159 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #66#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:09,159 INFO L272 TraceCheckUtils]: 55: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) 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)); {9609#true} is VALID [2022-04-28 11:16:09,160 INFO L290 TraceCheckUtils]: 56: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,160 INFO L290 TraceCheckUtils]: 57: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,160 INFO L290 TraceCheckUtils]: 58: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,160 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #68#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:09,160 INFO L272 TraceCheckUtils]: 60: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) 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)); {9609#true} is VALID [2022-04-28 11:16:09,161 INFO L290 TraceCheckUtils]: 61: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,161 INFO L290 TraceCheckUtils]: 62: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,161 INFO L290 TraceCheckUtils]: 63: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,161 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #70#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:09,162 INFO L290 TraceCheckUtils]: 65: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) 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; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:16:09,162 INFO L290 TraceCheckUtils]: 66: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} assume !false; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:16:09,162 INFO L272 TraceCheckUtils]: 67: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:16:09,162 INFO L290 TraceCheckUtils]: 68: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,163 INFO L290 TraceCheckUtils]: 69: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,163 INFO L290 TraceCheckUtils]: 70: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,163 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #62#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:16:09,163 INFO L272 TraceCheckUtils]: 72: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:16:09,163 INFO L290 TraceCheckUtils]: 73: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,163 INFO L290 TraceCheckUtils]: 74: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,164 INFO L290 TraceCheckUtils]: 75: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,164 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #64#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:16:09,164 INFO L272 TraceCheckUtils]: 77: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:16:09,164 INFO L290 TraceCheckUtils]: 78: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,164 INFO L290 TraceCheckUtils]: 79: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,164 INFO L290 TraceCheckUtils]: 80: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,165 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #66#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:16:09,165 INFO L272 TraceCheckUtils]: 82: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~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)); {9609#true} is VALID [2022-04-28 11:16:09,165 INFO L290 TraceCheckUtils]: 83: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,165 INFO L290 TraceCheckUtils]: 84: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,165 INFO L290 TraceCheckUtils]: 85: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,166 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #68#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:16:09,166 INFO L272 TraceCheckUtils]: 87: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~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)); {9609#true} is VALID [2022-04-28 11:16:09,166 INFO L290 TraceCheckUtils]: 88: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,166 INFO L290 TraceCheckUtils]: 89: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,166 INFO L290 TraceCheckUtils]: 90: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,167 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #70#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:16:09,167 INFO L290 TraceCheckUtils]: 92: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} assume !(~n~0 <= ~a~0); {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} is VALID [2022-04-28 11:16:09,167 INFO L272 TraceCheckUtils]: 93: Hoare triple {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:16:09,167 INFO L290 TraceCheckUtils]: 94: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:16:09,168 INFO L290 TraceCheckUtils]: 95: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:16:09,168 INFO L290 TraceCheckUtils]: 96: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:16:09,168 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {9609#true} {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} #72#return; {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} is VALID [2022-04-28 11:16:09,169 INFO L272 TraceCheckUtils]: 98: Hoare triple {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {9912#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:09,169 INFO L290 TraceCheckUtils]: 99: Hoare triple {9912#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9916#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:09,170 INFO L290 TraceCheckUtils]: 100: Hoare triple {9916#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9610#false} is VALID [2022-04-28 11:16:09,170 INFO L290 TraceCheckUtils]: 101: Hoare triple {9610#false} assume !false; {9610#false} is VALID [2022-04-28 11:16:09,170 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:16:09,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:09,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:09,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238015889] [2022-04-28 11:16:09,496 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:09,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172795934] [2022-04-28 11:16:09,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172795934] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:16:09,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:16:09,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 11:16:09,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:09,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [553306299] [2022-04-28 11:16:09,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [553306299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:09,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:09,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:16:09,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833888613] [2022-04-28 11:16:09,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:09,497 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:16:09,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:09,497 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:16:09,540 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:16:09,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:16:09,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:09,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:16:09,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:16:09,541 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:16:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:10,239 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2022-04-28 11:16:10,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:16:10,239 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:16:10,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:16:10,240 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:16:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:16:10,241 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:16:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:16:10,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2022-04-28 11:16:10,319 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:16:10,321 INFO L225 Difference]: With dead ends: 117 [2022-04-28 11:16:10,321 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 11:16:10,322 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:16:10,322 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:16:10,322 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:16:10,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 11:16:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-28 11:16:10,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:16:10,395 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:16:10,396 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:16:10,396 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:16:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:10,398 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-04-28 11:16:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:16:10,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:10,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:10,398 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:16:10,399 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:16:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:10,400 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-04-28 11:16:10,400 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:16:10,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:10,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:10,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:16:10,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:16:10,401 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:16:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2022-04-28 11:16:10,403 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 102 [2022-04-28 11:16:10,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:16:10,403 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2022-04-28 11:16:10,403 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:16:10,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 128 transitions. [2022-04-28 11:16:10,535 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:16:10,535 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:16:10,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 11:16:10,536 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:16:10,536 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:16:10,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 11:16:10,752 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:16:10,752 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:16:10,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:16:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash -360684101, now seen corresponding path program 13 times [2022-04-28 11:16:10,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:10,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [49830744] [2022-04-28 11:16:11,013 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:16:11,013 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:16:11,013 INFO L85 PathProgramCache]: Analyzing trace with hash -360684101, now seen corresponding path program 14 times [2022-04-28 11:16:11,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:16:11,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425544361] [2022-04-28 11:16:11,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:16:11,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:16:11,021 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:16:11,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112422699] [2022-04-28 11:16:11,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:16:11,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:11,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:16:11,022 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:16:11,023 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:16:11,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:16:11,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:16:11,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 11:16:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:16:11,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:16:11,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {10737#true} call ULTIMATE.init(); {10737#true} is VALID [2022-04-28 11:16:11,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {10737#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); {10737#true} is VALID [2022-04-28 11:16:11,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10737#true} {10737#true} #84#return; {10737#true} is VALID [2022-04-28 11:16:11,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {10737#true} call #t~ret5 := main(); {10737#true} is VALID [2022-04-28 11:16:11,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {10737#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; {10737#true} is VALID [2022-04-28 11:16:11,421 INFO L272 TraceCheckUtils]: 6: Hoare triple {10737#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:16:11,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,422 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10737#true} {10737#true} #60#return; {10737#true} is VALID [2022-04-28 11:16:11,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {10737#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:11,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:11,427 INFO L272 TraceCheckUtils]: 13: Hoare triple {10775#(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)); {10737#true} is VALID [2022-04-28 11:16:11,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,427 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:11,427 INFO L272 TraceCheckUtils]: 18: Hoare triple {10775#(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)); {10737#true} is VALID [2022-04-28 11:16:11,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,428 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:11,428 INFO L272 TraceCheckUtils]: 23: Hoare triple {10775#(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)); {10737#true} is VALID [2022-04-28 11:16:11,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,429 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:11,429 INFO L272 TraceCheckUtils]: 28: Hoare triple {10775#(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)); {10737#true} is VALID [2022-04-28 11:16:11,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,430 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:11,430 INFO L272 TraceCheckUtils]: 33: Hoare triple {10775#(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)); {10737#true} is VALID [2022-04-28 11:16:11,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,431 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:11,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {10775#(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; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:11,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !false; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:11,432 INFO L272 TraceCheckUtils]: 40: Hoare triple {10857#(and (= (+ 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)); {10737#true} is VALID [2022-04-28 11:16:11,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,432 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #62#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:11,432 INFO L272 TraceCheckUtils]: 45: Hoare triple {10857#(and (= (+ 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)); {10737#true} is VALID [2022-04-28 11:16:11,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,433 INFO L290 TraceCheckUtils]: 47: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,433 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #64#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:11,433 INFO L272 TraceCheckUtils]: 50: Hoare triple {10857#(and (= (+ 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)); {10737#true} is VALID [2022-04-28 11:16:11,433 INFO L290 TraceCheckUtils]: 51: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,433 INFO L290 TraceCheckUtils]: 52: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,434 INFO L290 TraceCheckUtils]: 53: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,434 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #66#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:11,434 INFO L272 TraceCheckUtils]: 55: Hoare triple {10857#(and (= (+ 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)); {10737#true} is VALID [2022-04-28 11:16:11,434 INFO L290 TraceCheckUtils]: 56: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,434 INFO L290 TraceCheckUtils]: 57: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,435 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #68#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:11,435 INFO L272 TraceCheckUtils]: 60: Hoare triple {10857#(and (= (+ 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)); {10737#true} is VALID [2022-04-28 11:16:11,435 INFO L290 TraceCheckUtils]: 61: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,435 INFO L290 TraceCheckUtils]: 62: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,435 INFO L290 TraceCheckUtils]: 63: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,436 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #70#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:11,436 INFO L290 TraceCheckUtils]: 65: Hoare triple {10857#(and (= (+ 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; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:16:11,436 INFO L290 TraceCheckUtils]: 66: Hoare triple {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} assume !false; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:16:11,437 INFO L272 TraceCheckUtils]: 67: Hoare triple {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:16:11,437 INFO L290 TraceCheckUtils]: 68: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,437 INFO L290 TraceCheckUtils]: 69: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,437 INFO L290 TraceCheckUtils]: 70: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,437 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #62#return; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:16:11,437 INFO L272 TraceCheckUtils]: 72: Hoare triple {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:16:11,437 INFO L290 TraceCheckUtils]: 73: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,438 INFO L290 TraceCheckUtils]: 74: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,438 INFO L290 TraceCheckUtils]: 75: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,438 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #64#return; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:16:11,438 INFO L272 TraceCheckUtils]: 77: Hoare triple {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:16:11,438 INFO L290 TraceCheckUtils]: 78: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,438 INFO L290 TraceCheckUtils]: 79: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,439 INFO L290 TraceCheckUtils]: 80: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,439 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #66#return; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:16:11,439 INFO L272 TraceCheckUtils]: 82: Hoare triple {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:16:11,439 INFO L290 TraceCheckUtils]: 83: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,439 INFO L290 TraceCheckUtils]: 84: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,440 INFO L290 TraceCheckUtils]: 85: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,440 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #68#return; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:16:11,440 INFO L272 TraceCheckUtils]: 87: Hoare triple {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:16:11,440 INFO L290 TraceCheckUtils]: 88: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,440 INFO L290 TraceCheckUtils]: 89: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,441 INFO L290 TraceCheckUtils]: 90: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,441 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #70#return; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:16:11,441 INFO L290 TraceCheckUtils]: 92: Hoare triple {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) 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; {11021#(and (= main_~n~0 3) (= main_~y~0 37))} is VALID [2022-04-28 11:16:11,442 INFO L290 TraceCheckUtils]: 93: Hoare triple {11021#(and (= main_~n~0 3) (= main_~y~0 37))} assume !false; {11021#(and (= main_~n~0 3) (= main_~y~0 37))} is VALID [2022-04-28 11:16:11,442 INFO L272 TraceCheckUtils]: 94: Hoare triple {11021#(and (= main_~n~0 3) (= main_~y~0 37))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:16:11,442 INFO L290 TraceCheckUtils]: 95: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,442 INFO L290 TraceCheckUtils]: 96: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,442 INFO L290 TraceCheckUtils]: 97: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,443 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10737#true} {11021#(and (= main_~n~0 3) (= main_~y~0 37))} #62#return; {11021#(and (= main_~n~0 3) (= main_~y~0 37))} is VALID [2022-04-28 11:16:11,443 INFO L272 TraceCheckUtils]: 99: Hoare triple {11021#(and (= main_~n~0 3) (= main_~y~0 37))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11043#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:11,443 INFO L290 TraceCheckUtils]: 100: Hoare triple {11043#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11047#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:11,444 INFO L290 TraceCheckUtils]: 101: Hoare triple {11047#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10738#false} is VALID [2022-04-28 11:16:11,444 INFO L290 TraceCheckUtils]: 102: Hoare triple {10738#false} assume !false; {10738#false} is VALID [2022-04-28 11:16:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 11:16:11,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:11,777 INFO L290 TraceCheckUtils]: 102: Hoare triple {10738#false} assume !false; {10738#false} is VALID [2022-04-28 11:16:11,777 INFO L290 TraceCheckUtils]: 101: Hoare triple {11047#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10738#false} is VALID [2022-04-28 11:16:11,778 INFO L290 TraceCheckUtils]: 100: Hoare triple {11043#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11047#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:11,778 INFO L272 TraceCheckUtils]: 99: Hoare triple {11063#(= (+ (* 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)); {11043#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:11,779 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10737#true} {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:16:11,779 INFO L290 TraceCheckUtils]: 97: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,779 INFO L290 TraceCheckUtils]: 96: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,779 INFO L290 TraceCheckUtils]: 95: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,779 INFO L272 TraceCheckUtils]: 94: Hoare triple {11063#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:16:11,779 INFO L290 TraceCheckUtils]: 93: Hoare triple {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:16:11,790 INFO L290 TraceCheckUtils]: 92: Hoare triple {11085#(= (+ (* 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; {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:16:11,791 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {10737#true} {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #70#return; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:16:11,791 INFO L290 TraceCheckUtils]: 90: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,791 INFO L290 TraceCheckUtils]: 89: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,791 INFO L290 TraceCheckUtils]: 88: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,792 INFO L272 TraceCheckUtils]: 87: Hoare triple {11085#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:16:11,792 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10737#true} {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #68#return; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:16:11,792 INFO L290 TraceCheckUtils]: 85: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,792 INFO L290 TraceCheckUtils]: 84: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,792 INFO L290 TraceCheckUtils]: 83: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,792 INFO L272 TraceCheckUtils]: 82: Hoare triple {11085#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:16:11,793 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10737#true} {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #66#return; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:16:11,793 INFO L290 TraceCheckUtils]: 80: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,793 INFO L290 TraceCheckUtils]: 79: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,793 INFO L290 TraceCheckUtils]: 78: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,793 INFO L272 TraceCheckUtils]: 77: Hoare triple {11085#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:16:11,794 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10737#true} {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #64#return; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:16:11,794 INFO L290 TraceCheckUtils]: 75: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,794 INFO L290 TraceCheckUtils]: 74: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,794 INFO L290 TraceCheckUtils]: 73: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,794 INFO L272 TraceCheckUtils]: 72: Hoare triple {11085#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:16:11,795 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10737#true} {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #62#return; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:16:11,795 INFO L290 TraceCheckUtils]: 70: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,795 INFO L290 TraceCheckUtils]: 69: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,795 INFO L290 TraceCheckUtils]: 68: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,795 INFO L272 TraceCheckUtils]: 67: Hoare triple {11085#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:16:11,796 INFO L290 TraceCheckUtils]: 66: Hoare triple {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !false; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:16:11,800 INFO L290 TraceCheckUtils]: 65: Hoare triple {11167#(= (+ (* 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; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:16:11,800 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10737#true} {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #70#return; {11167#(= (+ (* 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:16:11,800 INFO L290 TraceCheckUtils]: 63: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,800 INFO L290 TraceCheckUtils]: 62: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,800 INFO L290 TraceCheckUtils]: 61: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,801 INFO L272 TraceCheckUtils]: 60: Hoare triple {11167#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:16:11,801 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10737#true} {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #68#return; {11167#(= (+ (* 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:16:11,801 INFO L290 TraceCheckUtils]: 58: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,801 INFO L272 TraceCheckUtils]: 55: Hoare triple {11167#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:16:11,802 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10737#true} {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #66#return; {11167#(= (+ (* 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:16:11,802 INFO L290 TraceCheckUtils]: 53: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,802 INFO L272 TraceCheckUtils]: 50: Hoare triple {11167#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:16:11,803 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10737#true} {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #64#return; {11167#(= (+ (* 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:16:11,803 INFO L290 TraceCheckUtils]: 48: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,803 INFO L290 TraceCheckUtils]: 47: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,803 INFO L272 TraceCheckUtils]: 45: Hoare triple {11167#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:16:11,804 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10737#true} {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #62#return; {11167#(= (+ (* 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:16:11,804 INFO L290 TraceCheckUtils]: 43: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,804 INFO L290 TraceCheckUtils]: 42: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,804 INFO L290 TraceCheckUtils]: 41: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,804 INFO L272 TraceCheckUtils]: 40: Hoare triple {11167#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:16:11,805 INFO L290 TraceCheckUtils]: 39: Hoare triple {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} assume !false; {11167#(= (+ (* 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:16:11,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {11249#(= (+ (* 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; {11167#(= (+ (* 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:16:11,809 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10737#true} {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} #70#return; {11249#(= (+ (* 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:16:11,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,809 INFO L272 TraceCheckUtils]: 33: Hoare triple {11249#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:16:11,810 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10737#true} {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} #68#return; {11249#(= (+ (* 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:16:11,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,811 INFO L272 TraceCheckUtils]: 28: Hoare triple {11249#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:16:11,811 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10737#true} {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} #66#return; {11249#(= (+ (* 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:16:11,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,812 INFO L272 TraceCheckUtils]: 23: Hoare triple {11249#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:16:11,812 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10737#true} {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} #64#return; {11249#(= (+ (* 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:16:11,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,812 INFO L272 TraceCheckUtils]: 18: Hoare triple {11249#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:16:11,813 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10737#true} {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} #62#return; {11249#(= (+ (* 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:16:11,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,813 INFO L272 TraceCheckUtils]: 13: Hoare triple {11249#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:16:11,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} assume !false; {11249#(= (+ (* 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:16:11,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {10737#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {11249#(= (+ (* 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:16:11,814 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10737#true} {10737#true} #60#return; {10737#true} is VALID [2022-04-28 11:16:11,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:16:11,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:16:11,815 INFO L272 TraceCheckUtils]: 6: Hoare triple {10737#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:16:11,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {10737#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; {10737#true} is VALID [2022-04-28 11:16:11,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {10737#true} call #t~ret5 := main(); {10737#true} is VALID [2022-04-28 11:16:11,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10737#true} {10737#true} #84#return; {10737#true} is VALID [2022-04-28 11:16:11,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:16:11,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {10737#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); {10737#true} is VALID [2022-04-28 11:16:11,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {10737#true} call ULTIMATE.init(); {10737#true} is VALID [2022-04-28 11:16:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 11:16:11,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:11,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425544361] [2022-04-28 11:16:11,816 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:11,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112422699] [2022-04-28 11:16:11,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112422699] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:16:11,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:16:11,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-28 11:16:11,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:11,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [49830744] [2022-04-28 11:16:11,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [49830744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:11,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:11,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:16:11,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583034409] [2022-04-28 11:16:11,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:11,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 103 [2022-04-28 11:16:11,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:11,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:16:11,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:11,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:16:11,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:11,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:16:11,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:16:11,867 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:16:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:12,772 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2022-04-28 11:16:12,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:16:12,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 103 [2022-04-28 11:16:12,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:16:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:16:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2022-04-28 11:16:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:16:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2022-04-28 11:16:12,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 112 transitions. [2022-04-28 11:16:12,872 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:16:12,874 INFO L225 Difference]: With dead ends: 142 [2022-04-28 11:16:12,874 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 11:16:12,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:16:12,875 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 7 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:16:12,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 270 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 11:16:12,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 11:16:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-04-28 11:16:12,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:16:12,960 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:16:12,960 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:16:12,960 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:16:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:12,963 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2022-04-28 11:16:12,963 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2022-04-28 11:16:12,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:12,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:12,964 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:16:12,964 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:16:12,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:12,966 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2022-04-28 11:16:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2022-04-28 11:16:12,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:12,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:12,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:16:12,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:16:12,967 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:16:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2022-04-28 11:16:12,969 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 103 [2022-04-28 11:16:12,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:16:12,969 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2022-04-28 11:16:12,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:16:12,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 142 transitions. [2022-04-28 11:16:13,121 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:16:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-04-28 11:16:13,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 11:16:13,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:16:13,122 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:16:13,140 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:16:13,323 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:16:13,323 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:16:13,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:16:13,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 3 times [2022-04-28 11:16:13,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:13,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1057035544] [2022-04-28 11:16:13,547 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:16:13,547 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:16:13,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 4 times [2022-04-28 11:16:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:16:13,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311541739] [2022-04-28 11:16:13,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:16:13,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:16:13,554 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:16:13,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413065324] [2022-04-28 11:16:13,555 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:16:13,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:13,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:16:13,556 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:16:13,557 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:16:13,602 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:16:13,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:16:13,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 11:16:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:16:13,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:16:14,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {12192#true} call ULTIMATE.init(); {12192#true} is VALID [2022-04-28 11:16:14,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {12192#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); {12192#true} is VALID [2022-04-28 11:16:14,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12192#true} {12192#true} #84#return; {12192#true} is VALID [2022-04-28 11:16:14,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {12192#true} call #t~ret5 := main(); {12192#true} is VALID [2022-04-28 11:16:14,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {12192#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; {12192#true} is VALID [2022-04-28 11:16:14,162 INFO L272 TraceCheckUtils]: 6: Hoare triple {12192#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:16:14,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,162 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12192#true} {12192#true} #60#return; {12192#true} is VALID [2022-04-28 11:16:14,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {12192#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:14,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:14,163 INFO L272 TraceCheckUtils]: 13: Hoare triple {12230#(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)); {12192#true} is VALID [2022-04-28 11:16:14,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,164 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12192#true} {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:14,164 INFO L272 TraceCheckUtils]: 18: Hoare triple {12230#(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)); {12192#true} is VALID [2022-04-28 11:16:14,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,165 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12192#true} {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:14,165 INFO L272 TraceCheckUtils]: 23: Hoare triple {12230#(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)); {12192#true} is VALID [2022-04-28 11:16:14,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,165 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12192#true} {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:14,165 INFO L272 TraceCheckUtils]: 28: Hoare triple {12230#(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)); {12192#true} is VALID [2022-04-28 11:16:14,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,166 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12192#true} {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:14,166 INFO L272 TraceCheckUtils]: 33: Hoare triple {12230#(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)); {12192#true} is VALID [2022-04-28 11:16:14,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,167 INFO L290 TraceCheckUtils]: 36: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,167 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12192#true} {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:14,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {12230#(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; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:14,168 INFO L290 TraceCheckUtils]: 39: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !false; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:14,168 INFO L272 TraceCheckUtils]: 40: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~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)); {12192#true} is VALID [2022-04-28 11:16:14,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,168 INFO L290 TraceCheckUtils]: 43: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,169 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {12192#true} {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #62#return; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:14,169 INFO L272 TraceCheckUtils]: 45: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~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)); {12192#true} is VALID [2022-04-28 11:16:14,169 INFO L290 TraceCheckUtils]: 46: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,169 INFO L290 TraceCheckUtils]: 47: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,169 INFO L290 TraceCheckUtils]: 48: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,169 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {12192#true} {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #64#return; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:14,170 INFO L272 TraceCheckUtils]: 50: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~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)); {12192#true} is VALID [2022-04-28 11:16:14,170 INFO L290 TraceCheckUtils]: 51: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,170 INFO L290 TraceCheckUtils]: 52: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,170 INFO L290 TraceCheckUtils]: 53: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,170 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12192#true} {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #66#return; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:14,170 INFO L272 TraceCheckUtils]: 55: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) 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)); {12192#true} is VALID [2022-04-28 11:16:14,170 INFO L290 TraceCheckUtils]: 56: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,171 INFO L290 TraceCheckUtils]: 57: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,171 INFO L290 TraceCheckUtils]: 58: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,171 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12192#true} {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #68#return; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:14,171 INFO L272 TraceCheckUtils]: 60: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) 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)); {12192#true} is VALID [2022-04-28 11:16:14,171 INFO L290 TraceCheckUtils]: 61: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,171 INFO L290 TraceCheckUtils]: 62: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,172 INFO L290 TraceCheckUtils]: 63: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,172 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12192#true} {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #70#return; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:14,172 INFO L290 TraceCheckUtils]: 65: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) 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; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:16:14,173 INFO L290 TraceCheckUtils]: 66: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} assume !false; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:16:14,173 INFO L272 TraceCheckUtils]: 67: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:16:14,173 INFO L290 TraceCheckUtils]: 68: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,173 INFO L290 TraceCheckUtils]: 69: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,173 INFO L290 TraceCheckUtils]: 70: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,174 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12192#true} {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} #62#return; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:16:14,174 INFO L272 TraceCheckUtils]: 72: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12192#true} is VALID [2022-04-28 11:16:14,174 INFO L290 TraceCheckUtils]: 73: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,174 INFO L290 TraceCheckUtils]: 74: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,174 INFO L290 TraceCheckUtils]: 75: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,175 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {12192#true} {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} #64#return; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:16:14,175 INFO L272 TraceCheckUtils]: 77: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:16:14,175 INFO L290 TraceCheckUtils]: 78: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,175 INFO L290 TraceCheckUtils]: 79: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,175 INFO L290 TraceCheckUtils]: 80: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,175 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {12192#true} {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} #66#return; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:16:14,176 INFO L272 TraceCheckUtils]: 82: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:16:14,176 INFO L290 TraceCheckUtils]: 83: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,176 INFO L290 TraceCheckUtils]: 84: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,176 INFO L290 TraceCheckUtils]: 85: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,176 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {12192#true} {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} #68#return; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:16:14,176 INFO L272 TraceCheckUtils]: 87: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12192#true} is VALID [2022-04-28 11:16:14,177 INFO L290 TraceCheckUtils]: 88: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,177 INFO L290 TraceCheckUtils]: 89: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,177 INFO L290 TraceCheckUtils]: 90: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,177 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {12192#true} {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} #70#return; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:16:14,178 INFO L290 TraceCheckUtils]: 92: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} assume !(~n~0 <= ~a~0); {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} is VALID [2022-04-28 11:16:14,179 INFO L272 TraceCheckUtils]: 93: Hoare triple {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:16:14,179 INFO L290 TraceCheckUtils]: 94: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,179 INFO L290 TraceCheckUtils]: 95: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,179 INFO L290 TraceCheckUtils]: 96: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,179 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {12192#true} {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} #72#return; {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} is VALID [2022-04-28 11:16:14,180 INFO L272 TraceCheckUtils]: 98: Hoare triple {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:16:14,180 INFO L290 TraceCheckUtils]: 99: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:16:14,180 INFO L290 TraceCheckUtils]: 100: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:16:14,180 INFO L290 TraceCheckUtils]: 101: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:16:14,180 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {12192#true} {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} #74#return; {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} is VALID [2022-04-28 11:16:14,182 INFO L272 TraceCheckUtils]: 103: Hoare triple {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~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)); {12510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:14,182 INFO L290 TraceCheckUtils]: 104: Hoare triple {12510#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:14,182 INFO L290 TraceCheckUtils]: 105: Hoare triple {12514#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12193#false} is VALID [2022-04-28 11:16:14,182 INFO L290 TraceCheckUtils]: 106: Hoare triple {12193#false} assume !false; {12193#false} is VALID [2022-04-28 11:16:14,183 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:16:14,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:18,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:18,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311541739] [2022-04-28 11:16:18,542 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:18,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413065324] [2022-04-28 11:16:18,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413065324] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:16:18,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:16:18,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 11:16:18,543 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:18,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1057035544] [2022-04-28 11:16:18,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1057035544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:18,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:18,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:16:18,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758770881] [2022-04-28 11:16:18,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:18,544 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:16:18,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:18,544 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:16:18,590 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:16:18,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:16:18,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:18,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:16:18,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:16:18,591 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:16:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:19,344 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-04-28 11:16:19,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:16:19,345 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:16:19,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:16:19,345 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:16:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:16:19,346 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:16:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:16:19,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2022-04-28 11:16:19,431 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:16:19,433 INFO L225 Difference]: With dead ends: 136 [2022-04-28 11:16:19,433 INFO L226 Difference]: Without dead ends: 123 [2022-04-28 11:16:19,433 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:16:19,434 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:16:19,434 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:16:19,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-28 11:16:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-04-28 11:16:19,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:16:19,537 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:16:19,537 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:16:19,537 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:16:19,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:19,539 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-04-28 11:16:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:16:19,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:19,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:19,540 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:16:19,540 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:16:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:19,541 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-04-28 11:16:19,542 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:16:19,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:19,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:19,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:16:19,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:16:19,542 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:16:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-04-28 11:16:19,544 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 107 [2022-04-28 11:16:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:16:19,544 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-04-28 11:16:19,544 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:16:19,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 133 transitions. [2022-04-28 11:16:19,681 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:16:19,681 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:16:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 11:16:19,682 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:16:19,682 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:16:19,697 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:16:19,882 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:16:19,882 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:16:19,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:16:19,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1388085622, now seen corresponding path program 15 times [2022-04-28 11:16:19,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:19,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2071633053] [2022-04-28 11:16:20,106 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:16:20,106 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:16:20,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1388085622, now seen corresponding path program 16 times [2022-04-28 11:16:20,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:16:20,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20773590] [2022-04-28 11:16:20,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:16:20,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:16:20,115 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:16:20,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [804754212] [2022-04-28 11:16:20,116 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:16:20,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:20,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:16:20,117 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:16:20,118 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:16:20,163 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:16:20,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:16:20,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 11:16:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:16:20,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:16:20,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {13420#true} call ULTIMATE.init(); {13420#true} is VALID [2022-04-28 11:16:20,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {13420#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); {13420#true} is VALID [2022-04-28 11:16:20,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13420#true} {13420#true} #84#return; {13420#true} is VALID [2022-04-28 11:16:20,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {13420#true} call #t~ret5 := main(); {13420#true} is VALID [2022-04-28 11:16:20,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {13420#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; {13420#true} is VALID [2022-04-28 11:16:20,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {13420#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:16:20,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:20,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:20,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13420#true} {13420#true} #60#return; {13420#true} is VALID [2022-04-28 11:16:20,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {13420#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13458#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:16:20,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {13458#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} assume !false; {13458#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:16:20,669 INFO L272 TraceCheckUtils]: 13: Hoare triple {13458#(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)); {13420#true} is VALID [2022-04-28 11:16:20,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:20,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:20,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,669 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13420#true} {13458#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} #62#return; {13458#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:16:20,669 INFO L272 TraceCheckUtils]: 18: Hoare triple {13458#(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)); {13420#true} is VALID [2022-04-28 11:16:20,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:20,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:20,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,670 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13420#true} {13458#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} #64#return; {13458#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:16:20,670 INFO L272 TraceCheckUtils]: 23: Hoare triple {13458#(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)); {13420#true} is VALID [2022-04-28 11:16:20,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:20,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:20,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,671 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13420#true} {13458#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} #66#return; {13458#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:16:20,671 INFO L272 TraceCheckUtils]: 28: Hoare triple {13458#(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)); {13420#true} is VALID [2022-04-28 11:16:20,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:20,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:20,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,672 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13420#true} {13458#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} #68#return; {13458#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:16:20,672 INFO L272 TraceCheckUtils]: 33: Hoare triple {13458#(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)); {13420#true} is VALID [2022-04-28 11:16:20,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:20,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:20,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,673 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13420#true} {13458#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} #70#return; {13458#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:16:20,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {13458#(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; {13540#(and (<= 1 main_~x~0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:16:20,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {13540#(and (<= 1 main_~x~0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} assume !false; {13540#(and (<= 1 main_~x~0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:16:20,674 INFO L272 TraceCheckUtils]: 40: Hoare triple {13540#(and (<= 1 main_~x~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)); {13420#true} is VALID [2022-04-28 11:16:20,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:20,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:20,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,674 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13420#true} {13540#(and (<= 1 main_~x~0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #62#return; {13540#(and (<= 1 main_~x~0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:16:20,674 INFO L272 TraceCheckUtils]: 45: Hoare triple {13540#(and (<= 1 main_~x~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)); {13420#true} is VALID [2022-04-28 11:16:20,675 INFO L290 TraceCheckUtils]: 46: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:20,675 INFO L290 TraceCheckUtils]: 47: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:20,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,675 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13420#true} {13540#(and (<= 1 main_~x~0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #64#return; {13540#(and (<= 1 main_~x~0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:16:20,675 INFO L272 TraceCheckUtils]: 50: Hoare triple {13540#(and (<= 1 main_~x~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)); {13420#true} is VALID [2022-04-28 11:16:20,676 INFO L290 TraceCheckUtils]: 51: Hoare triple {13420#true} ~cond := #in~cond; {13580#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:20,676 INFO L290 TraceCheckUtils]: 52: Hoare triple {13580#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:20,676 INFO L290 TraceCheckUtils]: 53: Hoare triple {13584#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:20,677 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13584#(not (= |__VERIFIER_assert_#in~cond| 0))} {13540#(and (<= 1 main_~x~0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #66#return; {13591#(and (= main_~z~0 12) (= (+ 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:16:20,677 INFO L272 TraceCheckUtils]: 55: Hoare triple {13591#(and (= main_~z~0 12) (= (+ 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)); {13420#true} is VALID [2022-04-28 11:16:20,677 INFO L290 TraceCheckUtils]: 56: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:20,677 INFO L290 TraceCheckUtils]: 57: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:20,677 INFO L290 TraceCheckUtils]: 58: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,678 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13420#true} {13591#(and (= main_~z~0 12) (= (+ 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; {13591#(and (= main_~z~0 12) (= (+ 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:16:20,678 INFO L272 TraceCheckUtils]: 60: Hoare triple {13591#(and (= main_~z~0 12) (= (+ 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)); {13420#true} is VALID [2022-04-28 11:16:20,678 INFO L290 TraceCheckUtils]: 61: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:20,678 INFO L290 TraceCheckUtils]: 62: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:20,678 INFO L290 TraceCheckUtils]: 63: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,678 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13420#true} {13591#(and (= main_~z~0 12) (= (+ 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; {13591#(and (= main_~z~0 12) (= (+ 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:16:20,679 INFO L290 TraceCheckUtils]: 65: Hoare triple {13591#(and (= main_~z~0 12) (= (+ 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; {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:16:20,679 INFO L290 TraceCheckUtils]: 66: Hoare triple {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} assume !false; {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:16:20,680 INFO L272 TraceCheckUtils]: 67: Hoare triple {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:16:20,680 INFO L290 TraceCheckUtils]: 68: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:20,680 INFO L290 TraceCheckUtils]: 69: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:20,680 INFO L290 TraceCheckUtils]: 70: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,680 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13420#true} {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} #62#return; {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:16:20,680 INFO L272 TraceCheckUtils]: 72: Hoare triple {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:16:20,680 INFO L290 TraceCheckUtils]: 73: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:20,681 INFO L290 TraceCheckUtils]: 74: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:20,681 INFO L290 TraceCheckUtils]: 75: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,681 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13420#true} {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} #64#return; {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:16:20,681 INFO L272 TraceCheckUtils]: 77: Hoare triple {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:16:20,681 INFO L290 TraceCheckUtils]: 78: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:20,681 INFO L290 TraceCheckUtils]: 79: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:20,681 INFO L290 TraceCheckUtils]: 80: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,682 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13420#true} {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} #66#return; {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:16:20,682 INFO L272 TraceCheckUtils]: 82: Hoare triple {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~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)); {13420#true} is VALID [2022-04-28 11:16:20,682 INFO L290 TraceCheckUtils]: 83: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:20,682 INFO L290 TraceCheckUtils]: 84: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:20,682 INFO L290 TraceCheckUtils]: 85: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,683 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13420#true} {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} #68#return; {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:16:20,683 INFO L272 TraceCheckUtils]: 87: Hoare triple {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:16:20,683 INFO L290 TraceCheckUtils]: 88: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:20,683 INFO L290 TraceCheckUtils]: 89: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:20,683 INFO L290 TraceCheckUtils]: 90: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,684 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {13420#true} {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} #70#return; {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:16:20,684 INFO L290 TraceCheckUtils]: 92: Hoare triple {13625#(and (= main_~z~0 18) (= (+ main_~y~0 (- 12) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13707#(and (= main_~n~0 3) (= main_~y~0 37) (= (+ main_~x~0 (- 19)) 8))} is VALID [2022-04-28 11:16:20,684 INFO L290 TraceCheckUtils]: 93: Hoare triple {13707#(and (= main_~n~0 3) (= main_~y~0 37) (= (+ main_~x~0 (- 19)) 8))} assume !false; {13707#(and (= main_~n~0 3) (= main_~y~0 37) (= (+ main_~x~0 (- 19)) 8))} is VALID [2022-04-28 11:16:20,685 INFO L272 TraceCheckUtils]: 94: Hoare triple {13707#(and (= main_~n~0 3) (= main_~y~0 37) (= (+ main_~x~0 (- 19)) 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:16:20,685 INFO L290 TraceCheckUtils]: 95: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:20,685 INFO L290 TraceCheckUtils]: 96: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:20,685 INFO L290 TraceCheckUtils]: 97: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:20,685 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {13420#true} {13707#(and (= main_~n~0 3) (= main_~y~0 37) (= (+ main_~x~0 (- 19)) 8))} #62#return; {13707#(and (= main_~n~0 3) (= main_~y~0 37) (= (+ main_~x~0 (- 19)) 8))} is VALID [2022-04-28 11:16:20,685 INFO L272 TraceCheckUtils]: 99: Hoare triple {13707#(and (= main_~n~0 3) (= main_~y~0 37) (= (+ main_~x~0 (- 19)) 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:16:20,686 INFO L290 TraceCheckUtils]: 100: Hoare triple {13420#true} ~cond := #in~cond; {13580#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:20,686 INFO L290 TraceCheckUtils]: 101: Hoare triple {13580#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:20,686 INFO L290 TraceCheckUtils]: 102: Hoare triple {13584#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:20,687 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {13584#(not (= |__VERIFIER_assert_#in~cond| 0))} {13707#(and (= main_~n~0 3) (= main_~y~0 37) (= (+ main_~x~0 (- 19)) 8))} #64#return; {13741#(and (= main_~n~0 3) (= main_~x~0 27))} is VALID [2022-04-28 11:16:20,687 INFO L272 TraceCheckUtils]: 104: Hoare triple {13741#(and (= main_~n~0 3) (= main_~x~0 27))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:20,688 INFO L290 TraceCheckUtils]: 105: Hoare triple {13745#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:20,688 INFO L290 TraceCheckUtils]: 106: Hoare triple {13749#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13421#false} is VALID [2022-04-28 11:16:20,688 INFO L290 TraceCheckUtils]: 107: Hoare triple {13421#false} assume !false; {13421#false} is VALID [2022-04-28 11:16:20,688 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:16:20,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:21,495 INFO L290 TraceCheckUtils]: 107: Hoare triple {13421#false} assume !false; {13421#false} is VALID [2022-04-28 11:16:21,495 INFO L290 TraceCheckUtils]: 106: Hoare triple {13749#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13421#false} is VALID [2022-04-28 11:16:21,496 INFO L290 TraceCheckUtils]: 105: Hoare triple {13745#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:21,496 INFO L272 TraceCheckUtils]: 104: Hoare triple {13765#(= (* 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)); {13745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:21,497 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {13584#(not (= |__VERIFIER_assert_#in~cond| 0))} {13769#(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; {13765#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:16:21,497 INFO L290 TraceCheckUtils]: 102: Hoare triple {13584#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:21,497 INFO L290 TraceCheckUtils]: 101: Hoare triple {13779#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:21,498 INFO L290 TraceCheckUtils]: 100: Hoare triple {13420#true} ~cond := #in~cond; {13779#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:16:21,498 INFO L272 TraceCheckUtils]: 99: Hoare triple {13769#(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)); {13420#true} is VALID [2022-04-28 11:16:21,498 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {13420#true} {13769#(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; {13769#(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:16:21,498 INFO L290 TraceCheckUtils]: 97: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,498 INFO L290 TraceCheckUtils]: 96: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:21,498 INFO L290 TraceCheckUtils]: 95: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:21,499 INFO L272 TraceCheckUtils]: 94: Hoare triple {13769#(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)); {13420#true} is VALID [2022-04-28 11:16:21,499 INFO L290 TraceCheckUtils]: 93: Hoare triple {13769#(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; {13769#(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:16:21,503 INFO L290 TraceCheckUtils]: 92: Hoare triple {13804#(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; {13769#(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:16:21,504 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {13420#true} {13804#(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; {13804#(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:16:21,504 INFO L290 TraceCheckUtils]: 90: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,504 INFO L290 TraceCheckUtils]: 89: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:21,504 INFO L290 TraceCheckUtils]: 88: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:21,504 INFO L272 TraceCheckUtils]: 87: Hoare triple {13804#(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)); {13420#true} is VALID [2022-04-28 11:16:21,505 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13420#true} {13804#(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; {13804#(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:16:21,505 INFO L290 TraceCheckUtils]: 85: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,505 INFO L290 TraceCheckUtils]: 84: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:21,505 INFO L290 TraceCheckUtils]: 83: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:21,505 INFO L272 TraceCheckUtils]: 82: Hoare triple {13804#(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)); {13420#true} is VALID [2022-04-28 11:16:21,505 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13420#true} {13804#(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; {13804#(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:16:21,505 INFO L290 TraceCheckUtils]: 80: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,506 INFO L290 TraceCheckUtils]: 79: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:21,506 INFO L290 TraceCheckUtils]: 78: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:21,506 INFO L272 TraceCheckUtils]: 77: Hoare triple {13804#(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)); {13420#true} is VALID [2022-04-28 11:16:21,506 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13420#true} {13804#(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; {13804#(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:16:21,506 INFO L290 TraceCheckUtils]: 75: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,506 INFO L290 TraceCheckUtils]: 74: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:21,506 INFO L290 TraceCheckUtils]: 73: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:21,507 INFO L272 TraceCheckUtils]: 72: Hoare triple {13804#(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)); {13420#true} is VALID [2022-04-28 11:16:21,507 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13420#true} {13804#(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; {13804#(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:16:21,507 INFO L290 TraceCheckUtils]: 70: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,507 INFO L290 TraceCheckUtils]: 69: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:21,507 INFO L290 TraceCheckUtils]: 68: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:21,507 INFO L272 TraceCheckUtils]: 67: Hoare triple {13804#(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)); {13420#true} is VALID [2022-04-28 11:16:21,508 INFO L290 TraceCheckUtils]: 66: Hoare triple {13804#(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; {13804#(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:16:21,513 INFO L290 TraceCheckUtils]: 65: Hoare triple {13886#(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; {13804#(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:16:21,514 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13420#true} {13886#(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; {13886#(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:16:21,514 INFO L290 TraceCheckUtils]: 63: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,514 INFO L290 TraceCheckUtils]: 62: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:21,514 INFO L290 TraceCheckUtils]: 61: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:21,514 INFO L272 TraceCheckUtils]: 60: Hoare triple {13886#(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)); {13420#true} is VALID [2022-04-28 11:16:21,514 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13420#true} {13886#(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; {13886#(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:16:21,515 INFO L290 TraceCheckUtils]: 58: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,515 INFO L290 TraceCheckUtils]: 57: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:21,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:21,515 INFO L272 TraceCheckUtils]: 55: Hoare triple {13886#(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)); {13420#true} is VALID [2022-04-28 11:16:21,516 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13584#(not (= |__VERIFIER_assert_#in~cond| 0))} {13920#(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; {13886#(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:16:21,516 INFO L290 TraceCheckUtils]: 53: Hoare triple {13584#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:21,516 INFO L290 TraceCheckUtils]: 52: Hoare triple {13779#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:21,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {13420#true} ~cond := #in~cond; {13779#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:16:21,517 INFO L272 TraceCheckUtils]: 50: Hoare triple {13920#(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)); {13420#true} is VALID [2022-04-28 11:16:21,517 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13420#true} {13920#(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; {13920#(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:16:21,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:21,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:21,518 INFO L272 TraceCheckUtils]: 45: Hoare triple {13920#(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)); {13420#true} is VALID [2022-04-28 11:16:21,518 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13420#true} {13920#(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; {13920#(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:16:21,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:21,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:21,518 INFO L272 TraceCheckUtils]: 40: Hoare triple {13920#(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)); {13420#true} is VALID [2022-04-28 11:16:21,519 INFO L290 TraceCheckUtils]: 39: Hoare triple {13920#(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; {13920#(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:16:21,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {13969#(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; {13920#(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:16:21,526 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13420#true} {13969#(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; {13969#(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:16:21,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:21,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:21,527 INFO L272 TraceCheckUtils]: 33: Hoare triple {13969#(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)); {13420#true} is VALID [2022-04-28 11:16:21,527 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13420#true} {13969#(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; {13969#(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:16:21,527 INFO L290 TraceCheckUtils]: 31: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:21,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:21,528 INFO L272 TraceCheckUtils]: 28: Hoare triple {13969#(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)); {13420#true} is VALID [2022-04-28 11:16:21,528 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13420#true} {13969#(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; {13969#(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:16:21,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:21,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:21,528 INFO L272 TraceCheckUtils]: 23: Hoare triple {13969#(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)); {13420#true} is VALID [2022-04-28 11:16:21,529 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13420#true} {13969#(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; {13969#(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:16:21,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:21,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:21,529 INFO L272 TraceCheckUtils]: 18: Hoare triple {13969#(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)); {13420#true} is VALID [2022-04-28 11:16:21,530 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13420#true} {13969#(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; {13969#(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:16:21,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:21,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:21,530 INFO L272 TraceCheckUtils]: 13: Hoare triple {13969#(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)); {13420#true} is VALID [2022-04-28 11:16:21,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {13969#(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; {13969#(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:16:21,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {13420#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13969#(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:16:21,532 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13420#true} {13420#true} #60#return; {13420#true} is VALID [2022-04-28 11:16:21,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:16:21,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:16:21,532 INFO L272 TraceCheckUtils]: 6: Hoare triple {13420#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:16:21,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {13420#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; {13420#true} is VALID [2022-04-28 11:16:21,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {13420#true} call #t~ret5 := main(); {13420#true} is VALID [2022-04-28 11:16:21,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13420#true} {13420#true} #84#return; {13420#true} is VALID [2022-04-28 11:16:21,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:16:21,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {13420#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); {13420#true} is VALID [2022-04-28 11:16:21,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {13420#true} call ULTIMATE.init(); {13420#true} is VALID [2022-04-28 11:16:21,533 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:16:21,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:21,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20773590] [2022-04-28 11:16:21,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:21,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804754212] [2022-04-28 11:16:21,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804754212] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:16:21,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:16:21,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-28 11:16:21,534 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:21,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2071633053] [2022-04-28 11:16:21,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2071633053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:21,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:21,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 11:16:21,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150778552] [2022-04-28 11:16:21,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:21,535 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:16:21,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:21,535 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:16:21,603 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:16:21,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 11:16:21,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:21,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 11:16:21,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-28 11:16:21,604 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:16:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:23,971 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2022-04-28 11:16:23,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:16:23,971 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:16:23,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:16:23,971 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:16:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2022-04-28 11:16:23,973 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:16:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2022-04-28 11:16:23,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 106 transitions. [2022-04-28 11:16:24,106 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:16:24,108 INFO L225 Difference]: With dead ends: 139 [2022-04-28 11:16:24,108 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 11:16:24,108 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:16:24,108 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 11:16:24,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 189 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 11:16:24,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 11:16:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2022-04-28 11:16:24,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:16:24,193 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:16:24,193 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:16:24,193 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:16:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:24,198 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-04-28 11:16:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2022-04-28 11:16:24,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:24,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:24,199 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:16:24,199 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:16:24,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:24,201 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-04-28 11:16:24,201 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2022-04-28 11:16:24,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:24,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:24,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:16:24,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:16:24,202 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:16:24,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2022-04-28 11:16:24,204 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 108 [2022-04-28 11:16:24,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:16:24,204 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2022-04-28 11:16:24,204 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:16:24,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 138 transitions. [2022-04-28 11:16:24,387 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:16:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2022-04-28 11:16:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 11:16:24,388 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:16:24,388 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:16:24,406 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:16:24,588 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:16:24,589 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:16:24,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:16:24,589 INFO L85 PathProgramCache]: Analyzing trace with hash 34642523, now seen corresponding path program 17 times [2022-04-28 11:16:24,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:24,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [552341601] [2022-04-28 11:16:24,801 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:16:24,801 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:16:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash 34642523, now seen corresponding path program 18 times [2022-04-28 11:16:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:16:24,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650644260] [2022-04-28 11:16:24,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:16:24,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:16:24,824 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:16:24,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [922043503] [2022-04-28 11:16:24,824 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:16:24,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:24,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:16:24,825 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:16:24,826 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:16:25,355 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:16:25,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:16:25,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 11:16:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:16:25,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:48,660 WARN L833 $PredicateComparison]: unable to prove that (exists ((aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 Int) (aux_div_v_main_~z~0_BEFORE_CALL_279_45 Int)) (let ((.cse5 (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46))) (and (<= aux_div_v_main_~z~0_BEFORE_CALL_279_45 3) (or (<= 1 |c___VERIFIER_assert_#in~cond|) (and (<= 0 |c___VERIFIER_assert_#in~cond|) (not (let ((.cse1 (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_v_main_~z~0_BEFORE_CALL_279_45)) (.cse3 (* 3 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46)) (.cse2 (* 3 aux_div_v_main_~z~0_BEFORE_CALL_279_45 aux_div_v_main_~z~0_BEFORE_CALL_279_45))) (= (let ((.cse0 (+ (* 3 aux_div_v_main_~z~0_BEFORE_CALL_279_45) .cse1 (* 3 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) .cse2 .cse3 1))) (+ (* (* .cse0 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) 6) 6 (* 12 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 12) (* (* .cse0 aux_div_v_main_~z~0_BEFORE_CALL_279_45) 6))) (+ (* 6 .cse1) (* 18 (let ((.cse4 (div (+ .cse5 (* 6 aux_div_v_main_~z~0_BEFORE_CALL_279_45)) 6))) (* .cse4 .cse4 .cse4))) 6 (* aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 18) (* 6 .cse3) (* 18 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 6 .cse2))))))) (<= 0 .cse5) (< .cse5 6)))) is different from false [2022-04-28 11:17:50,663 WARN L855 $PredicateComparison]: unable to prove that (exists ((aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 Int) (aux_div_v_main_~z~0_BEFORE_CALL_279_45 Int)) (let ((.cse5 (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46))) (and (<= aux_div_v_main_~z~0_BEFORE_CALL_279_45 3) (or (<= 1 |c___VERIFIER_assert_#in~cond|) (and (<= 0 |c___VERIFIER_assert_#in~cond|) (not (let ((.cse1 (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_v_main_~z~0_BEFORE_CALL_279_45)) (.cse3 (* 3 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46)) (.cse2 (* 3 aux_div_v_main_~z~0_BEFORE_CALL_279_45 aux_div_v_main_~z~0_BEFORE_CALL_279_45))) (= (let ((.cse0 (+ (* 3 aux_div_v_main_~z~0_BEFORE_CALL_279_45) .cse1 (* 3 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) .cse2 .cse3 1))) (+ (* (* .cse0 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) 6) 6 (* 12 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 12) (* (* .cse0 aux_div_v_main_~z~0_BEFORE_CALL_279_45) 6))) (+ (* 6 .cse1) (* 18 (let ((.cse4 (div (+ .cse5 (* 6 aux_div_v_main_~z~0_BEFORE_CALL_279_45)) 6))) (* .cse4 .cse4 .cse4))) 6 (* aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 18) (* 6 .cse3) (* 18 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 6 .cse2))))))) (<= 0 .cse5) (< .cse5 6)))) is different from true [2022-04-28 11:19:03,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {14898#true} call ULTIMATE.init(); {14898#true} is VALID [2022-04-28 11:19:03,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {14898#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); {14898#true} is VALID [2022-04-28 11:19:03,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:19:03,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14898#true} {14898#true} #84#return; {14898#true} is VALID [2022-04-28 11:19:03,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {14898#true} call #t~ret5 := main(); {14898#true} is VALID [2022-04-28 11:19:03,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {14898#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; {14898#true} is VALID [2022-04-28 11:19:03,350 INFO L272 TraceCheckUtils]: 6: Hoare triple {14898#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:19:03,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {14898#true} ~cond := #in~cond; {14924#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:19:03,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {14924#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {14928#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:19:03,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {14928#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {14928#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:19:03,351 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14928#(not (= |assume_abort_if_not_#in~cond| 0))} {14898#true} #60#return; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,352 INFO L272 TraceCheckUtils]: 13: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:19:03,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:19:03,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:19:03,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:19:03,353 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14898#true} {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,353 INFO L272 TraceCheckUtils]: 18: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14898#true} is VALID [2022-04-28 11:19:03,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:19:03,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:19:03,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:19:03,354 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14898#true} {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,354 INFO L272 TraceCheckUtils]: 23: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:19:03,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:19:03,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:19:03,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:19:03,355 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14898#true} {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,355 INFO L272 TraceCheckUtils]: 28: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~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)); {14898#true} is VALID [2022-04-28 11:19:03,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:19:03,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:19:03,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:19:03,356 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14898#true} {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,356 INFO L272 TraceCheckUtils]: 33: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14898#true} is VALID [2022-04-28 11:19:03,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:19:03,356 INFO L290 TraceCheckUtils]: 35: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:19:03,356 INFO L290 TraceCheckUtils]: 36: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:19:03,357 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14898#true} {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,357 INFO L290 TraceCheckUtils]: 38: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~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; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,357 INFO L290 TraceCheckUtils]: 39: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,358 INFO L272 TraceCheckUtils]: 40: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:19:03,358 INFO L290 TraceCheckUtils]: 41: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:19:03,358 INFO L290 TraceCheckUtils]: 42: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:19:03,358 INFO L290 TraceCheckUtils]: 43: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:19:03,358 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14898#true} {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,358 INFO L272 TraceCheckUtils]: 45: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14898#true} is VALID [2022-04-28 11:19:03,359 INFO L290 TraceCheckUtils]: 46: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:19:03,359 INFO L290 TraceCheckUtils]: 47: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:19:03,359 INFO L290 TraceCheckUtils]: 48: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:19:03,359 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14898#true} {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,359 INFO L272 TraceCheckUtils]: 50: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:19:03,359 INFO L290 TraceCheckUtils]: 51: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:19:03,360 INFO L290 TraceCheckUtils]: 52: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:19:03,360 INFO L290 TraceCheckUtils]: 53: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:19:03,360 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14898#true} {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,360 INFO L272 TraceCheckUtils]: 55: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~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)); {14898#true} is VALID [2022-04-28 11:19:03,360 INFO L290 TraceCheckUtils]: 56: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:19:03,360 INFO L290 TraceCheckUtils]: 57: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:19:03,361 INFO L290 TraceCheckUtils]: 58: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:19:03,361 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14898#true} {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,361 INFO L272 TraceCheckUtils]: 60: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14898#true} is VALID [2022-04-28 11:19:03,361 INFO L290 TraceCheckUtils]: 61: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:19:03,368 INFO L290 TraceCheckUtils]: 62: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:19:03,368 INFO L290 TraceCheckUtils]: 63: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:19:03,370 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14898#true} {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,371 INFO L290 TraceCheckUtils]: 65: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~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; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,371 INFO L290 TraceCheckUtils]: 66: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,371 INFO L272 TraceCheckUtils]: 67: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:19:03,371 INFO L290 TraceCheckUtils]: 68: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:19:03,371 INFO L290 TraceCheckUtils]: 69: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:19:03,372 INFO L290 TraceCheckUtils]: 70: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:19:03,372 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {14898#true} {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,372 INFO L272 TraceCheckUtils]: 72: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14898#true} is VALID [2022-04-28 11:19:03,372 INFO L290 TraceCheckUtils]: 73: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:19:03,372 INFO L290 TraceCheckUtils]: 74: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:19:03,372 INFO L290 TraceCheckUtils]: 75: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:19:03,373 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14898#true} {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,373 INFO L272 TraceCheckUtils]: 77: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:19:03,373 INFO L290 TraceCheckUtils]: 78: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:19:03,373 INFO L290 TraceCheckUtils]: 79: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:19:03,373 INFO L290 TraceCheckUtils]: 80: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:19:03,373 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14898#true} {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,374 INFO L272 TraceCheckUtils]: 82: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~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)); {14898#true} is VALID [2022-04-28 11:19:03,374 INFO L290 TraceCheckUtils]: 83: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:19:03,374 INFO L290 TraceCheckUtils]: 84: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:19:03,374 INFO L290 TraceCheckUtils]: 85: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:19:03,374 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {14898#true} {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,374 INFO L272 TraceCheckUtils]: 87: Hoare triple {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14898#true} is VALID [2022-04-28 11:19:03,375 INFO L290 TraceCheckUtils]: 88: Hoare triple {14898#true} ~cond := #in~cond; {15170#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:03,375 INFO L290 TraceCheckUtils]: 89: Hoare triple {15170#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:03,375 INFO L290 TraceCheckUtils]: 90: Hoare triple {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:03,376 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} {14935#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {15181#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:19:03,380 INFO L290 TraceCheckUtils]: 92: Hoare triple {15181#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~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; {15185#(and (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~n~0 3))} is VALID [2022-04-28 11:19:03,381 INFO L290 TraceCheckUtils]: 93: Hoare triple {15185#(and (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~n~0 3))} assume !false; {15185#(and (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~n~0 3))} is VALID [2022-04-28 11:19:03,381 INFO L272 TraceCheckUtils]: 94: Hoare triple {15185#(and (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~n~0 3))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:19:03,381 INFO L290 TraceCheckUtils]: 95: Hoare triple {14898#true} ~cond := #in~cond; {15170#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:03,381 INFO L290 TraceCheckUtils]: 96: Hoare triple {15170#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:03,382 INFO L290 TraceCheckUtils]: 97: Hoare triple {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:03,382 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} {15185#(and (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~n~0 3))} #62#return; {15204#(and (= (+ (* 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) (<= main_~n~0 3))} is VALID [2022-04-28 11:19:03,382 INFO L272 TraceCheckUtils]: 99: Hoare triple {15204#(and (= (+ (* 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) (<= main_~n~0 3))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14898#true} is VALID [2022-04-28 11:19:03,382 INFO L290 TraceCheckUtils]: 100: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:19:03,383 INFO L290 TraceCheckUtils]: 101: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:19:03,383 INFO L290 TraceCheckUtils]: 102: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:19:03,383 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {14898#true} {15204#(and (= (+ (* 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) (<= main_~n~0 3))} #64#return; {15204#(and (= (+ (* 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) (<= main_~n~0 3))} is VALID [2022-04-28 11:19:03,383 INFO L272 TraceCheckUtils]: 104: Hoare triple {15204#(and (= (+ (* 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) (<= main_~n~0 3))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:19:03,384 INFO L290 TraceCheckUtils]: 105: Hoare triple {14898#true} ~cond := #in~cond; {15170#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:03,384 INFO L290 TraceCheckUtils]: 106: Hoare triple {15170#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:03,384 INFO L290 TraceCheckUtils]: 107: Hoare triple {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:05,386 WARN L284 TraceCheckUtils]: 108: Hoare quadruple {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} {15204#(and (= (+ (* 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) (<= main_~n~0 3))} #66#return; {15235#(and (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (div (+ main_~z~0 (- 6)) 6) 3) (= main_~x~0 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (= (mod main_~z~0 6) 0))} is UNKNOWN [2022-04-28 11:19:05,547 INFO L272 TraceCheckUtils]: 109: Hoare triple {15235#(and (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (div (+ main_~z~0 (- 6)) 6) 3) (= main_~x~0 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 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)); {15239#(exists ((aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 Int) (aux_div_v_main_~z~0_BEFORE_CALL_279_45 Int)) (and (<= aux_div_v_main_~z~0_BEFORE_CALL_279_45 3) (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (not (= (+ (* (* (+ (* 3 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 3 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) (* 3 aux_div_v_main_~z~0_BEFORE_CALL_279_45 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 3 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) 1) aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) 6) 6 (* 12 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 12) (* (* (+ (* 3 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 3 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) (* 3 aux_div_v_main_~z~0_BEFORE_CALL_279_45 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 3 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) 1) aux_div_v_main_~z~0_BEFORE_CALL_279_45) 6)) (+ (* 6 (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_v_main_~z~0_BEFORE_CALL_279_45)) (* 18 (* (div (+ (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) (* 6 aux_div_v_main_~z~0_BEFORE_CALL_279_45)) 6) (div (+ (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) (* 6 aux_div_v_main_~z~0_BEFORE_CALL_279_45)) 6) (div (+ (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) (* 6 aux_div_v_main_~z~0_BEFORE_CALL_279_45)) 6))) 6 (* aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 18) (* 6 (* 3 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46)) (* 18 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 6 (* 3 aux_div_v_main_~z~0_BEFORE_CALL_279_45 aux_div_v_main_~z~0_BEFORE_CALL_279_45)))))) (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 0 (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46)) (< (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) 6)))} is VALID [2022-04-28 11:19:07,548 WARN L290 TraceCheckUtils]: 110: Hoare triple {15239#(exists ((aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 Int) (aux_div_v_main_~z~0_BEFORE_CALL_279_45 Int)) (and (<= aux_div_v_main_~z~0_BEFORE_CALL_279_45 3) (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (not (= (+ (* (* (+ (* 3 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 3 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) (* 3 aux_div_v_main_~z~0_BEFORE_CALL_279_45 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 3 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) 1) aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) 6) 6 (* 12 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 12) (* (* (+ (* 3 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 3 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) (* 3 aux_div_v_main_~z~0_BEFORE_CALL_279_45 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 3 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) 1) aux_div_v_main_~z~0_BEFORE_CALL_279_45) 6)) (+ (* 6 (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_v_main_~z~0_BEFORE_CALL_279_45)) (* 18 (* (div (+ (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) (* 6 aux_div_v_main_~z~0_BEFORE_CALL_279_45)) 6) (div (+ (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) (* 6 aux_div_v_main_~z~0_BEFORE_CALL_279_45)) 6) (div (+ (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) (* 6 aux_div_v_main_~z~0_BEFORE_CALL_279_45)) 6))) 6 (* aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 18) (* 6 (* 3 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46)) (* 18 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 6 (* 3 aux_div_v_main_~z~0_BEFORE_CALL_279_45 aux_div_v_main_~z~0_BEFORE_CALL_279_45)))))) (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 0 (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46)) (< (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) 6)))} ~cond := #in~cond; {15243#(<= 1 __VERIFIER_assert_~cond)} is UNKNOWN [2022-04-28 11:19:07,549 INFO L290 TraceCheckUtils]: 111: Hoare triple {15243#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14899#false} is VALID [2022-04-28 11:19:07,549 INFO L290 TraceCheckUtils]: 112: Hoare triple {14899#false} assume !false; {14899#false} is VALID [2022-04-28 11:19:07,550 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 164 proven. 24 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-28 11:19:07,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:26,055 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (div (+ (- 6) c_main_~z~0) 6)) (.cse0 (* 6 c_main_~z~0))) (or (not (= (mod c_main_~z~0 6) 0)) (not (= (mod (+ .cse0 (* (- 1) c_main_~z~0 c_main_~z~0)) 12) 0)) (not (<= .cse1 c_main_~a~0)) (let ((.cse2 (div (+ .cse0 (* (- 1) (* c_main_~z~0 c_main_~z~0)) (- 12)) (- 12)))) (= (+ (* 12 c_main_~z~0) (* .cse2 12) (* 18 (let ((.cse3 (+ .cse1 1))) (* .cse3 .cse3 .cse3))) 6) (+ (* 2 c_main_~z~0) 12 (* (+ .cse2 c_main_~z~0) (+ 6 c_main_~z~0))))))) is different from true [2022-04-28 11:20:01,681 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (* 6 c_main_~z~0)) (.cse1 (* (- 1) c_main_~z~0 c_main_~z~0))) (or (not (= (mod c_main_~z~0 6) 0)) (not (= (mod (+ .cse0 .cse1) 12) 0)) (let ((.cse3 (div (+ .cse0 (- 12) .cse1) (- 12)))) (= (let ((.cse2 (div (+ (- 6) c_main_~z~0) 6))) (+ (* 54 (* .cse2 .cse2)) (* .cse3 6) (* 4 c_main_~z~0) 12 (* (* .cse2 .cse2 .cse2) 18) (* .cse2 54))) (+ (* .cse3 c_main_~z~0) (* c_main_~z~0 c_main_~z~0)))))) is different from true [2022-04-28 11:20:56,252 INFO L290 TraceCheckUtils]: 112: Hoare triple {14899#false} assume !false; {14899#false} is VALID [2022-04-28 11:20:56,252 INFO L290 TraceCheckUtils]: 111: Hoare triple {15243#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14899#false} is VALID [2022-04-28 11:20:56,253 INFO L290 TraceCheckUtils]: 110: Hoare triple {15256#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15243#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:56,253 INFO L272 TraceCheckUtils]: 109: Hoare triple {15260#(= (+ (* 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)); {15256#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:20:56,254 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} {15264#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {15260#(= (+ (* 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:20:56,254 INFO L290 TraceCheckUtils]: 107: Hoare triple {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:56,255 INFO L290 TraceCheckUtils]: 106: Hoare triple {15274#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:56,255 INFO L290 TraceCheckUtils]: 105: Hoare triple {14898#true} ~cond := #in~cond; {15274#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:20:56,255 INFO L272 TraceCheckUtils]: 104: Hoare triple {15264#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:56,255 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {14898#true} {15264#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {15264#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:20:56,256 INFO L290 TraceCheckUtils]: 102: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:56,256 INFO L290 TraceCheckUtils]: 101: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:20:56,256 INFO L290 TraceCheckUtils]: 100: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:20:56,256 INFO L272 TraceCheckUtils]: 99: Hoare triple {15264#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:56,256 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} {15296#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #62#return; {15264#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:20:56,257 INFO L290 TraceCheckUtils]: 97: Hoare triple {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:56,257 INFO L290 TraceCheckUtils]: 96: Hoare triple {15274#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:56,257 INFO L290 TraceCheckUtils]: 95: Hoare triple {14898#true} ~cond := #in~cond; {15274#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:20:56,257 INFO L272 TraceCheckUtils]: 94: Hoare triple {15296#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:56,258 INFO L290 TraceCheckUtils]: 93: Hoare triple {15296#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !false; {15296#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:20:56,806 INFO L290 TraceCheckUtils]: 92: Hoare triple {15315#(or (= (+ (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 18) (* main_~y~0 12) 6 (* main_~z~0 12)) (+ (* (+ main_~z~0 6) (+ main_~z~0 main_~y~0)) (* main_~z~0 2) 12)) (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 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; {15296#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:20:57,253 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} {15319#(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) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 18) 6 (* main_~z~0 12) (* (div (+ (* main_~z~0 6) (* (- 1) (* main_~z~0 main_~z~0)) (- 12)) (- 12)) 12)) (+ (* main_~z~0 2) 12 (* (+ (div (+ (* main_~z~0 6) (* (- 1) (* main_~z~0 main_~z~0)) (- 12)) (- 12)) main_~z~0) (+ main_~z~0 6)))) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)))} #70#return; {15315#(or (= (+ (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 18) (* main_~y~0 12) 6 (* main_~z~0 12)) (+ (* (+ main_~z~0 6) (+ main_~z~0 main_~y~0)) (* main_~z~0 2) 12)) (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 0)))} is VALID [2022-04-28 11:20:57,253 INFO L290 TraceCheckUtils]: 90: Hoare triple {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:57,254 INFO L290 TraceCheckUtils]: 89: Hoare triple {15274#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:57,254 INFO L290 TraceCheckUtils]: 88: Hoare triple {14898#true} ~cond := #in~cond; {15274#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:20:57,254 INFO L272 TraceCheckUtils]: 87: Hoare triple {15319#(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) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 18) 6 (* main_~z~0 12) (* (div (+ (* main_~z~0 6) (* (- 1) (* main_~z~0 main_~z~0)) (- 12)) (- 12)) 12)) (+ (* main_~z~0 2) 12 (* (+ (div (+ (* main_~z~0 6) (* (- 1) (* main_~z~0 main_~z~0)) (- 12)) (- 12)) main_~z~0) (+ main_~z~0 6)))) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:57,255 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {14898#true} {15335#(or (not (= (mod main_~z~0 6) 0)) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 54) (* main_~z~0 4) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) 6) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 54) 12) (+ (* main_~z~0 main_~z~0) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) main_~z~0))))} #68#return; {15319#(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) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 18) 6 (* main_~z~0 12) (* (div (+ (* main_~z~0 6) (* (- 1) (* main_~z~0 main_~z~0)) (- 12)) (- 12)) 12)) (+ (* main_~z~0 2) 12 (* (+ (div (+ (* main_~z~0 6) (* (- 1) (* main_~z~0 main_~z~0)) (- 12)) (- 12)) main_~z~0) (+ main_~z~0 6)))) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)))} is VALID [2022-04-28 11:20:57,255 INFO L290 TraceCheckUtils]: 85: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:57,255 INFO L290 TraceCheckUtils]: 84: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:20:57,255 INFO L290 TraceCheckUtils]: 83: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:20:57,255 INFO L272 TraceCheckUtils]: 82: Hoare triple {15335#(or (not (= (mod main_~z~0 6) 0)) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 54) (* main_~z~0 4) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) 6) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 54) 12) (+ (* main_~z~0 main_~z~0) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) 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)); {14898#true} is VALID [2022-04-28 11:20:57,256 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14898#true} {15335#(or (not (= (mod main_~z~0 6) 0)) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 54) (* main_~z~0 4) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) 6) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 54) 12) (+ (* main_~z~0 main_~z~0) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) main_~z~0))))} #66#return; {15335#(or (not (= (mod main_~z~0 6) 0)) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 54) (* main_~z~0 4) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) 6) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 54) 12) (+ (* main_~z~0 main_~z~0) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) main_~z~0))))} is VALID [2022-04-28 11:20:57,256 INFO L290 TraceCheckUtils]: 80: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:57,256 INFO L290 TraceCheckUtils]: 79: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:20:57,256 INFO L290 TraceCheckUtils]: 78: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:20:57,256 INFO L272 TraceCheckUtils]: 77: Hoare triple {15335#(or (not (= (mod main_~z~0 6) 0)) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 54) (* main_~z~0 4) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) 6) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 54) 12) (+ (* main_~z~0 main_~z~0) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) main_~z~0))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:57,257 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14898#true} {15335#(or (not (= (mod main_~z~0 6) 0)) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 54) (* main_~z~0 4) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) 6) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 54) 12) (+ (* main_~z~0 main_~z~0) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) main_~z~0))))} #64#return; {15335#(or (not (= (mod main_~z~0 6) 0)) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 54) (* main_~z~0 4) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) 6) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 54) 12) (+ (* main_~z~0 main_~z~0) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) main_~z~0))))} is VALID [2022-04-28 11:20:57,257 INFO L290 TraceCheckUtils]: 75: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:57,257 INFO L290 TraceCheckUtils]: 74: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:20:57,257 INFO L290 TraceCheckUtils]: 73: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:20:57,257 INFO L272 TraceCheckUtils]: 72: Hoare triple {15335#(or (not (= (mod main_~z~0 6) 0)) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 54) (* main_~z~0 4) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) 6) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 54) 12) (+ (* main_~z~0 main_~z~0) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) main_~z~0))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:57,258 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {14898#true} {15335#(or (not (= (mod main_~z~0 6) 0)) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 54) (* main_~z~0 4) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) 6) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 54) 12) (+ (* main_~z~0 main_~z~0) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) main_~z~0))))} #62#return; {15335#(or (not (= (mod main_~z~0 6) 0)) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 54) (* main_~z~0 4) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) 6) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 54) 12) (+ (* main_~z~0 main_~z~0) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) main_~z~0))))} is VALID [2022-04-28 11:20:57,258 INFO L290 TraceCheckUtils]: 70: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:57,258 INFO L290 TraceCheckUtils]: 69: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:20:57,258 INFO L290 TraceCheckUtils]: 68: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:20:57,258 INFO L272 TraceCheckUtils]: 67: Hoare triple {15335#(or (not (= (mod main_~z~0 6) 0)) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 54) (* main_~z~0 4) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) 6) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 54) 12) (+ (* main_~z~0 main_~z~0) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) main_~z~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:57,259 INFO L290 TraceCheckUtils]: 66: Hoare triple {15335#(or (not (= (mod main_~z~0 6) 0)) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 54) (* main_~z~0 4) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) 6) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 54) 12) (+ (* main_~z~0 main_~z~0) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) main_~z~0))))} assume !false; {15335#(or (not (= (mod main_~z~0 6) 0)) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 54) (* main_~z~0 4) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) 6) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 54) 12) (+ (* main_~z~0 main_~z~0) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) main_~z~0))))} is VALID [2022-04-28 11:20:59,262 WARN L290 TraceCheckUtils]: 65: Hoare triple {14898#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; {15335#(or (not (= (mod main_~z~0 6) 0)) (not (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6)) 12) 0)) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 54) (* main_~z~0 4) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) 6) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 54) 12) (+ (* main_~z~0 main_~z~0) (* (div (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 6) (- 12)) (- 12)) main_~z~0))))} is UNKNOWN [2022-04-28 11:20:59,263 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14898#true} {14898#true} #70#return; {14898#true} is VALID [2022-04-28 11:20:59,263 INFO L290 TraceCheckUtils]: 63: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:59,263 INFO L290 TraceCheckUtils]: 62: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:20:59,263 INFO L290 TraceCheckUtils]: 61: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:20:59,263 INFO L272 TraceCheckUtils]: 60: Hoare triple {14898#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:59,263 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14898#true} {14898#true} #68#return; {14898#true} is VALID [2022-04-28 11:20:59,263 INFO L290 TraceCheckUtils]: 58: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:59,263 INFO L290 TraceCheckUtils]: 57: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:20:59,264 INFO L290 TraceCheckUtils]: 56: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:20:59,264 INFO L272 TraceCheckUtils]: 55: Hoare triple {14898#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:59,264 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14898#true} {14898#true} #66#return; {14898#true} is VALID [2022-04-28 11:20:59,264 INFO L290 TraceCheckUtils]: 53: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:59,264 INFO L290 TraceCheckUtils]: 52: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:20:59,264 INFO L290 TraceCheckUtils]: 51: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:20:59,264 INFO L272 TraceCheckUtils]: 50: Hoare triple {14898#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:59,264 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14898#true} {14898#true} #64#return; {14898#true} is VALID [2022-04-28 11:20:59,264 INFO L290 TraceCheckUtils]: 48: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:59,264 INFO L290 TraceCheckUtils]: 47: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:20:59,264 INFO L290 TraceCheckUtils]: 46: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:20:59,265 INFO L272 TraceCheckUtils]: 45: Hoare triple {14898#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:59,265 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14898#true} {14898#true} #62#return; {14898#true} is VALID [2022-04-28 11:20:59,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:59,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:20:59,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:20:59,265 INFO L272 TraceCheckUtils]: 40: Hoare triple {14898#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:59,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {14898#true} assume !false; {14898#true} is VALID [2022-04-28 11:20:59,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {14898#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; {14898#true} is VALID [2022-04-28 11:20:59,265 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14898#true} {14898#true} #70#return; {14898#true} is VALID [2022-04-28 11:20:59,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:59,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:20:59,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:20:59,266 INFO L272 TraceCheckUtils]: 33: Hoare triple {14898#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:59,266 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14898#true} {14898#true} #68#return; {14898#true} is VALID [2022-04-28 11:20:59,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:59,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:20:59,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:20:59,266 INFO L272 TraceCheckUtils]: 28: Hoare triple {14898#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:59,266 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14898#true} {14898#true} #66#return; {14898#true} is VALID [2022-04-28 11:20:59,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:59,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:20:59,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:20:59,267 INFO L272 TraceCheckUtils]: 23: Hoare triple {14898#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:59,267 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14898#true} {14898#true} #64#return; {14898#true} is VALID [2022-04-28 11:20:59,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:59,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:20:59,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:20:59,267 INFO L272 TraceCheckUtils]: 18: Hoare triple {14898#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:59,267 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14898#true} {14898#true} #62#return; {14898#true} is VALID [2022-04-28 11:20:59,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:59,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:20:59,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:20:59,268 INFO L272 TraceCheckUtils]: 13: Hoare triple {14898#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:59,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {14898#true} assume !false; {14898#true} is VALID [2022-04-28 11:20:59,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {14898#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {14898#true} is VALID [2022-04-28 11:20:59,268 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14898#true} {14898#true} #60#return; {14898#true} is VALID [2022-04-28 11:20:59,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:59,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {14898#true} assume !(0 == ~cond); {14898#true} is VALID [2022-04-28 11:20:59,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {14898#true} ~cond := #in~cond; {14898#true} is VALID [2022-04-28 11:20:59,268 INFO L272 TraceCheckUtils]: 6: Hoare triple {14898#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {14898#true} is VALID [2022-04-28 11:20:59,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {14898#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; {14898#true} is VALID [2022-04-28 11:20:59,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {14898#true} call #t~ret5 := main(); {14898#true} is VALID [2022-04-28 11:20:59,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14898#true} {14898#true} #84#return; {14898#true} is VALID [2022-04-28 11:20:59,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {14898#true} assume true; {14898#true} is VALID [2022-04-28 11:20:59,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {14898#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); {14898#true} is VALID [2022-04-28 11:20:59,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {14898#true} call ULTIMATE.init(); {14898#true} is VALID [2022-04-28 11:20:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 186 proven. 9 refuted. 0 times theorem prover too weak. 484 trivial. 5 not checked. [2022-04-28 11:20:59,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:20:59,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650644260] [2022-04-28 11:20:59,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:20:59,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922043503] [2022-04-28 11:20:59,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922043503] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:20:59,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:20:59,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2022-04-28 11:20:59,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:20:59,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [552341601] [2022-04-28 11:20:59,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [552341601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:20:59,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:20:59,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 11:20:59,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759335973] [2022-04-28 11:20:59,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:20:59,271 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 9 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 113 [2022-04-28 11:20:59,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:20:59,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 9 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:21:03,226 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:21:03,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 11:21:03,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:03,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 11:21:03,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=257, Unknown=5, NotChecked=102, Total=420 [2022-04-28 11:21:03,228 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 9 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:21:05,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:21:07,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:21:09,516 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:21:11,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:21:13,520 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:21:15,523 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:21:17,525 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:21:19,527 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:21:22,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:21:24,639 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (exists ((aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 Int) (aux_div_v_main_~z~0_BEFORE_CALL_279_45 Int)) (let ((.cse5 (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46))) (and (<= aux_div_v_main_~z~0_BEFORE_CALL_279_45 3) (or (<= 1 |c___VERIFIER_assert_#in~cond|) (and (<= 0 |c___VERIFIER_assert_#in~cond|) (not (let ((.cse1 (* 6 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_v_main_~z~0_BEFORE_CALL_279_45)) (.cse3 (* 3 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46)) (.cse2 (* 3 aux_div_v_main_~z~0_BEFORE_CALL_279_45 aux_div_v_main_~z~0_BEFORE_CALL_279_45))) (= (let ((.cse0 (+ (* 3 aux_div_v_main_~z~0_BEFORE_CALL_279_45) .cse1 (* 3 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) .cse2 .cse3 1))) (+ (* (* .cse0 aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46) 6) 6 (* 12 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 12) (* (* .cse0 aux_div_v_main_~z~0_BEFORE_CALL_279_45) 6))) (+ (* 6 .cse1) (* 18 (let ((.cse4 (div (+ .cse5 (* 6 aux_div_v_main_~z~0_BEFORE_CALL_279_45)) 6))) (* .cse4 .cse4 .cse4))) 6 (* aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_279_45_46 18) (* 6 .cse3) (* 18 aux_div_v_main_~z~0_BEFORE_CALL_279_45) (* 6 .cse2))))))) (<= 0 .cse5) (< .cse5 6))))) is different from true [2022-04-28 11:21:28,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:21:31,069 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:21:33,333 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:21:35,335 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:21:37,337 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:21:39,341 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:21:41,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:21:43,506 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:21:45,508 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:21:50,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:21:51,402 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:21:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:51,404 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2022-04-28 11:21:51,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:21:51,404 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 9 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 113 [2022-04-28 11:21:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:21:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 9 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:21:51,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2022-04-28 11:21:51,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 9 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:21:51,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2022-04-28 11:21:51,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 49 transitions. [2022-04-28 11:21:54,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:54,063 INFO L225 Difference]: With dead ends: 136 [2022-04-28 11:21:54,063 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 11:21:54,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 205 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=86, Invalid=386, Unknown=6, NotChecked=172, Total=650 [2022-04-28 11:21:54,064 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 56 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 43.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:21:54,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 115 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 189 Invalid, 16 Unknown, 51 Unchecked, 43.0s Time] [2022-04-28 11:21:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 11:21:54,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-28 11:21:54,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:21:54,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 30 states have call successors, (30), 24 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:21:54,212 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 30 states have call successors, (30), 24 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:21:54,212 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 30 states have call successors, (30), 24 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:21:54,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:54,214 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-28 11:21:54,214 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-28 11:21:54,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:54,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:54,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 30 states have call successors, (30), 24 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 132 states. [2022-04-28 11:21:54,215 INFO L87 Difference]: Start difference. First operand has 132 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 30 states have call successors, (30), 24 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 132 states. [2022-04-28 11:21:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:54,216 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-28 11:21:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-28 11:21:54,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:54,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:54,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:21:54,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:21:54,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 30 states have call successors, (30), 24 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:21:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-04-28 11:21:54,219 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 113 [2022-04-28 11:21:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:21:54,219 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-04-28 11:21:54,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 9 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:21:54,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 139 transitions. [2022-04-28 11:21:57,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 138 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:57,175 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-28 11:21:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-28 11:21:57,175 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:21:57,175 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:21:57,183 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:21:57,380 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:21:57,380 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:21:57,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:21:57,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2063139367, now seen corresponding path program 5 times [2022-04-28 11:21:57,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:57,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1098146252] [2022-04-28 11:21:57,612 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:21:57,612 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:21:57,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2063139367, now seen corresponding path program 6 times [2022-04-28 11:21:57,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:21:57,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757135325] [2022-04-28 11:21:57,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:21:57,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:21:57,620 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:21:57,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838922735] [2022-04-28 11:21:57,620 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:21:57,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:21:57,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:21:57,626 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:21:57,626 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:21:57,727 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:21:57,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:21:57,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 11:21:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:21:57,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:21:59,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {16407#true} call ULTIMATE.init(); {16407#true} is VALID [2022-04-28 11:21:59,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {16407#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); {16407#true} is VALID [2022-04-28 11:21:59,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16407#true} {16407#true} #84#return; {16407#true} is VALID [2022-04-28 11:21:59,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {16407#true} call #t~ret5 := main(); {16407#true} is VALID [2022-04-28 11:21:59,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {16407#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; {16427#(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:21:59,947 INFO L272 TraceCheckUtils]: 6: Hoare triple {16427#(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 <= 2 then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {16407#true} ~cond := #in~cond; {16434#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:21:59,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {16434#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {16438#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:21:59,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {16438#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {16438#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:21:59,952 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16438#(not (= |assume_abort_if_not_#in~cond| 0))} {16427#(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; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,952 INFO L272 TraceCheckUtils]: 13: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,953 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16407#true} {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,953 INFO L272 TraceCheckUtils]: 18: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,954 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16407#true} {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,954 INFO L272 TraceCheckUtils]: 23: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,955 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16407#true} {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,955 INFO L272 TraceCheckUtils]: 28: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~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)); {16407#true} is VALID [2022-04-28 11:21:59,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,955 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16407#true} {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,956 INFO L272 TraceCheckUtils]: 33: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,956 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16407#true} {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,957 INFO L290 TraceCheckUtils]: 38: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~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; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,957 INFO L290 TraceCheckUtils]: 39: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,957 INFO L272 TraceCheckUtils]: 40: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,958 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16407#true} {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,958 INFO L272 TraceCheckUtils]: 45: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,958 INFO L290 TraceCheckUtils]: 46: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,958 INFO L290 TraceCheckUtils]: 47: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,958 INFO L290 TraceCheckUtils]: 48: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,958 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {16407#true} {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,959 INFO L272 TraceCheckUtils]: 50: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,959 INFO L290 TraceCheckUtils]: 51: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,959 INFO L290 TraceCheckUtils]: 52: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,959 INFO L290 TraceCheckUtils]: 53: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,959 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16407#true} {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,959 INFO L272 TraceCheckUtils]: 55: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~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)); {16407#true} is VALID [2022-04-28 11:21:59,959 INFO L290 TraceCheckUtils]: 56: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,960 INFO L290 TraceCheckUtils]: 57: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,960 INFO L290 TraceCheckUtils]: 58: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,960 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16407#true} {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,960 INFO L272 TraceCheckUtils]: 60: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,960 INFO L290 TraceCheckUtils]: 61: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,960 INFO L290 TraceCheckUtils]: 63: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,961 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16407#true} {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,961 INFO L290 TraceCheckUtils]: 65: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~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; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,962 INFO L290 TraceCheckUtils]: 66: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,962 INFO L272 TraceCheckUtils]: 67: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,962 INFO L290 TraceCheckUtils]: 68: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,962 INFO L290 TraceCheckUtils]: 69: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,962 INFO L290 TraceCheckUtils]: 70: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,962 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16407#true} {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,962 INFO L272 TraceCheckUtils]: 72: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,963 INFO L290 TraceCheckUtils]: 73: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,963 INFO L290 TraceCheckUtils]: 74: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,963 INFO L290 TraceCheckUtils]: 75: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,963 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16407#true} {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,963 INFO L272 TraceCheckUtils]: 77: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,963 INFO L290 TraceCheckUtils]: 78: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,963 INFO L290 TraceCheckUtils]: 79: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,963 INFO L290 TraceCheckUtils]: 80: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,964 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {16407#true} {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,964 INFO L272 TraceCheckUtils]: 82: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~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)); {16407#true} is VALID [2022-04-28 11:21:59,964 INFO L290 TraceCheckUtils]: 83: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,964 INFO L290 TraceCheckUtils]: 84: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,964 INFO L290 TraceCheckUtils]: 85: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,965 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16407#true} {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,965 INFO L272 TraceCheckUtils]: 87: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,965 INFO L290 TraceCheckUtils]: 88: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,965 INFO L290 TraceCheckUtils]: 89: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,965 INFO L290 TraceCheckUtils]: 90: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,965 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {16407#true} {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {16445#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,966 INFO L290 TraceCheckUtils]: 92: Hoare triple {16445#(and (<= 0 main_~a~0) (<= main_~a~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; {16692#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,967 INFO L290 TraceCheckUtils]: 93: Hoare triple {16692#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {16692#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,967 INFO L272 TraceCheckUtils]: 94: Hoare triple {16692#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,967 INFO L290 TraceCheckUtils]: 95: Hoare triple {16407#true} ~cond := #in~cond; {16702#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:59,967 INFO L290 TraceCheckUtils]: 96: Hoare triple {16702#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16706#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:59,968 INFO L290 TraceCheckUtils]: 97: Hoare triple {16706#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16706#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:59,968 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16706#(not (= |__VERIFIER_assert_#in~cond| 0))} {16692#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {16713#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,968 INFO L272 TraceCheckUtils]: 99: Hoare triple {16713#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,969 INFO L290 TraceCheckUtils]: 100: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,969 INFO L290 TraceCheckUtils]: 101: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,969 INFO L290 TraceCheckUtils]: 102: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,969 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {16407#true} {16713#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {16713#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,969 INFO L272 TraceCheckUtils]: 104: Hoare triple {16713#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,969 INFO L290 TraceCheckUtils]: 105: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,969 INFO L290 TraceCheckUtils]: 106: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,970 INFO L290 TraceCheckUtils]: 107: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,970 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16407#true} {16713#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {16713#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,970 INFO L272 TraceCheckUtils]: 109: Hoare triple {16713#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~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)); {16407#true} is VALID [2022-04-28 11:21:59,970 INFO L290 TraceCheckUtils]: 110: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,970 INFO L290 TraceCheckUtils]: 111: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,970 INFO L290 TraceCheckUtils]: 112: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,971 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {16407#true} {16713#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {16713#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,971 INFO L272 TraceCheckUtils]: 114: Hoare triple {16713#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,971 INFO L290 TraceCheckUtils]: 115: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,971 INFO L290 TraceCheckUtils]: 116: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,971 INFO L290 TraceCheckUtils]: 117: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,972 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {16407#true} {16713#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {16713#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:21:59,972 INFO L290 TraceCheckUtils]: 119: Hoare triple {16713#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} assume !(~n~0 <= ~a~0); {16777#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:21:59,973 INFO L272 TraceCheckUtils]: 120: Hoare triple {16777#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16407#true} is VALID [2022-04-28 11:21:59,973 INFO L290 TraceCheckUtils]: 121: Hoare triple {16407#true} ~cond := #in~cond; {16407#true} is VALID [2022-04-28 11:21:59,973 INFO L290 TraceCheckUtils]: 122: Hoare triple {16407#true} assume !(0 == ~cond); {16407#true} is VALID [2022-04-28 11:21:59,973 INFO L290 TraceCheckUtils]: 123: Hoare triple {16407#true} assume true; {16407#true} is VALID [2022-04-28 11:21:59,973 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {16407#true} {16777#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #72#return; {16777#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:21:59,976 INFO L272 TraceCheckUtils]: 125: Hoare triple {16777#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {16796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:21:59,976 INFO L290 TraceCheckUtils]: 126: Hoare triple {16796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:59,977 INFO L290 TraceCheckUtils]: 127: Hoare triple {16800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16408#false} is VALID [2022-04-28 11:21:59,977 INFO L290 TraceCheckUtils]: 128: Hoare triple {16408#false} assume !false; {16408#false} is VALID [2022-04-28 11:21:59,977 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:21:59,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:22:00,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:00,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757135325] [2022-04-28 11:22:00,052 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:00,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838922735] [2022-04-28 11:22:00,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838922735] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:22:00,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:22:00,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 11:22:00,053 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:00,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1098146252] [2022-04-28 11:22:00,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1098146252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:00,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:00,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 11:22:00,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581422618] [2022-04-28 11:22:00,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:00,053 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:22:00,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:00,054 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:22:00,096 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:22:00,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 11:22:00,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:00,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 11:22:00,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:22:00,096 INFO L87 Difference]: Start difference. First operand 132 states and 139 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:22:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:00,778 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2022-04-28 11:22:00,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:22:00,779 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:22:00,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:00,779 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:22:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2022-04-28 11:22:00,780 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:22:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2022-04-28 11:22:00,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 42 transitions. [2022-04-28 11:22:00,827 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:22:00,829 INFO L225 Difference]: With dead ends: 138 [2022-04-28 11:22:00,829 INFO L226 Difference]: Without dead ends: 136 [2022-04-28 11:22:00,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:22:00,830 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:00,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 95 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 11:22:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-28 11:22:00,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-04-28 11:22:00,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:00,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 136 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 30 states have call successors, (30), 25 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:22:00,975 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 136 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 30 states have call successors, (30), 25 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:22:00,975 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 136 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 30 states have call successors, (30), 25 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:22:00,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:00,984 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2022-04-28 11:22:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2022-04-28 11:22:00,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:00,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:00,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 30 states have call successors, (30), 25 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 136 states. [2022-04-28 11:22:00,985 INFO L87 Difference]: Start difference. First operand has 136 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 30 states have call successors, (30), 25 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 136 states. [2022-04-28 11:22:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:00,987 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2022-04-28 11:22:00,987 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2022-04-28 11:22:00,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:00,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:00,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:00,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 30 states have call successors, (30), 25 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:22:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2022-04-28 11:22:00,990 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 129 [2022-04-28 11:22:00,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:00,990 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2022-04-28 11:22:00,990 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:22:00,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 142 transitions. [2022-04-28 11:22:03,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 141 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:03,610 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2022-04-28 11:22:03,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 11:22:03,610 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:03,610 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:22:03,621 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:22:03,811 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:22:03,811 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:03,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:03,811 INFO L85 PathProgramCache]: Analyzing trace with hash -262683944, now seen corresponding path program 5 times [2022-04-28 11:22:03,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:03,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1059199542] [2022-04-28 11:22:04,022 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:22:04,022 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:22:04,022 INFO L85 PathProgramCache]: Analyzing trace with hash -262683944, now seen corresponding path program 6 times [2022-04-28 11:22:04,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:04,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335264347] [2022-04-28 11:22:04,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:04,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:04,039 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:04,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1594568611] [2022-04-28 11:22:04,039 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:22:04,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:04,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:04,040 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:22:04,069 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:22:04,179 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:22:04,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:04,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 11:22:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:04,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:07,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {17650#true} call ULTIMATE.init(); {17650#true} is VALID [2022-04-28 11:22:07,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {17650#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); {17650#true} is VALID [2022-04-28 11:22:07,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17650#true} {17650#true} #84#return; {17650#true} is VALID [2022-04-28 11:22:07,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {17650#true} call #t~ret5 := main(); {17650#true} is VALID [2022-04-28 11:22:07,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {17650#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; {17650#true} is VALID [2022-04-28 11:22:07,453 INFO L272 TraceCheckUtils]: 6: Hoare triple {17650#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {17650#true} ~cond := #in~cond; {17676#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:22:07,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {17676#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {17680#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:22:07,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {17680#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {17680#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:22:07,454 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17680#(not (= |assume_abort_if_not_#in~cond| 0))} {17650#true} #60#return; {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,455 INFO L272 TraceCheckUtils]: 13: Hoare triple {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,456 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17650#true} {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,456 INFO L272 TraceCheckUtils]: 18: Hoare triple {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,457 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17650#true} {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,457 INFO L272 TraceCheckUtils]: 23: Hoare triple {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,457 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17650#true} {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,458 INFO L272 TraceCheckUtils]: 28: Hoare triple {17687#(and (<= 0 main_~a~0) (<= main_~a~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)); {17650#true} is VALID [2022-04-28 11:22:07,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,458 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17650#true} {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,458 INFO L272 TraceCheckUtils]: 33: Hoare triple {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,459 INFO L290 TraceCheckUtils]: 35: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,459 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17650#true} {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {17687#(and (<= 0 main_~a~0) (<= main_~a~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; {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,460 INFO L272 TraceCheckUtils]: 40: Hoare triple {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,461 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17650#true} {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,461 INFO L272 TraceCheckUtils]: 45: Hoare triple {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,461 INFO L290 TraceCheckUtils]: 46: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,461 INFO L290 TraceCheckUtils]: 47: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,461 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17650#true} {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,462 INFO L272 TraceCheckUtils]: 50: Hoare triple {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,462 INFO L290 TraceCheckUtils]: 51: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,462 INFO L290 TraceCheckUtils]: 52: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,462 INFO L290 TraceCheckUtils]: 53: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,462 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17650#true} {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,462 INFO L272 TraceCheckUtils]: 55: Hoare triple {17687#(and (<= 0 main_~a~0) (<= main_~a~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)); {17650#true} is VALID [2022-04-28 11:22:07,462 INFO L290 TraceCheckUtils]: 56: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,463 INFO L290 TraceCheckUtils]: 57: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,463 INFO L290 TraceCheckUtils]: 58: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,486 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17650#true} {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,486 INFO L272 TraceCheckUtils]: 60: Hoare triple {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,487 INFO L290 TraceCheckUtils]: 61: Hoare triple {17650#true} ~cond := #in~cond; {17841#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:07,487 INFO L290 TraceCheckUtils]: 62: Hoare triple {17841#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:07,488 INFO L290 TraceCheckUtils]: 63: Hoare triple {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:07,488 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} {17687#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,491 INFO L290 TraceCheckUtils]: 65: Hoare triple {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~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; {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,491 INFO L290 TraceCheckUtils]: 66: Hoare triple {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,491 INFO L272 TraceCheckUtils]: 67: Hoare triple {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,491 INFO L290 TraceCheckUtils]: 68: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,491 INFO L290 TraceCheckUtils]: 69: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,492 INFO L290 TraceCheckUtils]: 70: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,492 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17650#true} {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,492 INFO L272 TraceCheckUtils]: 72: Hoare triple {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,492 INFO L290 TraceCheckUtils]: 73: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,492 INFO L290 TraceCheckUtils]: 74: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,492 INFO L290 TraceCheckUtils]: 75: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,493 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {17650#true} {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,493 INFO L272 TraceCheckUtils]: 77: Hoare triple {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,493 INFO L290 TraceCheckUtils]: 78: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,493 INFO L290 TraceCheckUtils]: 79: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,493 INFO L290 TraceCheckUtils]: 80: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,494 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17650#true} {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,494 INFO L272 TraceCheckUtils]: 82: Hoare triple {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~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)); {17650#true} is VALID [2022-04-28 11:22:07,494 INFO L290 TraceCheckUtils]: 83: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,494 INFO L290 TraceCheckUtils]: 84: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,494 INFO L290 TraceCheckUtils]: 85: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,494 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17650#true} {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,495 INFO L272 TraceCheckUtils]: 87: Hoare triple {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,495 INFO L290 TraceCheckUtils]: 88: Hoare triple {17650#true} ~cond := #in~cond; {17841#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:07,495 INFO L290 TraceCheckUtils]: 89: Hoare triple {17841#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:07,495 INFO L290 TraceCheckUtils]: 90: Hoare triple {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:07,496 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:07,498 INFO L290 TraceCheckUtils]: 92: Hoare triple {17852#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~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; {17937#(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 2))} is VALID [2022-04-28 11:22:07,498 INFO L290 TraceCheckUtils]: 93: Hoare triple {17937#(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 2))} assume !false; {17937#(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 2))} is VALID [2022-04-28 11:22:07,498 INFO L272 TraceCheckUtils]: 94: Hoare triple {17937#(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 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,499 INFO L290 TraceCheckUtils]: 95: Hoare triple {17650#true} ~cond := #in~cond; {17841#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:07,499 INFO L290 TraceCheckUtils]: 96: Hoare triple {17841#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:07,499 INFO L290 TraceCheckUtils]: 97: Hoare triple {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:07,500 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} {17937#(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 2))} #62#return; {17956#(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 2))} is VALID [2022-04-28 11:22:07,500 INFO L272 TraceCheckUtils]: 99: Hoare triple {17956#(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 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,500 INFO L290 TraceCheckUtils]: 100: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,500 INFO L290 TraceCheckUtils]: 101: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,500 INFO L290 TraceCheckUtils]: 102: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,501 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {17650#true} {17956#(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 2))} #64#return; {17956#(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 2))} is VALID [2022-04-28 11:22:07,501 INFO L272 TraceCheckUtils]: 104: Hoare triple {17956#(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 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,501 INFO L290 TraceCheckUtils]: 105: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,501 INFO L290 TraceCheckUtils]: 106: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,501 INFO L290 TraceCheckUtils]: 107: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,502 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17650#true} {17956#(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 2))} #66#return; {17956#(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 2))} is VALID [2022-04-28 11:22:07,502 INFO L272 TraceCheckUtils]: 109: Hoare triple {17956#(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 2))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,502 INFO L290 TraceCheckUtils]: 110: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,502 INFO L290 TraceCheckUtils]: 111: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,502 INFO L290 TraceCheckUtils]: 112: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,503 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17650#true} {17956#(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 2))} #68#return; {17956#(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 2))} is VALID [2022-04-28 11:22:07,503 INFO L272 TraceCheckUtils]: 114: Hoare triple {17956#(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 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,503 INFO L290 TraceCheckUtils]: 115: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,503 INFO L290 TraceCheckUtils]: 116: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,503 INFO L290 TraceCheckUtils]: 117: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,503 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {17650#true} {17956#(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 2))} #70#return; {17956#(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 2))} is VALID [2022-04-28 11:22:07,504 INFO L290 TraceCheckUtils]: 119: Hoare triple {17956#(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 2))} assume !(~n~0 <= ~a~0); {18020#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} is VALID [2022-04-28 11:22:07,504 INFO L272 TraceCheckUtils]: 120: Hoare triple {18020#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,505 INFO L290 TraceCheckUtils]: 121: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,505 INFO L290 TraceCheckUtils]: 122: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,505 INFO L290 TraceCheckUtils]: 123: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,505 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17650#true} {18020#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} #72#return; {18020#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} is VALID [2022-04-28 11:22:07,505 INFO L272 TraceCheckUtils]: 125: Hoare triple {18020#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:07,505 INFO L290 TraceCheckUtils]: 126: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:07,505 INFO L290 TraceCheckUtils]: 127: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:07,506 INFO L290 TraceCheckUtils]: 128: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:07,506 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17650#true} {18020#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} #74#return; {18020#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} is VALID [2022-04-28 11:22:07,517 INFO L272 TraceCheckUtils]: 130: Hoare triple {18020#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {18054#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:07,517 INFO L290 TraceCheckUtils]: 131: Hoare triple {18054#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18058#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:07,518 INFO L290 TraceCheckUtils]: 132: Hoare triple {18058#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17651#false} is VALID [2022-04-28 11:22:07,518 INFO L290 TraceCheckUtils]: 133: Hoare triple {17651#false} assume !false; {17651#false} is VALID [2022-04-28 11:22:07,518 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:22:07,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:22:24,800 INFO L290 TraceCheckUtils]: 133: Hoare triple {17651#false} assume !false; {17651#false} is VALID [2022-04-28 11:22:24,801 INFO L290 TraceCheckUtils]: 132: Hoare triple {18058#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17651#false} is VALID [2022-04-28 11:22:24,801 INFO L290 TraceCheckUtils]: 131: Hoare triple {18054#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18058#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:24,802 INFO L272 TraceCheckUtils]: 130: Hoare triple {18074#(= (+ (* 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)); {18054#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:24,802 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17650#true} {18074#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #74#return; {18074#(= (+ (* 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:22:24,802 INFO L290 TraceCheckUtils]: 128: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,802 INFO L290 TraceCheckUtils]: 127: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,802 INFO L290 TraceCheckUtils]: 126: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,802 INFO L272 TraceCheckUtils]: 125: Hoare triple {18074#(= (+ (* 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)); {17650#true} is VALID [2022-04-28 11:22:24,803 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17650#true} {18074#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #72#return; {18074#(= (+ (* 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:22:24,803 INFO L290 TraceCheckUtils]: 123: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,803 INFO L290 TraceCheckUtils]: 122: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,803 INFO L290 TraceCheckUtils]: 121: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,803 INFO L272 TraceCheckUtils]: 120: Hoare triple {18074#(= (+ (* 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)); {17650#true} is VALID [2022-04-28 11:22:24,804 INFO L290 TraceCheckUtils]: 119: Hoare triple {18108#(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); {18074#(= (+ (* 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:22:24,804 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {17650#true} {18108#(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; {18108#(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:22:24,804 INFO L290 TraceCheckUtils]: 117: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,804 INFO L290 TraceCheckUtils]: 116: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,804 INFO L290 TraceCheckUtils]: 115: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,805 INFO L272 TraceCheckUtils]: 114: Hoare triple {18108#(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)); {17650#true} is VALID [2022-04-28 11:22:24,805 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17650#true} {18108#(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; {18108#(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:22:24,805 INFO L290 TraceCheckUtils]: 112: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,805 INFO L290 TraceCheckUtils]: 111: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,805 INFO L290 TraceCheckUtils]: 110: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,805 INFO L272 TraceCheckUtils]: 109: Hoare triple {18108#(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)); {17650#true} is VALID [2022-04-28 11:22:24,806 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17650#true} {18108#(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; {18108#(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:22:24,806 INFO L290 TraceCheckUtils]: 107: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,806 INFO L290 TraceCheckUtils]: 106: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,806 INFO L290 TraceCheckUtils]: 105: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,806 INFO L272 TraceCheckUtils]: 104: Hoare triple {18108#(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)); {17650#true} is VALID [2022-04-28 11:22:24,807 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {17650#true} {18108#(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; {18108#(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:22:24,807 INFO L290 TraceCheckUtils]: 102: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,807 INFO L290 TraceCheckUtils]: 101: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,807 INFO L290 TraceCheckUtils]: 100: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,807 INFO L272 TraceCheckUtils]: 99: Hoare triple {18108#(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)); {17650#true} is VALID [2022-04-28 11:22:24,808 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} {18172#(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; {18108#(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:22:24,808 INFO L290 TraceCheckUtils]: 97: Hoare triple {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:24,808 INFO L290 TraceCheckUtils]: 96: Hoare triple {18182#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:24,809 INFO L290 TraceCheckUtils]: 95: Hoare triple {17650#true} ~cond := #in~cond; {18182#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:22:24,809 INFO L272 TraceCheckUtils]: 94: Hoare triple {18172#(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)); {17650#true} is VALID [2022-04-28 11:22:24,809 INFO L290 TraceCheckUtils]: 93: Hoare triple {18172#(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; {18172#(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:22:24,813 INFO L290 TraceCheckUtils]: 92: Hoare triple {18192#(or (= (+ (* (div main_~z~0 6) 12) (* main_~a~0 (+ 6 (* 6 (div main_~z~0 6)))) 12) (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10)) (<= (div main_~z~0 6) main_~a~0) (not (= (mod main_~z~0 6) 0)) (< (+ main_~a~0 1) (div 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; {18172#(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:22:24,817 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} {17650#true} #70#return; {18192#(or (= (+ (* (div main_~z~0 6) 12) (* main_~a~0 (+ 6 (* 6 (div main_~z~0 6)))) 12) (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10)) (<= (div main_~z~0 6) main_~a~0) (not (= (mod main_~z~0 6) 0)) (< (+ main_~a~0 1) (div main_~z~0 6)))} is VALID [2022-04-28 11:22:24,817 INFO L290 TraceCheckUtils]: 90: Hoare triple {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:24,817 INFO L290 TraceCheckUtils]: 89: Hoare triple {18182#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17845#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:24,820 INFO L290 TraceCheckUtils]: 88: Hoare triple {17650#true} ~cond := #in~cond; {18182#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:22:24,820 INFO L272 TraceCheckUtils]: 87: Hoare triple {17650#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:24,820 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17650#true} {17650#true} #68#return; {17650#true} is VALID [2022-04-28 11:22:24,820 INFO L290 TraceCheckUtils]: 85: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,820 INFO L290 TraceCheckUtils]: 84: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,820 INFO L290 TraceCheckUtils]: 83: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,820 INFO L272 TraceCheckUtils]: 82: Hoare triple {17650#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:24,821 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17650#true} {17650#true} #66#return; {17650#true} is VALID [2022-04-28 11:22:24,821 INFO L290 TraceCheckUtils]: 80: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,821 INFO L290 TraceCheckUtils]: 79: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,821 INFO L290 TraceCheckUtils]: 78: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,821 INFO L272 TraceCheckUtils]: 77: Hoare triple {17650#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:24,821 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {17650#true} {17650#true} #64#return; {17650#true} is VALID [2022-04-28 11:22:24,821 INFO L290 TraceCheckUtils]: 75: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,821 INFO L290 TraceCheckUtils]: 74: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,821 INFO L290 TraceCheckUtils]: 73: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,821 INFO L272 TraceCheckUtils]: 72: Hoare triple {17650#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:24,821 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17650#true} {17650#true} #62#return; {17650#true} is VALID [2022-04-28 11:22:24,822 INFO L290 TraceCheckUtils]: 70: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,822 INFO L290 TraceCheckUtils]: 69: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,822 INFO L290 TraceCheckUtils]: 68: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,822 INFO L272 TraceCheckUtils]: 67: Hoare triple {17650#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:24,822 INFO L290 TraceCheckUtils]: 66: Hoare triple {17650#true} assume !false; {17650#true} is VALID [2022-04-28 11:22:24,822 INFO L290 TraceCheckUtils]: 65: Hoare triple {17650#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; {17650#true} is VALID [2022-04-28 11:22:24,822 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17650#true} {17650#true} #70#return; {17650#true} is VALID [2022-04-28 11:22:24,822 INFO L290 TraceCheckUtils]: 63: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,822 INFO L290 TraceCheckUtils]: 62: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,822 INFO L290 TraceCheckUtils]: 61: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,822 INFO L272 TraceCheckUtils]: 60: Hoare triple {17650#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:24,823 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17650#true} {17650#true} #68#return; {17650#true} is VALID [2022-04-28 11:22:24,823 INFO L290 TraceCheckUtils]: 58: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,823 INFO L290 TraceCheckUtils]: 57: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,823 INFO L290 TraceCheckUtils]: 56: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,823 INFO L272 TraceCheckUtils]: 55: Hoare triple {17650#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:24,823 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17650#true} {17650#true} #66#return; {17650#true} is VALID [2022-04-28 11:22:24,823 INFO L290 TraceCheckUtils]: 53: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,823 INFO L290 TraceCheckUtils]: 52: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,823 INFO L290 TraceCheckUtils]: 51: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,823 INFO L272 TraceCheckUtils]: 50: Hoare triple {17650#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:24,823 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17650#true} {17650#true} #64#return; {17650#true} is VALID [2022-04-28 11:22:24,824 INFO L290 TraceCheckUtils]: 48: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,824 INFO L290 TraceCheckUtils]: 47: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,824 INFO L290 TraceCheckUtils]: 46: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,824 INFO L272 TraceCheckUtils]: 45: Hoare triple {17650#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:24,824 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17650#true} {17650#true} #62#return; {17650#true} is VALID [2022-04-28 11:22:24,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,824 INFO L290 TraceCheckUtils]: 42: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,824 INFO L290 TraceCheckUtils]: 41: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,824 INFO L272 TraceCheckUtils]: 40: Hoare triple {17650#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:24,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {17650#true} assume !false; {17650#true} is VALID [2022-04-28 11:22:24,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {17650#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; {17650#true} is VALID [2022-04-28 11:22:24,825 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17650#true} {17650#true} #70#return; {17650#true} is VALID [2022-04-28 11:22:24,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,825 INFO L290 TraceCheckUtils]: 35: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,825 INFO L290 TraceCheckUtils]: 34: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,825 INFO L272 TraceCheckUtils]: 33: Hoare triple {17650#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:24,825 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17650#true} {17650#true} #68#return; {17650#true} is VALID [2022-04-28 11:22:24,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,825 INFO L272 TraceCheckUtils]: 28: Hoare triple {17650#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:24,825 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17650#true} {17650#true} #66#return; {17650#true} is VALID [2022-04-28 11:22:24,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,826 INFO L272 TraceCheckUtils]: 23: Hoare triple {17650#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:24,826 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17650#true} {17650#true} #64#return; {17650#true} is VALID [2022-04-28 11:22:24,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,826 INFO L272 TraceCheckUtils]: 18: Hoare triple {17650#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:24,826 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17650#true} {17650#true} #62#return; {17650#true} is VALID [2022-04-28 11:22:24,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,827 INFO L272 TraceCheckUtils]: 13: Hoare triple {17650#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:24,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {17650#true} assume !false; {17650#true} is VALID [2022-04-28 11:22:24,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {17650#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17650#true} is VALID [2022-04-28 11:22:24,827 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17650#true} {17650#true} #60#return; {17650#true} is VALID [2022-04-28 11:22:24,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {17650#true} assume !(0 == ~cond); {17650#true} is VALID [2022-04-28 11:22:24,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {17650#true} ~cond := #in~cond; {17650#true} is VALID [2022-04-28 11:22:24,827 INFO L272 TraceCheckUtils]: 6: Hoare triple {17650#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {17650#true} is VALID [2022-04-28 11:22:24,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {17650#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; {17650#true} is VALID [2022-04-28 11:22:24,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {17650#true} call #t~ret5 := main(); {17650#true} is VALID [2022-04-28 11:22:24,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17650#true} {17650#true} #84#return; {17650#true} is VALID [2022-04-28 11:22:24,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {17650#true} assume true; {17650#true} is VALID [2022-04-28 11:22:24,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {17650#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); {17650#true} is VALID [2022-04-28 11:22:24,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {17650#true} call ULTIMATE.init(); {17650#true} is VALID [2022-04-28 11:22:24,828 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:22:24,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:24,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335264347] [2022-04-28 11:22:24,829 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:24,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594568611] [2022-04-28 11:22:24,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594568611] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:22:24,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:22:24,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-28 11:22:24,829 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:24,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1059199542] [2022-04-28 11:22:24,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1059199542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:24,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:24,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 11:22:24,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178060618] [2022-04-28 11:22:24,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:24,830 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 134 [2022-04-28 11:22:24,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:24,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-28 11:22:24,909 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:22:24,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 11:22:24,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:24,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 11:22:24,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:22:24,910 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-28 11:22:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:25,721 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2022-04-28 11:22:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:22:25,721 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 134 [2022-04-28 11:22:25,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-28 11:22:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-28 11:22:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-28 11:22:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-28 11:22:25,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2022-04-28 11:22:25,780 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:22:25,782 INFO L225 Difference]: With dead ends: 142 [2022-04-28 11:22:25,782 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 11:22:25,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-04-28 11:22:25,782 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:25,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 89 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:22:25,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 11:22:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2022-04-28 11:22:25,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:25,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 138 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 30 states have call successors, (30), 25 states have call predecessors, (30), 24 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:22:25,949 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 138 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 30 states have call successors, (30), 25 states have call predecessors, (30), 24 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:22:25,949 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 138 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 30 states have call successors, (30), 25 states have call predecessors, (30), 24 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:22:25,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:25,951 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2022-04-28 11:22:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 145 transitions. [2022-04-28 11:22:25,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:25,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:25,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 30 states have call successors, (30), 25 states have call predecessors, (30), 24 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 140 states. [2022-04-28 11:22:25,952 INFO L87 Difference]: Start difference. First operand has 138 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 30 states have call successors, (30), 25 states have call predecessors, (30), 24 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 140 states. [2022-04-28 11:22:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:25,954 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2022-04-28 11:22:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 145 transitions. [2022-04-28 11:22:25,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:25,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:25,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:25,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 30 states have call successors, (30), 25 states have call predecessors, (30), 24 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:22:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-04-28 11:22:25,957 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 134 [2022-04-28 11:22:25,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:25,957 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-04-28 11:22:25,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-28 11:22:25,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 143 transitions. [2022-04-28 11:22:29,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 142 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-28 11:22:29,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 11:22:29,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:29,213 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:22:29,218 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:22:29,415 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:22:29,415 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:29,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:29,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1923910469, now seen corresponding path program 19 times [2022-04-28 11:22:29,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:29,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [457519767] [2022-04-28 11:22:29,636 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:22:29,636 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:22:29,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1923910469, now seen corresponding path program 20 times [2022-04-28 11:22:29,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:29,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226419040] [2022-04-28 11:22:29,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:29,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:29,644 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:29,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1856306139] [2022-04-28 11:22:29,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:22:29,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:29,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:29,645 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:22:29,648 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:22:29,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:22:29,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:29,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 11:22:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:29,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:30,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {19319#true} call ULTIMATE.init(); {19319#true} is VALID [2022-04-28 11:22:30,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {19319#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); {19319#true} is VALID [2022-04-28 11:22:30,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19319#true} {19319#true} #84#return; {19319#true} is VALID [2022-04-28 11:22:30,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {19319#true} call #t~ret5 := main(); {19319#true} is VALID [2022-04-28 11:22:30,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {19319#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; {19319#true} is VALID [2022-04-28 11:22:30,382 INFO L272 TraceCheckUtils]: 6: Hoare triple {19319#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {19319#true} ~cond := #in~cond; {19345#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:22:30,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {19345#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {19349#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:22:30,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {19349#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {19349#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:22:30,385 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19349#(not (= |assume_abort_if_not_#in~cond| 0))} {19319#true} #60#return; {19356#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {19356#(and (<= 0 main_~a~0) (<= main_~a~0 2))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} is VALID [2022-04-28 11:22:30,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} assume !false; {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} is VALID [2022-04-28 11:22:30,386 INFO L272 TraceCheckUtils]: 13: Hoare triple {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,387 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19319#true} {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} #62#return; {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} is VALID [2022-04-28 11:22:30,387 INFO L272 TraceCheckUtils]: 18: Hoare triple {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,387 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19319#true} {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} #64#return; {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} is VALID [2022-04-28 11:22:30,388 INFO L272 TraceCheckUtils]: 23: Hoare triple {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,388 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19319#true} {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} #66#return; {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} is VALID [2022-04-28 11:22:30,388 INFO L272 TraceCheckUtils]: 28: Hoare triple {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 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)); {19319#true} is VALID [2022-04-28 11:22:30,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,389 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19319#true} {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} #68#return; {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} is VALID [2022-04-28 11:22:30,389 INFO L272 TraceCheckUtils]: 33: Hoare triple {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,390 INFO L290 TraceCheckUtils]: 36: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,390 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {19319#true} {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} #70#return; {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 main_~n~0))} is VALID [2022-04-28 11:22:30,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {19360#(and (<= 0 main_~a~0) (<= main_~a~0 2) (<= 0 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; {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,392 INFO L272 TraceCheckUtils]: 40: Hoare triple {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,392 INFO L290 TraceCheckUtils]: 41: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,392 INFO L290 TraceCheckUtils]: 42: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,392 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19319#true} {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,392 INFO L272 TraceCheckUtils]: 45: Hoare triple {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,393 INFO L290 TraceCheckUtils]: 48: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,393 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {19319#true} {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,393 INFO L272 TraceCheckUtils]: 50: Hoare triple {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,393 INFO L290 TraceCheckUtils]: 52: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,393 INFO L290 TraceCheckUtils]: 53: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,394 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19319#true} {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,394 INFO L272 TraceCheckUtils]: 55: Hoare triple {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~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)); {19319#true} is VALID [2022-04-28 11:22:30,394 INFO L290 TraceCheckUtils]: 56: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,394 INFO L290 TraceCheckUtils]: 57: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,394 INFO L290 TraceCheckUtils]: 58: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,395 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19319#true} {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,395 INFO L272 TraceCheckUtils]: 60: Hoare triple {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,395 INFO L290 TraceCheckUtils]: 61: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,395 INFO L290 TraceCheckUtils]: 62: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,395 INFO L290 TraceCheckUtils]: 63: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,396 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {19319#true} {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,396 INFO L290 TraceCheckUtils]: 65: Hoare triple {19442#(and (<= 1 main_~n~0) (<= 0 main_~a~0) (<= main_~a~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; {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,397 INFO L290 TraceCheckUtils]: 66: Hoare triple {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,397 INFO L272 TraceCheckUtils]: 67: Hoare triple {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,397 INFO L290 TraceCheckUtils]: 68: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,397 INFO L290 TraceCheckUtils]: 69: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,397 INFO L290 TraceCheckUtils]: 70: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,397 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19319#true} {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,398 INFO L272 TraceCheckUtils]: 72: Hoare triple {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,398 INFO L290 TraceCheckUtils]: 73: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,398 INFO L290 TraceCheckUtils]: 74: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,398 INFO L290 TraceCheckUtils]: 75: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,398 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19319#true} {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,398 INFO L272 TraceCheckUtils]: 77: Hoare triple {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,398 INFO L290 TraceCheckUtils]: 78: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,399 INFO L290 TraceCheckUtils]: 79: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,399 INFO L290 TraceCheckUtils]: 80: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,399 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19319#true} {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,399 INFO L272 TraceCheckUtils]: 82: Hoare triple {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~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)); {19319#true} is VALID [2022-04-28 11:22:30,399 INFO L290 TraceCheckUtils]: 83: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,399 INFO L290 TraceCheckUtils]: 84: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,399 INFO L290 TraceCheckUtils]: 85: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,400 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19319#true} {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,400 INFO L272 TraceCheckUtils]: 87: Hoare triple {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,400 INFO L290 TraceCheckUtils]: 88: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,400 INFO L290 TraceCheckUtils]: 89: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,400 INFO L290 TraceCheckUtils]: 90: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,401 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {19319#true} {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,401 INFO L290 TraceCheckUtils]: 92: Hoare triple {19524#(and (<= 2 main_~n~0) (<= 0 main_~a~0) (<= main_~a~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; {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,402 INFO L290 TraceCheckUtils]: 93: Hoare triple {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,402 INFO L272 TraceCheckUtils]: 94: Hoare triple {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,402 INFO L290 TraceCheckUtils]: 95: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,402 INFO L290 TraceCheckUtils]: 96: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,402 INFO L290 TraceCheckUtils]: 97: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,403 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {19319#true} {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,403 INFO L272 TraceCheckUtils]: 99: Hoare triple {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,403 INFO L290 TraceCheckUtils]: 100: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,403 INFO L290 TraceCheckUtils]: 101: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,403 INFO L290 TraceCheckUtils]: 102: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,403 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {19319#true} {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,403 INFO L272 TraceCheckUtils]: 104: Hoare triple {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,404 INFO L290 TraceCheckUtils]: 105: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,404 INFO L290 TraceCheckUtils]: 106: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,404 INFO L290 TraceCheckUtils]: 107: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,404 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19319#true} {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,404 INFO L272 TraceCheckUtils]: 109: Hoare triple {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~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)); {19319#true} is VALID [2022-04-28 11:22:30,404 INFO L290 TraceCheckUtils]: 110: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,404 INFO L290 TraceCheckUtils]: 111: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,405 INFO L290 TraceCheckUtils]: 112: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,405 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19319#true} {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,405 INFO L272 TraceCheckUtils]: 114: Hoare triple {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19319#true} is VALID [2022-04-28 11:22:30,405 INFO L290 TraceCheckUtils]: 115: Hoare triple {19319#true} ~cond := #in~cond; {19319#true} is VALID [2022-04-28 11:22:30,405 INFO L290 TraceCheckUtils]: 116: Hoare triple {19319#true} assume !(0 == ~cond); {19319#true} is VALID [2022-04-28 11:22:30,405 INFO L290 TraceCheckUtils]: 117: Hoare triple {19319#true} assume true; {19319#true} is VALID [2022-04-28 11:22:30,406 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {19319#true} {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-28 11:22:30,407 INFO L290 TraceCheckUtils]: 119: Hoare triple {19606#(and (<= 3 main_~n~0) (<= 0 main_~a~0) (<= main_~a~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; {19320#false} is VALID [2022-04-28 11:22:30,407 INFO L290 TraceCheckUtils]: 120: Hoare triple {19320#false} assume !false; {19320#false} is VALID [2022-04-28 11:22:30,407 INFO L272 TraceCheckUtils]: 121: Hoare triple {19320#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19320#false} is VALID [2022-04-28 11:22:30,407 INFO L290 TraceCheckUtils]: 122: Hoare triple {19320#false} ~cond := #in~cond; {19320#false} is VALID [2022-04-28 11:22:30,407 INFO L290 TraceCheckUtils]: 123: Hoare triple {19320#false} assume !(0 == ~cond); {19320#false} is VALID [2022-04-28 11:22:30,407 INFO L290 TraceCheckUtils]: 124: Hoare triple {19320#false} assume true; {19320#false} is VALID [2022-04-28 11:22:30,407 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {19320#false} {19320#false} #62#return; {19320#false} is VALID [2022-04-28 11:22:30,407 INFO L272 TraceCheckUtils]: 126: Hoare triple {19320#false} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19320#false} is VALID [2022-04-28 11:22:30,407 INFO L290 TraceCheckUtils]: 127: Hoare triple {19320#false} ~cond := #in~cond; {19320#false} is VALID [2022-04-28 11:22:30,407 INFO L290 TraceCheckUtils]: 128: Hoare triple {19320#false} assume !(0 == ~cond); {19320#false} is VALID [2022-04-28 11:22:30,407 INFO L290 TraceCheckUtils]: 129: Hoare triple {19320#false} assume true; {19320#false} is VALID [2022-04-28 11:22:30,408 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {19320#false} {19320#false} #64#return; {19320#false} is VALID [2022-04-28 11:22:30,408 INFO L272 TraceCheckUtils]: 131: Hoare triple {19320#false} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19320#false} is VALID [2022-04-28 11:22:30,408 INFO L290 TraceCheckUtils]: 132: Hoare triple {19320#false} ~cond := #in~cond; {19320#false} is VALID [2022-04-28 11:22:30,408 INFO L290 TraceCheckUtils]: 133: Hoare triple {19320#false} assume 0 == ~cond; {19320#false} is VALID [2022-04-28 11:22:30,408 INFO L290 TraceCheckUtils]: 134: Hoare triple {19320#false} assume !false; {19320#false} is VALID [2022-04-28 11:22:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2022-04-28 11:22:30,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:22:30,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:30,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226419040] [2022-04-28 11:22:30,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:30,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856306139] [2022-04-28 11:22:30,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856306139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:30,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:30,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:22:30,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:30,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [457519767] [2022-04-28 11:22:30,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [457519767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:30,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:30,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:22:30,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431116170] [2022-04-28 11:22:30,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:30,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 7 states have call predecessors, (24), 6 states have call successors, (24) Word has length 135 [2022-04-28 11:22:30,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:30,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 7 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:22:30,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:30,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:22:30,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:30,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:22:30,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:22:30,469 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 7 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:22:31,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:31,075 INFO L93 Difference]: Finished difference Result 167 states and 173 transitions. [2022-04-28 11:22:31,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:22:31,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 7 states have call predecessors, (24), 6 states have call successors, (24) Word has length 135 [2022-04-28 11:22:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:31,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 7 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:22:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-28 11:22:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 7 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:22:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-28 11:22:31,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 98 transitions. [2022-04-28 11:22:31,160 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:22:31,162 INFO L225 Difference]: With dead ends: 167 [2022-04-28 11:22:31,162 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 11:22:31,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:22:31,163 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 6 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:31,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 208 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:22:31,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 11:22:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-28 11:22:31,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:31,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0) internal successors, (81), 81 states have internal predecessors, (81), 27 states have call successors, (27), 25 states have call predecessors, (27), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:22:31,326 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0) internal successors, (81), 81 states have internal predecessors, (81), 27 states have call successors, (27), 25 states have call predecessors, (27), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:22:31,326 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0) internal successors, (81), 81 states have internal predecessors, (81), 27 states have call successors, (27), 25 states have call predecessors, (27), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:22:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:31,328 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2022-04-28 11:22:31,328 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2022-04-28 11:22:31,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:31,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:31,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 81 states have (on average 1.0) internal successors, (81), 81 states have internal predecessors, (81), 27 states have call successors, (27), 25 states have call predecessors, (27), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 132 states. [2022-04-28 11:22:31,329 INFO L87 Difference]: Start difference. First operand has 132 states, 81 states have (on average 1.0) internal successors, (81), 81 states have internal predecessors, (81), 27 states have call successors, (27), 25 states have call predecessors, (27), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 132 states. [2022-04-28 11:22:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:31,330 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2022-04-28 11:22:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2022-04-28 11:22:31,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:31,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:31,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:31,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.0) internal successors, (81), 81 states have internal predecessors, (81), 27 states have call successors, (27), 25 states have call predecessors, (27), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:22:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2022-04-28 11:22:31,332 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 135 [2022-04-28 11:22:31,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:31,333 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2022-04-28 11:22:31,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 7 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:22:31,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 133 transitions. [2022-04-28 11:22:31,531 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:22:31,532 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2022-04-28 11:22:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-28 11:22:31,532 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:31,533 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 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, 1, 1] [2022-04-28 11:22:31,549 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:22:31,733 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:22:31,733 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:31,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:31,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1075993849, now seen corresponding path program 1 times [2022-04-28 11:22:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:31,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [645540856] [2022-04-28 11:22:31,964 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:22:31,964 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:22:31,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1075993849, now seen corresponding path program 2 times [2022-04-28 11:22:31,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:31,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105994720] [2022-04-28 11:22:31,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:31,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:31,977 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:31,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [97479789] [2022-04-28 11:22:31,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:22:31,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:31,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:31,979 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:22:31,980 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:22:32,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:22:32,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:32,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 11:22:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:32,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:38,345 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:22:38,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {20596#true} call ULTIMATE.init(); {20596#true} is VALID [2022-04-28 11:22:38,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {20596#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); {20596#true} is VALID [2022-04-28 11:22:38,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20596#true} {20596#true} #84#return; {20596#true} is VALID [2022-04-28 11:22:38,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {20596#true} call #t~ret5 := main(); {20596#true} is VALID [2022-04-28 11:22:38,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {20596#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; {20596#true} is VALID [2022-04-28 11:22:38,483 INFO L272 TraceCheckUtils]: 6: Hoare triple {20596#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {20596#true} is VALID [2022-04-28 11:22:38,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,483 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20596#true} {20596#true} #60#return; {20596#true} is VALID [2022-04-28 11:22:38,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {20596#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {20634#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:38,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {20634#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {20634#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:38,484 INFO L272 TraceCheckUtils]: 13: Hoare triple {20634#(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)); {20596#true} is VALID [2022-04-28 11:22:38,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,485 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20596#true} {20634#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {20634#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:38,485 INFO L272 TraceCheckUtils]: 18: Hoare triple {20634#(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)); {20596#true} is VALID [2022-04-28 11:22:38,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,486 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20596#true} {20634#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {20634#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:38,486 INFO L272 TraceCheckUtils]: 23: Hoare triple {20634#(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)); {20596#true} is VALID [2022-04-28 11:22:38,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,487 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20596#true} {20634#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {20634#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:38,487 INFO L272 TraceCheckUtils]: 28: Hoare triple {20634#(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)); {20596#true} is VALID [2022-04-28 11:22:38,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,490 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20596#true} {20634#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {20634#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:38,490 INFO L272 TraceCheckUtils]: 33: Hoare triple {20634#(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)); {20596#true} is VALID [2022-04-28 11:22:38,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,491 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {20596#true} {20634#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {20634#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:38,491 INFO L290 TraceCheckUtils]: 38: Hoare triple {20634#(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; {20716#(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:22:38,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {20716#(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; {20716#(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:22:38,492 INFO L272 TraceCheckUtils]: 40: Hoare triple {20716#(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)); {20596#true} is VALID [2022-04-28 11:22:38,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,493 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {20596#true} {20716#(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; {20716#(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:22:38,493 INFO L272 TraceCheckUtils]: 45: Hoare triple {20716#(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)); {20596#true} is VALID [2022-04-28 11:22:38,493 INFO L290 TraceCheckUtils]: 46: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,493 INFO L290 TraceCheckUtils]: 47: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,493 INFO L290 TraceCheckUtils]: 48: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,493 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {20596#true} {20716#(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; {20716#(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:22:38,494 INFO L272 TraceCheckUtils]: 50: Hoare triple {20716#(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)); {20596#true} is VALID [2022-04-28 11:22:38,494 INFO L290 TraceCheckUtils]: 51: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,494 INFO L290 TraceCheckUtils]: 52: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,494 INFO L290 TraceCheckUtils]: 53: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,494 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {20596#true} {20716#(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; {20716#(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:22:38,494 INFO L272 TraceCheckUtils]: 55: Hoare triple {20716#(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)); {20596#true} is VALID [2022-04-28 11:22:38,494 INFO L290 TraceCheckUtils]: 56: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,495 INFO L290 TraceCheckUtils]: 58: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,495 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20596#true} {20716#(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; {20716#(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:22:38,495 INFO L272 TraceCheckUtils]: 60: Hoare triple {20716#(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)); {20596#true} is VALID [2022-04-28 11:22:38,495 INFO L290 TraceCheckUtils]: 61: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,495 INFO L290 TraceCheckUtils]: 62: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,496 INFO L290 TraceCheckUtils]: 63: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,496 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {20596#true} {20716#(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; {20716#(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:22:38,496 INFO L290 TraceCheckUtils]: 65: Hoare triple {20716#(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; {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:22:38,497 INFO L290 TraceCheckUtils]: 66: Hoare triple {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} assume !false; {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:22:38,497 INFO L272 TraceCheckUtils]: 67: Hoare triple {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20596#true} is VALID [2022-04-28 11:22:38,497 INFO L290 TraceCheckUtils]: 68: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,497 INFO L290 TraceCheckUtils]: 69: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,497 INFO L290 TraceCheckUtils]: 70: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,498 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20596#true} {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #62#return; {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:22:38,498 INFO L272 TraceCheckUtils]: 72: Hoare triple {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 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)); {20596#true} is VALID [2022-04-28 11:22:38,498 INFO L290 TraceCheckUtils]: 73: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,498 INFO L290 TraceCheckUtils]: 74: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,498 INFO L290 TraceCheckUtils]: 75: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,498 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {20596#true} {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #64#return; {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:22:38,499 INFO L272 TraceCheckUtils]: 77: Hoare triple {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20596#true} is VALID [2022-04-28 11:22:38,499 INFO L290 TraceCheckUtils]: 78: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,499 INFO L290 TraceCheckUtils]: 79: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,499 INFO L290 TraceCheckUtils]: 80: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,499 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20596#true} {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #66#return; {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:22:38,499 INFO L272 TraceCheckUtils]: 82: Hoare triple {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 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)); {20596#true} is VALID [2022-04-28 11:22:38,499 INFO L290 TraceCheckUtils]: 83: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,500 INFO L290 TraceCheckUtils]: 84: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,500 INFO L290 TraceCheckUtils]: 85: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,500 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {20596#true} {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #68#return; {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:22:38,500 INFO L272 TraceCheckUtils]: 87: Hoare triple {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 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)); {20596#true} is VALID [2022-04-28 11:22:38,500 INFO L290 TraceCheckUtils]: 88: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,500 INFO L290 TraceCheckUtils]: 89: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,500 INFO L290 TraceCheckUtils]: 90: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,501 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {20596#true} {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #70#return; {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:22:38,501 INFO L290 TraceCheckUtils]: 92: Hoare triple {20798#(and (= main_~z~0 18) (= main_~n~0 2) (= 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; {20880#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (<= 2 main_~a~0) (= 19 (+ main_~x~0 (- 8))) (<= main_~n~0 3))} is VALID [2022-04-28 11:22:38,502 INFO L290 TraceCheckUtils]: 93: Hoare triple {20880#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (<= 2 main_~a~0) (= 19 (+ main_~x~0 (- 8))) (<= main_~n~0 3))} assume !false; {20880#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (<= 2 main_~a~0) (= 19 (+ main_~x~0 (- 8))) (<= main_~n~0 3))} is VALID [2022-04-28 11:22:38,502 INFO L272 TraceCheckUtils]: 94: Hoare triple {20880#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (<= 2 main_~a~0) (= 19 (+ main_~x~0 (- 8))) (<= main_~n~0 3))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20596#true} is VALID [2022-04-28 11:22:38,502 INFO L290 TraceCheckUtils]: 95: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,502 INFO L290 TraceCheckUtils]: 96: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,502 INFO L290 TraceCheckUtils]: 97: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,503 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20596#true} {20880#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (<= 2 main_~a~0) (= 19 (+ main_~x~0 (- 8))) (<= main_~n~0 3))} #62#return; {20880#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (<= 2 main_~a~0) (= 19 (+ main_~x~0 (- 8))) (<= main_~n~0 3))} is VALID [2022-04-28 11:22:38,503 INFO L272 TraceCheckUtils]: 99: Hoare triple {20880#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (<= 2 main_~a~0) (= 19 (+ main_~x~0 (- 8))) (<= main_~n~0 3))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20596#true} is VALID [2022-04-28 11:22:38,503 INFO L290 TraceCheckUtils]: 100: Hoare triple {20596#true} ~cond := #in~cond; {20905#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:38,503 INFO L290 TraceCheckUtils]: 101: Hoare triple {20905#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20909#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:38,504 INFO L290 TraceCheckUtils]: 102: Hoare triple {20909#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20909#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:38,504 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {20909#(not (= |__VERIFIER_assert_#in~cond| 0))} {20880#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (<= 2 main_~a~0) (= 19 (+ main_~x~0 (- 8))) (<= main_~n~0 3))} #64#return; {20916#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 27))} is VALID [2022-04-28 11:22:38,505 INFO L272 TraceCheckUtils]: 104: Hoare triple {20916#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 27))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20596#true} is VALID [2022-04-28 11:22:38,505 INFO L290 TraceCheckUtils]: 105: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,505 INFO L290 TraceCheckUtils]: 106: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,505 INFO L290 TraceCheckUtils]: 107: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,505 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {20596#true} {20916#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 27))} #66#return; {20916#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 27))} is VALID [2022-04-28 11:22:38,505 INFO L272 TraceCheckUtils]: 109: Hoare triple {20916#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 27))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20596#true} is VALID [2022-04-28 11:22:38,505 INFO L290 TraceCheckUtils]: 110: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,506 INFO L290 TraceCheckUtils]: 111: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,506 INFO L290 TraceCheckUtils]: 112: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,506 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {20596#true} {20916#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 27))} #68#return; {20916#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 27))} is VALID [2022-04-28 11:22:38,506 INFO L272 TraceCheckUtils]: 114: Hoare triple {20916#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 27))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20596#true} is VALID [2022-04-28 11:22:38,507 INFO L290 TraceCheckUtils]: 115: Hoare triple {20596#true} ~cond := #in~cond; {20905#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:38,507 INFO L290 TraceCheckUtils]: 116: Hoare triple {20905#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20909#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:38,507 INFO L290 TraceCheckUtils]: 117: Hoare triple {20909#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20909#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:38,508 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {20909#(not (= |__VERIFIER_assert_#in~cond| 0))} {20916#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 27))} #70#return; {20916#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 27))} is VALID [2022-04-28 11:22:38,509 INFO L290 TraceCheckUtils]: 119: Hoare triple {20916#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 27))} assume !(~n~0 <= ~a~0); {20965#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (exists ((main_~n~0 Int)) (and (not (<= main_~n~0 main_~a~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-28 11:22:38,509 INFO L272 TraceCheckUtils]: 120: Hoare triple {20965#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (exists ((main_~n~0 Int)) (and (not (<= main_~n~0 main_~a~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20596#true} is VALID [2022-04-28 11:22:38,509 INFO L290 TraceCheckUtils]: 121: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,509 INFO L290 TraceCheckUtils]: 122: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,509 INFO L290 TraceCheckUtils]: 123: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,510 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {20596#true} {20965#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (exists ((main_~n~0 Int)) (and (not (<= main_~n~0 main_~a~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= main_~x~0 27))} #72#return; {20965#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (exists ((main_~n~0 Int)) (and (not (<= main_~n~0 main_~a~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-28 11:22:38,510 INFO L272 TraceCheckUtils]: 125: Hoare triple {20965#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (exists ((main_~n~0 Int)) (and (not (<= main_~n~0 main_~a~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {20596#true} is VALID [2022-04-28 11:22:38,510 INFO L290 TraceCheckUtils]: 126: Hoare triple {20596#true} ~cond := #in~cond; {20905#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:38,511 INFO L290 TraceCheckUtils]: 127: Hoare triple {20905#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20909#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:38,511 INFO L290 TraceCheckUtils]: 128: Hoare triple {20909#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20909#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:38,512 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {20909#(not (= |__VERIFIER_assert_#in~cond| 0))} {20965#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (exists ((main_~n~0 Int)) (and (not (<= main_~n~0 main_~a~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))) (= (+ main_~x~0 10) main_~y~0) (<= 2 main_~a~0) (= main_~x~0 27))} #74#return; {20996#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (= (+ main_~x~0 10) main_~y~0) (= main_~x~0 27))} is VALID [2022-04-28 11:22:38,512 INFO L272 TraceCheckUtils]: 130: Hoare triple {20996#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (= (+ main_~x~0 10) main_~y~0) (= main_~x~0 27))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {20596#true} is VALID [2022-04-28 11:22:38,512 INFO L290 TraceCheckUtils]: 131: Hoare triple {20596#true} ~cond := #in~cond; {20596#true} is VALID [2022-04-28 11:22:38,512 INFO L290 TraceCheckUtils]: 132: Hoare triple {20596#true} assume !(0 == ~cond); {20596#true} is VALID [2022-04-28 11:22:38,512 INFO L290 TraceCheckUtils]: 133: Hoare triple {20596#true} assume true; {20596#true} is VALID [2022-04-28 11:22:38,513 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {20596#true} {20996#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (= (+ main_~x~0 10) main_~y~0) (= main_~x~0 27))} #76#return; {20996#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (= (+ main_~x~0 10) main_~y~0) (= main_~x~0 27))} is VALID [2022-04-28 11:22:38,514 INFO L272 TraceCheckUtils]: 135: Hoare triple {20996#(and (= (+ main_~y~0 14) (+ main_~z~0 main_~x~0)) (= (+ main_~x~0 10) main_~y~0) (= main_~x~0 27))} 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)); {21015#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:38,514 INFO L290 TraceCheckUtils]: 136: Hoare triple {21015#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21019#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:38,514 INFO L290 TraceCheckUtils]: 137: Hoare triple {21019#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20597#false} is VALID [2022-04-28 11:22:38,514 INFO L290 TraceCheckUtils]: 138: Hoare triple {20597#false} assume !false; {20597#false} is VALID [2022-04-28 11:22:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 202 proven. 66 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2022-04-28 11:22:38,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:23:48,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:23:48,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105994720] [2022-04-28 11:23:48,616 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:23:48,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97479789] [2022-04-28 11:23:48,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97479789] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:23:48,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:23:48,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 11:23:48,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:23:48,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [645540856] [2022-04-28 11:23:48,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [645540856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:48,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:48,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 11:23:48,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711170156] [2022-04-28 11:23:48,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:23:48,618 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) Word has length 139 [2022-04-28 11:23:48,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:23:48,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) [2022-04-28 11:23:48,685 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:23:48,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 11:23:48,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:48,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 11:23:48,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=281, Unknown=2, NotChecked=0, Total=380 [2022-04-28 11:23:48,686 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) [2022-04-28 11:23:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:49,954 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2022-04-28 11:23:49,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 11:23:49,954 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) Word has length 139 [2022-04-28 11:23:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:23:49,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) [2022-04-28 11:23:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 75 transitions. [2022-04-28 11:23:49,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) [2022-04-28 11:23:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 75 transitions. [2022-04-28 11:23:49,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 75 transitions. [2022-04-28 11:23:50,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:50,038 INFO L225 Difference]: With dead ends: 136 [2022-04-28 11:23:50,038 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 11:23:50,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=122, Invalid=382, Unknown=2, NotChecked=0, Total=506 [2022-04-28 11:23:50,039 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 12 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:23:50,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 190 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 405 Invalid, 0 Unknown, 69 Unchecked, 0.5s Time] [2022-04-28 11:23:50,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 11:23:50,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 11:23:50,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:23:50,040 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:23:50,040 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:23:50,040 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:23:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:50,040 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:23:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:23:50,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:50,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:50,040 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:23:50,040 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:23:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:50,040 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:23:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:23:50,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:50,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:50,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:23:50,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:23:50,041 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:23:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 11:23:50,041 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2022-04-28 11:23:50,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:23:50,041 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 11:23:50,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) [2022-04-28 11:23:50,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 11:23:50,041 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:23:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:23:50,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:50,043 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:23:50,060 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:23:50,247 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:23:50,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 11:23:54,064 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 11:23:54,064 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 11:23:54,069 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 11:23:54,069 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-28 11:23:54,069 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:23:54,069 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:23:54,069 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:23:54,070 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (let ((.cse0 (<= 0 main_~a~0)) (.cse2 (= main_~x~0 (let ((.cse4 (div (+ main_~z~0 (- 6)) 6))) (* .cse4 .cse4 .cse4)))) (.cse3 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse1 (<= main_~a~0 2))) (or (and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) .cse0 (= main_~n~0 1) .cse1 (= main_~y~0 (+ main_~x~0 6))) (and .cse2 (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse3 .cse0 .cse1 (= main_~z~0 6)) (and (<= 1 main_~a~0) .cse3 .cse1 (= (+ main_~y~0 17) (* main_~z~0 2)) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and .cse2 .cse3 (<= 2 main_~a~0) (= main_~x~0 27) .cse1 (= main_~y~0 37)))) [2022-04-28 11:23:54,070 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 (<= 1 main_~a~0) .cse0 (< main_~a~0 2) (= (+ main_~y~0 17) (* main_~z~0 2)) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (and .cse0 (<= 2 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 27) (<= main_~n~0 3) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6))) (and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (<= 0 main_~a~0) (= main_~n~0 1) (< main_~a~0 1) (= main_~y~0 (+ main_~x~0 6))))) [2022-04-28 11:23:54,070 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 56) the Hoare annotation is: true [2022-04-28 11:23:54,070 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse1 (+ main_~z~0 main_~x~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) .cse1) (= main_~y~0 (+ main_~x~0 6))) (and (= main_~x~0 (let ((.cse2 (div (+ main_~z~0 (- 6)) 6))) (* .cse2 .cse2 .cse2))) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 3)) (and (= (+ main_~x~0 10) main_~z~0) .cse0 (= (+ 7 main_~y~0) .cse1) (= main_~x~0 8)))) [2022-04-28 11:23:54,070 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse1 (+ main_~z~0 main_~x~0)) (.cse2 (+ main_~x~0 10)) (.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) .cse1) (= main_~y~0 (+ main_~x~0 6))) (and (= .cse2 main_~z~0) .cse0 (= (+ 7 main_~y~0) .cse1) (= main_~x~0 8)) (let ((.cse3 (div (+ main_~z~0 (- 6)) 6))) (and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= .cse2 main_~y~0) .cse0 (<= 0 main_~a~0) (= main_~x~0 27) (<= .cse3 (+ main_~a~0 1)) (< main_~a~0 .cse3))))) [2022-04-28 11:23:54,070 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 10) main_~y~0) .cse0 (<= 2 main_~a~0) (= main_~x~0 27) (<= main_~n~0 3) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6))) (and (<= 1 main_~a~0) .cse0 (< main_~a~0 2) (= (+ main_~y~0 17) (* main_~z~0 2)) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (<= 0 main_~a~0) (= main_~n~0 1) (< main_~a~0 1) (= main_~y~0 (+ main_~x~0 6))))) [2022-04-28 11:23:54,070 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 56) the Hoare annotation is: true [2022-04-28 11:23:54,070 INFO L895 garLoopResultBuilder]: At program point L38(lines 33 46) the Hoare annotation is: (let ((.cse0 (= main_~x~0 (let ((.cse4 (div (+ main_~z~0 (- 6)) 6))) (* .cse4 .cse4 .cse4)))) (.cse1 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse2 (<= 0 main_~a~0)) (.cse3 (<= main_~a~0 2))) (or (and .cse0 (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse1 .cse2 .cse3 (= main_~z~0 6)) (and .cse0 .cse1 (<= 2 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 27) .cse3) (and (<= 1 main_~a~0) .cse1 .cse3 (= (+ main_~y~0 17) (* main_~z~0 2)) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) .cse2 (= main_~n~0 1) .cse3 (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= main_~y~0 (+ main_~x~0 6))))) [2022-04-28 11:23:54,070 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse0 (= main_~x~0 (let ((.cse4 (div (+ main_~z~0 (- 6)) 6))) (* .cse4 .cse4 .cse4)))) (.cse1 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse2 (<= 0 main_~a~0)) (.cse3 (<= main_~a~0 2))) (or (and .cse0 (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse1 .cse2 .cse3 (= main_~z~0 6)) (and .cse0 .cse1 (<= 2 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 27) .cse3) (and (<= 1 main_~a~0) .cse1 .cse3 (= (+ main_~y~0 17) (* main_~z~0 2)) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) .cse2 (= main_~n~0 1) .cse3 (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= main_~y~0 (+ main_~x~0 6))))) [2022-04-28 11:23:54,071 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (<= 0 main_~a~0)) (.cse2 (= main_~x~0 (let ((.cse4 (div (+ main_~z~0 (- 6)) 6))) (* .cse4 .cse4 .cse4)))) (.cse3 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse1 (<= main_~a~0 2))) (or (and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) .cse0 (= main_~n~0 1) .cse1 (= main_~y~0 (+ main_~x~0 6))) (and .cse2 (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse3 .cse0 .cse1 (= main_~z~0 6)) (and (<= 1 main_~a~0) .cse3 .cse1 (= (+ main_~y~0 17) (* main_~z~0 2)) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and .cse2 .cse3 (<= 2 main_~a~0) (= main_~x~0 27) .cse1 (= main_~y~0 37)))) [2022-04-28 11:23:54,071 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (<= 0 main_~a~0)) (.cse2 (= main_~x~0 (let ((.cse4 (div (+ main_~z~0 (- 6)) 6))) (* .cse4 .cse4 .cse4)))) (.cse3 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse1 (<= main_~a~0 2))) (or (and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) .cse0 (= main_~n~0 1) .cse1 (= main_~y~0 (+ main_~x~0 6))) (and .cse2 (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse3 .cse0 .cse1 (= main_~z~0 6)) (and (<= 1 main_~a~0) .cse3 .cse1 (= (+ main_~y~0 17) (* main_~z~0 2)) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and .cse2 .cse3 (<= 2 main_~a~0) (= main_~x~0 27) .cse1 (= main_~y~0 37)))) [2022-04-28 11:23:54,071 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 56) the Hoare annotation is: true [2022-04-28 11:23:54,071 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:23:54,071 INFO L895 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 0 main_~a~0) (<= main_~a~0 2)) [2022-04-28 11:23:54,071 INFO L902 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: true [2022-04-28 11:23:54,071 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse1 (+ main_~z~0 main_~x~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) .cse1) (= main_~y~0 (+ main_~x~0 6))) (and (= main_~x~0 (let ((.cse2 (div (+ main_~z~0 (- 6)) 6))) (* .cse2 .cse2 .cse2))) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 3)) (and (= (+ main_~x~0 10) main_~z~0) .cse0 (= (+ 7 main_~y~0) .cse1) (= main_~x~0 8)))) [2022-04-28 11:23:54,071 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse1 (<= 0 main_~a~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (and (= main_~n~0 2) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 17) (* main_~z~0 2)) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) .cse1 (= main_~n~0 1) (< main_~a~0 1) (= main_~y~0 (+ main_~x~0 6))) (let ((.cse2 (div (+ main_~z~0 (- 6)) 6))) (and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ main_~x~0 10) main_~y~0) .cse0 .cse1 (= main_~x~0 27) (<= .cse2 (+ main_~a~0 1)) (< main_~a~0 .cse2))))) [2022-04-28 11:23:54,071 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (= main_~x~0 (let ((.cse4 (div (+ main_~z~0 (- 6)) 6))) (* .cse4 .cse4 .cse4)))) (.cse1 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse2 (<= 0 main_~a~0)) (.cse3 (<= main_~a~0 2))) (or (and .cse0 (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse1 .cse2 .cse3 (= main_~z~0 6)) (and .cse0 .cse1 (<= 2 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 27) .cse3) (and (<= 1 main_~a~0) .cse1 .cse3 (= (+ main_~y~0 17) (* main_~z~0 2)) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) .cse2 (= main_~n~0 1) .cse3 (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= main_~y~0 (+ main_~x~0 6))))) [2022-04-28 11:23:54,071 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse2 (<= 0 main_~a~0)) (.cse0 (= main_~x~0 (let ((.cse4 (div (+ main_~z~0 (- 6)) 6))) (* .cse4 .cse4 .cse4)))) (.cse1 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse3 (<= main_~a~0 2))) (or (and .cse0 (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse1 .cse2 .cse3 (= main_~z~0 6)) (and (<= 1 main_~a~0) .cse1 .cse3 (= (+ main_~y~0 17) (* main_~z~0 2)) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and .cse1 (= main_~x~0 1) .cse2 (= main_~n~0 1) .cse3 (= main_~y~0 (+ main_~x~0 6))) (and .cse0 .cse1 (<= 2 main_~a~0) (= main_~x~0 27) .cse3 (= main_~y~0 37)))) [2022-04-28 11:23:54,071 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:23:54,072 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:23:54,072 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:23:54,072 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:23:54,072 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 11:23:54,072 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 11:23:54,072 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:23:54,072 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 11:23:54,072 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-04-28 11:23:54,072 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 11:23:54,072 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-04-28 11:23:54,072 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-04-28 11:23:54,072 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:23:54,074 INFO L356 BasicCegarLoop]: Path program histogram: [20, 6, 6, 2, 2, 2, 2, 2, 2] [2022-04-28 11:23:54,076 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:23:54,077 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:23:54,086 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 11:23:54,139 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:23:54,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:23:54 BoogieIcfgContainer [2022-04-28 11:23:54,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:23:54,159 INFO L158 Benchmark]: Toolchain (without parser) took 493502.83ms. Allocated memory was 190.8MB in the beginning and 297.8MB in the end (delta: 107.0MB). Free memory was 142.4MB in the beginning and 268.0MB in the end (delta: -125.6MB). Peak memory consumption was 155.4MB. Max. memory is 8.0GB. [2022-04-28 11:23:54,159 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory was 158.7MB in the beginning and 158.6MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:23:54,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.29ms. Allocated memory is still 190.8MB. Free memory was 142.1MB in the beginning and 166.6MB in the end (delta: -24.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 11:23:54,160 INFO L158 Benchmark]: Boogie Preprocessor took 37.90ms. Allocated memory is still 190.8MB. Free memory was 166.6MB in the beginning and 165.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 11:23:54,160 INFO L158 Benchmark]: RCFGBuilder took 279.25ms. Allocated memory is still 190.8MB. Free memory was 165.0MB in the beginning and 153.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 11:23:54,160 INFO L158 Benchmark]: TraceAbstraction took 492984.35ms. Allocated memory was 190.8MB in the beginning and 297.8MB in the end (delta: 107.0MB). Free memory was 153.0MB in the beginning and 268.0MB in the end (delta: -115.0MB). Peak memory consumption was 166.8MB. Max. memory is 8.0GB. [2022-04-28 11:23:54,161 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 190.8MB. Free memory was 158.7MB in the beginning and 158.6MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.29ms. Allocated memory is still 190.8MB. Free memory was 142.1MB in the beginning and 166.6MB in the end (delta: -24.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.90ms. Allocated memory is still 190.8MB. Free memory was 166.6MB in the beginning and 165.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 279.25ms. Allocated memory is still 190.8MB. Free memory was 165.0MB in the beginning and 153.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 492984.35ms. Allocated memory was 190.8MB in the beginning and 297.8MB in the end (delta: 107.0MB). Free memory was 153.0MB in the beginning and 268.0MB in the end (delta: -115.0MB). Peak memory consumption was 166.8MB. 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: 492.9s, OverallIterations: 22, TraceHistogramMax: 24, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 67.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 338 SdHoareTripleChecker+Valid, 49.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 223 mSDsluCounter, 3596 SdHoareTripleChecker+Invalid, 48.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 120 IncrementalHoareTripleChecker+Unchecked, 2579 mSDsCounter, 333 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4418 IncrementalHoareTripleChecker+Invalid, 4887 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 333 mSolverCounterUnsat, 1017 mSDtfsCounter, 4418 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2829 GetRequests, 2569 SyntacticMatches, 20 SemanticMatches, 240 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 27.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=20, InterpolantAutomatonStates: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 73 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 414 PreInvPairs, 588 NumberOfFragments, 1799 HoareAnnotationTreeSize, 414 FomulaSimplifications, 2971 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 36 FomulaSimplificationsInter, 36237 FormulaSimplificationTreeSizeReductionInter, 2.7s 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: (((((((x == 1 && y + 6 == z + x) && 0 <= a) && n == 1) && a <= 2) && y == x + 6) || (((((x == (z + -6) / 6 * ((z + -6) / 6) * ((z + -6) / 6) && z * z + 12 == y * 12 + z * 6) && n * 6 + 6 == z) && 0 <= a) && a <= 2) && z == 6)) || (((((1 <= a && n * 6 + 6 == z) && a <= 2) && y + 17 == z * 2) && y == z + 1) && x == 8)) || (((((x == (z + -6) / 6 * ((z + -6) / 6) * ((z + -6) / 6) && n * 6 + 6 == z) && 2 <= a) && x == 27) && a <= 2) && y == 37) - 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 || \old(cond) == 0 RESULT: Ultimate proved your program to be correct! [2022-04-28 11:23:54,247 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...