/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/loop-new/gauss_sum.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:45:58,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:45:58,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:45:58,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:45:58,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:45:58,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:45:58,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:45:58,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:45:58,241 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:45:58,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:45:58,243 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:45:58,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:45:58,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:45:58,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:45:58,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:45:58,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:45:58,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:45:58,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:45:58,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:45:58,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:45:58,263 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:45:58,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:45:58,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:45:58,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:45:58,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:45:58,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:45:58,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:45:58,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:45:58,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:45:58,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:45:58,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:45:58,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:45:58,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:45:58,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:45:58,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:45:58,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:45:58,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:45:58,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:45:58,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:45:58,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:45:58,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:45:58,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:45:58,282 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 09:45:58,294 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:45:58,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:45:58,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:45:58,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:45:58,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:45:58,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:45:58,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:45:58,296 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:45:58,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:45:58,297 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:45:58,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:45:58,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:45:58,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:45:58,298 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:45:58,298 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:45:58,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:45:58,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:45:58,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:45:58,298 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:45:58,298 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:45:58,299 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:45:58,299 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:45:58,299 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 09:45:58,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:45:58,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:45:58,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:45:58,563 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:45:58,564 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:45:58,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum.i [2022-04-28 09:45:58,613 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9bb0c90/3b3dde48a8024b358335855434d16013/FLAG604a119fd [2022-04-28 09:45:58,958 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:45:58,958 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i [2022-04-28 09:45:58,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9bb0c90/3b3dde48a8024b358335855434d16013/FLAG604a119fd [2022-04-28 09:45:58,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9bb0c90/3b3dde48a8024b358335855434d16013 [2022-04-28 09:45:58,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:45:58,977 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:45:58,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:45:58,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:45:58,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:45:58,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:45:58" (1/1) ... [2022-04-28 09:45:58,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61dcccc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:45:58, skipping insertion in model container [2022-04-28 09:45:58,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:45:58" (1/1) ... [2022-04-28 09:45:58,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:45:59,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:45:59,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i[891,904] [2022-04-28 09:45:59,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:45:59,159 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:45:59,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i[891,904] [2022-04-28 09:45:59,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:45:59,183 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:45:59,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:45:59 WrapperNode [2022-04-28 09:45:59,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:45:59,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:45:59,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:45:59,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:45:59,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:45:59" (1/1) ... [2022-04-28 09:45:59,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:45:59" (1/1) ... [2022-04-28 09:45:59,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:45:59" (1/1) ... [2022-04-28 09:45:59,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:45:59" (1/1) ... [2022-04-28 09:45:59,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:45:59" (1/1) ... [2022-04-28 09:45:59,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:45:59" (1/1) ... [2022-04-28 09:45:59,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:45:59" (1/1) ... [2022-04-28 09:45:59,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:45:59,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:45:59,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:45:59,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:45:59,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:45:59" (1/1) ... [2022-04-28 09:45:59,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:45:59,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:45:59,255 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 09:45:59,272 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 09:45:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:45:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:45:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:45:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:45:59,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:45:59,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:45:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:45:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:45:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:45:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:45:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:45:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:45:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:45:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:45:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:45:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:45:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:45:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:45:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:45:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:45:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:45:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:45:59,350 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:45:59,351 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:45:59,485 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:45:59,491 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:45:59,492 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:45:59,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:45:59 BoogieIcfgContainer [2022-04-28 09:45:59,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:45:59,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:45:59,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:45:59,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:45:59,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:45:58" (1/3) ... [2022-04-28 09:45:59,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73260a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:45:59, skipping insertion in model container [2022-04-28 09:45:59,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:45:59" (2/3) ... [2022-04-28 09:45:59,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73260a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:45:59, skipping insertion in model container [2022-04-28 09:45:59,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:45:59" (3/3) ... [2022-04-28 09:45:59,501 INFO L111 eAbstractionObserver]: Analyzing ICFG gauss_sum.i [2022-04-28 09:45:59,518 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:45:59,518 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:45:59,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:45:59,634 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@2ccf6af2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2481481c [2022-04-28 09:45:59,634 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:45:59,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:45:59,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 09:45:59,648 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:45:59,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:45:59,649 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:45:59,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:45:59,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1676006891, now seen corresponding path program 1 times [2022-04-28 09:45:59,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:45:59,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [400677155] [2022-04-28 09:45:59,683 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:45:59,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1676006891, now seen corresponding path program 2 times [2022-04-28 09:45:59,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:45:59,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275925598] [2022-04-28 09:45:59,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:45:59,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:45:59,807 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:45:59,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634325882] [2022-04-28 09:45:59,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:45:59,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:45:59,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:45:59,810 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 09:45:59,812 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 09:45:59,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 09:45:59,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:45:59,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 09:45:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:59,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:46:00,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2022-04-28 09:46:00,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#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(9, 2); {24#true} is VALID [2022-04-28 09:46:00,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 09:46:00,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #55#return; {24#true} is VALID [2022-04-28 09:46:00,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2022-04-28 09:46:00,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2022-04-28 09:46:00,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {47#(and (<= 1 main_~n~0) (<= main_~i~0 1))} is VALID [2022-04-28 09:46:00,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {47#(and (<= 1 main_~n~0) (<= main_~i~0 1))} assume !(~i~0 <= ~n~0); {25#false} is VALID [2022-04-28 09:46:00,094 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {25#false} is VALID [2022-04-28 09:46:00,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 09:46:00,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 09:46:00,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 09:46:00,096 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 09:46:00,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:46:00,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:46:00,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275925598] [2022-04-28 09:46:00,097 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:46:00,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634325882] [2022-04-28 09:46:00,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634325882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:46:00,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:46:00,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:46:00,103 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:46:00,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [400677155] [2022-04-28 09:46:00,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [400677155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:46:00,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:46:00,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:46:00,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770304471] [2022-04-28 09:46:00,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:46:00,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 09:46:00,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:46:00,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:00,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:00,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:46:00,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:00,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:46:00,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:46:00,157 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:00,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:00,246 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 09:46:00,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:46:00,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 09:46:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:46:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:00,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-04-28 09:46:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-04-28 09:46:00,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2022-04-28 09:46:00,310 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 09:46:00,318 INFO L225 Difference]: With dead ends: 35 [2022-04-28 09:46:00,319 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 09:46:00,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 09:46:00,327 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:46:00,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:46:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 09:46:00,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-28 09:46:00,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:46:00,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:00,365 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:00,365 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:00,370 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 09:46:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:46:00,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:00,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:00,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 09:46:00,371 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 09:46:00,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:00,373 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 09:46:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:46:00,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:00,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:00,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:46:00,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:46:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 09:46:00,381 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-28 09:46:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:46:00,381 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 09:46:00,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:00,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 09:46:00,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:46:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:46:00,400 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:46:00,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:46:00,423 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 09:46:00,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-28 09:46:00,616 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:46:00,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:46:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1072109235, now seen corresponding path program 1 times [2022-04-28 09:46:00,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:00,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1238280031] [2022-04-28 09:46:00,637 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:46:00,637 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:46:00,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1072109235, now seen corresponding path program 2 times [2022-04-28 09:46:00,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:46:00,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053930210] [2022-04-28 09:46:00,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:46:00,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:46:00,671 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:46:00,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1114892087] [2022-04-28 09:46:00,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:46:00,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:00,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:46:00,673 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 09:46:00,679 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 09:46:00,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:46:00,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:46:00,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 09:46:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:46:00,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:46:01,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {194#true} is VALID [2022-04-28 09:46:01,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#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(9, 2); {194#true} is VALID [2022-04-28 09:46:01,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-28 09:46:01,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #55#return; {194#true} is VALID [2022-04-28 09:46:01,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret3 := main(); {194#true} is VALID [2022-04-28 09:46:01,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {194#true} is VALID [2022-04-28 09:46:01,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {217#(and (<= 1 main_~n~0) (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:01,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(and (<= 1 main_~n~0) (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {221#(and (<= 1 main_~n~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:01,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#(and (<= 1 main_~n~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {225#(and (<= 1 main_~n~0) (<= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2022-04-28 09:46:01,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {225#(and (<= 1 main_~n~0) (<= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !(~i~0 <= ~n~0); {229#(and (<= 1 main_~n~0) (= main_~sum~0 1) (< main_~n~0 (+ main_~sum~0 1)))} is VALID [2022-04-28 09:46:01,048 INFO L272 TraceCheckUtils]: 10: Hoare triple {229#(and (<= 1 main_~n~0) (= main_~sum~0 1) (< main_~n~0 (+ main_~sum~0 1)))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:01,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:01,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {195#false} is VALID [2022-04-28 09:46:01,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-28 09:46:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:46:01,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:46:01,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-28 09:46:01,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {195#false} is VALID [2022-04-28 09:46:01,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:01,334 INFO L272 TraceCheckUtils]: 10: Hoare triple {253#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:01,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {257#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {253#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:46:01,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {261#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {257#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:01,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {265#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {261#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:01,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {265#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))))} is VALID [2022-04-28 09:46:01,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {194#true} is VALID [2022-04-28 09:46:01,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret3 := main(); {194#true} is VALID [2022-04-28 09:46:01,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #55#return; {194#true} is VALID [2022-04-28 09:46:01,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-28 09:46:01,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#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(9, 2); {194#true} is VALID [2022-04-28 09:46:01,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {194#true} is VALID [2022-04-28 09:46:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:46:01,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:46:01,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053930210] [2022-04-28 09:46:01,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:46:01,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114892087] [2022-04-28 09:46:01,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114892087] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:46:01,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:46:01,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-28 09:46:01,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:46:01,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1238280031] [2022-04-28 09:46:01,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1238280031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:46:01,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:46:01,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:46:01,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254468742] [2022-04-28 09:46:01,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:46:01,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:46:01,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:46:01,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:01,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:01,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:46:01,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:01,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:46:01,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:46:01,357 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:01,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:01,514 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 09:46:01,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:46:01,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:46:01,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:46:01,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:01,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 09:46:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 09:46:01,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-28 09:46:01,539 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 09:46:01,540 INFO L225 Difference]: With dead ends: 22 [2022-04-28 09:46:01,541 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 09:46:01,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:46:01,542 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:46:01,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:46:01,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 09:46:01,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 09:46:01,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:46:01,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:01,549 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:01,550 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:01,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:01,551 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 09:46:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:46:01,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:01,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:01,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 09:46:01,552 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 09:46:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:01,553 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 09:46:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:46:01,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:01,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:01,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:46:01,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:46:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 09:46:01,555 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2022-04-28 09:46:01,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:46:01,555 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 09:46:01,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:01,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 09:46:01,569 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 09:46:01,569 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:46:01,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 09:46:01,570 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:46:01,570 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:46:01,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 09:46:01,787 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,SelfDestructingSolverStorable1 [2022-04-28 09:46:01,788 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:46:01,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:46:01,788 INFO L85 PathProgramCache]: Analyzing trace with hash 606819281, now seen corresponding path program 3 times [2022-04-28 09:46:01,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:01,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1548305415] [2022-04-28 09:46:01,792 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:46:01,793 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:46:01,793 INFO L85 PathProgramCache]: Analyzing trace with hash 606819281, now seen corresponding path program 4 times [2022-04-28 09:46:01,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:46:01,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478511277] [2022-04-28 09:46:01,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:46:01,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:46:01,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:46:01,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1032847326] [2022-04-28 09:46:01,808 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:46:01,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:01,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:46:01,810 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 09:46:01,836 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 09:46:01,850 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:46:01,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:46:01,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 09:46:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:46:01,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:46:02,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {405#true} call ULTIMATE.init(); {405#true} is VALID [2022-04-28 09:46:02,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#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(9, 2); {405#true} is VALID [2022-04-28 09:46:02,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#true} assume true; {405#true} is VALID [2022-04-28 09:46:02,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {405#true} {405#true} #55#return; {405#true} is VALID [2022-04-28 09:46:02,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {405#true} call #t~ret3 := main(); {405#true} is VALID [2022-04-28 09:46:02,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {405#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {405#true} is VALID [2022-04-28 09:46:02,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {428#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:02,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {432#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:02,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {432#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {436#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:46:02,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {436#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {440#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:46:02,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {440#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {444#(and (<= 2 main_~n~0) (= main_~sum~0 3) (<= main_~i~0 3))} is VALID [2022-04-28 09:46:02,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {444#(and (<= 2 main_~n~0) (= main_~sum~0 3) (<= main_~i~0 3))} assume !(~i~0 <= ~n~0); {448#(and (< main_~n~0 3) (<= 2 main_~n~0) (= main_~sum~0 3))} is VALID [2022-04-28 09:46:02,145 INFO L272 TraceCheckUtils]: 12: Hoare triple {448#(and (< main_~n~0 3) (<= 2 main_~n~0) (= main_~sum~0 3))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {452#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:02,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {456#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:02,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {456#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {406#false} is VALID [2022-04-28 09:46:02,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {406#false} assume !false; {406#false} is VALID [2022-04-28 09:46:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:46:02,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:46:05,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {406#false} assume !false; {406#false} is VALID [2022-04-28 09:46:05,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {456#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {406#false} is VALID [2022-04-28 09:46:05,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {456#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:05,296 INFO L272 TraceCheckUtils]: 12: Hoare triple {472#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {452#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:05,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {476#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {472#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:46:05,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {480#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {476#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:05,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {484#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {480#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:05,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {484#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:05,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {484#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {488#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:05,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {484#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:05,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {405#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {405#true} is VALID [2022-04-28 09:46:05,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {405#true} call #t~ret3 := main(); {405#true} is VALID [2022-04-28 09:46:05,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {405#true} {405#true} #55#return; {405#true} is VALID [2022-04-28 09:46:05,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#true} assume true; {405#true} is VALID [2022-04-28 09:46:05,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#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(9, 2); {405#true} is VALID [2022-04-28 09:46:05,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {405#true} call ULTIMATE.init(); {405#true} is VALID [2022-04-28 09:46:05,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:46:05,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:46:05,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478511277] [2022-04-28 09:46:05,308 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:46:05,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032847326] [2022-04-28 09:46:05,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032847326] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:46:05,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:46:05,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2022-04-28 09:46:05,309 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:46:05,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1548305415] [2022-04-28 09:46:05,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1548305415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:46:05,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:46:05,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:46:05,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512037613] [2022-04-28 09:46:05,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:46:05,310 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 09:46:05,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:46:05,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:05,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:05,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:46:05,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:05,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:46:05,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-28 09:46:05,328 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:05,558 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 09:46:05,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:46:05,558 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 09:46:05,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:46:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-28 09:46:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-28 09:46:05,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-28 09:46:05,587 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 09:46:05,588 INFO L225 Difference]: With dead ends: 24 [2022-04-28 09:46:05,588 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 09:46:05,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:46:05,589 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:46:05,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:46:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 09:46:05,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 09:46:05,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:46:05,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:05,598 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:05,598 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:05,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:05,599 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 09:46:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 09:46:05,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:05,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:05,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 09:46:05,600 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 09:46:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:05,602 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 09:46:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 09:46:05,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:05,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:05,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:46:05,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:46:05,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-28 09:46:05,604 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2022-04-28 09:46:05,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:46:05,604 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-28 09:46:05,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:05,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-28 09:46:05,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 09:46:05,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 09:46:05,621 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:46:05,621 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:46:05,647 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 09:46:05,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:05,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:46:05,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:46:05,845 INFO L85 PathProgramCache]: Analyzing trace with hash 139772271, now seen corresponding path program 5 times [2022-04-28 09:46:05,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:05,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [7443880] [2022-04-28 09:46:05,848 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:46:05,848 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:46:05,848 INFO L85 PathProgramCache]: Analyzing trace with hash 139772271, now seen corresponding path program 6 times [2022-04-28 09:46:05,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:46:05,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529511452] [2022-04-28 09:46:05,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:46:05,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:46:05,864 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:46:05,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612904640] [2022-04-28 09:46:05,865 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:46:05,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:05,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:46:05,866 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 09:46:05,906 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 09:46:05,921 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 09:46:05,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:46:05,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 09:46:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:46:05,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:46:06,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {643#true} call ULTIMATE.init(); {643#true} is VALID [2022-04-28 09:46:06,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {643#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(9, 2); {643#true} is VALID [2022-04-28 09:46:06,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {643#true} assume true; {643#true} is VALID [2022-04-28 09:46:06,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {643#true} {643#true} #55#return; {643#true} is VALID [2022-04-28 09:46:06,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {643#true} call #t~ret3 := main(); {643#true} is VALID [2022-04-28 09:46:06,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {643#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {643#true} is VALID [2022-04-28 09:46:06,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {643#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {666#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:06,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {666#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {670#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:06,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {674#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} is VALID [2022-04-28 09:46:06,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {674#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {678#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} is VALID [2022-04-28 09:46:06,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {678#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {682#(and (= main_~i~0 3) (= (+ main_~sum~0 (- 3)) 0))} is VALID [2022-04-28 09:46:06,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {682#(and (= main_~i~0 3) (= (+ main_~sum~0 (- 3)) 0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {686#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 0) (= main_~i~0 3) (<= main_~i~0 main_~n~0))} is VALID [2022-04-28 09:46:06,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {686#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 0) (= main_~i~0 3) (<= main_~i~0 main_~n~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {690#(and (<= 3 main_~n~0) (= (+ main_~sum~0 (- 6)) 0) (<= main_~i~0 4))} is VALID [2022-04-28 09:46:06,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {690#(and (<= 3 main_~n~0) (= (+ main_~sum~0 (- 6)) 0) (<= main_~i~0 4))} assume !(~i~0 <= ~n~0); {694#(and (<= 3 main_~n~0) (< main_~n~0 4) (= (+ main_~sum~0 (- 6)) 0))} is VALID [2022-04-28 09:46:06,244 INFO L272 TraceCheckUtils]: 14: Hoare triple {694#(and (<= 3 main_~n~0) (< main_~n~0 4) (= (+ main_~sum~0 (- 6)) 0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {698#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:06,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {702#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:06,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {644#false} is VALID [2022-04-28 09:46:06,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {644#false} assume !false; {644#false} is VALID [2022-04-28 09:46:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:46:06,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:46:07,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {644#false} assume !false; {644#false} is VALID [2022-04-28 09:46:07,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {644#false} is VALID [2022-04-28 09:46:07,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {702#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:07,148 INFO L272 TraceCheckUtils]: 14: Hoare triple {718#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {698#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:07,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {722#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {718#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:46:07,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {726#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {722#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:07,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {730#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {726#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:07,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {734#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {730#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:07,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {730#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {734#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:07,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {734#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {730#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:07,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {734#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:07,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {643#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {730#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:07,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {643#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {643#true} is VALID [2022-04-28 09:46:07,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {643#true} call #t~ret3 := main(); {643#true} is VALID [2022-04-28 09:46:07,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {643#true} {643#true} #55#return; {643#true} is VALID [2022-04-28 09:46:07,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {643#true} assume true; {643#true} is VALID [2022-04-28 09:46:07,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {643#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(9, 2); {643#true} is VALID [2022-04-28 09:46:07,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {643#true} call ULTIMATE.init(); {643#true} is VALID [2022-04-28 09:46:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 09:46:07,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:46:07,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529511452] [2022-04-28 09:46:07,170 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:46:07,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612904640] [2022-04-28 09:46:07,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612904640] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:46:07,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:46:07,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2022-04-28 09:46:07,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:46:07,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [7443880] [2022-04-28 09:46:07,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [7443880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:46:07,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:46:07,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 09:46:07,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595735182] [2022-04-28 09:46:07,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:46:07,171 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 09:46:07,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:46:07,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:07,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:07,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 09:46:07,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:07,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 09:46:07,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:46:07,193 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:07,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:07,470 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 09:46:07,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 09:46:07,470 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 09:46:07,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:46:07,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-28 09:46:07,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:07,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-28 09:46:07,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2022-04-28 09:46:07,495 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 09:46:07,496 INFO L225 Difference]: With dead ends: 26 [2022-04-28 09:46:07,496 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 09:46:07,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:46:07,497 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:46:07,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 76 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:46:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 09:46:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 09:46:07,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:46:07,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:07,508 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:07,509 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:07,510 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 09:46:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 09:46:07,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:07,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:07,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 09:46:07,511 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 09:46:07,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:07,512 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 09:46:07,512 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 09:46:07,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:07,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:07,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:46:07,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:46:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-28 09:46:07,514 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2022-04-28 09:46:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:46:07,515 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-28 09:46:07,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:07,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-28 09:46:07,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:07,532 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 09:46:07,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 09:46:07,533 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:46:07,533 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:46:07,555 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 09:46:07,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:07,747 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:46:07,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:46:07,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2015805555, now seen corresponding path program 7 times [2022-04-28 09:46:07,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:07,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1369094028] [2022-04-28 09:46:07,752 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:46:07,752 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:46:07,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2015805555, now seen corresponding path program 8 times [2022-04-28 09:46:07,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:46:07,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379212317] [2022-04-28 09:46:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:46:07,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:46:07,770 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:46:07,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1234678770] [2022-04-28 09:46:07,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:46:07,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:07,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:46:07,772 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 09:46:07,799 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 09:46:07,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:46:07,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:46:07,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 09:46:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:46:07,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:46:08,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {907#true} call ULTIMATE.init(); {907#true} is VALID [2022-04-28 09:46:08,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {907#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(9, 2); {907#true} is VALID [2022-04-28 09:46:08,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {907#true} assume true; {907#true} is VALID [2022-04-28 09:46:08,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {907#true} {907#true} #55#return; {907#true} is VALID [2022-04-28 09:46:08,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {907#true} call #t~ret3 := main(); {907#true} is VALID [2022-04-28 09:46:08,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {907#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {907#true} is VALID [2022-04-28 09:46:08,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {930#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:08,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {930#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {934#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:08,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {934#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {938#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-28 09:46:08,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {938#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {942#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:46:08,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {942#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {946#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 2))))} is VALID [2022-04-28 09:46:08,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {946#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {950#(and (= (+ (- 2) main_~i~0) 1) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 3) (* main_~i~0 2))))} is VALID [2022-04-28 09:46:08,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {950#(and (= (+ (- 2) main_~i~0) 1) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 3) (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {954#(and (= (+ (- 5) (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 1))} is VALID [2022-04-28 09:46:08,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {954#(and (= (+ (- 5) (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {958#(and (<= main_~i~0 main_~n~0) (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} is VALID [2022-04-28 09:46:08,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {958#(and (<= main_~i~0 main_~n~0) (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {962#(and (<= main_~i~0 5) (<= 4 main_~n~0) (= main_~sum~0 10))} is VALID [2022-04-28 09:46:08,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {962#(and (<= main_~i~0 5) (<= 4 main_~n~0) (= main_~sum~0 10))} assume !(~i~0 <= ~n~0); {966#(and (<= 4 main_~n~0) (= main_~sum~0 10) (< main_~n~0 5))} is VALID [2022-04-28 09:46:08,162 INFO L272 TraceCheckUtils]: 16: Hoare triple {966#(and (<= 4 main_~n~0) (= main_~sum~0 10) (< main_~n~0 5))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {970#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:08,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:08,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {908#false} is VALID [2022-04-28 09:46:08,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {908#false} assume !false; {908#false} is VALID [2022-04-28 09:46:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:46:08,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:46:09,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {908#false} assume !false; {908#false} is VALID [2022-04-28 09:46:09,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {908#false} is VALID [2022-04-28 09:46:09,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:09,307 INFO L272 TraceCheckUtils]: 16: Hoare triple {990#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {970#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:09,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {994#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {990#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:46:09,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {998#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {994#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:09,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {1002#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {998#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:09,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {1006#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1002#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:09,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {1002#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1006#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:09,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {1006#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1002#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:09,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {1002#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1006#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:09,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {1006#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1002#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:09,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {1002#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1006#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:09,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1002#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:09,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {907#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {907#true} is VALID [2022-04-28 09:46:09,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {907#true} call #t~ret3 := main(); {907#true} is VALID [2022-04-28 09:46:09,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {907#true} {907#true} #55#return; {907#true} is VALID [2022-04-28 09:46:09,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {907#true} assume true; {907#true} is VALID [2022-04-28 09:46:09,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {907#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(9, 2); {907#true} is VALID [2022-04-28 09:46:09,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {907#true} call ULTIMATE.init(); {907#true} is VALID [2022-04-28 09:46:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:46:09,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:46:09,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379212317] [2022-04-28 09:46:09,328 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:46:09,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234678770] [2022-04-28 09:46:09,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234678770] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:46:09,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:46:09,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2022-04-28 09:46:09,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:46:09,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1369094028] [2022-04-28 09:46:09,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1369094028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:46:09,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:46:09,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 09:46:09,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213413600] [2022-04-28 09:46:09,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:46:09,329 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 09:46:09,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:46:09,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:09,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:09,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 09:46:09,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:09,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 09:46:09,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:46:09,347 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:09,646 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 09:46:09,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 09:46:09,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 09:46:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:46:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:09,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-28 09:46:09,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:09,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-28 09:46:09,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-04-28 09:46:09,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:09,679 INFO L225 Difference]: With dead ends: 28 [2022-04-28 09:46:09,679 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 09:46:09,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-04-28 09:46:09,680 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:46:09,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 90 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:46:09,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 09:46:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 09:46:09,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:46:09,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:09,694 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:09,695 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:09,696 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 09:46:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 09:46:09,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:09,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:09,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 09:46:09,697 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 09:46:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:09,698 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 09:46:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 09:46:09,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:09,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:09,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:46:09,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:46:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-28 09:46:09,700 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2022-04-28 09:46:09,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:46:09,700 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-28 09:46:09,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:09,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-28 09:46:09,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 09:46:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 09:46:09,719 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:46:09,719 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:46:09,745 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 09:46:09,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:09,943 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:46:09,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:46:09,943 INFO L85 PathProgramCache]: Analyzing trace with hash 943107627, now seen corresponding path program 9 times [2022-04-28 09:46:09,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:09,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1982070709] [2022-04-28 09:46:09,947 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:46:09,947 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:46:09,947 INFO L85 PathProgramCache]: Analyzing trace with hash 943107627, now seen corresponding path program 10 times [2022-04-28 09:46:09,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:46:09,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653925734] [2022-04-28 09:46:09,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:46:09,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:46:09,973 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:46:09,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1492573004] [2022-04-28 09:46:09,974 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:46:09,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:09,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:46:09,981 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 09:46:09,982 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 09:46:10,017 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:46:10,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:46:10,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 09:46:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:46:10,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:46:10,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {1197#true} call ULTIMATE.init(); {1197#true} is VALID [2022-04-28 09:46:10,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {1197#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(9, 2); {1197#true} is VALID [2022-04-28 09:46:10,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {1197#true} assume true; {1197#true} is VALID [2022-04-28 09:46:10,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1197#true} {1197#true} #55#return; {1197#true} is VALID [2022-04-28 09:46:10,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {1197#true} call #t~ret3 := main(); {1197#true} is VALID [2022-04-28 09:46:10,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {1197#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1197#true} is VALID [2022-04-28 09:46:10,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {1197#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1220#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:10,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {1220#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1224#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:10,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {1224#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1228#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} is VALID [2022-04-28 09:46:10,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {1228#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1232#(and (= main_~sum~0 (+ main_~i~0 1)) (= main_~i~0 2))} is VALID [2022-04-28 09:46:10,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {1232#(and (= main_~sum~0 (+ main_~i~0 1)) (= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1236#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:46:10,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {1236#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~i~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1240#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:46:10,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {1240#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1244#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-28 09:46:10,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {1244#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1248#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} is VALID [2022-04-28 09:46:10,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {1248#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1252#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} is VALID [2022-04-28 09:46:10,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {1252#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1256#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) main_~i~0) (<= main_~i~0 main_~n~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 4))} is VALID [2022-04-28 09:46:10,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {1256#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) main_~i~0) (<= main_~i~0 main_~n~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1260#(and (<= main_~sum~0 (+ main_~n~0 10)) (= 5 (+ main_~sum~0 (- 10))) (<= (+ main_~i~0 9) main_~sum~0))} is VALID [2022-04-28 09:46:10,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {1260#(and (<= main_~sum~0 (+ main_~n~0 10)) (= 5 (+ main_~sum~0 (- 10))) (<= (+ main_~i~0 9) main_~sum~0))} assume !(~i~0 <= ~n~0); {1264#(and (<= main_~sum~0 (+ main_~n~0 10)) (< (+ main_~n~0 9) main_~sum~0) (= 5 (+ main_~sum~0 (- 10))))} is VALID [2022-04-28 09:46:10,404 INFO L272 TraceCheckUtils]: 18: Hoare triple {1264#(and (<= main_~sum~0 (+ main_~n~0 10)) (< (+ main_~n~0 9) main_~sum~0) (= 5 (+ main_~sum~0 (- 10))))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:10,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1272#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:10,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {1272#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1198#false} is VALID [2022-04-28 09:46:10,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {1198#false} assume !false; {1198#false} is VALID [2022-04-28 09:46:10,405 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:46:10,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:46:11,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {1198#false} assume !false; {1198#false} is VALID [2022-04-28 09:46:11,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {1272#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1198#false} is VALID [2022-04-28 09:46:11,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1272#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:11,783 INFO L272 TraceCheckUtils]: 18: Hoare triple {1288#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:11,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {1292#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {1288#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:46:11,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {1296#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1292#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:11,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1296#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:11,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {1304#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:11,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1304#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:11,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {1304#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:11,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1304#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:11,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {1304#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:11,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1304#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:11,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {1304#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:11,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1304#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:11,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {1197#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:11,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {1197#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1197#true} is VALID [2022-04-28 09:46:11,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {1197#true} call #t~ret3 := main(); {1197#true} is VALID [2022-04-28 09:46:11,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1197#true} {1197#true} #55#return; {1197#true} is VALID [2022-04-28 09:46:11,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {1197#true} assume true; {1197#true} is VALID [2022-04-28 09:46:11,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {1197#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(9, 2); {1197#true} is VALID [2022-04-28 09:46:11,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {1197#true} call ULTIMATE.init(); {1197#true} is VALID [2022-04-28 09:46:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 09:46:11,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:46:11,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653925734] [2022-04-28 09:46:11,816 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:46:11,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492573004] [2022-04-28 09:46:11,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492573004] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:46:11,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:46:11,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 21 [2022-04-28 09:46:11,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:46:11,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1982070709] [2022-04-28 09:46:11,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1982070709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:46:11,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:46:11,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 09:46:11,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428697113] [2022-04-28 09:46:11,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:46:11,817 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 09:46:11,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:46:11,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:11,835 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 09:46:11,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 09:46:11,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:11,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 09:46:11,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-04-28 09:46:11,837 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:12,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:12,240 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 09:46:12,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 09:46:12,240 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 09:46:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:46:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-28 09:46:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-28 09:46:12,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2022-04-28 09:46:12,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:12,273 INFO L225 Difference]: With dead ends: 30 [2022-04-28 09:46:12,274 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 09:46:12,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:46:12,275 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:46:12,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 104 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:46:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 09:46:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 09:46:12,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:46:12,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:12,289 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:12,289 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:12,290 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 09:46:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 09:46:12,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:12,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:12,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 09:46:12,291 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 09:46:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:12,292 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 09:46:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 09:46:12,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:12,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:12,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:46:12,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:46:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-28 09:46:12,293 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2022-04-28 09:46:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:46:12,294 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-28 09:46:12,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:12,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-28 09:46:12,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:12,315 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 09:46:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 09:46:12,315 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:46:12,315 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:46:12,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 09:46:12,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:12,520 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:46:12,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:46:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1190325577, now seen corresponding path program 11 times [2022-04-28 09:46:12,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:12,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1562038654] [2022-04-28 09:46:12,523 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:46:12,523 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:46:12,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1190325577, now seen corresponding path program 12 times [2022-04-28 09:46:12,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:46:12,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617075397] [2022-04-28 09:46:12,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:46:12,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:46:12,551 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:46:12,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [116255183] [2022-04-28 09:46:12,551 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:46:12,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:12,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:46:12,553 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 09:46:12,554 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 09:46:12,594 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 09:46:12,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:46:12,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 09:46:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:46:12,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:46:13,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {1513#true} call ULTIMATE.init(); {1513#true} is VALID [2022-04-28 09:46:13,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {1513#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(9, 2); {1513#true} is VALID [2022-04-28 09:46:13,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {1513#true} assume true; {1513#true} is VALID [2022-04-28 09:46:13,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1513#true} {1513#true} #55#return; {1513#true} is VALID [2022-04-28 09:46:13,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {1513#true} call #t~ret3 := main(); {1513#true} is VALID [2022-04-28 09:46:13,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {1513#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1513#true} is VALID [2022-04-28 09:46:13,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {1513#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1536#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:13,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {1536#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1540#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:13,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {1540#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1544#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} is VALID [2022-04-28 09:46:13,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {1544#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1548#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} is VALID [2022-04-28 09:46:13,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {1548#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1552#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:46:13,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {1552#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= (+ (- 1) main_~i~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1556#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:46:13,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {1556#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1560#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-28 09:46:13,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {1560#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1564#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} is VALID [2022-04-28 09:46:13,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {1564#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1568#(and (= 5 main_~i~0) (= (+ main_~sum~0 (- 4)) 6))} is VALID [2022-04-28 09:46:13,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {1568#(and (= 5 main_~i~0) (= (+ main_~sum~0 (- 4)) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1572#(and (= 6 (+ (* (- 1) main_~i~0) main_~sum~0 (- 4))) (= 5 main_~i~0))} is VALID [2022-04-28 09:46:13,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {1572#(and (= 6 (+ (* (- 1) main_~i~0) main_~sum~0 (- 4))) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1576#(and (= 6 (+ (- 9) main_~sum~0)) (= main_~i~0 6))} is VALID [2022-04-28 09:46:13,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {1576#(and (= 6 (+ (- 9) main_~sum~0)) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1580#(and (<= main_~i~0 main_~n~0) (= 6 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 6))} is VALID [2022-04-28 09:46:13,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {1580#(and (<= main_~i~0 main_~n~0) (= 6 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1584#(and (<= (+ main_~i~0 14) main_~sum~0) (= 6 (+ (- 15) main_~sum~0)) (<= main_~sum~0 (+ main_~n~0 15)))} is VALID [2022-04-28 09:46:13,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {1584#(and (<= (+ main_~i~0 14) main_~sum~0) (= 6 (+ (- 15) main_~sum~0)) (<= main_~sum~0 (+ main_~n~0 15)))} assume !(~i~0 <= ~n~0); {1588#(and (< (+ main_~n~0 14) main_~sum~0) (= 6 (+ (- 15) main_~sum~0)) (<= main_~sum~0 (+ main_~n~0 15)))} is VALID [2022-04-28 09:46:13,009 INFO L272 TraceCheckUtils]: 20: Hoare triple {1588#(and (< (+ main_~n~0 14) main_~sum~0) (= 6 (+ (- 15) main_~sum~0)) (<= main_~sum~0 (+ main_~n~0 15)))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {1592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:13,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {1592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:13,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {1596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1514#false} is VALID [2022-04-28 09:46:13,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {1514#false} assume !false; {1514#false} is VALID [2022-04-28 09:46:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:46:13,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:46:14,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {1514#false} assume !false; {1514#false} is VALID [2022-04-28 09:46:14,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {1596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1514#false} is VALID [2022-04-28 09:46:14,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {1592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:14,547 INFO L272 TraceCheckUtils]: 20: Hoare triple {1612#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {1592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:14,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {1616#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {1612#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:46:14,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {1620#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1616#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:14,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1620#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:14,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:14,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:14,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:14,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:14,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:14,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:14,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:14,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:14,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:14,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:14,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {1513#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:14,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {1513#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1513#true} is VALID [2022-04-28 09:46:14,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {1513#true} call #t~ret3 := main(); {1513#true} is VALID [2022-04-28 09:46:14,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1513#true} {1513#true} #55#return; {1513#true} is VALID [2022-04-28 09:46:14,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {1513#true} assume true; {1513#true} is VALID [2022-04-28 09:46:14,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {1513#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(9, 2); {1513#true} is VALID [2022-04-28 09:46:14,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {1513#true} call ULTIMATE.init(); {1513#true} is VALID [2022-04-28 09:46:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 09:46:14,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:46:14,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617075397] [2022-04-28 09:46:14,579 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:46:14,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116255183] [2022-04-28 09:46:14,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116255183] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:46:14,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:46:14,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 23 [2022-04-28 09:46:14,579 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:46:14,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1562038654] [2022-04-28 09:46:14,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1562038654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:46:14,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:46:14,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 09:46:14,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327797655] [2022-04-28 09:46:14,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:46:14,580 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 09:46:14,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:46:14,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:14,608 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 09:46:14,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 09:46:14,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:14,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 09:46:14,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:46:14,609 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:15,051 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 09:46:15,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 09:46:15,052 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 09:46:15,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:46:15,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-28 09:46:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:15,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-28 09:46:15,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2022-04-28 09:46:15,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:15,079 INFO L225 Difference]: With dead ends: 32 [2022-04-28 09:46:15,079 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 09:46:15,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2022-04-28 09:46:15,080 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:46:15,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 118 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:46:15,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 09:46:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 09:46:15,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:46:15,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:15,094 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:15,094 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:15,095 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 09:46:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 09:46:15,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:15,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:15,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 09:46:15,096 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 09:46:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:15,097 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 09:46:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 09:46:15,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:15,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:15,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:46:15,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:46:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-28 09:46:15,098 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2022-04-28 09:46:15,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:46:15,098 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-28 09:46:15,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:15,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-28 09:46:15,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 09:46:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 09:46:15,131 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:46:15,131 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:46:15,154 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 09:46:15,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:15,332 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:46:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:46:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1751393049, now seen corresponding path program 13 times [2022-04-28 09:46:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:15,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1295181707] [2022-04-28 09:46:15,335 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:46:15,335 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:46:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1751393049, now seen corresponding path program 14 times [2022-04-28 09:46:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:46:15,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066236324] [2022-04-28 09:46:15,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:46:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:46:15,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:46:15,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1167509176] [2022-04-28 09:46:15,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:46:15,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:15,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:46:15,353 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 09:46:15,354 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 09:46:15,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:46:15,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:46:15,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 09:46:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:46:15,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:46:15,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {1855#true} call ULTIMATE.init(); {1855#true} is VALID [2022-04-28 09:46:15,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {1855#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(9, 2); {1855#true} is VALID [2022-04-28 09:46:15,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {1855#true} assume true; {1855#true} is VALID [2022-04-28 09:46:15,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1855#true} {1855#true} #55#return; {1855#true} is VALID [2022-04-28 09:46:15,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {1855#true} call #t~ret3 := main(); {1855#true} is VALID [2022-04-28 09:46:15,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {1855#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1855#true} is VALID [2022-04-28 09:46:15,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {1855#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1878#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:15,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {1878#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1882#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:15,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {1882#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1886#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} is VALID [2022-04-28 09:46:15,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {1886#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1890#(and (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} is VALID [2022-04-28 09:46:15,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {1890#(and (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1894#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~sum~0) 2))} is VALID [2022-04-28 09:46:15,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {1894#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~sum~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1898#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:46:15,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {1898#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1902#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-28 09:46:15,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {1902#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1906#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2022-04-28 09:46:15,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {1906#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1910#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-28 09:46:15,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {1910#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1914#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} is VALID [2022-04-28 09:46:15,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {1914#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1918#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} is VALID [2022-04-28 09:46:15,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {1918#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1922#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} is VALID [2022-04-28 09:46:15,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {1922#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1926#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} is VALID [2022-04-28 09:46:15,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {1926#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1930#(and (<= main_~i~0 main_~n~0) (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} is VALID [2022-04-28 09:46:15,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {1930#(and (<= main_~i~0 main_~n~0) (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1934#(and (<= 7 main_~n~0) (<= main_~i~0 8) (= main_~sum~0 28))} is VALID [2022-04-28 09:46:15,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {1934#(and (<= 7 main_~n~0) (<= main_~i~0 8) (= main_~sum~0 28))} assume !(~i~0 <= ~n~0); {1938#(and (< main_~n~0 8) (<= 7 main_~n~0) (= main_~sum~0 28))} is VALID [2022-04-28 09:46:15,851 INFO L272 TraceCheckUtils]: 22: Hoare triple {1938#(and (< main_~n~0 8) (<= 7 main_~n~0) (= main_~sum~0 28))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:15,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1946#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:15,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {1946#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1856#false} is VALID [2022-04-28 09:46:15,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {1856#false} assume !false; {1856#false} is VALID [2022-04-28 09:46:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:46:15,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:46:17,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {1856#false} assume !false; {1856#false} is VALID [2022-04-28 09:46:17,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {1946#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1856#false} is VALID [2022-04-28 09:46:17,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1946#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:17,712 INFO L272 TraceCheckUtils]: 22: Hoare triple {1962#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:17,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {1966#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {1962#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:46:17,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {1970#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1966#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:17,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1970#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:17,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:17,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:17,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:17,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:17,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:17,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:17,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:17,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:17,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:17,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:17,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:17,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:17,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {1855#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:17,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {1855#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1855#true} is VALID [2022-04-28 09:46:17,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {1855#true} call #t~ret3 := main(); {1855#true} is VALID [2022-04-28 09:46:17,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1855#true} {1855#true} #55#return; {1855#true} is VALID [2022-04-28 09:46:17,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {1855#true} assume true; {1855#true} is VALID [2022-04-28 09:46:17,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {1855#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(9, 2); {1855#true} is VALID [2022-04-28 09:46:17,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {1855#true} call ULTIMATE.init(); {1855#true} is VALID [2022-04-28 09:46:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:46:17,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:46:17,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066236324] [2022-04-28 09:46:17,763 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:46:17,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167509176] [2022-04-28 09:46:17,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167509176] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:46:17,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:46:17,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 25 [2022-04-28 09:46:17,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:46:17,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1295181707] [2022-04-28 09:46:17,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1295181707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:46:17,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:46:17,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 09:46:17,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335913440] [2022-04-28 09:46:17,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:46:17,765 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 09:46:17,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:46:17,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:17,786 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 09:46:17,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 09:46:17,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:17,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 09:46:17,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2022-04-28 09:46:17,787 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:18,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:18,353 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 09:46:18,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 09:46:18,353 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 09:46:18,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:46:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-28 09:46:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-28 09:46:18,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2022-04-28 09:46:18,386 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 09:46:18,386 INFO L225 Difference]: With dead ends: 34 [2022-04-28 09:46:18,386 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 09:46:18,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-04-28 09:46:18,387 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:46:18,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:46:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 09:46:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 09:46:18,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:46:18,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:18,404 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:18,404 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:18,405 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 09:46:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 09:46:18,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:18,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:18,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 09:46:18,406 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 09:46:18,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:18,407 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 09:46:18,407 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 09:46:18,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:18,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:18,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:46:18,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:46:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-28 09:46:18,409 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2022-04-28 09:46:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:46:18,409 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-28 09:46:18,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:18,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-28 09:46:18,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 09:46:18,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 09:46:18,440 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:46:18,440 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:46:18,465 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 09:46:18,640 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,SelfDestructingSolverStorable7 [2022-04-28 09:46:18,641 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:46:18,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:46:18,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1640455429, now seen corresponding path program 15 times [2022-04-28 09:46:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:18,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [643621053] [2022-04-28 09:46:18,644 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:46:18,644 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:46:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1640455429, now seen corresponding path program 16 times [2022-04-28 09:46:18,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:46:18,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814028910] [2022-04-28 09:46:18,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:46:18,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:46:18,661 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:46:18,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766730740] [2022-04-28 09:46:18,662 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:46:18,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:18,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:46:18,663 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 09:46:18,680 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 09:46:18,709 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:46:18,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:46:18,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 09:46:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:46:18,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:46:19,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2223#true} is VALID [2022-04-28 09:46:19,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {2223#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(9, 2); {2223#true} is VALID [2022-04-28 09:46:19,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2022-04-28 09:46:19,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #55#return; {2223#true} is VALID [2022-04-28 09:46:19,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret3 := main(); {2223#true} is VALID [2022-04-28 09:46:19,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {2223#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2223#true} is VALID [2022-04-28 09:46:19,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {2223#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {2246#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:19,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {2246#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2250#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:19,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {2250#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2254#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} is VALID [2022-04-28 09:46:19,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {2254#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2258#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} is VALID [2022-04-28 09:46:19,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {2258#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2262#(and (= main_~i~0 3) (= (+ main_~sum~0 (- 3)) 0))} is VALID [2022-04-28 09:46:19,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {2262#(and (= main_~i~0 3) (= (+ main_~sum~0 (- 3)) 0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2266#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 0) (= main_~i~0 3))} is VALID [2022-04-28 09:46:19,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {2266#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 0) (= main_~i~0 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2270#(and (= (+ main_~sum~0 (- 6)) 0) (= main_~i~0 4))} is VALID [2022-04-28 09:46:19,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {2270#(and (= (+ main_~sum~0 (- 6)) 0) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2274#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 0) (= main_~i~0 4))} is VALID [2022-04-28 09:46:19,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {2274#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 0) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2278#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} is VALID [2022-04-28 09:46:19,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {2278#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2282#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 4))} is VALID [2022-04-28 09:46:19,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {2282#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2286#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} is VALID [2022-04-28 09:46:19,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {2286#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2290#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} is VALID [2022-04-28 09:46:19,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {2290#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2294#(and (= 7 main_~i~0) (= main_~sum~0 21))} is VALID [2022-04-28 09:46:19,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {2294#(and (= 7 main_~i~0) (= main_~sum~0 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2298#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} is VALID [2022-04-28 09:46:19,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {2298#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2302#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ main_~i~0 20)))} is VALID [2022-04-28 09:46:19,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {2302#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ main_~i~0 20)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2306#(and (<= main_~i~0 main_~n~0) (= 7 (+ (- 1) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 20)))} is VALID [2022-04-28 09:46:19,213 INFO L290 TraceCheckUtils]: 22: Hoare triple {2306#(and (<= main_~i~0 main_~n~0) (= 7 (+ (- 1) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 20)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2310#(and (= (+ main_~sum~0 (- 8)) 28) (<= main_~i~0 9) (<= 8 main_~n~0))} is VALID [2022-04-28 09:46:19,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {2310#(and (= (+ main_~sum~0 (- 8)) 28) (<= main_~i~0 9) (<= 8 main_~n~0))} assume !(~i~0 <= ~n~0); {2314#(and (= (+ main_~sum~0 (- 8)) 28) (< main_~n~0 9) (<= 8 main_~n~0))} is VALID [2022-04-28 09:46:19,214 INFO L272 TraceCheckUtils]: 24: Hoare triple {2314#(and (= (+ main_~sum~0 (- 8)) 28) (< main_~n~0 9) (<= 8 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {2318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:19,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {2318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:19,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {2322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2224#false} is VALID [2022-04-28 09:46:19,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2022-04-28 09:46:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:46:19,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:46:21,257 INFO L290 TraceCheckUtils]: 27: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2022-04-28 09:46:21,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {2322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2224#false} is VALID [2022-04-28 09:46:21,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {2318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:21,259 INFO L272 TraceCheckUtils]: 24: Hoare triple {2338#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {2318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:21,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {2342#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {2338#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:46:21,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {2346#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2342#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:21,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2346#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:21,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:21,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:21,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:21,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:21,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:21,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:21,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:21,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:21,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:21,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:21,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:21,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:21,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:21,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:21,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {2223#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:21,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {2223#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2223#true} is VALID [2022-04-28 09:46:21,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret3 := main(); {2223#true} is VALID [2022-04-28 09:46:21,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #55#return; {2223#true} is VALID [2022-04-28 09:46:21,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2022-04-28 09:46:21,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {2223#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(9, 2); {2223#true} is VALID [2022-04-28 09:46:21,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2223#true} is VALID [2022-04-28 09:46:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-28 09:46:21,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:46:21,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814028910] [2022-04-28 09:46:21,307 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:46:21,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766730740] [2022-04-28 09:46:21,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766730740] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:46:21,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:46:21,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 27 [2022-04-28 09:46:21,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:46:21,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [643621053] [2022-04-28 09:46:21,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [643621053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:46:21,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:46:21,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 09:46:21,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176464967] [2022-04-28 09:46:21,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:46:21,309 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 09:46:21,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:46:21,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:21,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:21,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 09:46:21,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:21,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 09:46:21,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2022-04-28 09:46:21,333 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:22,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:22,043 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 09:46:22,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 09:46:22,043 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 09:46:22,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:46:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-28 09:46:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-28 09:46:22,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2022-04-28 09:46:22,078 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 09:46:22,079 INFO L225 Difference]: With dead ends: 36 [2022-04-28 09:46:22,079 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 09:46:22,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2022-04-28 09:46:22,080 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:46:22,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 153 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:46:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 09:46:22,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 09:46:22,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:46:22,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:22,098 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:22,098 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:22,099 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 09:46:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 09:46:22,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:22,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:22,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 09:46:22,100 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 09:46:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:22,101 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 09:46:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 09:46:22,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:22,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:22,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:46:22,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:46:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 09:46:22,102 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2022-04-28 09:46:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:46:22,102 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 09:46:22,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:22,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 09:46:22,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 09:46:22,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 09:46:22,134 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:46:22,135 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:46:22,163 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 09:46:22,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:22,335 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:46:22,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:46:22,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1326665123, now seen corresponding path program 17 times [2022-04-28 09:46:22,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:22,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1181906809] [2022-04-28 09:46:22,338 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:46:22,338 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:46:22,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1326665123, now seen corresponding path program 18 times [2022-04-28 09:46:22,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:46:22,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480827378] [2022-04-28 09:46:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:46:22,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:46:22,357 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:46:22,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1031499199] [2022-04-28 09:46:22,357 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:46:22,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:22,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:46:22,365 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 09:46:22,369 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 09:46:22,409 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 09:46:22,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:46:22,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 09:46:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:46:22,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:46:22,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {2617#true} call ULTIMATE.init(); {2617#true} is VALID [2022-04-28 09:46:22,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {2617#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(9, 2); {2617#true} is VALID [2022-04-28 09:46:22,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {2617#true} assume true; {2617#true} is VALID [2022-04-28 09:46:22,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2617#true} {2617#true} #55#return; {2617#true} is VALID [2022-04-28 09:46:22,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {2617#true} call #t~ret3 := main(); {2617#true} is VALID [2022-04-28 09:46:22,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {2617#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2617#true} is VALID [2022-04-28 09:46:22,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {2617#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {2640#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:22,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {2640#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2644#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:22,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {2644#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2648#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-28 09:46:22,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {2648#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2652#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:46:22,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {2652#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2656#(and (= (+ (- 2) main_~i~0) 1) (= (+ (- 2) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-28 09:46:22,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {2656#(and (= (+ (- 2) main_~i~0) 1) (= (+ (- 2) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2660#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:46:22,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {2660#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2664#(and (= (+ main_~i~0 (- 3)) 1) (= (+ main_~i~0 (- 3)) (+ main_~sum~0 3 (* (- 2) main_~i~0))))} is VALID [2022-04-28 09:46:22,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {2664#(and (= (+ main_~i~0 (- 3)) 1) (= (+ main_~i~0 (- 3)) (+ main_~sum~0 3 (* (- 2) main_~i~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2668#(and (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} is VALID [2022-04-28 09:46:22,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {2668#(and (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2672#(and (= (+ (- 10) (* main_~i~0 4)) main_~sum~0) (= (+ main_~i~0 (- 4)) 1))} is VALID [2022-04-28 09:46:22,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {2672#(and (= (+ (- 10) (* main_~i~0 4)) main_~sum~0) (= (+ main_~i~0 (- 4)) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2676#(and (= (+ (- 10) (* main_~i~0 4)) (+ (* (- 1) main_~i~0) main_~sum~0)) (= (+ main_~i~0 (- 4)) 1))} is VALID [2022-04-28 09:46:22,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {2676#(and (= (+ (- 10) (* main_~i~0 4)) (+ (* (- 1) main_~i~0) main_~sum~0)) (= (+ main_~i~0 (- 4)) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2680#(and (= (+ main_~i~0 (- 5)) 1) (= (+ (- 14) (* main_~i~0 4)) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-28 09:46:22,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {2680#(and (= (+ main_~i~0 (- 5)) 1) (= (+ (- 14) (* main_~i~0 4)) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2684#(and (= main_~sum~0 (+ (* main_~i~0 6) (- 15))) (= (+ main_~i~0 (- 5)) 1))} is VALID [2022-04-28 09:46:22,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {2684#(and (= main_~sum~0 (+ (* main_~i~0 6) (- 15))) (= (+ main_~i~0 (- 5)) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2688#(and (= 7 main_~i~0) (= main_~sum~0 21))} is VALID [2022-04-28 09:46:22,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {2688#(and (= 7 main_~i~0) (= main_~sum~0 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2692#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} is VALID [2022-04-28 09:46:22,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {2692#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2696#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2022-04-28 09:46:22,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {2696#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2700#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} is VALID [2022-04-28 09:46:22,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {2700#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2704#(and (= main_~sum~0 36) (= main_~i~0 9))} is VALID [2022-04-28 09:46:22,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {2704#(and (= main_~sum~0 36) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2708#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-28 09:46:22,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {2708#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2712#(and (<= 9 main_~n~0) (<= main_~i~0 10) (= main_~sum~0 45))} is VALID [2022-04-28 09:46:22,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {2712#(and (<= 9 main_~n~0) (<= main_~i~0 10) (= main_~sum~0 45))} assume !(~i~0 <= ~n~0); {2716#(and (<= 9 main_~n~0) (< main_~n~0 10) (= main_~sum~0 45))} is VALID [2022-04-28 09:46:22,966 INFO L272 TraceCheckUtils]: 26: Hoare triple {2716#(and (<= 9 main_~n~0) (< main_~n~0 10) (= main_~sum~0 45))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {2720#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:22,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {2720#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2724#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:22,967 INFO L290 TraceCheckUtils]: 28: Hoare triple {2724#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2618#false} is VALID [2022-04-28 09:46:22,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {2618#false} assume !false; {2618#false} is VALID [2022-04-28 09:46:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:46:22,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:46:25,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {2618#false} assume !false; {2618#false} is VALID [2022-04-28 09:46:25,728 INFO L290 TraceCheckUtils]: 28: Hoare triple {2724#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2618#false} is VALID [2022-04-28 09:46:25,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {2720#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2724#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:25,729 INFO L272 TraceCheckUtils]: 26: Hoare triple {2740#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {2720#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:25,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {2744#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {2740#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:46:25,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {2748#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2744#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:25,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2748#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:25,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:25,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:25,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:25,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:25,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:25,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:25,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:25,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:25,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:25,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:25,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:25,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:25,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:25,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:25,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:25,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:25,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {2617#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:25,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {2617#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2617#true} is VALID [2022-04-28 09:46:25,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {2617#true} call #t~ret3 := main(); {2617#true} is VALID [2022-04-28 09:46:25,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2617#true} {2617#true} #55#return; {2617#true} is VALID [2022-04-28 09:46:25,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {2617#true} assume true; {2617#true} is VALID [2022-04-28 09:46:25,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {2617#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(9, 2); {2617#true} is VALID [2022-04-28 09:46:25,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {2617#true} call ULTIMATE.init(); {2617#true} is VALID [2022-04-28 09:46:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 09:46:25,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:46:25,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480827378] [2022-04-28 09:46:25,790 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:46:25,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031499199] [2022-04-28 09:46:25,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031499199] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:46:25,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:46:25,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 9] total 29 [2022-04-28 09:46:25,791 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:46:25,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1181906809] [2022-04-28 09:46:25,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1181906809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:46:25,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:46:25,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 09:46:25,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944362040] [2022-04-28 09:46:25,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:46:25,792 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 09:46:25,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:46:25,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:25,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:25,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 09:46:25,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:25,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 09:46:25,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2022-04-28 09:46:25,823 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:26,640 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 09:46:26,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 09:46:26,640 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 09:46:26,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:46:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-28 09:46:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-28 09:46:26,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 38 transitions. [2022-04-28 09:46:26,683 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 09:46:26,684 INFO L225 Difference]: With dead ends: 38 [2022-04-28 09:46:26,684 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 09:46:26,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2022-04-28 09:46:26,689 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:46:26,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 160 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:46:26,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 09:46:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 09:46:26,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:46:26,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:26,715 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:26,716 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:26,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:26,717 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 09:46:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 09:46:26,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:26,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:26,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 09:46:26,718 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 09:46:26,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:26,719 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 09:46:26,719 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 09:46:26,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:26,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:26,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:46:26,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:46:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:26,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-28 09:46:26,720 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2022-04-28 09:46:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:46:26,722 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-28 09:46:26,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:26,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-28 09:46:26,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 09:46:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 09:46:26,757 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:46:26,757 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:46:26,778 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 09:46:26,971 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,SelfDestructingSolverStorable9 [2022-04-28 09:46:26,971 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:46:26,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:46:26,972 INFO L85 PathProgramCache]: Analyzing trace with hash 421891777, now seen corresponding path program 19 times [2022-04-28 09:46:26,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:26,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1832033821] [2022-04-28 09:46:26,974 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:46:26,974 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:46:26,974 INFO L85 PathProgramCache]: Analyzing trace with hash 421891777, now seen corresponding path program 20 times [2022-04-28 09:46:26,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:46:26,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900141898] [2022-04-28 09:46:26,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:46:26,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:46:27,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:46:27,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872810476] [2022-04-28 09:46:27,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:46:27,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:27,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:46:27,003 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 09:46:27,021 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 09:46:27,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:46:27,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:46:27,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 09:46:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:46:27,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:46:27,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {3037#true} call ULTIMATE.init(); {3037#true} is VALID [2022-04-28 09:46:27,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {3037#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(9, 2); {3037#true} is VALID [2022-04-28 09:46:27,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {3037#true} assume true; {3037#true} is VALID [2022-04-28 09:46:27,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3037#true} {3037#true} #55#return; {3037#true} is VALID [2022-04-28 09:46:27,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {3037#true} call #t~ret3 := main(); {3037#true} is VALID [2022-04-28 09:46:27,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {3037#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3037#true} is VALID [2022-04-28 09:46:27,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {3037#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {3060#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:27,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {3060#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3064#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:27,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {3064#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3068#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:46:27,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {3068#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3072#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:46:27,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {3072#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 0) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3076#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) 0))} is VALID [2022-04-28 09:46:27,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {3076#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) 0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3080#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} is VALID [2022-04-28 09:46:27,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {3080#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3084#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-28 09:46:27,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {3084#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3088#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} is VALID [2022-04-28 09:46:27,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {3088#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3092#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} is VALID [2022-04-28 09:46:27,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {3092#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3096#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-28 09:46:27,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {3096#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3100#(and (= (+ (- 2) main_~i~0) 4) (= main_~sum~0 (+ 3 (* main_~i~0 2))))} is VALID [2022-04-28 09:46:27,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {3100#(and (= (+ (- 2) main_~i~0) 4) (= main_~sum~0 (+ 3 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3104#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 3 (* main_~i~0 2))) (= (+ (- 2) main_~i~0) 4))} is VALID [2022-04-28 09:46:27,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {3104#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 3 (* main_~i~0 2))) (= (+ (- 2) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3108#(and (= (+ main_~i~0 (- 3)) 4) (= (+ (* main_~i~0 2) 1) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-28 09:46:27,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {3108#(and (= (+ main_~i~0 (- 3)) 4) (= (+ (* main_~i~0 2) 1) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3112#(and (= (+ main_~i~0 (- 3)) 4) (= (+ (* main_~i~0 2) 1) (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} is VALID [2022-04-28 09:46:27,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {3112#(and (= (+ main_~i~0 (- 3)) 4) (= (+ (* main_~i~0 2) 1) (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3116#(and (= (+ (- 1) (* main_~i~0 2)) (+ main_~sum~0 3 (* (- 2) main_~i~0))) (= (+ main_~i~0 (- 4)) 4))} is VALID [2022-04-28 09:46:27,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {3116#(and (= (+ (- 1) (* main_~i~0 2)) (+ main_~sum~0 3 (* (- 2) main_~i~0))) (= (+ main_~i~0 (- 4)) 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3120#(and (= (+ main_~i~0 (- 4)) 4) (= (+ (* 5 main_~i~0) (- 4)) main_~sum~0))} is VALID [2022-04-28 09:46:27,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {3120#(and (= (+ main_~i~0 (- 4)) 4) (= (+ (* 5 main_~i~0) (- 4)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3124#(and (= main_~sum~0 36) (= main_~i~0 9))} is VALID [2022-04-28 09:46:27,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {3124#(and (= main_~sum~0 36) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3128#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 36) (= main_~i~0 9))} is VALID [2022-04-28 09:46:27,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {3128#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 36) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3132#(and (= (+ (- 1) main_~i~0) 9) (= 36 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-28 09:46:27,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {3132#(and (= (+ (- 1) main_~i~0) 9) (= 36 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3136#(and (= (+ (- 1) main_~i~0) 9) (<= main_~i~0 main_~n~0) (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 36))} is VALID [2022-04-28 09:46:27,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {3136#(and (= (+ (- 1) main_~i~0) 9) (<= main_~i~0 main_~n~0) (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 36))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3140#(and (= (+ main_~sum~0 (- 19)) 36) (<= 10 main_~n~0) (<= main_~i~0 11))} is VALID [2022-04-28 09:46:27,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {3140#(and (= (+ main_~sum~0 (- 19)) 36) (<= 10 main_~n~0) (<= main_~i~0 11))} assume !(~i~0 <= ~n~0); {3144#(and (= (+ main_~sum~0 (- 19)) 36) (<= 10 main_~n~0) (< main_~n~0 11))} is VALID [2022-04-28 09:46:27,639 INFO L272 TraceCheckUtils]: 28: Hoare triple {3144#(and (= (+ main_~sum~0 (- 19)) 36) (<= 10 main_~n~0) (< main_~n~0 11))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {3148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:27,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {3148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:27,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {3152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3038#false} is VALID [2022-04-28 09:46:27,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {3038#false} assume !false; {3038#false} is VALID [2022-04-28 09:46:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:46:27,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:46:30,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {3038#false} assume !false; {3038#false} is VALID [2022-04-28 09:46:30,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {3152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3038#false} is VALID [2022-04-28 09:46:30,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {3148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:30,532 INFO L272 TraceCheckUtils]: 28: Hoare triple {3168#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {3148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:30,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {3172#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {3168#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:46:30,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {3176#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3172#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:30,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3176#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:30,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:30,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:30,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:30,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:30,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:30,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:30,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:30,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:30,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:30,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:30,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:30,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:30,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:30,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:30,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:30,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:30,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:30,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:30,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {3037#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:30,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {3037#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3037#true} is VALID [2022-04-28 09:46:30,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {3037#true} call #t~ret3 := main(); {3037#true} is VALID [2022-04-28 09:46:30,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3037#true} {3037#true} #55#return; {3037#true} is VALID [2022-04-28 09:46:30,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {3037#true} assume true; {3037#true} is VALID [2022-04-28 09:46:30,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {3037#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(9, 2); {3037#true} is VALID [2022-04-28 09:46:30,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {3037#true} call ULTIMATE.init(); {3037#true} is VALID [2022-04-28 09:46:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-28 09:46:30,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:46:30,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900141898] [2022-04-28 09:46:30,599 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:46:30,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872810476] [2022-04-28 09:46:30,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872810476] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:46:30,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:46:30,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 9] total 31 [2022-04-28 09:46:30,599 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:46:30,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1832033821] [2022-04-28 09:46:30,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1832033821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:46:30,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:46:30,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 09:46:30,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971952330] [2022-04-28 09:46:30,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:46:30,600 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 09:46:30,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:46:30,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:30,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:30,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 09:46:30,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:30,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 09:46:30,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2022-04-28 09:46:30,632 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:31,542 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 09:46:31,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 09:46:31,542 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 09:46:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:46:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-28 09:46:31,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:31,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-28 09:46:31,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 40 transitions. [2022-04-28 09:46:31,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:31,580 INFO L225 Difference]: With dead ends: 40 [2022-04-28 09:46:31,580 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 09:46:31,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 09:46:31,581 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:46:31,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 174 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:46:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 09:46:31,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 09:46:31,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:46:31,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:31,611 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:31,611 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:31,612 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 09:46:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 09:46:31,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:31,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:31,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 09:46:31,612 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 09:46:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:31,613 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 09:46:31,613 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 09:46:31,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:31,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:31,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:46:31,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:46:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:31,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-28 09:46:31,614 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2022-04-28 09:46:31,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:46:31,615 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-28 09:46:31,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:31,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-28 09:46:31,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:31,648 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 09:46:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 09:46:31,648 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:46:31,648 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:46:31,665 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 09:46:31,851 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,SelfDestructingSolverStorable10 [2022-04-28 09:46:31,851 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:46:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:46:31,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1481899937, now seen corresponding path program 21 times [2022-04-28 09:46:31,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:31,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1096311352] [2022-04-28 09:46:31,855 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:46:31,855 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:46:31,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1481899937, now seen corresponding path program 22 times [2022-04-28 09:46:31,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:46:31,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809223750] [2022-04-28 09:46:31,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:46:31,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:46:31,870 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:46:31,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267047258] [2022-04-28 09:46:31,871 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:46:31,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:31,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:46:31,872 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 09:46:31,878 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 09:46:31,918 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:46:31,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:46:31,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 09:46:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:46:31,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:46:32,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {3483#true} call ULTIMATE.init(); {3483#true} is VALID [2022-04-28 09:46:32,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {3483#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(9, 2); {3483#true} is VALID [2022-04-28 09:46:32,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {3483#true} assume true; {3483#true} is VALID [2022-04-28 09:46:32,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3483#true} {3483#true} #55#return; {3483#true} is VALID [2022-04-28 09:46:32,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {3483#true} call #t~ret3 := main(); {3483#true} is VALID [2022-04-28 09:46:32,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {3483#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3483#true} is VALID [2022-04-28 09:46:32,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {3483#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {3506#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:32,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {3506#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3510#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:32,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {3510#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3514#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-28 09:46:32,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {3514#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3518#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:46:32,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {3518#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3522#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2022-04-28 09:46:32,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {3522#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3526#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} is VALID [2022-04-28 09:46:32,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {3526#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3530#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-28 09:46:32,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {3530#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3534#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} is VALID [2022-04-28 09:46:32,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {3534#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3538#(and (= 6 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-28 09:46:32,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {3538#(and (= 6 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3542#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 6) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-28 09:46:32,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {3542#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 6) (= (+ (- 1) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3546#(and (= 6 (+ (- 9) main_~sum~0)) (= main_~i~0 6))} is VALID [2022-04-28 09:46:32,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {3546#(and (= 6 (+ (- 9) main_~sum~0)) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3550#(and (= 6 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 6))} is VALID [2022-04-28 09:46:32,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {3550#(and (= 6 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3554#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} is VALID [2022-04-28 09:46:32,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {3554#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3558#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} is VALID [2022-04-28 09:46:32,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {3558#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3562#(and (= 7 (+ main_~sum~0 (- 21))) (= (+ (- 20) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:46:32,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {3562#(and (= 7 (+ main_~sum~0 (- 21))) (= (+ (- 20) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3566#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} is VALID [2022-04-28 09:46:32,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {3566#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3570#(and (= main_~sum~0 36) (= main_~i~0 9))} is VALID [2022-04-28 09:46:32,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {3570#(and (= main_~sum~0 36) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3574#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 36) (= main_~i~0 9))} is VALID [2022-04-28 09:46:32,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {3574#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 36) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3578#(and (= main_~i~0 (+ main_~sum~0 (- 35))) (= (+ main_~sum~0 (- 36)) 9))} is VALID [2022-04-28 09:46:32,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {3578#(and (= main_~i~0 (+ main_~sum~0 (- 35))) (= (+ main_~sum~0 (- 36)) 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3582#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} is VALID [2022-04-28 09:46:32,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {3582#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3586#(and (= 9 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 33 (* main_~i~0 2))))} is VALID [2022-04-28 09:46:32,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {3586#(and (= 9 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 33 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3590#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ 33 (* main_~i~0 3))) (= 9 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:46:32,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {3590#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ 33 (* main_~i~0 3))) (= 9 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3594#(and (= 66 main_~sum~0) (<= 11 main_~n~0) (<= main_~i~0 12))} is VALID [2022-04-28 09:46:32,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {3594#(and (= 66 main_~sum~0) (<= 11 main_~n~0) (<= main_~i~0 12))} assume !(~i~0 <= ~n~0); {3598#(and (< main_~n~0 12) (= 66 main_~sum~0) (<= 11 main_~n~0))} is VALID [2022-04-28 09:46:32,566 INFO L272 TraceCheckUtils]: 30: Hoare triple {3598#(and (< main_~n~0 12) (= 66 main_~sum~0) (<= 11 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {3602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:32,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {3602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:32,566 INFO L290 TraceCheckUtils]: 32: Hoare triple {3606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3484#false} is VALID [2022-04-28 09:46:32,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {3484#false} assume !false; {3484#false} is VALID [2022-04-28 09:46:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:46:32,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:46:35,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {3484#false} assume !false; {3484#false} is VALID [2022-04-28 09:46:35,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {3606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3484#false} is VALID [2022-04-28 09:46:35,673 INFO L290 TraceCheckUtils]: 31: Hoare triple {3602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:35,674 INFO L272 TraceCheckUtils]: 30: Hoare triple {3622#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {3602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:35,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {3626#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {3622#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:46:35,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {3630#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3626#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:35,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3630#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:35,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:35,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:35,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:35,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:35,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:35,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:35,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:35,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:35,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:35,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:35,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:35,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:35,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:35,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:35,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:35,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:35,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:35,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:35,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:35,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:35,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {3483#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:35,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {3483#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3483#true} is VALID [2022-04-28 09:46:35,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {3483#true} call #t~ret3 := main(); {3483#true} is VALID [2022-04-28 09:46:35,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3483#true} {3483#true} #55#return; {3483#true} is VALID [2022-04-28 09:46:35,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {3483#true} assume true; {3483#true} is VALID [2022-04-28 09:46:35,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {3483#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(9, 2); {3483#true} is VALID [2022-04-28 09:46:35,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {3483#true} call ULTIMATE.init(); {3483#true} is VALID [2022-04-28 09:46:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-28 09:46:35,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:46:35,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809223750] [2022-04-28 09:46:35,772 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:46:35,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267047258] [2022-04-28 09:46:35,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267047258] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:46:35,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:46:35,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 9] total 33 [2022-04-28 09:46:35,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:46:35,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1096311352] [2022-04-28 09:46:35,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1096311352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:46:35,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:46:35,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 09:46:35,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673890398] [2022-04-28 09:46:35,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:46:35,773 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 09:46:35,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:46:35,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:35,805 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 09:46:35,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 09:46:35,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:35,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 09:46:35,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=961, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 09:46:35,806 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:36,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:36,902 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 09:46:36,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 09:46:36,902 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 09:46:36,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:46:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-28 09:46:36,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-28 09:46:36,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 42 transitions. [2022-04-28 09:46:36,945 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 09:46:36,946 INFO L225 Difference]: With dead ends: 42 [2022-04-28 09:46:36,946 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 09:46:36,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=106, Invalid=1084, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 09:46:36,947 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:46:36,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 195 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 09:46:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 09:46:36,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 09:46:36,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:46:36,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:36,976 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:36,976 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:36,977 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 09:46:36,977 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 09:46:36,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:36,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:36,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 09:46:36,977 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 09:46:36,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:36,978 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 09:46:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 09:46:36,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:36,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:36,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:46:36,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:46:36,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-28 09:46:36,980 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2022-04-28 09:46:36,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:46:36,980 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-28 09:46:36,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:36,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-28 09:46:37,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:37,014 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 09:46:37,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 09:46:37,015 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:46:37,015 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:46:37,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 09:46:37,219 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,SelfDestructingSolverStorable11 [2022-04-28 09:46:37,219 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:46:37,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:46:37,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1369668995, now seen corresponding path program 23 times [2022-04-28 09:46:37,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:37,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [988960214] [2022-04-28 09:46:37,222 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:46:37,222 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:46:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1369668995, now seen corresponding path program 24 times [2022-04-28 09:46:37,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:46:37,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949196721] [2022-04-28 09:46:37,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:46:37,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:46:37,249 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:46:37,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254180844] [2022-04-28 09:46:37,250 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:46:37,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:37,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:46:37,259 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 09:46:37,266 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 09:46:37,304 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 09:46:37,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:46:37,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-28 09:46:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:46:37,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:46:38,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {3955#true} call ULTIMATE.init(); {3955#true} is VALID [2022-04-28 09:46:38,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {3955#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(9, 2); {3955#true} is VALID [2022-04-28 09:46:38,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {3955#true} assume true; {3955#true} is VALID [2022-04-28 09:46:38,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3955#true} {3955#true} #55#return; {3955#true} is VALID [2022-04-28 09:46:38,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {3955#true} call #t~ret3 := main(); {3955#true} is VALID [2022-04-28 09:46:38,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {3955#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3955#true} is VALID [2022-04-28 09:46:38,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {3955#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {3978#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:38,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {3978#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3982#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:38,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {3982#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3986#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-28 09:46:38,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {3986#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3990#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:46:38,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {3990#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3994#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} is VALID [2022-04-28 09:46:38,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {3994#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3998#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) 1))} is VALID [2022-04-28 09:46:38,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {3998#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4002#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:46:38,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {4002#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4006#(and (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 3))} is VALID [2022-04-28 09:46:38,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {4006#(and (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4010#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} is VALID [2022-04-28 09:46:38,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {4010#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4014#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 4))} is VALID [2022-04-28 09:46:38,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {4014#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4018#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} is VALID [2022-04-28 09:46:38,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {4018#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4022#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} is VALID [2022-04-28 09:46:38,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {4022#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4026#(and (= main_~sum~0 (+ 7 (* main_~i~0 2))) (= 5 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:46:38,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {4026#(and (= main_~sum~0 (+ 7 (* main_~i~0 2))) (= 5 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4030#(and (= (+ 7 (* main_~i~0 3)) main_~sum~0) (= 5 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:46:38,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {4030#(and (= (+ 7 (* main_~i~0 3)) main_~sum~0) (= 5 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4034#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2022-04-28 09:46:38,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {4034#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4038#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} is VALID [2022-04-28 09:46:38,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {4038#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4042#(and (= 8 (+ (- 28) main_~sum~0)) (= (+ (- 27) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:46:38,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {4042#(and (= 8 (+ (- 28) main_~sum~0)) (= (+ (- 27) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4046#(and (= main_~sum~0 (+ (* main_~i~0 2) 27)) (= (+ (- 1) main_~i~0) 8))} is VALID [2022-04-28 09:46:38,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {4046#(and (= main_~sum~0 (+ (* main_~i~0 2) 27)) (= (+ (- 1) main_~i~0) 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4050#(and (= main_~i~0 10) (= main_~sum~0 45))} is VALID [2022-04-28 09:46:38,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {4050#(and (= main_~i~0 10) (= main_~sum~0 45))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4054#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} is VALID [2022-04-28 09:46:38,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {4054#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4058#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2022-04-28 09:46:38,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {4058#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4062#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} is VALID [2022-04-28 09:46:38,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {4062#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4066#(and (= (+ (- 1) main_~i~0) 11) (= 55 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-28 09:46:38,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {4066#(and (= (+ (- 1) main_~i~0) 11) (= 55 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4070#(and (= (+ (- 1) main_~i~0) 11) (<= main_~i~0 main_~n~0) (= (+ (* main_~i~0 2) 54) main_~sum~0))} is VALID [2022-04-28 09:46:38,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {4070#(and (= (+ (- 1) main_~i~0) 11) (<= main_~i~0 main_~n~0) (= (+ (* main_~i~0 2) 54) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4074#(and (<= main_~i~0 13) (<= 12 main_~n~0) (= main_~sum~0 78))} is VALID [2022-04-28 09:46:38,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {4074#(and (<= main_~i~0 13) (<= 12 main_~n~0) (= main_~sum~0 78))} assume !(~i~0 <= ~n~0); {4078#(and (< main_~n~0 13) (<= 12 main_~n~0) (= main_~sum~0 78))} is VALID [2022-04-28 09:46:38,016 INFO L272 TraceCheckUtils]: 32: Hoare triple {4078#(and (< main_~n~0 13) (<= 12 main_~n~0) (= main_~sum~0 78))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {4082#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:38,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {4082#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4086#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:38,017 INFO L290 TraceCheckUtils]: 34: Hoare triple {4086#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3956#false} is VALID [2022-04-28 09:46:38,017 INFO L290 TraceCheckUtils]: 35: Hoare triple {3956#false} assume !false; {3956#false} is VALID [2022-04-28 09:46:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:46:38,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:46:41,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {3956#false} assume !false; {3956#false} is VALID [2022-04-28 09:46:41,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {4086#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3956#false} is VALID [2022-04-28 09:46:41,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {4082#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4086#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:41,555 INFO L272 TraceCheckUtils]: 32: Hoare triple {4102#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {4082#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:41,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {4106#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {4102#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:46:41,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {4110#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4106#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:41,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4110#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:41,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:41,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:41,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:41,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:41,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:41,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:41,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:41,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:41,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:41,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:41,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:41,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:41,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:41,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:41,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:41,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:41,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:41,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:41,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:41,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:41,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:41,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:41,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {3955#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:41,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {3955#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3955#true} is VALID [2022-04-28 09:46:41,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {3955#true} call #t~ret3 := main(); {3955#true} is VALID [2022-04-28 09:46:41,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3955#true} {3955#true} #55#return; {3955#true} is VALID [2022-04-28 09:46:41,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {3955#true} assume true; {3955#true} is VALID [2022-04-28 09:46:41,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {3955#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(9, 2); {3955#true} is VALID [2022-04-28 09:46:41,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {3955#true} call ULTIMATE.init(); {3955#true} is VALID [2022-04-28 09:46:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-28 09:46:41,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:46:41,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949196721] [2022-04-28 09:46:41,621 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:46:41,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254180844] [2022-04-28 09:46:41,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254180844] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:46:41,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:46:41,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 9] total 35 [2022-04-28 09:46:41,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:46:41,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [988960214] [2022-04-28 09:46:41,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [988960214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:46:41,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:46:41,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 09:46:41,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834947125] [2022-04-28 09:46:41,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:46:41,622 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 09:46:41,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:46:41,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:41,655 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 09:46:41,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 09:46:41,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:41,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 09:46:41,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1089, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 09:46:41,656 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:42,960 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 09:46:42,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 09:46:42,960 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 09:46:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:46:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:42,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-28 09:46:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-28 09:46:42,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 44 transitions. [2022-04-28 09:46:43,008 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 09:46:43,008 INFO L225 Difference]: With dead ends: 44 [2022-04-28 09:46:43,008 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 09:46:43,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=112, Invalid=1220, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 09:46:43,009 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:46:43,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 202 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 09:46:43,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 09:46:43,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 09:46:43,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:46:43,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:43,031 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:43,031 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:43,032 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 09:46:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 09:46:43,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:43,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:43,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 09:46:43,032 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 09:46:43,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:43,033 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 09:46:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 09:46:43,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:43,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:43,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:46:43,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:46:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-28 09:46:43,034 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2022-04-28 09:46:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:46:43,034 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-28 09:46:43,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:43,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-28 09:46:43,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 09:46:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 09:46:43,079 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:46:43,080 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:46:43,105 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 09:46:43,280 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,SelfDestructingSolverStorable12 [2022-04-28 09:46:43,280 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:46:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:46:43,281 INFO L85 PathProgramCache]: Analyzing trace with hash -889916133, now seen corresponding path program 25 times [2022-04-28 09:46:43,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:43,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [671675081] [2022-04-28 09:46:43,283 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:46:43,283 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:46:43,284 INFO L85 PathProgramCache]: Analyzing trace with hash -889916133, now seen corresponding path program 26 times [2022-04-28 09:46:43,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:46:43,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066864256] [2022-04-28 09:46:43,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:46:43,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:46:43,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:46:43,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548664806] [2022-04-28 09:46:43,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:46:43,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:43,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:46:43,301 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 09:46:43,305 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 09:46:43,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:46:43,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:46:43,348 WARN L261 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 09:46:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:46:43,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:46:44,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {4453#true} call ULTIMATE.init(); {4453#true} is VALID [2022-04-28 09:46:44,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {4453#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(9, 2); {4453#true} is VALID [2022-04-28 09:46:44,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {4453#true} assume true; {4453#true} is VALID [2022-04-28 09:46:44,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4453#true} {4453#true} #55#return; {4453#true} is VALID [2022-04-28 09:46:44,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {4453#true} call #t~ret3 := main(); {4453#true} is VALID [2022-04-28 09:46:44,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {4453#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4453#true} is VALID [2022-04-28 09:46:44,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {4453#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {4476#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:44,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {4476#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4480#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:44,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {4480#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4484#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:46:44,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {4484#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4488#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:46:44,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {4488#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 0) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4492#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) 0))} is VALID [2022-04-28 09:46:44,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {4492#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) 0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4496#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 3 (* main_~i~0 (- 3))) 0))} is VALID [2022-04-28 09:46:44,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {4496#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 3 (* main_~i~0 (- 3))) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4500#(and (= (+ main_~sum~0 6 (* main_~i~0 (- 3))) 0) (= (+ main_~i~0 (- 3)) 1))} is VALID [2022-04-28 09:46:44,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {4500#(and (= (+ main_~sum~0 6 (* main_~i~0 (- 3))) 0) (= (+ main_~i~0 (- 3)) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4504#(and (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} is VALID [2022-04-28 09:46:44,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {4504#(and (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4508#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-28 09:46:44,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {4508#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4512#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} is VALID [2022-04-28 09:46:44,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {4512#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4516#(and (= main_~i~0 6) (= main_~sum~0 15))} is VALID [2022-04-28 09:46:44,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {4516#(and (= main_~i~0 6) (= main_~sum~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4520#(and (= main_~i~0 6) (= (+ (* (- 1) main_~i~0) main_~sum~0) 15))} is VALID [2022-04-28 09:46:44,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {4520#(and (= main_~i~0 6) (= (+ (* (- 1) main_~i~0) main_~sum~0) 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4524#(and (= (+ main_~sum~0 (- 6)) 15) (= 7 main_~i~0))} is VALID [2022-04-28 09:46:44,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {4524#(and (= (+ main_~sum~0 (- 6)) 15) (= 7 main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4528#(and (= 7 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 15))} is VALID [2022-04-28 09:46:44,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {4528#(and (= 7 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4532#(and (= (+ (- 13) main_~sum~0) 15) (= main_~i~0 8))} is VALID [2022-04-28 09:46:44,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {4532#(and (= (+ (- 13) main_~sum~0) 15) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4536#(and (= (+ (* (- 1) main_~i~0) (- 13) main_~sum~0) 15) (= main_~i~0 8))} is VALID [2022-04-28 09:46:44,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {4536#(and (= (+ (* (- 1) main_~i~0) (- 13) main_~sum~0) 15) (= main_~i~0 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4540#(and (= 8 (+ (- 28) main_~sum~0)) (= (+ (- 27) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:46:44,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {4540#(and (= 8 (+ (- 28) main_~sum~0)) (= (+ (- 27) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4544#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-28 09:46:44,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {4544#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4548#(and (= main_~i~0 (+ main_~sum~0 (- 35))) (= (+ main_~sum~0 (- 36)) 9))} is VALID [2022-04-28 09:46:44,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {4548#(and (= main_~i~0 (+ main_~sum~0 (- 35))) (= (+ main_~sum~0 (- 36)) 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4552#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} is VALID [2022-04-28 09:46:44,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {4552#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4556#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2022-04-28 09:46:44,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {4556#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4560#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} is VALID [2022-04-28 09:46:44,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {4560#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4564#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} is VALID [2022-04-28 09:46:44,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {4564#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4568#(and (= (+ (- 1) main_~i~0) 11) (= (+ (* main_~i~0 2) 54) main_~sum~0))} is VALID [2022-04-28 09:46:44,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {4568#(and (= (+ (- 1) main_~i~0) 11) (= (+ (* main_~i~0 2) 54) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4572#(and (= (+ (- 2) main_~i~0) 11) (= main_~sum~0 (+ 52 (* main_~i~0 2))))} is VALID [2022-04-28 09:46:44,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {4572#(and (= (+ (- 2) main_~i~0) 11) (= main_~sum~0 (+ 52 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4576#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 52 (* main_~i~0 2))) (<= main_~i~0 main_~n~0) (= (+ (- 2) main_~i~0) 11))} is VALID [2022-04-28 09:46:44,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {4576#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 52 (* main_~i~0 2))) (<= main_~i~0 main_~n~0) (= (+ (- 2) main_~i~0) 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4580#(and (<= main_~i~0 14) (= (+ (- 13) main_~sum~0) 78) (<= 13 main_~n~0))} is VALID [2022-04-28 09:46:44,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {4580#(and (<= main_~i~0 14) (= (+ (- 13) main_~sum~0) 78) (<= 13 main_~n~0))} assume !(~i~0 <= ~n~0); {4584#(and (< main_~n~0 14) (= (+ (- 13) main_~sum~0) 78) (<= 13 main_~n~0))} is VALID [2022-04-28 09:46:44,148 INFO L272 TraceCheckUtils]: 34: Hoare triple {4584#(and (< main_~n~0 14) (= (+ (- 13) main_~sum~0) 78) (<= 13 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {4588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:44,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {4588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:44,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {4592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4454#false} is VALID [2022-04-28 09:46:44,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {4454#false} assume !false; {4454#false} is VALID [2022-04-28 09:46:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:46:44,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:46:48,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {4454#false} assume !false; {4454#false} is VALID [2022-04-28 09:46:48,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {4592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4454#false} is VALID [2022-04-28 09:46:48,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {4588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:48,403 INFO L272 TraceCheckUtils]: 34: Hoare triple {4608#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {4588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:48,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {4612#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {4608#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:46:48,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {4616#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4612#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:48,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4616#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:48,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:48,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:48,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:48,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:48,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:48,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:48,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:48,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:48,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:48,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:48,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:48,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:48,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:48,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:48,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:48,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:48,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:48,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:48,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:48,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:48,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:48,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:48,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:48,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:48,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {4453#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:48,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {4453#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4453#true} is VALID [2022-04-28 09:46:48,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {4453#true} call #t~ret3 := main(); {4453#true} is VALID [2022-04-28 09:46:48,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4453#true} {4453#true} #55#return; {4453#true} is VALID [2022-04-28 09:46:48,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {4453#true} assume true; {4453#true} is VALID [2022-04-28 09:46:48,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {4453#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(9, 2); {4453#true} is VALID [2022-04-28 09:46:48,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {4453#true} call ULTIMATE.init(); {4453#true} is VALID [2022-04-28 09:46:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 09:46:48,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:46:48,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066864256] [2022-04-28 09:46:48,504 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:46:48,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548664806] [2022-04-28 09:46:48,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548664806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:46:48,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:46:48,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 9] total 37 [2022-04-28 09:46:48,505 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:46:48,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [671675081] [2022-04-28 09:46:48,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [671675081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:46:48,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:46:48,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 09:46:48,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058739706] [2022-04-28 09:46:48,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:46:48,506 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 09:46:48,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:46:48,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:48,539 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 09:46:48,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 09:46:48,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:48,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 09:46:48,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1225, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 09:46:48,540 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:50,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:50,138 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 09:46:50,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 09:46:50,139 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 09:46:50,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:46:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-28 09:46:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-28 09:46:50,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 46 transitions. [2022-04-28 09:46:50,185 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 09:46:50,186 INFO L225 Difference]: With dead ends: 46 [2022-04-28 09:46:50,186 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 09:46:50,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 13 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=118, Invalid=1364, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 09:46:50,187 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 09:46:50,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 223 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 09:46:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 09:46:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-28 09:46:50,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:46:50,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:50,218 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:50,218 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:50,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:50,218 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 09:46:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 09:46:50,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:50,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:50,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 09:46:50,219 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 09:46:50,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:50,219 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 09:46:50,220 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 09:46:50,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:50,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:50,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:46:50,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:46:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-28 09:46:50,221 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2022-04-28 09:46:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:46:50,221 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-28 09:46:50,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:50,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-28 09:46:50,266 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 09:46:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 09:46:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 09:46:50,266 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:46:50,266 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:46:50,283 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 09:46:50,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:50,467 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:46:50,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:46:50,467 INFO L85 PathProgramCache]: Analyzing trace with hash 591083577, now seen corresponding path program 27 times [2022-04-28 09:46:50,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:50,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [650227068] [2022-04-28 09:46:50,470 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:46:50,470 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:46:50,470 INFO L85 PathProgramCache]: Analyzing trace with hash 591083577, now seen corresponding path program 28 times [2022-04-28 09:46:50,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:46:50,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355076819] [2022-04-28 09:46:50,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:46:50,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:46:50,494 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:46:50,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1949899579] [2022-04-28 09:46:50,494 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:46:50,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:50,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:46:50,495 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 09:46:50,496 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 09:46:50,534 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:46:50,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:46:50,536 WARN L261 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-28 09:46:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:46:50,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:46:51,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {4977#true} call ULTIMATE.init(); {4977#true} is VALID [2022-04-28 09:46:51,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {4977#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(9, 2); {4977#true} is VALID [2022-04-28 09:46:51,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {4977#true} assume true; {4977#true} is VALID [2022-04-28 09:46:51,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4977#true} {4977#true} #55#return; {4977#true} is VALID [2022-04-28 09:46:51,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {4977#true} call #t~ret3 := main(); {4977#true} is VALID [2022-04-28 09:46:51,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {4977#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4977#true} is VALID [2022-04-28 09:46:51,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {4977#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {5000#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:51,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {5000#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5004#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:51,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {5004#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5008#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} is VALID [2022-04-28 09:46:51,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {5008#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5012#(and (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} is VALID [2022-04-28 09:46:51,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {5012#(and (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5016#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~sum~0) 2))} is VALID [2022-04-28 09:46:51,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {5016#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~sum~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5020#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) main_~i~0) (= 2 (+ (- 1) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:46:51,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {5020#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) main_~i~0) (= 2 (+ (- 1) (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5024#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:46:51,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {5024#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5028#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2022-04-28 09:46:51,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {5028#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5032#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-28 09:46:51,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {5032#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5036#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} is VALID [2022-04-28 09:46:51,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {5036#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5040#(and (= (+ (- 1) main_~i~0) 5) (= main_~sum~0 (+ main_~i~0 9)))} is VALID [2022-04-28 09:46:51,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {5040#(and (= (+ (- 1) main_~i~0) 5) (= main_~sum~0 (+ main_~i~0 9)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5044#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} is VALID [2022-04-28 09:46:51,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {5044#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5048#(and (= 7 main_~i~0) (= main_~sum~0 21))} is VALID [2022-04-28 09:46:51,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {5048#(and (= 7 main_~i~0) (= main_~sum~0 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5052#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} is VALID [2022-04-28 09:46:51,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {5052#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5056#(and (= 7 (+ main_~sum~0 (- 21))) (= (+ (- 20) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:46:51,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {5056#(and (= 7 (+ main_~sum~0 (- 21))) (= (+ (- 20) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5060#(and (= main_~i~0 (+ (- 20) (* (- 1) main_~i~0) main_~sum~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 21)) 7))} is VALID [2022-04-28 09:46:51,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {5060#(and (= main_~i~0 (+ (- 20) (* (- 1) main_~i~0) main_~sum~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 21)) 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5064#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 19)) (+ (- 1) main_~i~0)) (= 7 (+ (- 20) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:46:51,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {5064#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 19)) (+ (- 1) main_~i~0)) (= 7 (+ (- 20) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5068#(and (= main_~sum~0 (+ (* main_~i~0 3) 18)) (= 7 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:46:51,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {5068#(and (= main_~sum~0 (+ (* main_~i~0 3) 18)) (= 7 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5072#(and (= main_~sum~0 (+ 15 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 7))} is VALID [2022-04-28 09:46:51,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {5072#(and (= main_~sum~0 (+ 15 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5076#(and (= main_~sum~0 (+ 15 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 7))} is VALID [2022-04-28 09:46:51,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {5076#(and (= main_~sum~0 (+ 15 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5080#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2022-04-28 09:46:51,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {5080#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5084#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} is VALID [2022-04-28 09:46:51,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {5084#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5088#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} is VALID [2022-04-28 09:46:51,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {5088#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5092#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} is VALID [2022-04-28 09:46:51,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {5092#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5096#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} is VALID [2022-04-28 09:46:51,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {5096#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5100#(and (= 12 (+ (* (- 1) main_~i~0) main_~sum~0 (- 66))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 65))))} is VALID [2022-04-28 09:46:51,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {5100#(and (= 12 (+ (* (- 1) main_~i~0) main_~sum~0 (- 66))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 65))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5104#(and (= 13 (+ main_~sum~0 (- 78))) (= (+ (- 77) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:46:51,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {5104#(and (= 13 (+ main_~sum~0 (- 78))) (= (+ (- 77) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5108#(and (= main_~sum~0 (+ 91 main_~i~0)) (<= main_~i~0 main_~n~0) (= main_~i~0 14))} is VALID [2022-04-28 09:46:51,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {5108#(and (= main_~sum~0 (+ 91 main_~i~0)) (<= main_~i~0 main_~n~0) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5112#(and (<= (+ main_~i~0 90) main_~sum~0) (= 14 (+ main_~sum~0 (- 91))) (<= main_~sum~0 (+ 91 main_~n~0)))} is VALID [2022-04-28 09:46:51,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {5112#(and (<= (+ main_~i~0 90) main_~sum~0) (= 14 (+ main_~sum~0 (- 91))) (<= main_~sum~0 (+ 91 main_~n~0)))} assume !(~i~0 <= ~n~0); {5116#(and (= 14 (+ main_~sum~0 (- 91))) (< (+ main_~n~0 90) main_~sum~0) (<= main_~sum~0 (+ 91 main_~n~0)))} is VALID [2022-04-28 09:46:51,418 INFO L272 TraceCheckUtils]: 36: Hoare triple {5116#(and (= 14 (+ main_~sum~0 (- 91))) (< (+ main_~n~0 90) main_~sum~0) (<= main_~sum~0 (+ 91 main_~n~0)))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {5120#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:51,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {5120#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5124#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:51,419 INFO L290 TraceCheckUtils]: 38: Hoare triple {5124#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4978#false} is VALID [2022-04-28 09:46:51,419 INFO L290 TraceCheckUtils]: 39: Hoare triple {4978#false} assume !false; {4978#false} is VALID [2022-04-28 09:46:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:46:51,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:46:55,967 INFO L290 TraceCheckUtils]: 39: Hoare triple {4978#false} assume !false; {4978#false} is VALID [2022-04-28 09:46:55,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {5124#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4978#false} is VALID [2022-04-28 09:46:55,968 INFO L290 TraceCheckUtils]: 37: Hoare triple {5120#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5124#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:55,969 INFO L272 TraceCheckUtils]: 36: Hoare triple {5140#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {5120#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:55,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {5144#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {5140#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:46:55,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {5148#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5144#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:55,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5148#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:46:55,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:55,978 INFO L290 TraceCheckUtils]: 31: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:55,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:55,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:55,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:55,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:56,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:56,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:56,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:56,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:56,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:56,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:56,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:56,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:56,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:56,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:56,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:56,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:56,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:56,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:56,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:56,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:56,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:56,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:56,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:56,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:46:56,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {4977#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:46:56,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {4977#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4977#true} is VALID [2022-04-28 09:46:56,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {4977#true} call #t~ret3 := main(); {4977#true} is VALID [2022-04-28 09:46:56,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4977#true} {4977#true} #55#return; {4977#true} is VALID [2022-04-28 09:46:56,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {4977#true} assume true; {4977#true} is VALID [2022-04-28 09:46:56,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {4977#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(9, 2); {4977#true} is VALID [2022-04-28 09:46:56,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {4977#true} call ULTIMATE.init(); {4977#true} is VALID [2022-04-28 09:46:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-04-28 09:46:56,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:46:56,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355076819] [2022-04-28 09:46:56,082 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:46:56,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949899579] [2022-04-28 09:46:56,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949899579] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:46:56,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:46:56,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 9] total 39 [2022-04-28 09:46:56,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:46:56,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [650227068] [2022-04-28 09:46:56,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [650227068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:46:56,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:46:56,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 09:46:56,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659842944] [2022-04-28 09:46:56,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:46:56,084 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 09:46:56,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:46:56,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:56,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:56,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 09:46:56,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:56,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 09:46:56,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 09:46:56,126 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:58,116 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 09:46:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 09:46:58,116 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 09:46:58,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:46:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-28 09:46:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-28 09:46:58,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 48 transitions. [2022-04-28 09:46:58,163 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 09:46:58,163 INFO L225 Difference]: With dead ends: 48 [2022-04-28 09:46:58,163 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 09:46:58,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 14 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=124, Invalid=1516, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 09:46:58,164 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:46:58,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 237 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 09:46:58,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 09:46:58,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 09:46:58,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:46:58,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:58,189 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:58,189 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:58,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:58,190 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 09:46:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 09:46:58,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:58,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:58,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 09:46:58,191 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 09:46:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:46:58,191 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 09:46:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 09:46:58,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:46:58,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:46:58,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:46:58,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:46:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-28 09:46:58,193 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2022-04-28 09:46:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:46:58,193 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-28 09:46:58,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:46:58,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-28 09:46:58,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:46:58,236 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 09:46:58,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 09:46:58,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:46:58,237 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:46:58,253 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 09:46:58,439 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,SelfDestructingSolverStorable14 [2022-04-28 09:46:58,440 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:46:58,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:46:58,440 INFO L85 PathProgramCache]: Analyzing trace with hash -2097337385, now seen corresponding path program 29 times [2022-04-28 09:46:58,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:46:58,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1933796449] [2022-04-28 09:46:58,442 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:46:58,443 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:46:58,443 INFO L85 PathProgramCache]: Analyzing trace with hash -2097337385, now seen corresponding path program 30 times [2022-04-28 09:46:58,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:46:58,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338573186] [2022-04-28 09:46:58,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:46:58,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:46:58,458 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:46:58,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [215957493] [2022-04-28 09:46:58,459 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:46:58,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:46:58,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:46:58,460 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 09:46:58,467 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 09:46:58,508 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 09:46:58,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:46:58,509 WARN L261 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-28 09:46:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:46:58,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:46:59,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {5527#true} call ULTIMATE.init(); {5527#true} is VALID [2022-04-28 09:46:59,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {5527#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(9, 2); {5527#true} is VALID [2022-04-28 09:46:59,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {5527#true} assume true; {5527#true} is VALID [2022-04-28 09:46:59,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5527#true} {5527#true} #55#return; {5527#true} is VALID [2022-04-28 09:46:59,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {5527#true} call #t~ret3 := main(); {5527#true} is VALID [2022-04-28 09:46:59,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {5527#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5527#true} is VALID [2022-04-28 09:46:59,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {5527#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {5550#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:59,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {5550#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5554#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:46:59,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {5554#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5558#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-28 09:46:59,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {5558#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5562#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:46:59,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {5562#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5566#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2022-04-28 09:46:59,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {5566#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5570#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) main_~sum~0) 3))} is VALID [2022-04-28 09:46:59,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {5570#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) main_~sum~0) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5574#(and (= 3 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-28 09:46:59,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {5574#(and (= 3 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5578#(and (= main_~sum~0 (+ 2 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-28 09:46:59,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {5578#(and (= main_~sum~0 (+ 2 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5582#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-28 09:46:59,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {5582#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5586#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} is VALID [2022-04-28 09:46:59,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {5586#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5590#(and (= main_~i~0 6) (= (+ main_~sum~0 (- 5)) 10))} is VALID [2022-04-28 09:46:59,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {5590#(and (= main_~i~0 6) (= (+ main_~sum~0 (- 5)) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5594#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) 10) (= main_~i~0 6))} is VALID [2022-04-28 09:46:59,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {5594#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) 10) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5598#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} is VALID [2022-04-28 09:46:59,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {5598#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5602#(and (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} is VALID [2022-04-28 09:46:59,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {5602#(and (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5606#(and (= 6 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 12 (* main_~i~0 2))))} is VALID [2022-04-28 09:46:59,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {5606#(and (= 6 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 12 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5610#(and (= (+ (* main_~i~0 3) 12) main_~sum~0) (= 6 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:46:59,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {5610#(and (= (+ (* main_~i~0 3) 12) main_~sum~0) (= 6 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5614#(and (= main_~sum~0 36) (= main_~i~0 9))} is VALID [2022-04-28 09:46:59,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {5614#(and (= main_~sum~0 36) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5618#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-28 09:46:59,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {5618#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5622#(and (= (+ (- 1) main_~i~0) 9) (= (+ 35 main_~i~0) main_~sum~0))} is VALID [2022-04-28 09:46:59,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {5622#(and (= (+ (- 1) main_~i~0) 9) (= (+ 35 main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5626#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} is VALID [2022-04-28 09:46:59,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {5626#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5630#(and (= 9 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 33 (* main_~i~0 2))))} is VALID [2022-04-28 09:46:59,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {5630#(and (= 9 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 33 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5634#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 33 (* main_~i~0 2))) (= 9 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:46:59,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {5634#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 33 (* main_~i~0 2))) (= 9 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5638#(and (= (+ 31 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 9))} is VALID [2022-04-28 09:46:59,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {5638#(and (= (+ 31 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5642#(and (= main_~sum~0 (+ 30 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 9))} is VALID [2022-04-28 09:46:59,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {5642#(and (= main_~sum~0 (+ 30 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5646#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2022-04-28 09:46:59,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {5646#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5650#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2022-04-28 09:46:59,448 INFO L290 TraceCheckUtils]: 32: Hoare triple {5650#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5654#(and (= 91 main_~sum~0) (= main_~i~0 14))} is VALID [2022-04-28 09:46:59,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {5654#(and (= 91 main_~sum~0) (= main_~i~0 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5658#(and (= main_~sum~0 (+ 91 main_~i~0)) (= main_~i~0 14))} is VALID [2022-04-28 09:46:59,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {5658#(and (= main_~sum~0 (+ 91 main_~i~0)) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5662#(and (= main_~sum~0 (+ main_~i~0 90)) (= (+ (- 1) main_~i~0) 14))} is VALID [2022-04-28 09:46:59,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {5662#(and (= main_~sum~0 (+ main_~i~0 90)) (= (+ (- 1) main_~i~0) 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5666#(and (<= main_~i~0 main_~n~0) (= (+ 90 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 14))} is VALID [2022-04-28 09:46:59,454 INFO L290 TraceCheckUtils]: 36: Hoare triple {5666#(and (<= main_~i~0 main_~n~0) (= (+ 90 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5670#(and (<= main_~i~0 16) (<= 15 main_~n~0) (= main_~sum~0 120))} is VALID [2022-04-28 09:46:59,455 INFO L290 TraceCheckUtils]: 37: Hoare triple {5670#(and (<= main_~i~0 16) (<= 15 main_~n~0) (= main_~sum~0 120))} assume !(~i~0 <= ~n~0); {5674#(and (< main_~n~0 16) (<= 15 main_~n~0) (= main_~sum~0 120))} is VALID [2022-04-28 09:46:59,456 INFO L272 TraceCheckUtils]: 38: Hoare triple {5674#(and (< main_~n~0 16) (<= 15 main_~n~0) (= main_~sum~0 120))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {5678#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:46:59,456 INFO L290 TraceCheckUtils]: 39: Hoare triple {5678#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5682#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:46:59,456 INFO L290 TraceCheckUtils]: 40: Hoare triple {5682#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5528#false} is VALID [2022-04-28 09:46:59,456 INFO L290 TraceCheckUtils]: 41: Hoare triple {5528#false} assume !false; {5528#false} is VALID [2022-04-28 09:46:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:46:59,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:47:04,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {5528#false} assume !false; {5528#false} is VALID [2022-04-28 09:47:04,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {5682#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5528#false} is VALID [2022-04-28 09:47:04,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {5678#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5682#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:47:04,527 INFO L272 TraceCheckUtils]: 38: Hoare triple {5698#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {5678#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:47:04,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {5702#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {5698#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:47:04,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {5706#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5702#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:47:04,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5706#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:47:04,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:04,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:04,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:04,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:04,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:04,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:04,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:04,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:04,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:04,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:04,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:04,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:04,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:04,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:04,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:04,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:04,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:04,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:04,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:04,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:04,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:04,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:04,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:04,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:04,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:04,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:04,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:04,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:04,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {5527#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:04,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {5527#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5527#true} is VALID [2022-04-28 09:47:04,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {5527#true} call #t~ret3 := main(); {5527#true} is VALID [2022-04-28 09:47:04,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5527#true} {5527#true} #55#return; {5527#true} is VALID [2022-04-28 09:47:04,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {5527#true} assume true; {5527#true} is VALID [2022-04-28 09:47:04,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {5527#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(9, 2); {5527#true} is VALID [2022-04-28 09:47:04,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {5527#true} call ULTIMATE.init(); {5527#true} is VALID [2022-04-28 09:47:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-28 09:47:04,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:47:04,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338573186] [2022-04-28 09:47:04,868 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:47:04,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215957493] [2022-04-28 09:47:04,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215957493] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:47:04,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:47:04,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 9] total 41 [2022-04-28 09:47:04,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:47:04,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1933796449] [2022-04-28 09:47:04,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1933796449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:04,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:47:04,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 09:47:04,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754527762] [2022-04-28 09:47:04,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:47:04,869 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 09:47:04,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:47:04,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:04,912 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 09:47:04,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 09:47:04,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:04,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 09:47:04,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1521, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 09:47:04,913 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:06,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:06,942 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 09:47:06,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 09:47:06,943 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 09:47:06,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:47:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-28 09:47:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-28 09:47:06,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 50 transitions. [2022-04-28 09:47:06,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:47:06,998 INFO L225 Difference]: With dead ends: 50 [2022-04-28 09:47:06,998 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 09:47:06,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 29 SyntacticMatches, 15 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=130, Invalid=1676, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 09:47:06,999 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:47:06,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 251 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 09:47:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 09:47:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 09:47:07,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:47:07,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:07,032 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:07,032 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:07,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:07,033 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 09:47:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 09:47:07,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:07,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:07,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-28 09:47:07,034 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-28 09:47:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:07,035 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 09:47:07,035 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 09:47:07,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:07,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:07,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:47:07,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:47:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-28 09:47:07,036 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2022-04-28 09:47:07,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:47:07,036 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-28 09:47:07,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:07,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-28 09:47:07,093 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 09:47:07,093 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 09:47:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 09:47:07,094 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:47:07,094 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:47:07,110 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 09:47:07,294 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,SelfDestructingSolverStorable15 [2022-04-28 09:47:07,294 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:47:07,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:47:07,295 INFO L85 PathProgramCache]: Analyzing trace with hash -99569675, now seen corresponding path program 31 times [2022-04-28 09:47:07,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:07,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [765299708] [2022-04-28 09:47:07,297 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:47:07,297 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:47:07,297 INFO L85 PathProgramCache]: Analyzing trace with hash -99569675, now seen corresponding path program 32 times [2022-04-28 09:47:07,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:47:07,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001909977] [2022-04-28 09:47:07,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:47:07,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:47:07,321 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:47:07,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333008598] [2022-04-28 09:47:07,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:47:07,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:47:07,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:47:07,322 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 09:47:07,334 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 09:47:07,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:47:07,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:47:07,375 WARN L261 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-28 09:47:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:07,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:47:08,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {6103#true} call ULTIMATE.init(); {6103#true} is VALID [2022-04-28 09:47:08,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {6103#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(9, 2); {6103#true} is VALID [2022-04-28 09:47:08,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {6103#true} assume true; {6103#true} is VALID [2022-04-28 09:47:08,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6103#true} {6103#true} #55#return; {6103#true} is VALID [2022-04-28 09:47:08,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {6103#true} call #t~ret3 := main(); {6103#true} is VALID [2022-04-28 09:47:08,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {6103#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6103#true} is VALID [2022-04-28 09:47:08,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {6103#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {6126#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:47:08,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {6126#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6130#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-28 09:47:08,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {6130#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6134#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:47:08,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {6134#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6138#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:47:08,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {6138#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 0) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6142#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) 0))} is VALID [2022-04-28 09:47:08,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {6142#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) 0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6146#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} is VALID [2022-04-28 09:47:08,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {6146#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6150#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-28 09:47:08,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {6150#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6154#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2022-04-28 09:47:08,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {6154#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6158#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-28 09:47:08,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {6158#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6162#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} is VALID [2022-04-28 09:47:08,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {6162#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6166#(and (= main_~i~0 6) (= (+ main_~sum~0 (- 5)) 10))} is VALID [2022-04-28 09:47:08,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {6166#(and (= main_~i~0 6) (= (+ main_~sum~0 (- 5)) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6170#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} is VALID [2022-04-28 09:47:08,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {6170#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6174#(and (= (+ main_~i~0 14) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} is VALID [2022-04-28 09:47:08,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {6174#(and (= (+ main_~i~0 14) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6178#(and (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} is VALID [2022-04-28 09:47:08,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {6178#(and (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6182#(and (= 6 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 12 (* main_~i~0 2))))} is VALID [2022-04-28 09:47:08,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {6182#(and (= 6 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 12 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6186#(and (= 6 (+ (- 2) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 12 (* main_~i~0 2))))} is VALID [2022-04-28 09:47:08,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {6186#(and (= 6 (+ (- 2) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 12 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6190#(and (= (+ main_~sum~0 (- 8)) 28) (= main_~i~0 9))} is VALID [2022-04-28 09:47:08,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {6190#(and (= (+ main_~sum~0 (- 8)) 28) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6194#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 8)) 28) (= main_~i~0 9))} is VALID [2022-04-28 09:47:08,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {6194#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 8)) 28) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6198#(and (= (+ (- 1) main_~i~0) 9) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 7)) 28))} is VALID [2022-04-28 09:47:08,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {6198#(and (= (+ (- 1) main_~i~0) 9) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 7)) 28))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6202#(and (= (+ (- 1) main_~i~0) 9) (= 28 (+ main_~sum~0 (- 7) (* (- 2) main_~i~0))))} is VALID [2022-04-28 09:47:08,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {6202#(and (= (+ (- 1) main_~i~0) 9) (= 28 (+ main_~sum~0 (- 7) (* (- 2) main_~i~0))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6206#(and (= (+ main_~sum~0 (- 5) (* (- 2) main_~i~0)) 28) (= 9 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:47:08,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {6206#(and (= (+ main_~sum~0 (- 5) (* (- 2) main_~i~0)) 28) (= 9 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6210#(and (= main_~sum~0 (+ 33 (* main_~i~0 3))) (= 9 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:47:08,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {6210#(and (= main_~sum~0 (+ 33 (* main_~i~0 3))) (= 9 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6214#(and (= main_~i~0 12) (= 66 main_~sum~0))} is VALID [2022-04-28 09:47:08,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {6214#(and (= main_~i~0 12) (= 66 main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6218#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} is VALID [2022-04-28 09:47:08,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {6218#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6222#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} is VALID [2022-04-28 09:47:08,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {6222#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6226#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-28 09:47:08,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {6226#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6230#(and (= 91 main_~sum~0) (= main_~i~0 14))} is VALID [2022-04-28 09:47:08,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {6230#(and (= 91 main_~sum~0) (= main_~i~0 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6234#(and (= main_~sum~0 (+ 91 main_~i~0)) (= main_~i~0 14))} is VALID [2022-04-28 09:47:08,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {6234#(and (= main_~sum~0 (+ 91 main_~i~0)) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6238#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} is VALID [2022-04-28 09:47:08,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {6238#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6242#(and (= (+ 90 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 14))} is VALID [2022-04-28 09:47:08,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {6242#(and (= (+ 90 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6246#(and (= 14 (+ (- 2) main_~i~0)) (= (+ 88 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-28 09:47:08,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {6246#(and (= 14 (+ (- 2) main_~i~0)) (= (+ 88 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6250#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 88 (* main_~i~0 2))) (= 14 (+ (- 2) main_~i~0)) (<= main_~i~0 main_~n~0))} is VALID [2022-04-28 09:47:08,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {6250#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 88 (* main_~i~0 2))) (= 14 (+ (- 2) main_~i~0)) (<= main_~i~0 main_~n~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6254#(and (<= 16 main_~n~0) (= 120 (+ (- 16) main_~sum~0)) (<= main_~i~0 17))} is VALID [2022-04-28 09:47:08,335 INFO L290 TraceCheckUtils]: 39: Hoare triple {6254#(and (<= 16 main_~n~0) (= 120 (+ (- 16) main_~sum~0)) (<= main_~i~0 17))} assume !(~i~0 <= ~n~0); {6258#(and (< main_~n~0 17) (<= 16 main_~n~0) (= 120 (+ (- 16) main_~sum~0)))} is VALID [2022-04-28 09:47:08,336 INFO L272 TraceCheckUtils]: 40: Hoare triple {6258#(and (< main_~n~0 17) (<= 16 main_~n~0) (= 120 (+ (- 16) main_~sum~0)))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {6262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:47:08,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {6262#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:47:08,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {6266#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6104#false} is VALID [2022-04-28 09:47:08,337 INFO L290 TraceCheckUtils]: 43: Hoare triple {6104#false} assume !false; {6104#false} is VALID [2022-04-28 09:47:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:47:08,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:47:14,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {6104#false} assume !false; {6104#false} is VALID [2022-04-28 09:47:14,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {6266#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6104#false} is VALID [2022-04-28 09:47:14,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {6262#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:47:14,222 INFO L272 TraceCheckUtils]: 40: Hoare triple {6282#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {6262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:47:14,222 INFO L290 TraceCheckUtils]: 39: Hoare triple {6286#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {6282#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:47:14,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {6290#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6286#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:47:14,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6290#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:47:14,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:14,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:14,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:14,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:14,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:14,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:14,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:14,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:14,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:14,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:14,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:14,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:14,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:14,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:14,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:14,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:14,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:14,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:14,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:14,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:14,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:14,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:14,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:14,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:14,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:14,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:14,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:14,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:14,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:14,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:14,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {6103#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:14,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {6103#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6103#true} is VALID [2022-04-28 09:47:14,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {6103#true} call #t~ret3 := main(); {6103#true} is VALID [2022-04-28 09:47:14,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6103#true} {6103#true} #55#return; {6103#true} is VALID [2022-04-28 09:47:14,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {6103#true} assume true; {6103#true} is VALID [2022-04-28 09:47:14,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {6103#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(9, 2); {6103#true} is VALID [2022-04-28 09:47:14,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {6103#true} call ULTIMATE.init(); {6103#true} is VALID [2022-04-28 09:47:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-04-28 09:47:14,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:47:14,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001909977] [2022-04-28 09:47:14,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:47:14,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333008598] [2022-04-28 09:47:14,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333008598] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:47:14,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:47:14,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 9] total 43 [2022-04-28 09:47:14,349 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:47:14,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [765299708] [2022-04-28 09:47:14,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [765299708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:14,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:47:14,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 09:47:14,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148699530] [2022-04-28 09:47:14,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:47:14,350 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 09:47:14,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:47:14,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:14,398 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 09:47:14,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 09:47:14,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:14,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 09:47:14,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1681, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 09:47:14,400 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:16,787 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 09:47:16,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 09:47:16,787 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 09:47:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:47:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-28 09:47:16,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-28 09:47:16,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 52 transitions. [2022-04-28 09:47:16,851 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 09:47:16,851 INFO L225 Difference]: With dead ends: 52 [2022-04-28 09:47:16,851 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 09:47:16,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 16 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=136, Invalid=1844, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 09:47:16,852 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:47:16,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 265 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 09:47:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 09:47:16,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 09:47:16,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:47:16,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:16,896 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:16,896 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:16,897 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 09:47:16,897 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 09:47:16,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:16,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:16,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-28 09:47:16,898 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-28 09:47:16,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:16,898 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 09:47:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 09:47:16,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:16,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:16,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:47:16,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:47:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-28 09:47:16,899 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2022-04-28 09:47:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:47:16,900 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-28 09:47:16,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:16,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-28 09:47:16,969 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 09:47:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 09:47:16,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 09:47:16,969 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:47:16,970 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:47:16,987 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 09:47:17,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 09:47:17,172 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:47:17,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:47:17,172 INFO L85 PathProgramCache]: Analyzing trace with hash -95181677, now seen corresponding path program 33 times [2022-04-28 09:47:17,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:17,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [767215789] [2022-04-28 09:47:17,175 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:47:17,175 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:47:17,175 INFO L85 PathProgramCache]: Analyzing trace with hash -95181677, now seen corresponding path program 34 times [2022-04-28 09:47:17,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:47:17,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611924765] [2022-04-28 09:47:17,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:47:17,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:47:17,190 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:47:17,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229068897] [2022-04-28 09:47:17,190 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:47:17,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:47:17,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:47:17,192 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 09:47:17,220 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 09:47:17,250 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:47:17,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:47:17,252 WARN L261 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-28 09:47:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:17,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:47:18,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {6705#true} call ULTIMATE.init(); {6705#true} is VALID [2022-04-28 09:47:18,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {6705#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(9, 2); {6705#true} is VALID [2022-04-28 09:47:18,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {6705#true} assume true; {6705#true} is VALID [2022-04-28 09:47:18,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6705#true} {6705#true} #55#return; {6705#true} is VALID [2022-04-28 09:47:18,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {6705#true} call #t~ret3 := main(); {6705#true} is VALID [2022-04-28 09:47:18,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {6705#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6705#true} is VALID [2022-04-28 09:47:18,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {6705#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {6728#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:47:18,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {6728#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6732#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:47:18,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {6732#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6736#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} is VALID [2022-04-28 09:47:18,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {6736#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6740#(and (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} is VALID [2022-04-28 09:47:18,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {6740#(and (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6744#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 1) (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 2)))} is VALID [2022-04-28 09:47:18,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {6744#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 1) (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 2)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6748#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:47:18,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {6748#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6752#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-28 09:47:18,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {6752#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6756#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2022-04-28 09:47:18,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {6756#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6760#(and (= (+ 5 main_~i~0) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-28 09:47:18,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {6760#(and (= (+ 5 main_~i~0) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6764#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-28 09:47:18,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {6764#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6768#(and (= main_~i~0 6) (= main_~sum~0 15))} is VALID [2022-04-28 09:47:18,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {6768#(and (= main_~i~0 6) (= main_~sum~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6772#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} is VALID [2022-04-28 09:47:18,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {6772#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6776#(and (= 7 main_~i~0) (= main_~sum~0 21))} is VALID [2022-04-28 09:47:18,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {6776#(and (= 7 main_~i~0) (= main_~sum~0 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6780#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} is VALID [2022-04-28 09:47:18,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {6780#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6784#(and (= 7 (+ main_~sum~0 (- 21))) (= (+ (- 20) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:47:18,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {6784#(and (= 7 (+ main_~sum~0 (- 21))) (= (+ (- 20) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6788#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} is VALID [2022-04-28 09:47:18,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {6788#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6792#(and (= main_~sum~0 36) (= main_~i~0 9))} is VALID [2022-04-28 09:47:18,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {6792#(and (= main_~sum~0 36) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6796#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-28 09:47:18,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {6796#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6800#(and (= (+ (- 1) main_~i~0) 9) (= (+ 35 main_~i~0) main_~sum~0))} is VALID [2022-04-28 09:47:18,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {6800#(and (= (+ (- 1) main_~i~0) 9) (= (+ 35 main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6804#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} is VALID [2022-04-28 09:47:18,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {6804#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6808#(and (= 9 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 33 (* main_~i~0 2))))} is VALID [2022-04-28 09:47:18,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {6808#(and (= 9 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 33 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6812#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 33 (* main_~i~0 2))) (= 9 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:47:18,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {6812#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 33 (* main_~i~0 2))) (= 9 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6816#(and (= (+ 31 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 9))} is VALID [2022-04-28 09:47:18,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {6816#(and (= (+ 31 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6820#(and (= main_~sum~0 (+ 30 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 9))} is VALID [2022-04-28 09:47:18,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {6820#(and (= main_~sum~0 (+ 30 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6824#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2022-04-28 09:47:18,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {6824#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6828#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2022-04-28 09:47:18,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {6828#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6832#(and (= 13 (+ main_~sum~0 (- 78))) (= (+ (- 77) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:47:18,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {6832#(and (= 13 (+ main_~sum~0 (- 78))) (= (+ (- 77) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6836#(and (= main_~sum~0 (+ 77 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 13))} is VALID [2022-04-28 09:47:18,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {6836#(and (= main_~sum~0 (+ 77 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6840#(and (= main_~i~0 15) (= main_~sum~0 105))} is VALID [2022-04-28 09:47:18,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {6840#(and (= main_~i~0 15) (= main_~sum~0 105))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6844#(and (= main_~i~0 15) (= (+ (* (- 1) main_~i~0) main_~sum~0) 105))} is VALID [2022-04-28 09:47:18,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {6844#(and (= main_~i~0 15) (= (+ (* (- 1) main_~i~0) main_~sum~0) 105))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6848#(and (= main_~i~0 16) (= (+ (- 15) main_~sum~0) 105))} is VALID [2022-04-28 09:47:18,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {6848#(and (= main_~i~0 16) (= (+ (- 15) main_~sum~0) 105))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6852#(and (= main_~i~0 16) (= (+ (* (- 1) main_~i~0) (- 15) main_~sum~0) 105))} is VALID [2022-04-28 09:47:18,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {6852#(and (= main_~i~0 16) (= (+ (* (- 1) main_~i~0) (- 15) main_~sum~0) 105))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6856#(and (= main_~i~0 (+ main_~sum~0 (- 119))) (= 16 (+ (- 120) main_~sum~0)))} is VALID [2022-04-28 09:47:18,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {6856#(and (= main_~i~0 (+ main_~sum~0 (- 119))) (= 16 (+ (- 120) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6860#(and (= (+ (* (- 1) main_~i~0) (- 120) main_~sum~0) 16) (<= main_~i~0 main_~n~0) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 119))))} is VALID [2022-04-28 09:47:18,443 INFO L290 TraceCheckUtils]: 40: Hoare triple {6860#(and (= (+ (* (- 1) main_~i~0) (- 120) main_~sum~0) 16) (<= main_~i~0 main_~n~0) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 119))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6864#(and (<= (+ main_~i~0 135) main_~sum~0) (<= main_~sum~0 (+ main_~n~0 136)) (= (+ main_~sum~0 (- 136)) 17))} is VALID [2022-04-28 09:47:18,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {6864#(and (<= (+ main_~i~0 135) main_~sum~0) (<= main_~sum~0 (+ main_~n~0 136)) (= (+ main_~sum~0 (- 136)) 17))} assume !(~i~0 <= ~n~0); {6868#(and (<= main_~sum~0 (+ main_~n~0 136)) (= (+ main_~sum~0 (- 136)) 17) (< (+ main_~n~0 135) main_~sum~0))} is VALID [2022-04-28 09:47:18,446 INFO L272 TraceCheckUtils]: 42: Hoare triple {6868#(and (<= main_~sum~0 (+ main_~n~0 136)) (= (+ main_~sum~0 (- 136)) 17) (< (+ main_~n~0 135) main_~sum~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {6872#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:47:18,446 INFO L290 TraceCheckUtils]: 43: Hoare triple {6872#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6876#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:47:18,446 INFO L290 TraceCheckUtils]: 44: Hoare triple {6876#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6706#false} is VALID [2022-04-28 09:47:18,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {6706#false} assume !false; {6706#false} is VALID [2022-04-28 09:47:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:47:18,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:47:27,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {6706#false} assume !false; {6706#false} is VALID [2022-04-28 09:47:27,013 INFO L290 TraceCheckUtils]: 44: Hoare triple {6876#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6706#false} is VALID [2022-04-28 09:47:27,014 INFO L290 TraceCheckUtils]: 43: Hoare triple {6872#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6876#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:47:27,014 INFO L272 TraceCheckUtils]: 42: Hoare triple {6892#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {6872#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:47:27,015 INFO L290 TraceCheckUtils]: 41: Hoare triple {6896#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {6892#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:47:27,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {6900#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6896#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:47:27,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6900#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:47:27,020 INFO L290 TraceCheckUtils]: 38: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:27,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:27,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:27,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:27,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:27,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:27,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:27,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:27,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:27,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:27,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:27,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:27,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:27,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:27,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:27,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:27,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {6705#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:27,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {6705#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6705#true} is VALID [2022-04-28 09:47:27,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {6705#true} call #t~ret3 := main(); {6705#true} is VALID [2022-04-28 09:47:27,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6705#true} {6705#true} #55#return; {6705#true} is VALID [2022-04-28 09:47:27,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {6705#true} assume true; {6705#true} is VALID [2022-04-28 09:47:27,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {6705#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(9, 2); {6705#true} is VALID [2022-04-28 09:47:27,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {6705#true} call ULTIMATE.init(); {6705#true} is VALID [2022-04-28 09:47:27,185 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-04-28 09:47:27,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:47:27,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611924765] [2022-04-28 09:47:27,185 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:47:27,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229068897] [2022-04-28 09:47:27,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229068897] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:47:27,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:47:27,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 9] total 45 [2022-04-28 09:47:27,186 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:47:27,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [767215789] [2022-04-28 09:47:27,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [767215789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:27,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:47:27,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 09:47:27,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992039645] [2022-04-28 09:47:27,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:47:27,187 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-28 09:47:27,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:47:27,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:27,247 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 09:47:27,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 09:47:27,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:27,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 09:47:27,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1849, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 09:47:27,248 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:30,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:30,053 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 09:47:30,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 09:47:30,053 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-28 09:47:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:47:30,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:30,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-28 09:47:30,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-28 09:47:30,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 54 transitions. [2022-04-28 09:47:30,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:47:30,132 INFO L225 Difference]: With dead ends: 54 [2022-04-28 09:47:30,133 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 09:47:30,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 17 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=142, Invalid=2020, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 09:47:30,136 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:47:30,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 272 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 09:47:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 09:47:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-28 09:47:30,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:47:30,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:30,175 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:30,175 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:30,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:30,176 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 09:47:30,176 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 09:47:30,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:30,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:30,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-28 09:47:30,177 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-28 09:47:30,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:30,177 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 09:47:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 09:47:30,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:30,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:30,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:47:30,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:47:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-28 09:47:30,179 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2022-04-28 09:47:30,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:47:30,179 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-28 09:47:30,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:30,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-28 09:47:30,256 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 09:47:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 09:47:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 09:47:30,256 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:47:30,256 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:47:30,273 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 09:47:30,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 09:47:30,457 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:47:30,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:47:30,457 INFO L85 PathProgramCache]: Analyzing trace with hash -173282895, now seen corresponding path program 35 times [2022-04-28 09:47:30,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:30,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [386349179] [2022-04-28 09:47:30,460 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:47:30,460 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:47:30,460 INFO L85 PathProgramCache]: Analyzing trace with hash -173282895, now seen corresponding path program 36 times [2022-04-28 09:47:30,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:47:30,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143985490] [2022-04-28 09:47:30,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:47:30,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:47:30,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:47:30,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1626349304] [2022-04-28 09:47:30,474 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:47:30,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:47:30,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:47:30,475 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 09:47:30,496 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 09:47:30,547 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 09:47:30,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:47:30,551 WARN L261 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-28 09:47:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:30,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:47:31,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {7333#true} call ULTIMATE.init(); {7333#true} is VALID [2022-04-28 09:47:31,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {7333#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(9, 2); {7333#true} is VALID [2022-04-28 09:47:31,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {7333#true} assume true; {7333#true} is VALID [2022-04-28 09:47:31,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7333#true} {7333#true} #55#return; {7333#true} is VALID [2022-04-28 09:47:31,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {7333#true} call #t~ret3 := main(); {7333#true} is VALID [2022-04-28 09:47:31,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {7333#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7333#true} is VALID [2022-04-28 09:47:31,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {7333#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {7356#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:47:31,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {7356#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7360#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-28 09:47:31,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {7360#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7364#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} is VALID [2022-04-28 09:47:31,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {7364#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7368#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} is VALID [2022-04-28 09:47:31,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {7368#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7372#(and (= main_~i~0 3) (= (+ main_~sum~0 (- 3)) 0))} is VALID [2022-04-28 09:47:31,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {7372#(and (= main_~i~0 3) (= (+ main_~sum~0 (- 3)) 0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7376#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 0) (= main_~i~0 3))} is VALID [2022-04-28 09:47:31,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {7376#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 0) (= main_~i~0 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7380#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:47:31,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {7380#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7384#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2022-04-28 09:47:31,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {7384#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7388#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-28 09:47:31,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {7388#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7392#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} is VALID [2022-04-28 09:47:31,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {7392#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7396#(and (= (+ (- 1) main_~i~0) 5) (= 10 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-28 09:47:31,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {7396#(and (= (+ (- 1) main_~i~0) 5) (= 10 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7400#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} is VALID [2022-04-28 09:47:31,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {7400#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7404#(and (= 7 main_~i~0) (= main_~sum~0 21))} is VALID [2022-04-28 09:47:31,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {7404#(and (= 7 main_~i~0) (= main_~sum~0 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7408#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} is VALID [2022-04-28 09:47:31,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {7408#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7412#(and (= 7 (+ main_~sum~0 (- 21))) (= (+ (- 20) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:47:31,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {7412#(and (= 7 (+ main_~sum~0 (- 21))) (= (+ (- 20) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7416#(and (= main_~i~0 (+ (- 20) (* (- 1) main_~i~0) main_~sum~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 21)) 7))} is VALID [2022-04-28 09:47:31,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {7416#(and (= main_~i~0 (+ (- 20) (* (- 1) main_~i~0) main_~sum~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 21)) 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7420#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 19)) (+ (- 1) main_~i~0)) (= 7 (+ (- 20) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:47:31,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {7420#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 19)) (+ (- 1) main_~i~0)) (= 7 (+ (- 20) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7424#(and (= main_~sum~0 (+ (* main_~i~0 2) 27)) (= (+ (- 1) main_~i~0) 8))} is VALID [2022-04-28 09:47:31,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {7424#(and (= main_~sum~0 (+ (* main_~i~0 2) 27)) (= (+ (- 1) main_~i~0) 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7428#(and (= main_~i~0 10) (= main_~sum~0 45))} is VALID [2022-04-28 09:47:31,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {7428#(and (= main_~i~0 10) (= main_~sum~0 45))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7432#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} is VALID [2022-04-28 09:47:31,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {7432#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7436#(and (= (+ 44 main_~i~0) main_~sum~0) (= (+ (- 1) main_~i~0) 10))} is VALID [2022-04-28 09:47:31,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {7436#(and (= (+ 44 main_~i~0) main_~sum~0) (= (+ (- 1) main_~i~0) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7440#(and (= (+ (- 1) main_~i~0) 10) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 44 main_~i~0)))} is VALID [2022-04-28 09:47:31,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {7440#(and (= (+ (- 1) main_~i~0) 10) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 44 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7444#(and (= main_~i~0 12) (= 55 (+ (- 11) main_~sum~0)))} is VALID [2022-04-28 09:47:31,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {7444#(and (= main_~i~0 12) (= 55 (+ (- 11) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7448#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} is VALID [2022-04-28 09:47:31,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {7448#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7452#(and (= (+ (- 1) main_~i~0) 12) (= main_~sum~0 (+ main_~i~0 65)))} is VALID [2022-04-28 09:47:31,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {7452#(and (= (+ (- 1) main_~i~0) 12) (= main_~sum~0 (+ main_~i~0 65)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7456#(and (= (+ (- 1) main_~i~0) 12) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 65)))} is VALID [2022-04-28 09:47:31,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {7456#(and (= (+ (- 1) main_~i~0) 12) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 65)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7460#(and (= (+ (- 13) main_~sum~0) 78) (= main_~i~0 14))} is VALID [2022-04-28 09:47:31,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {7460#(and (= (+ (- 13) main_~sum~0) 78) (= main_~i~0 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7464#(and (= (+ (* (- 1) main_~i~0) (- 13) main_~sum~0) 78) (= main_~i~0 14))} is VALID [2022-04-28 09:47:31,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {7464#(and (= (+ (* (- 1) main_~i~0) (- 13) main_~sum~0) 78) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7468#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} is VALID [2022-04-28 09:47:31,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {7468#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7472#(and (= 14 (+ (* (- 1) main_~i~0) main_~sum~0 (- 91))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 90))))} is VALID [2022-04-28 09:47:31,910 INFO L290 TraceCheckUtils]: 36: Hoare triple {7472#(and (= 14 (+ (* (- 1) main_~i~0) main_~sum~0 (- 91))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 90))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7476#(and (= 14 (+ (* (- 1) main_~i~0) main_~sum~0 (- 90))) (= (+ (- 89) (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)))} is VALID [2022-04-28 09:47:31,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {7476#(and (= 14 (+ (* (- 1) main_~i~0) main_~sum~0 (- 90))) (= (+ (- 89) (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7480#(and (= 14 (+ (- 2) main_~i~0)) (= (+ 88 (* main_~i~0 3)) main_~sum~0))} is VALID [2022-04-28 09:47:31,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {7480#(and (= 14 (+ (- 2) main_~i~0)) (= (+ 88 (* main_~i~0 3)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7484#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2022-04-28 09:47:31,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {7484#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7488#(and (= main_~i~0 17) (= main_~sum~0 (+ main_~i~0 136)))} is VALID [2022-04-28 09:47:31,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {7488#(and (= main_~i~0 17) (= main_~sum~0 (+ main_~i~0 136)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7492#(and (= (+ main_~sum~0 (- 136)) 17) (= main_~i~0 (+ main_~sum~0 (- 135))))} is VALID [2022-04-28 09:47:31,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {7492#(and (= (+ main_~sum~0 (- 136)) 17) (= main_~i~0 (+ main_~sum~0 (- 135))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7496#(and (= 17 (+ (* (- 1) main_~i~0) main_~sum~0 (- 136))) (<= main_~i~0 main_~n~0) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 135))))} is VALID [2022-04-28 09:47:31,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {7496#(and (= 17 (+ (* (- 1) main_~i~0) main_~sum~0 (- 136))) (<= main_~i~0 main_~n~0) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 135))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7500#(and (<= (+ 152 main_~i~0) main_~sum~0) (= (+ (- 153) main_~sum~0) 18) (<= main_~sum~0 (+ 153 main_~n~0)))} is VALID [2022-04-28 09:47:31,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {7500#(and (<= (+ 152 main_~i~0) main_~sum~0) (= (+ (- 153) main_~sum~0) 18) (<= main_~sum~0 (+ 153 main_~n~0)))} assume !(~i~0 <= ~n~0); {7504#(and (= (+ (- 153) main_~sum~0) 18) (<= main_~sum~0 (+ 153 main_~n~0)) (< (+ 152 main_~n~0) main_~sum~0))} is VALID [2022-04-28 09:47:31,918 INFO L272 TraceCheckUtils]: 44: Hoare triple {7504#(and (= (+ (- 153) main_~sum~0) 18) (<= main_~sum~0 (+ 153 main_~n~0)) (< (+ 152 main_~n~0) main_~sum~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {7508#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:47:31,919 INFO L290 TraceCheckUtils]: 45: Hoare triple {7508#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7512#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:47:31,919 INFO L290 TraceCheckUtils]: 46: Hoare triple {7512#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7334#false} is VALID [2022-04-28 09:47:31,919 INFO L290 TraceCheckUtils]: 47: Hoare triple {7334#false} assume !false; {7334#false} is VALID [2022-04-28 09:47:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:47:31,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:47:41,475 INFO L290 TraceCheckUtils]: 47: Hoare triple {7334#false} assume !false; {7334#false} is VALID [2022-04-28 09:47:41,476 INFO L290 TraceCheckUtils]: 46: Hoare triple {7512#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7334#false} is VALID [2022-04-28 09:47:41,476 INFO L290 TraceCheckUtils]: 45: Hoare triple {7508#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7512#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:47:41,477 INFO L272 TraceCheckUtils]: 44: Hoare triple {7528#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {7508#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:47:41,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {7532#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {7528#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:47:41,480 INFO L290 TraceCheckUtils]: 42: Hoare triple {7536#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7532#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:47:41,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7536#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:47:41,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,502 INFO L290 TraceCheckUtils]: 37: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:41,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {7333#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:41,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {7333#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7333#true} is VALID [2022-04-28 09:47:41,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {7333#true} call #t~ret3 := main(); {7333#true} is VALID [2022-04-28 09:47:41,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7333#true} {7333#true} #55#return; {7333#true} is VALID [2022-04-28 09:47:41,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {7333#true} assume true; {7333#true} is VALID [2022-04-28 09:47:41,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {7333#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(9, 2); {7333#true} is VALID [2022-04-28 09:47:41,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {7333#true} call ULTIMATE.init(); {7333#true} is VALID [2022-04-28 09:47:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-28 09:47:41,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:47:41,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143985490] [2022-04-28 09:47:41,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:47:41,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626349304] [2022-04-28 09:47:41,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626349304] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:47:41,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:47:41,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 9] total 47 [2022-04-28 09:47:41,659 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:47:41,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [386349179] [2022-04-28 09:47:41,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [386349179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:41,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:47:41,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 09:47:41,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441965089] [2022-04-28 09:47:41,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:47:41,660 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-28 09:47:41,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:47:41,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:41,720 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 09:47:41,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 09:47:41,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:41,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 09:47:41,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2025, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 09:47:41,721 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:45,236 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 09:47:45,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 09:47:45,237 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-28 09:47:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:47:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-28 09:47:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-28 09:47:45,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 56 transitions. [2022-04-28 09:47:45,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:47:45,319 INFO L225 Difference]: With dead ends: 56 [2022-04-28 09:47:45,319 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 09:47:45,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 32 SyntacticMatches, 18 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=148, Invalid=2204, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 09:47:45,320 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 09:47:45,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 286 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 09:47:45,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 09:47:45,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 09:47:45,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:47:45,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:45,355 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:45,355 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:45,356 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 09:47:45,356 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 09:47:45,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:45,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:45,357 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 09:47:45,357 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 09:47:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:45,358 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 09:47:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 09:47:45,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:45,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:45,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:47:45,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:47:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-28 09:47:45,359 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2022-04-28 09:47:45,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:47:45,359 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-28 09:47:45,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:45,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-28 09:47:45,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:47:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 09:47:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 09:47:45,436 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:47:45,436 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:47:45,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-28 09:47:45,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:47:45,636 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:47:45,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:47:45,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2080857935, now seen corresponding path program 37 times [2022-04-28 09:47:45,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:45,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [715867985] [2022-04-28 09:47:45,639 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:47:45,639 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:47:45,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2080857935, now seen corresponding path program 38 times [2022-04-28 09:47:45,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:47:45,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046549545] [2022-04-28 09:47:45,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:47:45,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:47:45,653 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:47:45,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2125759357] [2022-04-28 09:47:45,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:47:45,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:47:45,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:47:45,654 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 09:47:45,686 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 09:47:45,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:47:45,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:47:45,727 WARN L261 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 84 conjunts are in the unsatisfiable core [2022-04-28 09:47:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:45,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:47:46,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {7987#true} call ULTIMATE.init(); {7987#true} is VALID [2022-04-28 09:47:46,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {7987#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(9, 2); {7987#true} is VALID [2022-04-28 09:47:46,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {7987#true} assume true; {7987#true} is VALID [2022-04-28 09:47:46,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7987#true} {7987#true} #55#return; {7987#true} is VALID [2022-04-28 09:47:46,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {7987#true} call #t~ret3 := main(); {7987#true} is VALID [2022-04-28 09:47:46,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {7987#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7987#true} is VALID [2022-04-28 09:47:46,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {7987#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {8010#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:47:46,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {8010#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8014#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:47:46,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {8014#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8018#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-28 09:47:46,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {8018#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8022#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:47:46,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {8022#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8026#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} is VALID [2022-04-28 09:47:46,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {8026#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8030#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} is VALID [2022-04-28 09:47:46,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {8030#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8034#(and (= main_~sum~0 (+ main_~i~0 2)) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-28 09:47:46,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {8034#(and (= main_~sum~0 (+ main_~i~0 2)) (= (+ (- 1) main_~i~0) 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8038#(and (= main_~sum~0 (+ 2 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-28 09:47:46,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {8038#(and (= main_~sum~0 (+ 2 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8042#(and (= main_~sum~0 (* main_~i~0 2)) (= 3 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:47:46,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {8042#(and (= main_~sum~0 (* main_~i~0 2)) (= 3 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8046#(and (= main_~sum~0 (* main_~i~0 3)) (= 3 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:47:46,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {8046#(and (= main_~sum~0 (* main_~i~0 3)) (= 3 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8050#(and (= (+ main_~i~0 (- 3)) 3) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} is VALID [2022-04-28 09:47:46,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {8050#(and (= (+ main_~i~0 (- 3)) 3) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8054#(and (= main_~sum~0 (+ (- 3) (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 3))} is VALID [2022-04-28 09:47:46,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {8054#(and (= main_~sum~0 (+ (- 3) (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8058#(and (= main_~sum~0 (+ (- 7) (* main_~i~0 4))) (= 3 (+ main_~i~0 (- 4))))} is VALID [2022-04-28 09:47:46,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {8058#(and (= main_~sum~0 (+ (- 7) (* main_~i~0 4))) (= 3 (+ main_~i~0 (- 4))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8062#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 7) (* main_~i~0 4))) (= 3 (+ main_~i~0 (- 4))))} is VALID [2022-04-28 09:47:46,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {8062#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 7) (* main_~i~0 4))) (= 3 (+ main_~i~0 (- 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8066#(and (= (+ main_~sum~0 (- 7)) 21) (= main_~i~0 8))} is VALID [2022-04-28 09:47:46,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {8066#(and (= (+ main_~sum~0 (- 7)) 21) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8070#(and (= 21 (+ (* (- 1) main_~i~0) main_~sum~0 (- 7))) (= main_~i~0 8))} is VALID [2022-04-28 09:47:46,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {8070#(and (= 21 (+ (* (- 1) main_~i~0) main_~sum~0 (- 7))) (= main_~i~0 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8074#(and (= 21 (+ (- 15) main_~sum~0)) (= main_~i~0 9))} is VALID [2022-04-28 09:47:46,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {8074#(and (= 21 (+ (- 15) main_~sum~0)) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8078#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-28 09:47:46,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {8078#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8082#(and (= main_~i~0 10) (= main_~sum~0 45))} is VALID [2022-04-28 09:47:46,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {8082#(and (= main_~i~0 10) (= main_~sum~0 45))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8086#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 45) (= main_~i~0 10))} is VALID [2022-04-28 09:47:46,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {8086#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 45) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8090#(and (= main_~i~0 11) (= 45 (+ main_~sum~0 (- 10))))} is VALID [2022-04-28 09:47:46,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {8090#(and (= main_~i~0 11) (= 45 (+ main_~sum~0 (- 10))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8094#(and (= main_~i~0 11) (= main_~sum~0 (+ main_~i~0 55)))} is VALID [2022-04-28 09:47:46,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {8094#(and (= main_~i~0 11) (= main_~sum~0 (+ main_~i~0 55)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8098#(and (= main_~sum~0 (+ main_~i~0 54)) (= (+ (- 1) main_~i~0) 11))} is VALID [2022-04-28 09:47:47,000 INFO L290 TraceCheckUtils]: 29: Hoare triple {8098#(and (= main_~sum~0 (+ main_~i~0 54)) (= (+ (- 1) main_~i~0) 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8102#(and (= (+ (- 1) main_~i~0) 11) (= (+ (* main_~i~0 2) 54) main_~sum~0))} is VALID [2022-04-28 09:47:47,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {8102#(and (= (+ (- 1) main_~i~0) 11) (= (+ (* main_~i~0 2) 54) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8106#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2022-04-28 09:47:47,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {8106#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8110#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2022-04-28 09:47:47,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {8110#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8114#(and (= (+ (- 1) main_~i~0) 13) (= main_~sum~0 (+ 77 main_~i~0)))} is VALID [2022-04-28 09:47:47,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {8114#(and (= (+ (- 1) main_~i~0) 13) (= main_~sum~0 (+ 77 main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8118#(and (= (+ (- 1) main_~i~0) 13) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 77 main_~i~0)))} is VALID [2022-04-28 09:47:47,002 INFO L290 TraceCheckUtils]: 34: Hoare triple {8118#(and (= (+ (- 1) main_~i~0) 13) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 77 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8122#(and (= main_~i~0 15) (= 91 (+ (- 14) main_~sum~0)))} is VALID [2022-04-28 09:47:47,002 INFO L290 TraceCheckUtils]: 35: Hoare triple {8122#(and (= main_~i~0 15) (= 91 (+ (- 14) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8126#(and (= main_~i~0 15) (= 91 (+ (- 14) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:47:47,003 INFO L290 TraceCheckUtils]: 36: Hoare triple {8126#(and (= main_~i~0 15) (= 91 (+ (- 14) (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8130#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} is VALID [2022-04-28 09:47:47,003 INFO L290 TraceCheckUtils]: 37: Hoare triple {8130#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8134#(and (= main_~sum~0 (+ 104 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 15))} is VALID [2022-04-28 09:47:47,004 INFO L290 TraceCheckUtils]: 38: Hoare triple {8134#(and (= main_~sum~0 (+ 104 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8138#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-28 09:47:47,004 INFO L290 TraceCheckUtils]: 39: Hoare triple {8138#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8142#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:47:47,005 INFO L290 TraceCheckUtils]: 40: Hoare triple {8142#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8146#(and (= (+ (* main_~i~0 2) 100) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 15))} is VALID [2022-04-28 09:47:47,005 INFO L290 TraceCheckUtils]: 41: Hoare triple {8146#(and (= (+ (* main_~i~0 2) 100) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8150#(and (= (+ main_~i~0 (- 3)) 15) (= (+ (* main_~i~0 2) 100) (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} is VALID [2022-04-28 09:47:47,005 INFO L290 TraceCheckUtils]: 42: Hoare triple {8150#(and (= (+ main_~i~0 (- 3)) 15) (= (+ (* main_~i~0 2) 100) (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8154#(and (= 15 (+ main_~i~0 (- 4))) (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) (+ 98 (* main_~i~0 2))))} is VALID [2022-04-28 09:47:47,006 INFO L290 TraceCheckUtils]: 43: Hoare triple {8154#(and (= 15 (+ main_~i~0 (- 4))) (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) (+ 98 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8158#(and (= 15 (+ main_~i~0 (- 4))) (<= main_~i~0 main_~n~0) (= (+ (* 5 main_~i~0) 95) main_~sum~0))} is VALID [2022-04-28 09:47:47,006 INFO L290 TraceCheckUtils]: 44: Hoare triple {8158#(and (= 15 (+ main_~i~0 (- 4))) (<= main_~i~0 main_~n~0) (= (+ (* 5 main_~i~0) 95) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8162#(and (<= 19 main_~n~0) (= 190 main_~sum~0) (<= main_~i~0 20))} is VALID [2022-04-28 09:47:47,007 INFO L290 TraceCheckUtils]: 45: Hoare triple {8162#(and (<= 19 main_~n~0) (= 190 main_~sum~0) (<= main_~i~0 20))} assume !(~i~0 <= ~n~0); {8166#(and (<= 19 main_~n~0) (= 190 main_~sum~0) (< main_~n~0 20))} is VALID [2022-04-28 09:47:47,008 INFO L272 TraceCheckUtils]: 46: Hoare triple {8166#(and (<= 19 main_~n~0) (= 190 main_~sum~0) (< main_~n~0 20))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {8170#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:47:47,008 INFO L290 TraceCheckUtils]: 47: Hoare triple {8170#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8174#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:47:47,009 INFO L290 TraceCheckUtils]: 48: Hoare triple {8174#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7988#false} is VALID [2022-04-28 09:47:47,009 INFO L290 TraceCheckUtils]: 49: Hoare triple {7988#false} assume !false; {7988#false} is VALID [2022-04-28 09:47:47,009 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:47:47,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:47:56,047 INFO L290 TraceCheckUtils]: 49: Hoare triple {7988#false} assume !false; {7988#false} is VALID [2022-04-28 09:47:56,047 INFO L290 TraceCheckUtils]: 48: Hoare triple {8174#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7988#false} is VALID [2022-04-28 09:47:56,048 INFO L290 TraceCheckUtils]: 47: Hoare triple {8170#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8174#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:47:56,048 INFO L272 TraceCheckUtils]: 46: Hoare triple {8190#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {8170#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:47:56,049 INFO L290 TraceCheckUtils]: 45: Hoare triple {8194#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {8190#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:47:56,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {8198#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8194#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:47:56,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8198#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:47:56,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,067 INFO L290 TraceCheckUtils]: 41: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,081 INFO L290 TraceCheckUtils]: 39: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,082 INFO L290 TraceCheckUtils]: 38: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,091 INFO L290 TraceCheckUtils]: 36: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,116 INFO L290 TraceCheckUtils]: 33: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:47:56,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {7987#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:47:56,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {7987#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7987#true} is VALID [2022-04-28 09:47:56,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {7987#true} call #t~ret3 := main(); {7987#true} is VALID [2022-04-28 09:47:56,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7987#true} {7987#true} #55#return; {7987#true} is VALID [2022-04-28 09:47:56,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {7987#true} assume true; {7987#true} is VALID [2022-04-28 09:47:56,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {7987#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(9, 2); {7987#true} is VALID [2022-04-28 09:47:56,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {7987#true} call ULTIMATE.init(); {7987#true} is VALID [2022-04-28 09:47:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-04-28 09:47:56,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:47:56,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046549545] [2022-04-28 09:47:56,259 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:47:56,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125759357] [2022-04-28 09:47:56,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125759357] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:47:56,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:47:56,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 9] total 49 [2022-04-28 09:47:56,259 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:47:56,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [715867985] [2022-04-28 09:47:56,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [715867985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:56,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:47:56,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 09:47:56,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288381723] [2022-04-28 09:47:56,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:47:56,260 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 09:47:56,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:47:56,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:47:56,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:47:56,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 09:47:56,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:56,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 09:47:56,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2209, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 09:47:56,325 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:00,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:48:00,086 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 09:48:00,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 09:48:00,087 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 09:48:00,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:48:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-28 09:48:00,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-28 09:48:00,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 58 transitions. [2022-04-28 09:48:00,176 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 09:48:00,177 INFO L225 Difference]: With dead ends: 58 [2022-04-28 09:48:00,177 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 09:48:00,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 33 SyntacticMatches, 19 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=154, Invalid=2396, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 09:48:00,178 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 1846 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:48:00,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 307 Invalid, 1847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1846 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 09:48:00,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 09:48:00,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-28 09:48:00,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:48:00,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:00,210 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:00,210 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:48:00,211 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 09:48:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 09:48:00,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:48:00,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:48:00,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 09:48:00,212 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 09:48:00,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:48:00,212 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 09:48:00,213 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 09:48:00,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:48:00,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:48:00,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:48:00,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:48:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-04-28 09:48:00,214 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2022-04-28 09:48:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:48:00,214 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-04-28 09:48:00,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:00,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2022-04-28 09:48:00,319 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 09:48:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 09:48:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 09:48:00,319 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:48:00,320 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:48:00,336 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 09:48:00,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:48:00,520 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:48:00,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:48:00,520 INFO L85 PathProgramCache]: Analyzing trace with hash -648288915, now seen corresponding path program 39 times [2022-04-28 09:48:00,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:48:00,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1200267733] [2022-04-28 09:48:00,523 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:48:00,523 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:48:00,523 INFO L85 PathProgramCache]: Analyzing trace with hash -648288915, now seen corresponding path program 40 times [2022-04-28 09:48:00,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:48:00,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743757138] [2022-04-28 09:48:00,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:48:00,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:48:00,541 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:48:00,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2101038941] [2022-04-28 09:48:00,542 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:48:00,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:48:00,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:48:00,543 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:48:00,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 09:48:00,596 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:48:00,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:48:00,598 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-28 09:48:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:00,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:48:02,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {8667#true} call ULTIMATE.init(); {8667#true} is VALID [2022-04-28 09:48:02,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {8667#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(9, 2); {8667#true} is VALID [2022-04-28 09:48:02,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {8667#true} assume true; {8667#true} is VALID [2022-04-28 09:48:02,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8667#true} {8667#true} #55#return; {8667#true} is VALID [2022-04-28 09:48:02,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {8667#true} call #t~ret3 := main(); {8667#true} is VALID [2022-04-28 09:48:02,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {8667#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8667#true} is VALID [2022-04-28 09:48:02,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {8667#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {8690#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:48:02,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {8690#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8694#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:48:02,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {8694#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8698#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2022-04-28 09:48:02,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {8698#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8702#(and (= main_~i~0 2) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} is VALID [2022-04-28 09:48:02,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {8702#(and (= main_~i~0 2) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8706#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 1) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:48:02,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {8706#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 1) (= (+ (- 1) main_~i~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8710#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 1) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:48:02,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {8710#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 1) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8714#(and (= main_~i~0 4) (= (+ main_~sum~0 (- 5)) 1))} is VALID [2022-04-28 09:48:02,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {8714#(and (= main_~i~0 4) (= (+ main_~sum~0 (- 5)) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8718#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2022-04-28 09:48:02,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {8718#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8722#(and (= (+ 5 main_~i~0) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-28 09:48:02,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {8722#(and (= (+ 5 main_~i~0) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8726#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-28 09:48:02,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {8726#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8730#(and (= (+ (- 2) main_~i~0) 4) (= main_~sum~0 (+ 3 (* main_~i~0 2))))} is VALID [2022-04-28 09:48:02,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {8730#(and (= (+ (- 2) main_~i~0) 4) (= main_~sum~0 (+ 3 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8734#(and (= (+ 3 (* main_~i~0 3)) main_~sum~0) (= (+ (- 2) main_~i~0) 4))} is VALID [2022-04-28 09:48:02,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {8734#(and (= (+ 3 (* main_~i~0 3)) main_~sum~0) (= (+ (- 2) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8738#(and (= (+ main_~i~0 (- 3)) 4) (= main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 09:48:02,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {8738#(and (= (+ main_~i~0 (- 3)) 4) (= main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8742#(and (= (+ main_~i~0 (- 3)) 4) (= (+ (* (- 1) main_~i~0) main_~sum~0) (* main_~i~0 3)))} is VALID [2022-04-28 09:48:02,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {8742#(and (= (+ main_~i~0 (- 3)) 4) (= (+ (* (- 1) main_~i~0) main_~sum~0) (* main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8746#(and (= (+ (- 3) (* main_~i~0 3)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 4)) 4))} is VALID [2022-04-28 09:48:02,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {8746#(and (= (+ (- 3) (* main_~i~0 3)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 4)) 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8750#(and (= (+ main_~i~0 (- 4)) 4) (= (+ (* 5 main_~i~0) (- 4)) main_~sum~0))} is VALID [2022-04-28 09:48:02,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {8750#(and (= (+ main_~i~0 (- 4)) 4) (= (+ (* 5 main_~i~0) (- 4)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8754#(and (= main_~sum~0 36) (= main_~i~0 9))} is VALID [2022-04-28 09:48:02,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {8754#(and (= main_~sum~0 36) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8758#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-28 09:48:02,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {8758#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8762#(and (= main_~i~0 10) (= main_~sum~0 45))} is VALID [2022-04-28 09:48:02,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {8762#(and (= main_~i~0 10) (= main_~sum~0 45))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8766#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 45) (= main_~i~0 10))} is VALID [2022-04-28 09:48:02,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {8766#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 45) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8770#(and (= (+ main_~sum~0 (- 44)) main_~i~0) (= (+ (- 45) main_~sum~0) 10))} is VALID [2022-04-28 09:48:02,034 INFO L290 TraceCheckUtils]: 27: Hoare triple {8770#(and (= (+ main_~sum~0 (- 44)) main_~i~0) (= (+ (- 45) main_~sum~0) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8774#(and (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 44))) (= (+ (* (- 1) main_~i~0) (- 45) main_~sum~0) 10))} is VALID [2022-04-28 09:48:02,037 INFO L290 TraceCheckUtils]: 28: Hoare triple {8774#(and (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 44))) (= (+ (* (- 1) main_~i~0) (- 45) main_~sum~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8778#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} is VALID [2022-04-28 09:48:02,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {8778#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8782#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 54)) main_~i~0) (= (+ (- 55) (* (- 1) main_~i~0) main_~sum~0) 11))} is VALID [2022-04-28 09:48:02,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {8782#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 54)) main_~i~0) (= (+ (- 55) (* (- 1) main_~i~0) main_~sum~0) 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8786#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} is VALID [2022-04-28 09:48:02,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {8786#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8790#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-28 09:48:02,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {8790#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8794#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 2) 63)))} is VALID [2022-04-28 09:48:02,041 INFO L290 TraceCheckUtils]: 33: Hoare triple {8794#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 2) 63)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8798#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 3) 63)))} is VALID [2022-04-28 09:48:02,041 INFO L290 TraceCheckUtils]: 34: Hoare triple {8798#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 3) 63)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8802#(and (= (+ main_~i~0 (- 3)) 12) (= main_~sum~0 (+ 60 (* main_~i~0 3))))} is VALID [2022-04-28 09:48:02,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {8802#(and (= (+ main_~i~0 (- 3)) 12) (= main_~sum~0 (+ 60 (* main_~i~0 3))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8806#(and (= main_~sum~0 (+ 60 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 12))} is VALID [2022-04-28 09:48:02,042 INFO L290 TraceCheckUtils]: 36: Hoare triple {8806#(and (= main_~sum~0 (+ 60 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8810#(and (= main_~i~0 16) (= main_~sum~0 120))} is VALID [2022-04-28 09:48:02,042 INFO L290 TraceCheckUtils]: 37: Hoare triple {8810#(and (= main_~i~0 16) (= main_~sum~0 120))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8814#(and (= main_~i~0 16) (= (+ (* (- 1) main_~i~0) main_~sum~0) 120))} is VALID [2022-04-28 09:48:02,043 INFO L290 TraceCheckUtils]: 38: Hoare triple {8814#(and (= main_~i~0 16) (= (+ (* (- 1) main_~i~0) main_~sum~0) 120))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8818#(and (= 120 (+ (- 16) main_~sum~0)) (= main_~i~0 17))} is VALID [2022-04-28 09:48:02,043 INFO L290 TraceCheckUtils]: 39: Hoare triple {8818#(and (= 120 (+ (- 16) main_~sum~0)) (= main_~i~0 17))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8822#(and (= main_~i~0 17) (= main_~sum~0 (+ main_~i~0 136)))} is VALID [2022-04-28 09:48:02,043 INFO L290 TraceCheckUtils]: 40: Hoare triple {8822#(and (= main_~i~0 17) (= main_~sum~0 (+ main_~i~0 136)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8826#(and (= 153 main_~sum~0) (= main_~i~0 18))} is VALID [2022-04-28 09:48:02,044 INFO L290 TraceCheckUtils]: 41: Hoare triple {8826#(and (= 153 main_~sum~0) (= main_~i~0 18))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8830#(and (= main_~i~0 18) (= (+ (* (- 1) main_~i~0) main_~sum~0) 153))} is VALID [2022-04-28 09:48:02,044 INFO L290 TraceCheckUtils]: 42: Hoare triple {8830#(and (= main_~i~0 18) (= (+ (* (- 1) main_~i~0) main_~sum~0) 153))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8834#(and (= 153 (+ main_~sum~0 (- 18))) (= 19 main_~i~0))} is VALID [2022-04-28 09:48:02,045 INFO L290 TraceCheckUtils]: 43: Hoare triple {8834#(and (= 153 (+ main_~sum~0 (- 18))) (= 19 main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8838#(and (= (+ 171 main_~i~0) main_~sum~0) (= 19 main_~i~0))} is VALID [2022-04-28 09:48:02,045 INFO L290 TraceCheckUtils]: 44: Hoare triple {8838#(and (= (+ 171 main_~i~0) main_~sum~0) (= 19 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8842#(and (= main_~sum~0 (+ 170 main_~i~0)) (= 19 (+ (- 1) main_~i~0)))} is VALID [2022-04-28 09:48:02,045 INFO L290 TraceCheckUtils]: 45: Hoare triple {8842#(and (= main_~sum~0 (+ 170 main_~i~0)) (= 19 (+ (- 1) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8846#(and (<= main_~i~0 main_~n~0) (= (+ 170 (* main_~i~0 2)) main_~sum~0) (= 19 (+ (- 1) main_~i~0)))} is VALID [2022-04-28 09:48:02,046 INFO L290 TraceCheckUtils]: 46: Hoare triple {8846#(and (<= main_~i~0 main_~n~0) (= (+ 170 (* main_~i~0 2)) main_~sum~0) (= 19 (+ (- 1) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8850#(and (<= 20 main_~n~0) (<= main_~i~0 21) (= main_~sum~0 210))} is VALID [2022-04-28 09:48:02,047 INFO L290 TraceCheckUtils]: 47: Hoare triple {8850#(and (<= 20 main_~n~0) (<= main_~i~0 21) (= main_~sum~0 210))} assume !(~i~0 <= ~n~0); {8854#(and (<= 20 main_~n~0) (< main_~n~0 21) (= main_~sum~0 210))} is VALID [2022-04-28 09:48:02,048 INFO L272 TraceCheckUtils]: 48: Hoare triple {8854#(and (<= 20 main_~n~0) (< main_~n~0 21) (= main_~sum~0 210))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {8858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:48:02,049 INFO L290 TraceCheckUtils]: 49: Hoare triple {8858#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:48:02,049 INFO L290 TraceCheckUtils]: 50: Hoare triple {8862#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8668#false} is VALID [2022-04-28 09:48:02,049 INFO L290 TraceCheckUtils]: 51: Hoare triple {8668#false} assume !false; {8668#false} is VALID [2022-04-28 09:48:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:48:02,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:48:12,036 INFO L290 TraceCheckUtils]: 51: Hoare triple {8668#false} assume !false; {8668#false} is VALID [2022-04-28 09:48:12,037 INFO L290 TraceCheckUtils]: 50: Hoare triple {8862#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8668#false} is VALID [2022-04-28 09:48:12,037 INFO L290 TraceCheckUtils]: 49: Hoare triple {8858#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:48:12,038 INFO L272 TraceCheckUtils]: 48: Hoare triple {8878#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {8858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:48:12,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {8882#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {8878#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:48:12,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {8886#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8882#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:48:12,044 INFO L290 TraceCheckUtils]: 45: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8886#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:48:12,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,066 INFO L290 TraceCheckUtils]: 41: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,087 INFO L290 TraceCheckUtils]: 36: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:12,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {8667#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:12,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {8667#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8667#true} is VALID [2022-04-28 09:48:12,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {8667#true} call #t~ret3 := main(); {8667#true} is VALID [2022-04-28 09:48:12,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8667#true} {8667#true} #55#return; {8667#true} is VALID [2022-04-28 09:48:12,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {8667#true} assume true; {8667#true} is VALID [2022-04-28 09:48:12,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {8667#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(9, 2); {8667#true} is VALID [2022-04-28 09:48:12,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {8667#true} call ULTIMATE.init(); {8667#true} is VALID [2022-04-28 09:48:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2022-04-28 09:48:12,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:48:12,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743757138] [2022-04-28 09:48:12,244 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:48:12,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101038941] [2022-04-28 09:48:12,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101038941] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:48:12,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:48:12,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 9] total 51 [2022-04-28 09:48:12,244 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:48:12,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1200267733] [2022-04-28 09:48:12,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1200267733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:48:12,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:48:12,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 09:48:12,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187093110] [2022-04-28 09:48:12,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:48:12,245 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-28 09:48:12,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:48:12,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:12,328 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 09:48:12,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 09:48:12,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:48:12,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 09:48:12,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2401, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 09:48:12,329 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:48:16,745 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 09:48:16,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 09:48:16,745 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-28 09:48:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:48:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-28 09:48:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:16,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-28 09:48:16,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 60 transitions. [2022-04-28 09:48:16,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:48:16,847 INFO L225 Difference]: With dead ends: 60 [2022-04-28 09:48:16,848 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 09:48:16,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 34 SyntacticMatches, 20 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=160, Invalid=2596, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 09:48:16,849 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:48:16,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 321 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 09:48:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 09:48:16,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 09:48:16,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:48:16,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:16,885 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:16,886 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:48:16,886 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-28 09:48:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 09:48:16,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:48:16,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:48:16,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 09:48:16,887 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 09:48:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:48:16,887 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-28 09:48:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 09:48:16,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:48:16,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:48:16,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:48:16,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:48:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-04-28 09:48:16,888 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2022-04-28 09:48:16,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:48:16,888 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-04-28 09:48:16,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:16,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2022-04-28 09:48:16,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:48:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 09:48:16,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 09:48:16,993 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:48:16,993 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:48:17,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 09:48:17,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:48:17,194 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:48:17,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:48:17,194 INFO L85 PathProgramCache]: Analyzing trace with hash 866606091, now seen corresponding path program 41 times [2022-04-28 09:48:17,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:48:17,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1984205452] [2022-04-28 09:48:17,197 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:48:17,197 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:48:17,197 INFO L85 PathProgramCache]: Analyzing trace with hash 866606091, now seen corresponding path program 42 times [2022-04-28 09:48:17,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:48:17,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980157888] [2022-04-28 09:48:17,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:48:17,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:48:17,216 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:48:17,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409285309] [2022-04-28 09:48:17,217 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:48:17,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:48:17,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:48:17,218 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:48:17,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 09:48:17,277 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-28 09:48:17,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:48:17,279 WARN L261 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-28 09:48:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:17,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:48:18,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {9373#true} call ULTIMATE.init(); {9373#true} is VALID [2022-04-28 09:48:18,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {9373#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(9, 2); {9373#true} is VALID [2022-04-28 09:48:18,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {9373#true} assume true; {9373#true} is VALID [2022-04-28 09:48:18,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9373#true} {9373#true} #55#return; {9373#true} is VALID [2022-04-28 09:48:18,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {9373#true} call #t~ret3 := main(); {9373#true} is VALID [2022-04-28 09:48:18,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {9373#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9373#true} is VALID [2022-04-28 09:48:18,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {9373#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {9396#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:48:18,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {9396#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9400#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:48:18,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {9400#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9404#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-28 09:48:18,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {9404#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9408#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:48:18,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {9408#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9412#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} is VALID [2022-04-28 09:48:18,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {9412#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9416#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) 1))} is VALID [2022-04-28 09:48:18,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {9416#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9420#(and (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 1) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-28 09:48:18,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {9420#(and (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 1) (= (+ (- 1) main_~i~0) 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9424#(and (= main_~sum~0 (+ 2 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-28 09:48:18,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {9424#(and (= main_~sum~0 (+ 2 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9428#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-28 09:48:18,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {9428#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9432#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} is VALID [2022-04-28 09:48:18,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {9432#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9436#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} is VALID [2022-04-28 09:48:18,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {9436#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9440#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} is VALID [2022-04-28 09:48:18,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {9440#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9444#(and (= (+ main_~i~0 14) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} is VALID [2022-04-28 09:48:18,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {9444#(and (= (+ main_~i~0 14) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9448#(and (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} is VALID [2022-04-28 09:48:18,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {9448#(and (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9452#(and (= 6 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 12 (* main_~i~0 2))))} is VALID [2022-04-28 09:48:18,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {9452#(and (= 6 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 12 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9456#(and (= (+ (* main_~i~0 3) 12) main_~sum~0) (= 6 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:48:18,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {9456#(and (= (+ (* main_~i~0 3) 12) main_~sum~0) (= 6 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9460#(and (= (+ 9 (* main_~i~0 3)) main_~sum~0) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-28 09:48:18,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {9460#(and (= (+ 9 (* main_~i~0 3)) main_~sum~0) (= (+ main_~i~0 (- 3)) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9464#(and (= main_~sum~0 (+ 9 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-28 09:48:18,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {9464#(and (= main_~sum~0 (+ 9 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9468#(and (= main_~i~0 10) (= main_~sum~0 45))} is VALID [2022-04-28 09:48:18,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {9468#(and (= main_~i~0 10) (= main_~sum~0 45))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9472#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 45) (= main_~i~0 10))} is VALID [2022-04-28 09:48:18,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {9472#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 45) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9476#(and (= main_~i~0 11) (= 45 (+ main_~sum~0 (- 10))))} is VALID [2022-04-28 09:48:18,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {9476#(and (= main_~i~0 11) (= 45 (+ main_~sum~0 (- 10))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9480#(and (= main_~i~0 11) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 10)) 45))} is VALID [2022-04-28 09:48:18,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {9480#(and (= main_~i~0 11) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 10)) 45))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9484#(and (= (+ (- 1) main_~i~0) 11) (= 45 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:48:18,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {9484#(and (= (+ (- 1) main_~i~0) 11) (= 45 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9488#(and (= (+ (- 1) main_~i~0) 11) (= (+ (- 9) main_~sum~0 (* (- 2) main_~i~0)) 45))} is VALID [2022-04-28 09:48:18,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {9488#(and (= (+ (- 1) main_~i~0) 11) (= (+ (- 9) main_~sum~0 (* (- 2) main_~i~0)) 45))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9492#(and (= 45 (+ main_~sum~0 (- 33))) (= main_~i~0 13))} is VALID [2022-04-28 09:48:18,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {9492#(and (= 45 (+ main_~sum~0 (- 33))) (= main_~i~0 13))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9496#(and (= 45 (+ (* (- 1) main_~i~0) main_~sum~0 (- 33))) (= main_~i~0 13))} is VALID [2022-04-28 09:48:18,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {9496#(and (= 45 (+ (* (- 1) main_~i~0) main_~sum~0 (- 33))) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9500#(and (= (+ (- 1) main_~i~0) 13) (= 45 (+ (* (- 1) main_~i~0) main_~sum~0 (- 32))))} is VALID [2022-04-28 09:48:18,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {9500#(and (= (+ (- 1) main_~i~0) 13) (= 45 (+ (* (- 1) main_~i~0) main_~sum~0 (- 32))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9504#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) (- 32)) 45) (= (+ (- 1) main_~i~0) 13))} is VALID [2022-04-28 09:48:18,900 INFO L290 TraceCheckUtils]: 34: Hoare triple {9504#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) (- 32)) 45) (= (+ (- 1) main_~i~0) 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9508#(and (= (+ (- 2) main_~i~0) 13) (= (+ main_~sum~0 (* (- 2) main_~i~0) (- 30)) 45))} is VALID [2022-04-28 09:48:18,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {9508#(and (= (+ (- 2) main_~i~0) 13) (= (+ main_~sum~0 (* (- 2) main_~i~0) (- 30)) 45))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9512#(and (= (+ (- 2) main_~i~0) 13) (= (+ (* main_~i~0 3) 75) main_~sum~0))} is VALID [2022-04-28 09:48:18,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {9512#(and (= (+ (- 2) main_~i~0) 13) (= (+ (* main_~i~0 3) 75) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9516#(and (= (+ main_~i~0 (- 3)) 13) (= (+ 72 (* main_~i~0 3)) main_~sum~0))} is VALID [2022-04-28 09:48:18,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {9516#(and (= (+ main_~i~0 (- 3)) 13) (= (+ 72 (* main_~i~0 3)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9520#(and (= (+ main_~i~0 (- 3)) 13) (= main_~sum~0 (+ 72 (* main_~i~0 4))))} is VALID [2022-04-28 09:48:18,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {9520#(and (= (+ main_~i~0 (- 3)) 13) (= main_~sum~0 (+ 72 (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9524#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2022-04-28 09:48:18,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {9524#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9528#(and (= main_~i~0 17) (= (+ (* (- 1) main_~i~0) main_~sum~0) 136))} is VALID [2022-04-28 09:48:18,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {9528#(and (= main_~i~0 17) (= (+ (* (- 1) main_~i~0) main_~sum~0) 136))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9532#(and (= (+ main_~sum~0 (- 136)) 17) (= main_~i~0 (+ main_~sum~0 (- 135))))} is VALID [2022-04-28 09:48:18,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {9532#(and (= (+ main_~sum~0 (- 136)) 17) (= main_~i~0 (+ main_~sum~0 (- 135))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9536#(and (= 17 (+ (* (- 1) main_~i~0) main_~sum~0 (- 136))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 135))))} is VALID [2022-04-28 09:48:18,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {9536#(and (= 17 (+ (* (- 1) main_~i~0) main_~sum~0 (- 136))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 135))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9540#(and (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) (- 134) main_~sum~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 135)) 17))} is VALID [2022-04-28 09:48:18,910 INFO L290 TraceCheckUtils]: 43: Hoare triple {9540#(and (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) (- 134) main_~sum~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 135)) 17))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9544#(and (= (+ (- 1) main_~i~0) 18) (= main_~sum~0 (+ 152 (* main_~i~0 2))))} is VALID [2022-04-28 09:48:18,911 INFO L290 TraceCheckUtils]: 44: Hoare triple {9544#(and (= (+ (- 1) main_~i~0) 18) (= main_~sum~0 (+ 152 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9548#(and (= (+ (- 2) main_~i~0) 18) (= (+ 150 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-28 09:48:18,911 INFO L290 TraceCheckUtils]: 45: Hoare triple {9548#(and (= (+ (- 2) main_~i~0) 18) (= (+ 150 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9552#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 150 (* main_~i~0 2))) (= (+ (- 2) main_~i~0) 18))} is VALID [2022-04-28 09:48:18,912 INFO L290 TraceCheckUtils]: 46: Hoare triple {9552#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 150 (* main_~i~0 2))) (= (+ (- 2) main_~i~0) 18))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9556#(and (= main_~i~0 21) (= 190 (+ (- 20) main_~sum~0)))} is VALID [2022-04-28 09:48:18,912 INFO L290 TraceCheckUtils]: 47: Hoare triple {9556#(and (= main_~i~0 21) (= 190 (+ (- 20) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9560#(and (= main_~i~0 21) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 210) main_~sum~0))} is VALID [2022-04-28 09:48:18,913 INFO L290 TraceCheckUtils]: 48: Hoare triple {9560#(and (= main_~i~0 21) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 210) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9564#(and (<= main_~sum~0 (+ main_~n~0 210)) (= (+ (- 210) main_~sum~0) 21) (<= (+ main_~i~0 209) main_~sum~0))} is VALID [2022-04-28 09:48:18,917 INFO L290 TraceCheckUtils]: 49: Hoare triple {9564#(and (<= main_~sum~0 (+ main_~n~0 210)) (= (+ (- 210) main_~sum~0) 21) (<= (+ main_~i~0 209) main_~sum~0))} assume !(~i~0 <= ~n~0); {9568#(and (<= main_~sum~0 (+ main_~n~0 210)) (= (+ (- 210) main_~sum~0) 21) (< (+ main_~n~0 209) main_~sum~0))} is VALID [2022-04-28 09:48:18,918 INFO L272 TraceCheckUtils]: 50: Hoare triple {9568#(and (<= main_~sum~0 (+ main_~n~0 210)) (= (+ (- 210) main_~sum~0) 21) (< (+ main_~n~0 209) main_~sum~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {9572#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:48:18,919 INFO L290 TraceCheckUtils]: 51: Hoare triple {9572#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9576#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:48:18,919 INFO L290 TraceCheckUtils]: 52: Hoare triple {9576#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9374#false} is VALID [2022-04-28 09:48:18,919 INFO L290 TraceCheckUtils]: 53: Hoare triple {9374#false} assume !false; {9374#false} is VALID [2022-04-28 09:48:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:48:18,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:48:30,167 INFO L290 TraceCheckUtils]: 53: Hoare triple {9374#false} assume !false; {9374#false} is VALID [2022-04-28 09:48:30,168 INFO L290 TraceCheckUtils]: 52: Hoare triple {9576#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9374#false} is VALID [2022-04-28 09:48:30,168 INFO L290 TraceCheckUtils]: 51: Hoare triple {9572#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9576#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:48:30,169 INFO L272 TraceCheckUtils]: 50: Hoare triple {9592#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {9572#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:48:30,169 INFO L290 TraceCheckUtils]: 49: Hoare triple {9596#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {9592#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:48:30,173 INFO L290 TraceCheckUtils]: 48: Hoare triple {9600#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9596#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:48:30,176 INFO L290 TraceCheckUtils]: 47: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9600#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:48:30,178 INFO L290 TraceCheckUtils]: 46: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,184 INFO L290 TraceCheckUtils]: 45: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,189 INFO L290 TraceCheckUtils]: 44: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,201 INFO L290 TraceCheckUtils]: 42: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,210 INFO L290 TraceCheckUtils]: 41: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,214 INFO L290 TraceCheckUtils]: 40: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:30,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {9373#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:30,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {9373#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9373#true} is VALID [2022-04-28 09:48:30,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {9373#true} call #t~ret3 := main(); {9373#true} is VALID [2022-04-28 09:48:30,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9373#true} {9373#true} #55#return; {9373#true} is VALID [2022-04-28 09:48:30,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {9373#true} assume true; {9373#true} is VALID [2022-04-28 09:48:30,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {9373#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(9, 2); {9373#true} is VALID [2022-04-28 09:48:30,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {9373#true} call ULTIMATE.init(); {9373#true} is VALID [2022-04-28 09:48:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-28 09:48:30,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:48:30,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980157888] [2022-04-28 09:48:30,416 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:48:30,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409285309] [2022-04-28 09:48:30,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409285309] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:48:30,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:48:30,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 9] total 53 [2022-04-28 09:48:30,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:48:30,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1984205452] [2022-04-28 09:48:30,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1984205452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:48:30,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:48:30,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 09:48:30,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941452594] [2022-04-28 09:48:30,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:48:30,417 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-28 09:48:30,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:48:30,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:30,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:48:30,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 09:48:30,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:48:30,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 09:48:30,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2601, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 09:48:30,513 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:48:36,334 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 09:48:36,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 09:48:36,334 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-28 09:48:36,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:48:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-28 09:48:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-28 09:48:36,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 62 transitions. [2022-04-28 09:48:36,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:48:36,455 INFO L225 Difference]: With dead ends: 62 [2022-04-28 09:48:36,455 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 09:48:36,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 35 SyntacticMatches, 21 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=166, Invalid=2804, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 09:48:36,456 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 2162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 09:48:36,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 328 Invalid, 2162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-28 09:48:36,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 09:48:36,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 09:48:36,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:48:36,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:36,492 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:36,493 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:48:36,493 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-28 09:48:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 09:48:36,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:48:36,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:48:36,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-28 09:48:36,494 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-28 09:48:36,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:48:36,494 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-28 09:48:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 09:48:36,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:48:36,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:48:36,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:48:36,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:48:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-04-28 09:48:36,496 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2022-04-28 09:48:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:48:36,496 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-04-28 09:48:36,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:36,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 57 transitions. [2022-04-28 09:48:36,618 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 09:48:36,619 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 09:48:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 09:48:36,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:48:36,619 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:48:36,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-28 09:48:36,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:48:36,823 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:48:36,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:48:36,824 INFO L85 PathProgramCache]: Analyzing trace with hash 686793513, now seen corresponding path program 43 times [2022-04-28 09:48:36,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:48:36,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [423324434] [2022-04-28 09:48:36,826 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:48:36,827 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:48:36,827 INFO L85 PathProgramCache]: Analyzing trace with hash 686793513, now seen corresponding path program 44 times [2022-04-28 09:48:36,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:48:36,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410308435] [2022-04-28 09:48:36,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:48:36,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:48:36,841 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:48:36,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809769774] [2022-04-28 09:48:36,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:48:36,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:48:36,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:48:36,842 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:48:36,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 09:48:36,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:48:36,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:48:36,912 WARN L261 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-28 09:48:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:36,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:48:38,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {10105#true} call ULTIMATE.init(); {10105#true} is VALID [2022-04-28 09:48:38,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {10105#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(9, 2); {10105#true} is VALID [2022-04-28 09:48:38,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {10105#true} assume true; {10105#true} is VALID [2022-04-28 09:48:38,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10105#true} {10105#true} #55#return; {10105#true} is VALID [2022-04-28 09:48:38,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {10105#true} call #t~ret3 := main(); {10105#true} is VALID [2022-04-28 09:48:38,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {10105#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10105#true} is VALID [2022-04-28 09:48:38,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {10105#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {10128#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:48:38,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {10128#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10132#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:48:38,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {10132#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10136#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-28 09:48:38,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {10136#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10140#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:48:38,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {10140#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10144#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} is VALID [2022-04-28 09:48:38,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {10144#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10148#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) 1))} is VALID [2022-04-28 09:48:38,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {10148#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10152#(and (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 1) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-28 09:48:38,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {10152#(and (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 1) (= (+ (- 1) main_~i~0) 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10156#(and (= (+ (- 1) main_~sum~0 (* (- 2) main_~i~0)) 1) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-28 09:48:38,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {10156#(and (= (+ (- 1) main_~sum~0 (* (- 2) main_~i~0)) 1) (= (+ (- 1) main_~i~0) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10160#(and (= 5 main_~i~0) (= (+ (- 9) main_~sum~0) 1))} is VALID [2022-04-28 09:48:38,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {10160#(and (= 5 main_~i~0) (= (+ (- 9) main_~sum~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10164#(and (= (+ (- 9) (* (- 1) main_~i~0) main_~sum~0) 1) (= 5 main_~i~0))} is VALID [2022-04-28 09:48:38,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {10164#(and (= (+ (- 9) (* (- 1) main_~i~0) main_~sum~0) 1) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10168#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} is VALID [2022-04-28 09:48:38,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {10168#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10172#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 10)) 5) (= main_~i~0 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:48:38,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {10172#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 10)) 5) (= main_~i~0 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10176#(and (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 (- 8))) (= 5 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:48:38,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {10176#(and (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 (- 8))) (= 5 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10180#(and (= (+ 7 (* main_~i~0 3)) main_~sum~0) (= 5 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:48:38,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {10180#(and (= (+ 7 (* main_~i~0 3)) main_~sum~0) (= 5 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10184#(and (= (+ main_~i~0 (- 3)) 5) (= main_~sum~0 (+ (* main_~i~0 3) 4)))} is VALID [2022-04-28 09:48:38,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {10184#(and (= (+ main_~i~0 (- 3)) 5) (= main_~sum~0 (+ (* main_~i~0 3) 4)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10188#(and (= (+ main_~i~0 (- 3)) 5) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 3) 4)))} is VALID [2022-04-28 09:48:38,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {10188#(and (= (+ main_~i~0 (- 3)) 5) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 3) 4)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10192#(and (= 5 (+ main_~i~0 (- 4))) (= (+ (* main_~i~0 3) 1) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-28 09:48:38,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {10192#(and (= 5 (+ main_~i~0 (- 4))) (= (+ (* main_~i~0 3) 1) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10196#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ (* main_~i~0 3) 1)) (= 5 (+ main_~i~0 (- 4))))} is VALID [2022-04-28 09:48:38,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {10196#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ (* main_~i~0 3) 1)) (= 5 (+ main_~i~0 (- 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10200#(and (= (+ main_~i~0 (- 5)) 5) (= (+ (- 2) (* main_~i~0 3)) (+ main_~sum~0 3 (* (- 2) main_~i~0))))} is VALID [2022-04-28 09:48:38,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {10200#(and (= (+ main_~i~0 (- 5)) 5) (= (+ (- 2) (* main_~i~0 3)) (+ main_~sum~0 3 (* (- 2) main_~i~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10204#(and (= (+ (* main_~i~0 6) (- 5)) main_~sum~0) (= (+ main_~i~0 (- 5)) 5))} is VALID [2022-04-28 09:48:38,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {10204#(and (= (+ (* main_~i~0 6) (- 5)) main_~sum~0) (= (+ main_~i~0 (- 5)) 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10208#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2022-04-28 09:48:38,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {10208#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10212#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} is VALID [2022-04-28 09:48:38,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {10212#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10216#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} is VALID [2022-04-28 09:48:38,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {10216#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10220#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} is VALID [2022-04-28 09:48:38,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {10220#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10224#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} is VALID [2022-04-28 09:48:38,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {10224#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10228#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-28 09:48:38,895 INFO L290 TraceCheckUtils]: 32: Hoare triple {10228#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10232#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 2) 63)))} is VALID [2022-04-28 09:48:38,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {10232#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 2) 63)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10236#(and (= 12 (+ (- 2) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 2) 63)))} is VALID [2022-04-28 09:48:38,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {10236#(and (= 12 (+ (- 2) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 2) 63)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10240#(and (= main_~i~0 15) (= 91 (+ (- 14) main_~sum~0)))} is VALID [2022-04-28 09:48:38,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {10240#(and (= main_~i~0 15) (= 91 (+ (- 14) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10244#(and (= main_~i~0 15) (= main_~sum~0 (+ main_~i~0 105)))} is VALID [2022-04-28 09:48:38,896 INFO L290 TraceCheckUtils]: 36: Hoare triple {10244#(and (= main_~i~0 15) (= main_~sum~0 (+ main_~i~0 105)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10248#(and (= main_~sum~0 (+ 104 main_~i~0)) (= (+ (- 1) main_~i~0) 15))} is VALID [2022-04-28 09:48:38,897 INFO L290 TraceCheckUtils]: 37: Hoare triple {10248#(and (= main_~sum~0 (+ 104 main_~i~0)) (= (+ (- 1) main_~i~0) 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10252#(and (= main_~sum~0 (+ 104 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 15))} is VALID [2022-04-28 09:48:38,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {10252#(and (= main_~sum~0 (+ 104 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10256#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-28 09:48:38,897 INFO L290 TraceCheckUtils]: 39: Hoare triple {10256#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10260#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:48:38,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {10260#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10264#(and (= (+ (* main_~i~0 2) 100) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 15))} is VALID [2022-04-28 09:48:38,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {10264#(and (= (+ (* main_~i~0 2) 100) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10268#(and (= (+ main_~i~0 (- 3)) 15) (= main_~sum~0 (+ 99 (* main_~i~0 4))))} is VALID [2022-04-28 09:48:38,899 INFO L290 TraceCheckUtils]: 42: Hoare triple {10268#(and (= (+ main_~i~0 (- 3)) 15) (= main_~sum~0 (+ 99 (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10272#(and (= 19 main_~i~0) (= main_~sum~0 171))} is VALID [2022-04-28 09:48:38,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {10272#(and (= 19 main_~i~0) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10276#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 171) (= 19 main_~i~0))} is VALID [2022-04-28 09:48:38,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {10276#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 171) (= 19 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10280#(and (= main_~i~0 20) (= 171 (+ main_~sum~0 (- 19))))} is VALID [2022-04-28 09:48:38,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {10280#(and (= main_~i~0 20) (= 171 (+ main_~sum~0 (- 19))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10284#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} is VALID [2022-04-28 09:48:38,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {10284#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10288#(and (= (+ main_~sum~0 (- 189)) main_~i~0) (= 20 (+ main_~sum~0 (- 190))))} is VALID [2022-04-28 09:48:38,901 INFO L290 TraceCheckUtils]: 47: Hoare triple {10288#(and (= (+ main_~sum~0 (- 189)) main_~i~0) (= 20 (+ main_~sum~0 (- 190))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10292#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 190)) 20) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 189)) main_~i~0))} is VALID [2022-04-28 09:48:38,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {10292#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 190)) 20) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 189)) main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10296#(and (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) (- 188) main_~sum~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 189)) 20))} is VALID [2022-04-28 09:48:38,909 INFO L290 TraceCheckUtils]: 49: Hoare triple {10296#(and (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) (- 188) main_~sum~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 189)) 20))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10300#(and (= (+ 187 (* main_~i~0 3)) main_~sum~0) (<= main_~i~0 main_~n~0) (= 20 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:48:38,910 INFO L290 TraceCheckUtils]: 50: Hoare triple {10300#(and (= (+ 187 (* main_~i~0 3)) main_~sum~0) (<= main_~i~0 main_~n~0) (= 20 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#(and (<= 22 main_~n~0) (<= main_~i~0 23) (= main_~sum~0 253))} is VALID [2022-04-28 09:48:38,913 INFO L290 TraceCheckUtils]: 51: Hoare triple {10304#(and (<= 22 main_~n~0) (<= main_~i~0 23) (= main_~sum~0 253))} assume !(~i~0 <= ~n~0); {10308#(and (< main_~n~0 23) (<= 22 main_~n~0) (= main_~sum~0 253))} is VALID [2022-04-28 09:48:38,914 INFO L272 TraceCheckUtils]: 52: Hoare triple {10308#(and (< main_~n~0 23) (<= 22 main_~n~0) (= main_~sum~0 253))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {10312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:48:38,915 INFO L290 TraceCheckUtils]: 53: Hoare triple {10312#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10316#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:48:38,915 INFO L290 TraceCheckUtils]: 54: Hoare triple {10316#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10106#false} is VALID [2022-04-28 09:48:38,915 INFO L290 TraceCheckUtils]: 55: Hoare triple {10106#false} assume !false; {10106#false} is VALID [2022-04-28 09:48:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:48:38,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:48:53,883 INFO L290 TraceCheckUtils]: 55: Hoare triple {10106#false} assume !false; {10106#false} is VALID [2022-04-28 09:48:53,884 INFO L290 TraceCheckUtils]: 54: Hoare triple {10316#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10106#false} is VALID [2022-04-28 09:48:53,884 INFO L290 TraceCheckUtils]: 53: Hoare triple {10312#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10316#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:48:53,885 INFO L272 TraceCheckUtils]: 52: Hoare triple {10332#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {10312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:48:53,885 INFO L290 TraceCheckUtils]: 51: Hoare triple {10336#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {10332#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:48:53,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {10340#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10336#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:48:53,893 INFO L290 TraceCheckUtils]: 49: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10340#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:48:53,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:53,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:53,907 INFO L290 TraceCheckUtils]: 46: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:53,916 INFO L290 TraceCheckUtils]: 45: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:53,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:53,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:53,931 INFO L290 TraceCheckUtils]: 42: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:53,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:53,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:53,961 INFO L290 TraceCheckUtils]: 39: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:53,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:53,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:53,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:53,989 INFO L290 TraceCheckUtils]: 35: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:53,991 INFO L290 TraceCheckUtils]: 34: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:53,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:54,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:54,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:54,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:54,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:54,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:54,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:54,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:54,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:54,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:54,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:54,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:54,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:54,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:54,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:54,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:54,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:54,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:54,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:54,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:54,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:54,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:54,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:54,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:54,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:54,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:54,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:48:54,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {10105#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:48:54,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {10105#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10105#true} is VALID [2022-04-28 09:48:54,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {10105#true} call #t~ret3 := main(); {10105#true} is VALID [2022-04-28 09:48:54,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10105#true} {10105#true} #55#return; {10105#true} is VALID [2022-04-28 09:48:54,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {10105#true} assume true; {10105#true} is VALID [2022-04-28 09:48:54,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {10105#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(9, 2); {10105#true} is VALID [2022-04-28 09:48:54,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {10105#true} call ULTIMATE.init(); {10105#true} is VALID [2022-04-28 09:48:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-04-28 09:48:54,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:48:54,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410308435] [2022-04-28 09:48:54,175 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:48:54,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809769774] [2022-04-28 09:48:54,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809769774] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:48:54,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:48:54,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 9] total 55 [2022-04-28 09:48:54,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:48:54,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [423324434] [2022-04-28 09:48:54,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [423324434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:48:54,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:48:54,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-28 09:48:54,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392967545] [2022-04-28 09:48:54,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:48:54,176 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-28 09:48:54,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:48:54,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:48:54,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:48:54,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-28 09:48:54,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:48:54,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-28 09:48:54,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2809, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 09:48:54,291 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:00,893 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 09:49:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 09:49:00,893 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-28 09:49:00,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:49:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 09:49:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 09:49:00,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-28 09:49:01,103 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 09:49:01,104 INFO L225 Difference]: With dead ends: 64 [2022-04-28 09:49:01,104 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 09:49:01,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 22 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=172, Invalid=3020, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 09:49:01,105 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 2398 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 2399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:49:01,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 349 Invalid, 2399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2398 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 09:49:01,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 09:49:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-28 09:49:01,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:49:01,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:01,151 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:01,151 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:01,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:01,152 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-28 09:49:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 09:49:01,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:49:01,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:49:01,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-28 09:49:01,152 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-28 09:49:01,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:01,153 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-28 09:49:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 09:49:01,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:49:01,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:49:01,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:49:01,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:49:01,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-04-28 09:49:01,155 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2022-04-28 09:49:01,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:49:01,155 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-04-28 09:49:01,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:01,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 59 transitions. [2022-04-28 09:49:01,324 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 09:49:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 09:49:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 09:49:01,324 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:49:01,324 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:49:01,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 09:49:01,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:49:01,525 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:49:01,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:49:01,525 INFO L85 PathProgramCache]: Analyzing trace with hash -314402105, now seen corresponding path program 45 times [2022-04-28 09:49:01,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:49:01,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [42838943] [2022-04-28 09:49:01,528 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:49:01,528 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:49:01,528 INFO L85 PathProgramCache]: Analyzing trace with hash -314402105, now seen corresponding path program 46 times [2022-04-28 09:49:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:49:01,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302163335] [2022-04-28 09:49:01,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:49:01,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:49:01,555 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:49:01,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1251109831] [2022-04-28 09:49:01,555 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:49:01,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:49:01,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:49:01,556 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:49:01,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 09:49:01,619 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:49:01,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:49:01,621 WARN L261 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-28 09:49:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:01,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:49:03,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {10863#true} call ULTIMATE.init(); {10863#true} is VALID [2022-04-28 09:49:03,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {10863#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(9, 2); {10863#true} is VALID [2022-04-28 09:49:03,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {10863#true} assume true; {10863#true} is VALID [2022-04-28 09:49:03,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10863#true} {10863#true} #55#return; {10863#true} is VALID [2022-04-28 09:49:03,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {10863#true} call #t~ret3 := main(); {10863#true} is VALID [2022-04-28 09:49:03,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {10863#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10863#true} is VALID [2022-04-28 09:49:03,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {10863#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {10886#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:49:03,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {10886#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10890#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-28 09:49:03,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {10890#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10894#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} is VALID [2022-04-28 09:49:03,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {10894#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10898#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:49:03,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {10898#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10902#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 2))))} is VALID [2022-04-28 09:49:03,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {10902#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10906#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} is VALID [2022-04-28 09:49:03,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {10906#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10910#(and (= (+ (- 6) (* main_~i~0 3)) main_~sum~0) (= (+ main_~i~0 (- 3)) 1))} is VALID [2022-04-28 09:49:03,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {10910#(and (= (+ (- 6) (* main_~i~0 3)) main_~sum~0) (= (+ main_~i~0 (- 3)) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10914#(and (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} is VALID [2022-04-28 09:49:03,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {10914#(and (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10918#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-28 09:49:03,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {10918#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10922#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} is VALID [2022-04-28 09:49:03,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {10922#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10926#(and (= (+ (- 1) main_~i~0) 5) (= main_~sum~0 (+ main_~i~0 9)))} is VALID [2022-04-28 09:49:03,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {10926#(and (= (+ (- 1) main_~i~0) 5) (= main_~sum~0 (+ main_~i~0 9)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10930#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 9)) (= (+ (- 1) main_~i~0) 5))} is VALID [2022-04-28 09:49:03,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {10930#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 9)) (= (+ (- 1) main_~i~0) 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10934#(and (= (+ main_~sum~0 (- 6)) 15) (= 7 main_~i~0))} is VALID [2022-04-28 09:49:03,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {10934#(and (= (+ main_~sum~0 (- 6)) 15) (= 7 main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10938#(and (= 7 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 15))} is VALID [2022-04-28 09:49:03,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {10938#(and (= 7 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10942#(and (= (+ (- 13) main_~sum~0) 15) (= main_~i~0 8))} is VALID [2022-04-28 09:49:03,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {10942#(and (= (+ (- 13) main_~sum~0) 15) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10946#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} is VALID [2022-04-28 09:49:03,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {10946#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10950#(and (= main_~sum~0 36) (= main_~i~0 9))} is VALID [2022-04-28 09:49:03,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {10950#(and (= main_~sum~0 36) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10954#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-28 09:49:03,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {10954#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10958#(and (= (+ (- 1) main_~i~0) 9) (= (+ 35 main_~i~0) main_~sum~0))} is VALID [2022-04-28 09:49:03,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {10958#(and (= (+ (- 1) main_~i~0) 9) (= (+ 35 main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10962#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} is VALID [2022-04-28 09:49:03,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {10962#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10966#(and (= 9 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 33 (* main_~i~0 2))))} is VALID [2022-04-28 09:49:03,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {10966#(and (= 9 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 33 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10970#(and (= main_~sum~0 (+ 33 (* main_~i~0 3))) (= 9 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:49:03,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {10970#(and (= main_~sum~0 (+ 33 (* main_~i~0 3))) (= 9 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10974#(and (= main_~sum~0 (+ 30 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 9))} is VALID [2022-04-28 09:49:03,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {10974#(and (= main_~sum~0 (+ 30 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10978#(and (= main_~sum~0 (+ 30 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 9))} is VALID [2022-04-28 09:49:03,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {10978#(and (= main_~sum~0 (+ 30 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10982#(and (= 9 (+ main_~i~0 (- 4))) (= main_~sum~0 (+ 26 (* main_~i~0 4))))} is VALID [2022-04-28 09:49:03,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {10982#(and (= 9 (+ main_~i~0 (- 4))) (= main_~sum~0 (+ 26 (* main_~i~0 4))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10986#(and (= (+ (* 5 main_~i~0) 26) main_~sum~0) (= 9 (+ main_~i~0 (- 4))))} is VALID [2022-04-28 09:49:03,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {10986#(and (= (+ (* 5 main_~i~0) 26) main_~sum~0) (= 9 (+ main_~i~0 (- 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10990#(and (= 91 main_~sum~0) (= main_~i~0 14))} is VALID [2022-04-28 09:49:03,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {10990#(and (= 91 main_~sum~0) (= main_~i~0 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10994#(and (= main_~sum~0 (+ 91 main_~i~0)) (= main_~i~0 14))} is VALID [2022-04-28 09:49:03,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {10994#(and (= main_~sum~0 (+ 91 main_~i~0)) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10998#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} is VALID [2022-04-28 09:49:03,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {10998#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11002#(and (= (+ 90 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 14))} is VALID [2022-04-28 09:49:03,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {11002#(and (= (+ 90 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11006#(and (= 14 (+ (- 2) main_~i~0)) (= (+ 88 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-28 09:49:03,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {11006#(and (= 14 (+ (- 2) main_~i~0)) (= (+ 88 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11010#(and (= 14 (+ (- 2) main_~i~0)) (= (+ 88 (* main_~i~0 3)) main_~sum~0))} is VALID [2022-04-28 09:49:03,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {11010#(and (= 14 (+ (- 2) main_~i~0)) (= (+ 88 (* main_~i~0 3)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11014#(and (= (+ main_~i~0 (- 3)) 14) (= main_~sum~0 (+ 85 (* main_~i~0 3))))} is VALID [2022-04-28 09:49:03,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {11014#(and (= (+ main_~i~0 (- 3)) 14) (= main_~sum~0 (+ 85 (* main_~i~0 3))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11018#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 85 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 14))} is VALID [2022-04-28 09:49:03,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {11018#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 85 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11022#(and (= (+ 82 (* main_~i~0 3)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= 14 (+ main_~i~0 (- 4))))} is VALID [2022-04-28 09:49:03,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {11022#(and (= (+ 82 (* main_~i~0 3)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= 14 (+ main_~i~0 (- 4))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11026#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ 82 (* main_~i~0 3))) (= 14 (+ main_~i~0 (- 4))))} is VALID [2022-04-28 09:49:03,407 INFO L290 TraceCheckUtils]: 42: Hoare triple {11026#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ 82 (* main_~i~0 3))) (= 14 (+ main_~i~0 (- 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11030#(and (= 136 (+ main_~sum~0 (- 35))) (= 19 main_~i~0))} is VALID [2022-04-28 09:49:03,407 INFO L290 TraceCheckUtils]: 43: Hoare triple {11030#(and (= 136 (+ main_~sum~0 (- 35))) (= 19 main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11034#(and (= (+ 171 main_~i~0) main_~sum~0) (= 19 main_~i~0))} is VALID [2022-04-28 09:49:03,407 INFO L290 TraceCheckUtils]: 44: Hoare triple {11034#(and (= (+ 171 main_~i~0) main_~sum~0) (= 19 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11038#(and (= main_~sum~0 (+ 170 main_~i~0)) (= 19 (+ (- 1) main_~i~0)))} is VALID [2022-04-28 09:49:03,408 INFO L290 TraceCheckUtils]: 45: Hoare triple {11038#(and (= main_~sum~0 (+ 170 main_~i~0)) (= 19 (+ (- 1) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11042#(and (= (+ 170 (* main_~i~0 2)) main_~sum~0) (= 19 (+ (- 1) main_~i~0)))} is VALID [2022-04-28 09:49:03,408 INFO L290 TraceCheckUtils]: 46: Hoare triple {11042#(and (= (+ 170 (* main_~i~0 2)) main_~sum~0) (= 19 (+ (- 1) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11046#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2022-04-28 09:49:03,409 INFO L290 TraceCheckUtils]: 47: Hoare triple {11046#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11050#(and (= main_~i~0 21) (= (+ (* (- 1) main_~i~0) main_~sum~0) 210))} is VALID [2022-04-28 09:49:03,409 INFO L290 TraceCheckUtils]: 48: Hoare triple {11050#(and (= main_~i~0 21) (= (+ (* (- 1) main_~i~0) main_~sum~0) 210))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11054#(and (= (+ (- 210) main_~sum~0) 21) (= (+ main_~sum~0 (- 209)) main_~i~0))} is VALID [2022-04-28 09:49:03,409 INFO L290 TraceCheckUtils]: 49: Hoare triple {11054#(and (= (+ (- 210) main_~sum~0) 21) (= (+ main_~sum~0 (- 209)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11058#(and (= main_~i~0 22) (= main_~sum~0 (+ main_~i~0 231)))} is VALID [2022-04-28 09:49:03,410 INFO L290 TraceCheckUtils]: 50: Hoare triple {11058#(and (= main_~i~0 22) (= main_~sum~0 (+ main_~i~0 231)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11062#(and (= (+ main_~sum~0 (- 231)) 22) (= (+ main_~sum~0 (- 230)) main_~i~0))} is VALID [2022-04-28 09:49:03,410 INFO L290 TraceCheckUtils]: 51: Hoare triple {11062#(and (= (+ main_~sum~0 (- 231)) 22) (= (+ main_~sum~0 (- 230)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11066#(and (<= main_~i~0 main_~n~0) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 230))) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 231)) 22))} is VALID [2022-04-28 09:49:03,416 INFO L290 TraceCheckUtils]: 52: Hoare triple {11066#(and (<= main_~i~0 main_~n~0) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 230))) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 231)) 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11070#(and (<= main_~sum~0 (+ main_~n~0 253)) (= 23 (+ (- 253) main_~sum~0)) (<= (+ main_~i~0 252) main_~sum~0))} is VALID [2022-04-28 09:49:03,419 INFO L290 TraceCheckUtils]: 53: Hoare triple {11070#(and (<= main_~sum~0 (+ main_~n~0 253)) (= 23 (+ (- 253) main_~sum~0)) (<= (+ main_~i~0 252) main_~sum~0))} assume !(~i~0 <= ~n~0); {11074#(and (<= main_~sum~0 (+ main_~n~0 253)) (= 23 (+ (- 253) main_~sum~0)) (< (+ main_~n~0 252) main_~sum~0))} is VALID [2022-04-28 09:49:03,420 INFO L272 TraceCheckUtils]: 54: Hoare triple {11074#(and (<= main_~sum~0 (+ main_~n~0 253)) (= 23 (+ (- 253) main_~sum~0)) (< (+ main_~n~0 252) main_~sum~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {11078#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:49:03,421 INFO L290 TraceCheckUtils]: 55: Hoare triple {11078#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11082#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:49:03,421 INFO L290 TraceCheckUtils]: 56: Hoare triple {11082#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10864#false} is VALID [2022-04-28 09:49:03,421 INFO L290 TraceCheckUtils]: 57: Hoare triple {10864#false} assume !false; {10864#false} is VALID [2022-04-28 09:49:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:49:03,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:49:21,057 INFO L290 TraceCheckUtils]: 57: Hoare triple {10864#false} assume !false; {10864#false} is VALID [2022-04-28 09:49:21,058 INFO L290 TraceCheckUtils]: 56: Hoare triple {11082#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10864#false} is VALID [2022-04-28 09:49:21,058 INFO L290 TraceCheckUtils]: 55: Hoare triple {11078#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11082#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:49:21,059 INFO L272 TraceCheckUtils]: 54: Hoare triple {11098#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {11078#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:49:21,059 INFO L290 TraceCheckUtils]: 53: Hoare triple {11102#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {11098#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:49:21,064 INFO L290 TraceCheckUtils]: 52: Hoare triple {11106#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11102#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:49:21,068 INFO L290 TraceCheckUtils]: 51: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11106#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:49:21,070 INFO L290 TraceCheckUtils]: 50: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,077 INFO L290 TraceCheckUtils]: 49: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,083 INFO L290 TraceCheckUtils]: 48: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,095 INFO L290 TraceCheckUtils]: 47: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,125 INFO L290 TraceCheckUtils]: 43: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,172 INFO L290 TraceCheckUtils]: 36: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,184 INFO L290 TraceCheckUtils]: 35: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:21,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {10863#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:21,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {10863#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10863#true} is VALID [2022-04-28 09:49:21,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {10863#true} call #t~ret3 := main(); {10863#true} is VALID [2022-04-28 09:49:21,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10863#true} {10863#true} #55#return; {10863#true} is VALID [2022-04-28 09:49:21,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {10863#true} assume true; {10863#true} is VALID [2022-04-28 09:49:21,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {10863#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(9, 2); {10863#true} is VALID [2022-04-28 09:49:21,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {10863#true} call ULTIMATE.init(); {10863#true} is VALID [2022-04-28 09:49:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-28 09:49:21,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:49:21,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302163335] [2022-04-28 09:49:21,403 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:49:21,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251109831] [2022-04-28 09:49:21,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251109831] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:49:21,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:49:21,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 9] total 57 [2022-04-28 09:49:21,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:49:21,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [42838943] [2022-04-28 09:49:21,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [42838943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:49:21,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:49:21,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 09:49:21,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708059075] [2022-04-28 09:49:21,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:49:21,405 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-28 09:49:21,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:49:21,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:21,537 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 09:49:21,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 09:49:21,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:49:21,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 09:49:21,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3025, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 09:49:21,538 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:29,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:29,975 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 09:49:29,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 09:49:29,975 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-28 09:49:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:49:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-28 09:49:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-28 09:49:29,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-28 09:49:30,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:49:30,241 INFO L225 Difference]: With dead ends: 66 [2022-04-28 09:49:30,241 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 09:49:30,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 37 SyntacticMatches, 23 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=178, Invalid=3244, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 09:49:30,242 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 2598 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:49:30,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 363 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2598 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-28 09:49:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 09:49:30,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 09:49:30,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:49:30,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:30,289 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:30,289 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:30,290 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-28 09:49:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 09:49:30,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:49:30,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:49:30,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-28 09:49:30,291 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-28 09:49:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:30,292 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-28 09:49:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 09:49:30,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:49:30,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:49:30,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:49:30,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:49:30,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:30,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2022-04-28 09:49:30,293 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2022-04-28 09:49:30,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:49:30,293 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2022-04-28 09:49:30,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:30,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 61 transitions. [2022-04-28 09:49:30,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:49:30,539 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 09:49:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 09:49:30,540 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:49:30,540 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:49:30,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 09:49:30,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:49:30,741 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:49:30,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:49:30,741 INFO L85 PathProgramCache]: Analyzing trace with hash -390716699, now seen corresponding path program 47 times [2022-04-28 09:49:30,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:49:30,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1501783534] [2022-04-28 09:49:30,744 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:49:30,744 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:49:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash -390716699, now seen corresponding path program 48 times [2022-04-28 09:49:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:49:30,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467247983] [2022-04-28 09:49:30,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:49:30,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:49:30,759 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:49:30,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1264591003] [2022-04-28 09:49:30,759 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:49:30,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:49:30,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:49:30,761 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:49:30,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 09:49:30,825 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-28 09:49:30,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:49:30,828 WARN L261 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-28 09:49:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:30,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:49:33,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {11647#true} call ULTIMATE.init(); {11647#true} is VALID [2022-04-28 09:49:33,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {11647#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(9, 2); {11647#true} is VALID [2022-04-28 09:49:33,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {11647#true} assume true; {11647#true} is VALID [2022-04-28 09:49:33,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11647#true} {11647#true} #55#return; {11647#true} is VALID [2022-04-28 09:49:33,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {11647#true} call #t~ret3 := main(); {11647#true} is VALID [2022-04-28 09:49:33,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {11647#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {11647#true} is VALID [2022-04-28 09:49:33,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {11647#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {11670#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:49:33,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {11670#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11674#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:49:33,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {11674#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11678#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-28 09:49:33,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {11678#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11682#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:49:33,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {11682#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11686#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2022-04-28 09:49:33,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {11686#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11690#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} is VALID [2022-04-28 09:49:33,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {11690#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11694#(and (= main_~sum~0 (+ main_~i~0 2)) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-28 09:49:33,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {11694#(and (= main_~sum~0 (+ main_~i~0 2)) (= (+ (- 1) main_~i~0) 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11698#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 2)) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-28 09:49:33,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {11698#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 2)) (= (+ (- 1) main_~i~0) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11702#(and (= 5 main_~i~0) (= (+ main_~sum~0 (- 4)) 6))} is VALID [2022-04-28 09:49:33,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {11702#(and (= 5 main_~i~0) (= (+ main_~sum~0 (- 4)) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11706#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} is VALID [2022-04-28 09:49:33,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {11706#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11710#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} is VALID [2022-04-28 09:49:33,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {11710#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11714#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 10)) 5) (= main_~i~0 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:49:33,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {11714#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 10)) 5) (= main_~i~0 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11718#(and (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 (- 8))) (= 5 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:49:33,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {11718#(and (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 (- 8))) (= 5 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11722#(and (= (+ (- 9) main_~sum~0 (* (- 2) main_~i~0)) 5) (= (+ (- 1) main_~i~0) (+ main_~sum~0 (* (- 2) main_~i~0) (- 8))))} is VALID [2022-04-28 09:49:33,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {11722#(and (= (+ (- 9) main_~sum~0 (* (- 2) main_~i~0)) 5) (= (+ (- 1) main_~i~0) (+ main_~sum~0 (* (- 2) main_~i~0) (- 8))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11726#(and (= 5 (+ main_~sum~0 (- 7) (* (- 2) main_~i~0))) (= (+ main_~sum~0 (- 6) (* (- 2) main_~i~0)) (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:49:33,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {11726#(and (= 5 (+ main_~sum~0 (- 7) (* (- 2) main_~i~0))) (= (+ main_~sum~0 (- 6) (* (- 2) main_~i~0)) (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11730#(and (= (+ (* main_~i~0 3) 12) main_~sum~0) (= 6 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:49:33,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {11730#(and (= (+ (* main_~i~0 3) 12) main_~sum~0) (= 6 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11734#(and (= (+ 9 (* main_~i~0 3)) main_~sum~0) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-28 09:49:33,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {11734#(and (= (+ 9 (* main_~i~0 3)) main_~sum~0) (= (+ main_~i~0 (- 3)) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11738#(and (= main_~sum~0 (+ 9 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-28 09:49:33,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {11738#(and (= main_~sum~0 (+ 9 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11742#(and (= main_~i~0 10) (= main_~sum~0 45))} is VALID [2022-04-28 09:49:33,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {11742#(and (= main_~i~0 10) (= main_~sum~0 45))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11746#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} is VALID [2022-04-28 09:49:33,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {11746#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11750#(and (= (+ main_~sum~0 (- 44)) main_~i~0) (= (+ (- 45) main_~sum~0) 10))} is VALID [2022-04-28 09:49:33,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {11750#(and (= (+ main_~sum~0 (- 44)) main_~i~0) (= (+ (- 45) main_~sum~0) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11754#(and (= main_~i~0 11) (= main_~sum~0 (+ main_~i~0 55)))} is VALID [2022-04-28 09:49:33,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {11754#(and (= main_~i~0 11) (= main_~sum~0 (+ main_~i~0 55)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11758#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} is VALID [2022-04-28 09:49:33,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {11758#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11762#(and (= (+ (- 1) main_~i~0) 11) (= (+ (* main_~i~0 2) 54) main_~sum~0))} is VALID [2022-04-28 09:49:33,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {11762#(and (= (+ (- 1) main_~i~0) 11) (= (+ (* main_~i~0 2) 54) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11766#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2022-04-28 09:49:33,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {11766#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11770#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2022-04-28 09:49:33,338 INFO L290 TraceCheckUtils]: 32: Hoare triple {11770#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11774#(and (= (+ (- 1) main_~i~0) 13) (= main_~sum~0 (+ 77 main_~i~0)))} is VALID [2022-04-28 09:49:33,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {11774#(and (= (+ (- 1) main_~i~0) 13) (= main_~sum~0 (+ 77 main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11778#(and (= main_~sum~0 (+ 77 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 13))} is VALID [2022-04-28 09:49:33,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {11778#(and (= main_~sum~0 (+ 77 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11782#(and (= (+ (* main_~i~0 2) 75) main_~sum~0) (= (+ (- 2) main_~i~0) 13))} is VALID [2022-04-28 09:49:33,340 INFO L290 TraceCheckUtils]: 35: Hoare triple {11782#(and (= (+ (* main_~i~0 2) 75) main_~sum~0) (= (+ (- 2) main_~i~0) 13))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11786#(and (= (+ (- 2) main_~i~0) 13) (= (+ (* main_~i~0 2) 75) (+ (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:49:33,340 INFO L290 TraceCheckUtils]: 36: Hoare triple {11786#(and (= (+ (- 2) main_~i~0) 13) (= (+ (* main_~i~0 2) 75) (+ (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11790#(and (= main_~i~0 16) (= (+ (- 15) main_~sum~0) 105))} is VALID [2022-04-28 09:49:33,340 INFO L290 TraceCheckUtils]: 37: Hoare triple {11790#(and (= main_~i~0 16) (= (+ (- 15) main_~sum~0) 105))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11794#(and (= main_~i~0 16) (= (+ (* (- 1) main_~i~0) (- 15) main_~sum~0) 105))} is VALID [2022-04-28 09:49:33,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {11794#(and (= main_~i~0 16) (= (+ (* (- 1) main_~i~0) (- 15) main_~sum~0) 105))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11798#(and (= (+ (- 1) main_~i~0) 16) (= (+ (- 14) (* (- 1) main_~i~0) main_~sum~0) 105))} is VALID [2022-04-28 09:49:33,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {11798#(and (= (+ (- 1) main_~i~0) 16) (= (+ (- 14) (* (- 1) main_~i~0) main_~sum~0) 105))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11802#(and (= (+ (- 1) main_~i~0) 16) (= main_~sum~0 (+ 119 (* main_~i~0 2))))} is VALID [2022-04-28 09:49:33,342 INFO L290 TraceCheckUtils]: 40: Hoare triple {11802#(and (= (+ (- 1) main_~i~0) 16) (= main_~sum~0 (+ 119 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11806#(and (= 16 (+ (- 2) main_~i~0)) (= (+ 117 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-28 09:49:33,342 INFO L290 TraceCheckUtils]: 41: Hoare triple {11806#(and (= 16 (+ (- 2) main_~i~0)) (= (+ 117 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11810#(and (= 16 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 117 (* main_~i~0 3))))} is VALID [2022-04-28 09:49:33,342 INFO L290 TraceCheckUtils]: 42: Hoare triple {11810#(and (= 16 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 117 (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11814#(and (= 19 main_~i~0) (= main_~sum~0 171))} is VALID [2022-04-28 09:49:33,343 INFO L290 TraceCheckUtils]: 43: Hoare triple {11814#(and (= 19 main_~i~0) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11818#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 171) (= 19 main_~i~0))} is VALID [2022-04-28 09:49:33,343 INFO L290 TraceCheckUtils]: 44: Hoare triple {11818#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 171) (= 19 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11822#(and (= 19 (+ main_~sum~0 (- 171))) (= (+ (- 170) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:49:33,344 INFO L290 TraceCheckUtils]: 45: Hoare triple {11822#(and (= 19 (+ main_~sum~0 (- 171))) (= (+ (- 170) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11826#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} is VALID [2022-04-28 09:49:33,344 INFO L290 TraceCheckUtils]: 46: Hoare triple {11826#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11830#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2022-04-28 09:49:33,344 INFO L290 TraceCheckUtils]: 47: Hoare triple {11830#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11834#(and (= main_~i~0 21) (= (+ (* (- 1) main_~i~0) main_~sum~0) 210))} is VALID [2022-04-28 09:49:33,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {11834#(and (= main_~i~0 21) (= (+ (* (- 1) main_~i~0) main_~sum~0) 210))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11838#(and (= (+ (- 210) main_~sum~0) 21) (= (+ main_~sum~0 (- 209)) main_~i~0))} is VALID [2022-04-28 09:49:33,345 INFO L290 TraceCheckUtils]: 49: Hoare triple {11838#(and (= (+ (- 210) main_~sum~0) 21) (= (+ main_~sum~0 (- 209)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11842#(and (= (+ 209 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} is VALID [2022-04-28 09:49:33,346 INFO L290 TraceCheckUtils]: 50: Hoare triple {11842#(and (= (+ 209 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11846#(and (= main_~sum~0 (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:49:33,346 INFO L290 TraceCheckUtils]: 51: Hoare triple {11846#(and (= main_~sum~0 (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11850#(and (= main_~sum~0 (+ 207 (* main_~i~0 3))) (= 21 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:49:33,346 INFO L290 TraceCheckUtils]: 52: Hoare triple {11850#(and (= main_~sum~0 (+ 207 (* main_~i~0 3))) (= 21 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11854#(and (= 276 main_~sum~0) (= main_~i~0 24))} is VALID [2022-04-28 09:49:33,347 INFO L290 TraceCheckUtils]: 53: Hoare triple {11854#(and (= 276 main_~sum~0) (= main_~i~0 24))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11858#(and (<= main_~i~0 main_~n~0) (= main_~i~0 24) (= main_~sum~0 (+ 276 main_~i~0)))} is VALID [2022-04-28 09:49:33,347 INFO L290 TraceCheckUtils]: 54: Hoare triple {11858#(and (<= main_~i~0 main_~n~0) (= main_~i~0 24) (= main_~sum~0 (+ 276 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11862#(and (<= main_~sum~0 (+ 276 main_~n~0)) (<= (+ main_~i~0 275) main_~sum~0) (= (+ main_~sum~0 (- 276)) 24))} is VALID [2022-04-28 09:49:33,349 INFO L290 TraceCheckUtils]: 55: Hoare triple {11862#(and (<= main_~sum~0 (+ 276 main_~n~0)) (<= (+ main_~i~0 275) main_~sum~0) (= (+ main_~sum~0 (- 276)) 24))} assume !(~i~0 <= ~n~0); {11866#(and (<= main_~sum~0 (+ 276 main_~n~0)) (< (+ main_~n~0 275) main_~sum~0) (= (+ main_~sum~0 (- 276)) 24))} is VALID [2022-04-28 09:49:33,350 INFO L272 TraceCheckUtils]: 56: Hoare triple {11866#(and (<= main_~sum~0 (+ 276 main_~n~0)) (< (+ main_~n~0 275) main_~sum~0) (= (+ main_~sum~0 (- 276)) 24))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {11870#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:49:33,351 INFO L290 TraceCheckUtils]: 57: Hoare triple {11870#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11874#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:49:33,351 INFO L290 TraceCheckUtils]: 58: Hoare triple {11874#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11648#false} is VALID [2022-04-28 09:49:33,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {11648#false} assume !false; {11648#false} is VALID [2022-04-28 09:49:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:49:33,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:49:52,508 INFO L290 TraceCheckUtils]: 59: Hoare triple {11648#false} assume !false; {11648#false} is VALID [2022-04-28 09:49:52,509 INFO L290 TraceCheckUtils]: 58: Hoare triple {11874#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11648#false} is VALID [2022-04-28 09:49:52,509 INFO L290 TraceCheckUtils]: 57: Hoare triple {11870#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11874#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:49:52,510 INFO L272 TraceCheckUtils]: 56: Hoare triple {11890#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {11870#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:49:52,510 INFO L290 TraceCheckUtils]: 55: Hoare triple {11894#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {11890#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:49:52,516 INFO L290 TraceCheckUtils]: 54: Hoare triple {11898#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11894#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:49:52,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11898#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:49:52,526 INFO L290 TraceCheckUtils]: 52: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,539 INFO L290 TraceCheckUtils]: 51: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,545 INFO L290 TraceCheckUtils]: 50: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,556 INFO L290 TraceCheckUtils]: 49: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,557 INFO L290 TraceCheckUtils]: 48: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,576 INFO L290 TraceCheckUtils]: 47: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,583 INFO L290 TraceCheckUtils]: 46: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,595 INFO L290 TraceCheckUtils]: 44: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,607 INFO L290 TraceCheckUtils]: 43: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,624 INFO L290 TraceCheckUtils]: 41: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,646 INFO L290 TraceCheckUtils]: 38: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,663 INFO L290 TraceCheckUtils]: 36: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:49:52,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {11647#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:49:52,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {11647#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {11647#true} is VALID [2022-04-28 09:49:52,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {11647#true} call #t~ret3 := main(); {11647#true} is VALID [2022-04-28 09:49:52,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11647#true} {11647#true} #55#return; {11647#true} is VALID [2022-04-28 09:49:52,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {11647#true} assume true; {11647#true} is VALID [2022-04-28 09:49:52,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {11647#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(9, 2); {11647#true} is VALID [2022-04-28 09:49:52,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {11647#true} call ULTIMATE.init(); {11647#true} is VALID [2022-04-28 09:49:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-28 09:49:52,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:49:52,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467247983] [2022-04-28 09:49:52,898 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:49:52,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264591003] [2022-04-28 09:49:52,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264591003] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:49:52,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:49:52,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 9] total 59 [2022-04-28 09:49:52,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:49:52,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1501783534] [2022-04-28 09:49:52,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1501783534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:49:52,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:49:52,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-28 09:49:52,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201177279] [2022-04-28 09:49:52,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:49:52,900 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-28 09:49:52,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:49:52,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:49:53,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:49:53,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-28 09:49:53,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:49:53,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-28 09:49:53,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3249, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 09:49:53,067 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand has 54 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:50:01,700 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 09:50:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-28 09:50:01,700 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-28 09:50:01,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:50:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-28 09:50:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-28 09:50:01,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 68 transitions. [2022-04-28 09:50:01,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:50:01,906 INFO L225 Difference]: With dead ends: 68 [2022-04-28 09:50:01,906 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 09:50:01,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 38 SyntacticMatches, 24 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=184, Invalid=3476, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 09:50:01,907 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 2755 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 09:50:01,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 370 Invalid, 2756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2755 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 09:50:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 09:50:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-28 09:50:01,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:50:01,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:01,946 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:01,946 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:50:01,947 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-28 09:50:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-28 09:50:01,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:50:01,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:50:01,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-28 09:50:01,948 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-28 09:50:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:50:01,949 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-28 09:50:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-28 09:50:01,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:50:01,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:50:01,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:50:01,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:50:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2022-04-28 09:50:01,951 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2022-04-28 09:50:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:50:01,951 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2022-04-28 09:50:01,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:01,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 63 transitions. [2022-04-28 09:50:02,138 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 09:50:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-28 09:50:02,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 09:50:02,138 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:50:02,138 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:50:02,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-28 09:50:02,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 09:50:02,351 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:50:02,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:50:02,352 INFO L85 PathProgramCache]: Analyzing trace with hash -714597501, now seen corresponding path program 49 times [2022-04-28 09:50:02,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:50:02,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [123922040] [2022-04-28 09:50:02,354 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:50:02,354 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:50:02,354 INFO L85 PathProgramCache]: Analyzing trace with hash -714597501, now seen corresponding path program 50 times [2022-04-28 09:50:02,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:50:02,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610581786] [2022-04-28 09:50:02,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:50:02,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:50:02,371 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:50:02,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [567483264] [2022-04-28 09:50:02,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:50:02,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:50:02,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:50:02,372 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:50:02,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 09:50:02,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:50:02,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:50:02,437 WARN L261 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-28 09:50:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:50:02,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:50:04,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {12457#true} call ULTIMATE.init(); {12457#true} is VALID [2022-04-28 09:50:04,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {12457#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(9, 2); {12457#true} is VALID [2022-04-28 09:50:04,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-28 09:50:04,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12457#true} {12457#true} #55#return; {12457#true} is VALID [2022-04-28 09:50:04,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {12457#true} call #t~ret3 := main(); {12457#true} is VALID [2022-04-28 09:50:04,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {12457#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12457#true} is VALID [2022-04-28 09:50:04,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {12457#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {12480#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:50:04,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {12480#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12484#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-28 09:50:04,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {12484#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12488#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} is VALID [2022-04-28 09:50:04,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {12488#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12492#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} is VALID [2022-04-28 09:50:04,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {12492#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12496#(and (= main_~i~0 3) (= (+ main_~sum~0 (- 3)) 0))} is VALID [2022-04-28 09:50:04,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {12496#(and (= main_~i~0 3) (= (+ main_~sum~0 (- 3)) 0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12500#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 0) (= main_~i~0 3))} is VALID [2022-04-28 09:50:04,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {12500#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 0) (= main_~i~0 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12504#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:50:04,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {12504#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12508#(and (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 3))} is VALID [2022-04-28 09:50:04,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {12508#(and (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12512#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} is VALID [2022-04-28 09:50:04,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {12512#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12516#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-28 09:50:04,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {12516#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12520#(and (= (+ (- 2) main_~i~0) 4) (= main_~sum~0 (+ 3 (* main_~i~0 2))))} is VALID [2022-04-28 09:50:04,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {12520#(and (= (+ (- 2) main_~i~0) 4) (= main_~sum~0 (+ 3 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12524#(and (= (+ 3 (* main_~i~0 3)) main_~sum~0) (= (+ (- 2) main_~i~0) 4))} is VALID [2022-04-28 09:50:04,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {12524#(and (= (+ 3 (* main_~i~0 3)) main_~sum~0) (= (+ (- 2) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12528#(and (= (+ main_~i~0 (- 3)) 4) (= main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 09:50:04,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {12528#(and (= (+ main_~i~0 (- 3)) 4) (= main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12532#(and (= (+ main_~i~0 (- 3)) 4) (= (+ (* (- 1) main_~i~0) main_~sum~0) (* main_~i~0 3)))} is VALID [2022-04-28 09:50:04,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {12532#(and (= (+ main_~i~0 (- 3)) 4) (= (+ (* (- 1) main_~i~0) main_~sum~0) (* main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12536#(and (= (+ main_~sum~0 (- 7)) 21) (= main_~i~0 8))} is VALID [2022-04-28 09:50:04,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {12536#(and (= (+ main_~sum~0 (- 7)) 21) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12540#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} is VALID [2022-04-28 09:50:04,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {12540#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12544#(and (= (+ main_~i~0 27) main_~sum~0) (= (+ (- 1) main_~i~0) 8))} is VALID [2022-04-28 09:50:04,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {12544#(and (= (+ main_~i~0 27) main_~sum~0) (= (+ (- 1) main_~i~0) 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12548#(and (= main_~sum~0 (+ (* main_~i~0 2) 27)) (= (+ (- 1) main_~i~0) 8))} is VALID [2022-04-28 09:50:04,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {12548#(and (= main_~sum~0 (+ (* main_~i~0 2) 27)) (= (+ (- 1) main_~i~0) 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12552#(and (= main_~sum~0 (+ (* main_~i~0 2) 25)) (= 8 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:50:04,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {12552#(and (= main_~sum~0 (+ (* main_~i~0 2) 25)) (= 8 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12556#(and (= 8 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 3) 25)))} is VALID [2022-04-28 09:50:04,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {12556#(and (= 8 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 3) 25)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12560#(and (= main_~sum~0 (+ 22 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 8))} is VALID [2022-04-28 09:50:04,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {12560#(and (= main_~sum~0 (+ 22 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12564#(and (= (+ main_~i~0 (- 3)) 8) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 22 (* main_~i~0 3))))} is VALID [2022-04-28 09:50:04,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {12564#(and (= (+ main_~i~0 (- 3)) 8) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 22 (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12568#(and (= main_~i~0 12) (= 55 (+ (- 11) main_~sum~0)))} is VALID [2022-04-28 09:50:04,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {12568#(and (= main_~i~0 12) (= 55 (+ (- 11) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12572#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} is VALID [2022-04-28 09:50:04,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {12572#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12576#(and (= (+ (- 1) main_~i~0) 12) (= main_~sum~0 (+ main_~i~0 65)))} is VALID [2022-04-28 09:50:04,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {12576#(and (= (+ (- 1) main_~i~0) 12) (= main_~sum~0 (+ main_~i~0 65)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12580#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-28 09:50:04,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {12580#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12584#(and (= 91 main_~sum~0) (= main_~i~0 14))} is VALID [2022-04-28 09:50:04,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {12584#(and (= 91 main_~sum~0) (= main_~i~0 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12588#(and (= 91 (+ (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 14))} is VALID [2022-04-28 09:50:04,876 INFO L290 TraceCheckUtils]: 34: Hoare triple {12588#(and (= 91 (+ (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12592#(and (= 91 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 14))} is VALID [2022-04-28 09:50:04,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {12592#(and (= 91 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12596#(and (= 91 (+ main_~sum~0 (* (- 2) main_~i~0) 1)) (= (+ (- 1) main_~i~0) 14))} is VALID [2022-04-28 09:50:04,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {12596#(and (= 91 (+ main_~sum~0 (* (- 2) main_~i~0) 1)) (= (+ (- 1) main_~i~0) 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12600#(and (= main_~i~0 16) (= 91 (+ main_~sum~0 (- 29))))} is VALID [2022-04-28 09:50:04,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {12600#(and (= main_~i~0 16) (= 91 (+ main_~sum~0 (- 29))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12604#(and (= main_~i~0 16) (= 91 (+ (* (- 1) main_~i~0) main_~sum~0 (- 29))))} is VALID [2022-04-28 09:50:04,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {12604#(and (= main_~i~0 16) (= 91 (+ (* (- 1) main_~i~0) main_~sum~0 (- 29))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12608#(and (= main_~i~0 17) (= 91 (+ (- 45) main_~sum~0)))} is VALID [2022-04-28 09:50:04,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {12608#(and (= main_~i~0 17) (= 91 (+ (- 45) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12612#(and (= main_~i~0 17) (= main_~sum~0 (+ main_~i~0 136)))} is VALID [2022-04-28 09:50:04,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {12612#(and (= main_~i~0 17) (= main_~sum~0 (+ main_~i~0 136)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12616#(and (= (+ (- 1) main_~i~0) 17) (= (+ main_~i~0 135) main_~sum~0))} is VALID [2022-04-28 09:50:04,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {12616#(and (= (+ (- 1) main_~i~0) 17) (= (+ main_~i~0 135) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12620#(and (= (+ (- 1) main_~i~0) 17) (= main_~sum~0 (+ 135 (* main_~i~0 2))))} is VALID [2022-04-28 09:50:04,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {12620#(and (= (+ (- 1) main_~i~0) 17) (= main_~sum~0 (+ 135 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12624#(and (= 19 main_~i~0) (= main_~sum~0 171))} is VALID [2022-04-28 09:50:04,885 INFO L290 TraceCheckUtils]: 43: Hoare triple {12624#(and (= 19 main_~i~0) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12628#(and (= (+ 171 main_~i~0) main_~sum~0) (= 19 main_~i~0))} is VALID [2022-04-28 09:50:04,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {12628#(and (= (+ 171 main_~i~0) main_~sum~0) (= 19 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12632#(and (= 19 (+ main_~sum~0 (- 171))) (= (+ (- 170) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:50:04,886 INFO L290 TraceCheckUtils]: 45: Hoare triple {12632#(and (= 19 (+ main_~sum~0 (- 171))) (= (+ (- 170) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12636#(and (= (+ 170 (* main_~i~0 2)) main_~sum~0) (= 19 (+ (- 1) main_~i~0)))} is VALID [2022-04-28 09:50:04,886 INFO L290 TraceCheckUtils]: 46: Hoare triple {12636#(and (= (+ 170 (* main_~i~0 2)) main_~sum~0) (= 19 (+ (- 1) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12640#(and (= main_~sum~0 (+ 168 (* main_~i~0 2))) (= 19 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:50:04,886 INFO L290 TraceCheckUtils]: 47: Hoare triple {12640#(and (= main_~sum~0 (+ 168 (* main_~i~0 2))) (= 19 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12644#(and (= 19 (+ (- 2) main_~i~0)) (= (+ (* main_~i~0 3) 168) main_~sum~0))} is VALID [2022-04-28 09:50:04,887 INFO L290 TraceCheckUtils]: 48: Hoare triple {12644#(and (= 19 (+ (- 2) main_~i~0)) (= (+ (* main_~i~0 3) 168) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12648#(and (= main_~sum~0 (+ (* main_~i~0 3) 165)) (= (+ main_~i~0 (- 3)) 19))} is VALID [2022-04-28 09:50:04,887 INFO L290 TraceCheckUtils]: 49: Hoare triple {12648#(and (= main_~sum~0 (+ (* main_~i~0 3) 165)) (= (+ main_~i~0 (- 3)) 19))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12652#(and (= (+ main_~i~0 (- 3)) 19) (= (+ 165 (* main_~i~0 4)) main_~sum~0))} is VALID [2022-04-28 09:50:04,888 INFO L290 TraceCheckUtils]: 50: Hoare triple {12652#(and (= (+ main_~i~0 (- 3)) 19) (= (+ 165 (* main_~i~0 4)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12656#(and (= 23 main_~i~0) (= main_~sum~0 253))} is VALID [2022-04-28 09:50:04,888 INFO L290 TraceCheckUtils]: 51: Hoare triple {12656#(and (= 23 main_~i~0) (= main_~sum~0 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12660#(and (= main_~sum~0 (+ main_~i~0 253)) (= 23 main_~i~0))} is VALID [2022-04-28 09:50:04,888 INFO L290 TraceCheckUtils]: 52: Hoare triple {12660#(and (= main_~sum~0 (+ main_~i~0 253)) (= 23 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12664#(and (= 23 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ main_~i~0 252)))} is VALID [2022-04-28 09:50:04,889 INFO L290 TraceCheckUtils]: 53: Hoare triple {12664#(and (= 23 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ main_~i~0 252)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12668#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 252)) (= 23 (+ (- 1) main_~i~0)))} is VALID [2022-04-28 09:50:04,889 INFO L290 TraceCheckUtils]: 54: Hoare triple {12668#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 252)) (= 23 (+ (- 1) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12672#(and (= main_~i~0 25) (= 276 (+ main_~sum~0 (- 24))))} is VALID [2022-04-28 09:50:04,890 INFO L290 TraceCheckUtils]: 55: Hoare triple {12672#(and (= main_~i~0 25) (= 276 (+ main_~sum~0 (- 24))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12676#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)) (<= main_~i~0 main_~n~0))} is VALID [2022-04-28 09:50:04,890 INFO L290 TraceCheckUtils]: 56: Hoare triple {12676#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)) (<= main_~i~0 main_~n~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12680#(and (<= main_~sum~0 (+ main_~n~0 300)) (<= (+ main_~i~0 299) main_~sum~0) (= (+ (- 300) main_~sum~0) 25))} is VALID [2022-04-28 09:50:04,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {12680#(and (<= main_~sum~0 (+ main_~n~0 300)) (<= (+ main_~i~0 299) main_~sum~0) (= (+ (- 300) main_~sum~0) 25))} assume !(~i~0 <= ~n~0); {12684#(and (<= main_~sum~0 (+ main_~n~0 300)) (= (+ (- 300) main_~sum~0) 25) (< (+ main_~n~0 299) main_~sum~0))} is VALID [2022-04-28 09:50:04,893 INFO L272 TraceCheckUtils]: 58: Hoare triple {12684#(and (<= main_~sum~0 (+ main_~n~0 300)) (= (+ (- 300) main_~sum~0) 25) (< (+ main_~n~0 299) main_~sum~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {12688#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:50:04,894 INFO L290 TraceCheckUtils]: 59: Hoare triple {12688#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12692#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:50:04,894 INFO L290 TraceCheckUtils]: 60: Hoare triple {12692#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12458#false} is VALID [2022-04-28 09:50:04,894 INFO L290 TraceCheckUtils]: 61: Hoare triple {12458#false} assume !false; {12458#false} is VALID [2022-04-28 09:50:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:50:04,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:50:27,315 INFO L290 TraceCheckUtils]: 61: Hoare triple {12458#false} assume !false; {12458#false} is VALID [2022-04-28 09:50:27,315 INFO L290 TraceCheckUtils]: 60: Hoare triple {12692#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12458#false} is VALID [2022-04-28 09:50:27,315 INFO L290 TraceCheckUtils]: 59: Hoare triple {12688#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12692#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:50:27,316 INFO L272 TraceCheckUtils]: 58: Hoare triple {12708#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {12688#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:50:27,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {12712#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {12708#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:50:27,323 INFO L290 TraceCheckUtils]: 56: Hoare triple {12716#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12712#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:50:27,328 INFO L290 TraceCheckUtils]: 55: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12716#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:50:27,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,346 INFO L290 TraceCheckUtils]: 53: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,352 INFO L290 TraceCheckUtils]: 52: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,366 INFO L290 TraceCheckUtils]: 51: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,368 INFO L290 TraceCheckUtils]: 50: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,378 INFO L290 TraceCheckUtils]: 49: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,384 INFO L290 TraceCheckUtils]: 48: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,394 INFO L290 TraceCheckUtils]: 47: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,406 INFO L290 TraceCheckUtils]: 45: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,409 INFO L290 TraceCheckUtils]: 44: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,421 INFO L290 TraceCheckUtils]: 42: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,430 INFO L290 TraceCheckUtils]: 41: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,442 INFO L290 TraceCheckUtils]: 39: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,465 INFO L290 TraceCheckUtils]: 37: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:50:27,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {12457#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:50:27,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {12457#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12457#true} is VALID [2022-04-28 09:50:27,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {12457#true} call #t~ret3 := main(); {12457#true} is VALID [2022-04-28 09:50:27,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12457#true} {12457#true} #55#return; {12457#true} is VALID [2022-04-28 09:50:27,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-28 09:50:27,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {12457#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(9, 2); {12457#true} is VALID [2022-04-28 09:50:27,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {12457#true} call ULTIMATE.init(); {12457#true} is VALID [2022-04-28 09:50:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2022-04-28 09:50:27,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:50:27,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610581786] [2022-04-28 09:50:27,707 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:50:27,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567483264] [2022-04-28 09:50:27,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567483264] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:50:27,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:50:27,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 9] total 61 [2022-04-28 09:50:27,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:50:27,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [123922040] [2022-04-28 09:50:27,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [123922040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:50:27,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:50:27,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-28 09:50:27,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784822977] [2022-04-28 09:50:27,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:50:27,708 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-28 09:50:27,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:50:27,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:27,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:50:27,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-28 09:50:27,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:50:27,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-28 09:50:27,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3481, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 09:50:27,842 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:38,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:50:38,363 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 09:50:38,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-28 09:50:38,363 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-28 09:50:38,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:50:38,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:38,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-28 09:50:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-28 09:50:38,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-28 09:50:38,630 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 09:50:38,631 INFO L225 Difference]: With dead ends: 70 [2022-04-28 09:50:38,631 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 09:50:38,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 39 SyntacticMatches, 25 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=190, Invalid=3716, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 09:50:38,632 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 3022 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 3023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:50:38,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 391 Invalid, 3023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3022 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-28 09:50:38,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 09:50:38,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 09:50:38,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:50:38,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:38,674 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:38,674 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:50:38,675 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-28 09:50:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-28 09:50:38,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:50:38,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:50:38,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 09:50:38,676 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 09:50:38,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:50:38,676 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-28 09:50:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-28 09:50:38,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:50:38,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:50:38,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:50:38,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:50:38,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:38,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2022-04-28 09:50:38,678 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2022-04-28 09:50:38,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:50:38,678 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2022-04-28 09:50:38,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:50:38,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 65 transitions. [2022-04-28 09:50:38,916 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 09:50:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-28 09:50:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 09:50:38,917 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:50:38,917 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:50:38,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-28 09:50:39,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 09:50:39,123 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:50:39,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:50:39,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1568564385, now seen corresponding path program 51 times [2022-04-28 09:50:39,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:50:39,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [439797492] [2022-04-28 09:50:39,126 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:50:39,126 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:50:39,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1568564385, now seen corresponding path program 52 times [2022-04-28 09:50:39,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:50:39,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250979078] [2022-04-28 09:50:39,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:50:39,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:50:39,142 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:50:39,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1782507590] [2022-04-28 09:50:39,142 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:50:39,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:50:39,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:50:39,143 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:50:39,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 09:50:39,197 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:50:39,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:50:39,199 WARN L261 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-28 09:50:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:50:39,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:50:41,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {13293#true} call ULTIMATE.init(); {13293#true} is VALID [2022-04-28 09:50:41,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {13293#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(9, 2); {13293#true} is VALID [2022-04-28 09:50:41,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {13293#true} assume true; {13293#true} is VALID [2022-04-28 09:50:41,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13293#true} {13293#true} #55#return; {13293#true} is VALID [2022-04-28 09:50:41,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {13293#true} call #t~ret3 := main(); {13293#true} is VALID [2022-04-28 09:50:41,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {13293#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13293#true} is VALID [2022-04-28 09:50:41,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {13293#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {13316#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:50:41,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {13316#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13320#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:50:41,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {13320#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13324#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} is VALID [2022-04-28 09:50:41,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {13324#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13328#(and (= main_~sum~0 (+ main_~i~0 1)) (= main_~i~0 2))} is VALID [2022-04-28 09:50:41,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {13328#(and (= main_~sum~0 (+ main_~i~0 1)) (= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13332#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:50:41,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {13332#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~i~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13336#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:50:41,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {13336#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13340#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-28 09:50:41,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {13340#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13344#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} is VALID [2022-04-28 09:50:41,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {13344#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13348#(and (= 5 main_~i~0) (= (+ main_~sum~0 (- 4)) 6))} is VALID [2022-04-28 09:50:41,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {13348#(and (= 5 main_~i~0) (= (+ main_~sum~0 (- 4)) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13352#(and (= 6 (+ (* (- 1) main_~i~0) main_~sum~0 (- 4))) (= 5 main_~i~0))} is VALID [2022-04-28 09:50:41,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {13352#(and (= 6 (+ (* (- 1) main_~i~0) main_~sum~0 (- 4))) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13356#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 6) (= (+ (- 1) main_~i~0) 5))} is VALID [2022-04-28 09:50:41,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {13356#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 6) (= (+ (- 1) main_~i~0) 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13360#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} is VALID [2022-04-28 09:50:41,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {13360#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13364#(and (= main_~sum~0 (+ 7 (* main_~i~0 2))) (= 5 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:50:41,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {13364#(and (= main_~sum~0 (+ 7 (* main_~i~0 2))) (= 5 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13368#(and (= (+ 7 (* main_~i~0 3)) main_~sum~0) (= 5 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:50:41,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {13368#(and (= (+ 7 (* main_~i~0 3)) main_~sum~0) (= 5 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13372#(and (= (+ main_~i~0 (- 3)) 5) (= main_~sum~0 (+ (* main_~i~0 3) 4)))} is VALID [2022-04-28 09:50:41,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {13372#(and (= (+ main_~i~0 (- 3)) 5) (= main_~sum~0 (+ (* main_~i~0 3) 4)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13376#(and (= (+ main_~i~0 (- 3)) 5) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 3) 4)))} is VALID [2022-04-28 09:50:41,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {13376#(and (= (+ main_~i~0 (- 3)) 5) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 3) 4)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13380#(and (= (+ main_~sum~0 (- 8)) 28) (= main_~i~0 9))} is VALID [2022-04-28 09:50:41,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {13380#(and (= (+ main_~sum~0 (- 8)) 28) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13384#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-28 09:50:41,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {13384#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13388#(and (= (+ (- 1) main_~i~0) 9) (= (+ 35 main_~i~0) main_~sum~0))} is VALID [2022-04-28 09:50:41,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {13388#(and (= (+ (- 1) main_~i~0) 9) (= (+ 35 main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13392#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} is VALID [2022-04-28 09:50:41,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {13392#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13396#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2022-04-28 09:50:41,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {13396#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13400#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} is VALID [2022-04-28 09:50:41,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {13400#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13404#(and (= main_~i~0 12) (= 55 (+ (- 11) main_~sum~0)))} is VALID [2022-04-28 09:50:41,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {13404#(and (= main_~i~0 12) (= 55 (+ (- 11) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13408#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} is VALID [2022-04-28 09:50:41,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {13408#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13412#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} is VALID [2022-04-28 09:50:41,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {13412#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13416#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-28 09:50:41,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {13416#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13420#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 2) 63)))} is VALID [2022-04-28 09:50:41,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {13420#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 2) 63)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13424#(and (= 12 (+ (- 2) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 2) 63)))} is VALID [2022-04-28 09:50:41,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {13424#(and (= 12 (+ (- 2) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 2) 63)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13428#(and (= (+ (* main_~i~0 2) 61) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 12))} is VALID [2022-04-28 09:50:41,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {13428#(and (= (+ (* main_~i~0 2) 61) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 12))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13432#(and (= (+ (* main_~i~0 2) 61) (+ main_~sum~0 (* (- 2) main_~i~0) 1)) (= (+ main_~i~0 (- 3)) 12))} is VALID [2022-04-28 09:50:41,547 INFO L290 TraceCheckUtils]: 36: Hoare triple {13432#(and (= (+ (* main_~i~0 2) 61) (+ main_~sum~0 (* (- 2) main_~i~0) 1)) (= (+ main_~i~0 (- 3)) 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13436#(and (= main_~i~0 16) (= 91 (+ main_~sum~0 (- 29))))} is VALID [2022-04-28 09:50:41,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {13436#(and (= main_~i~0 16) (= 91 (+ main_~sum~0 (- 29))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13440#(and (= main_~i~0 16) (= 91 (+ (* (- 1) main_~i~0) main_~sum~0 (- 29))))} is VALID [2022-04-28 09:50:41,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {13440#(and (= main_~i~0 16) (= 91 (+ (* (- 1) main_~i~0) main_~sum~0 (- 29))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13444#(and (= 91 (+ (* (- 1) main_~i~0) (- 28) main_~sum~0)) (= (+ (- 1) main_~i~0) 16))} is VALID [2022-04-28 09:50:41,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {13444#(and (= 91 (+ (* (- 1) main_~i~0) (- 28) main_~sum~0)) (= (+ (- 1) main_~i~0) 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13448#(and (= (+ (- 1) main_~i~0) 16) (= 91 (+ (- 28) main_~sum~0 (* (- 2) main_~i~0))))} is VALID [2022-04-28 09:50:41,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {13448#(and (= (+ (- 1) main_~i~0) 16) (= 91 (+ (- 28) main_~sum~0 (* (- 2) main_~i~0))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13452#(and (= 91 (+ (- 62) main_~sum~0)) (= main_~i~0 18))} is VALID [2022-04-28 09:50:41,549 INFO L290 TraceCheckUtils]: 41: Hoare triple {13452#(and (= 91 (+ (- 62) main_~sum~0)) (= main_~i~0 18))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13456#(and (= 91 (+ (* (- 1) main_~i~0) (- 62) main_~sum~0)) (= main_~i~0 18))} is VALID [2022-04-28 09:50:41,549 INFO L290 TraceCheckUtils]: 42: Hoare triple {13456#(and (= 91 (+ (* (- 1) main_~i~0) (- 62) main_~sum~0)) (= main_~i~0 18))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13460#(and (= 19 main_~i~0) (= 91 (+ (- 80) main_~sum~0)))} is VALID [2022-04-28 09:50:41,549 INFO L290 TraceCheckUtils]: 43: Hoare triple {13460#(and (= 19 main_~i~0) (= 91 (+ (- 80) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13464#(and (= 91 (+ (* (- 1) main_~i~0) (- 80) main_~sum~0)) (= 19 main_~i~0))} is VALID [2022-04-28 09:50:41,550 INFO L290 TraceCheckUtils]: 44: Hoare triple {13464#(and (= 91 (+ (* (- 1) main_~i~0) (- 80) main_~sum~0)) (= 19 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13468#(and (= 91 (+ (- 79) (* (- 1) main_~i~0) main_~sum~0)) (= 19 (+ (- 1) main_~i~0)))} is VALID [2022-04-28 09:50:41,550 INFO L290 TraceCheckUtils]: 45: Hoare triple {13468#(and (= 91 (+ (- 79) (* (- 1) main_~i~0) main_~sum~0)) (= 19 (+ (- 1) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13472#(and (= (+ 170 (* main_~i~0 2)) main_~sum~0) (= 19 (+ (- 1) main_~i~0)))} is VALID [2022-04-28 09:50:41,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {13472#(and (= (+ 170 (* main_~i~0 2)) main_~sum~0) (= 19 (+ (- 1) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13476#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2022-04-28 09:50:41,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {13476#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13480#(and (= main_~i~0 21) (= (+ (* (- 1) main_~i~0) main_~sum~0) 210))} is VALID [2022-04-28 09:50:41,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {13480#(and (= main_~i~0 21) (= (+ (* (- 1) main_~i~0) main_~sum~0) 210))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13484#(and (= main_~i~0 22) (= (+ main_~sum~0 (- 21)) 210))} is VALID [2022-04-28 09:50:41,552 INFO L290 TraceCheckUtils]: 49: Hoare triple {13484#(and (= main_~i~0 22) (= (+ main_~sum~0 (- 21)) 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13488#(and (= main_~i~0 22) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 21)) 210))} is VALID [2022-04-28 09:50:41,552 INFO L290 TraceCheckUtils]: 50: Hoare triple {13488#(and (= main_~i~0 22) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 21)) 210))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13492#(and (= (+ main_~sum~0 (- 43)) 210) (= 23 main_~i~0))} is VALID [2022-04-28 09:50:41,552 INFO L290 TraceCheckUtils]: 51: Hoare triple {13492#(and (= (+ main_~sum~0 (- 43)) 210) (= 23 main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13496#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 43)) 210) (= 23 main_~i~0))} is VALID [2022-04-28 09:50:41,553 INFO L290 TraceCheckUtils]: 52: Hoare triple {13496#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 43)) 210) (= 23 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13500#(and (= 23 (+ (- 1) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 42)) 210))} is VALID [2022-04-28 09:50:41,553 INFO L290 TraceCheckUtils]: 53: Hoare triple {13500#(and (= 23 (+ (- 1) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 42)) 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13504#(and (= (+ 252 (* main_~i~0 2)) main_~sum~0) (= 23 (+ (- 1) main_~i~0)))} is VALID [2022-04-28 09:50:41,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {13504#(and (= (+ 252 (* main_~i~0 2)) main_~sum~0) (= 23 (+ (- 1) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13508#(and (= main_~i~0 25) (= main_~sum~0 300))} is VALID [2022-04-28 09:50:41,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {13508#(and (= main_~i~0 25) (= main_~sum~0 300))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13512#(and (= main_~i~0 25) (= (+ (* (- 1) main_~i~0) main_~sum~0) 300))} is VALID [2022-04-28 09:50:41,554 INFO L290 TraceCheckUtils]: 56: Hoare triple {13512#(and (= main_~i~0 25) (= (+ (* (- 1) main_~i~0) main_~sum~0) 300))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13516#(and (= main_~i~0 (+ (- 299) main_~sum~0)) (= (+ (- 300) main_~sum~0) 25))} is VALID [2022-04-28 09:50:41,555 INFO L290 TraceCheckUtils]: 57: Hoare triple {13516#(and (= main_~i~0 (+ (- 299) main_~sum~0)) (= (+ (- 300) main_~sum~0) 25))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13520#(and (= main_~sum~0 (+ 325 main_~i~0)) (<= main_~i~0 main_~n~0) (= main_~i~0 26))} is VALID [2022-04-28 09:50:41,557 INFO L290 TraceCheckUtils]: 58: Hoare triple {13520#(and (= main_~sum~0 (+ 325 main_~i~0)) (<= main_~i~0 main_~n~0) (= main_~i~0 26))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13524#(and (= main_~sum~0 351) (<= main_~i~0 27) (<= 26 main_~n~0))} is VALID [2022-04-28 09:50:41,562 INFO L290 TraceCheckUtils]: 59: Hoare triple {13524#(and (= main_~sum~0 351) (<= main_~i~0 27) (<= 26 main_~n~0))} assume !(~i~0 <= ~n~0); {13528#(and (= main_~sum~0 351) (< main_~n~0 27) (<= 26 main_~n~0))} is VALID [2022-04-28 09:50:41,564 INFO L272 TraceCheckUtils]: 60: Hoare triple {13528#(and (= main_~sum~0 351) (< main_~n~0 27) (<= 26 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {13532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:50:41,564 INFO L290 TraceCheckUtils]: 61: Hoare triple {13532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:50:41,565 INFO L290 TraceCheckUtils]: 62: Hoare triple {13536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13294#false} is VALID [2022-04-28 09:50:41,565 INFO L290 TraceCheckUtils]: 63: Hoare triple {13294#false} assume !false; {13294#false} is VALID [2022-04-28 09:50:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:50:41,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:51:07,316 INFO L290 TraceCheckUtils]: 63: Hoare triple {13294#false} assume !false; {13294#false} is VALID [2022-04-28 09:51:07,316 INFO L290 TraceCheckUtils]: 62: Hoare triple {13536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13294#false} is VALID [2022-04-28 09:51:07,316 INFO L290 TraceCheckUtils]: 61: Hoare triple {13532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:51:07,317 INFO L272 TraceCheckUtils]: 60: Hoare triple {13552#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {13532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:51:07,317 INFO L290 TraceCheckUtils]: 59: Hoare triple {13556#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {13552#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:51:07,325 INFO L290 TraceCheckUtils]: 58: Hoare triple {13560#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13556#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:51:07,330 INFO L290 TraceCheckUtils]: 57: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13560#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:51:07,337 INFO L290 TraceCheckUtils]: 56: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,348 INFO L290 TraceCheckUtils]: 55: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,356 INFO L290 TraceCheckUtils]: 54: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,371 INFO L290 TraceCheckUtils]: 53: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,373 INFO L290 TraceCheckUtils]: 52: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,387 INFO L290 TraceCheckUtils]: 51: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,394 INFO L290 TraceCheckUtils]: 50: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,407 INFO L290 TraceCheckUtils]: 48: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,421 INFO L290 TraceCheckUtils]: 47: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,447 INFO L290 TraceCheckUtils]: 44: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,479 INFO L290 TraceCheckUtils]: 40: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,496 INFO L290 TraceCheckUtils]: 39: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,509 INFO L290 TraceCheckUtils]: 37: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:07,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {13293#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:07,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {13293#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13293#true} is VALID [2022-04-28 09:51:07,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {13293#true} call #t~ret3 := main(); {13293#true} is VALID [2022-04-28 09:51:07,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13293#true} {13293#true} #55#return; {13293#true} is VALID [2022-04-28 09:51:07,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {13293#true} assume true; {13293#true} is VALID [2022-04-28 09:51:07,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {13293#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(9, 2); {13293#true} is VALID [2022-04-28 09:51:07,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {13293#true} call ULTIMATE.init(); {13293#true} is VALID [2022-04-28 09:51:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2022-04-28 09:51:07,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:51:07,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250979078] [2022-04-28 09:51:07,793 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:51:07,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782507590] [2022-04-28 09:51:07,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782507590] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:51:07,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:51:07,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 9] total 63 [2022-04-28 09:51:07,794 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:51:07,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [439797492] [2022-04-28 09:51:07,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [439797492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:51:07,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:51:07,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-28 09:51:07,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286510380] [2022-04-28 09:51:07,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:51:07,794 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 09:51:07,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:51:07,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:51:07,981 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 09:51:07,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-28 09:51:07,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:51:07,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-28 09:51:07,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3721, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 09:51:07,982 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand has 58 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:51:18,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:51:18,090 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 09:51:18,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-28 09:51:18,090 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 09:51:18,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:51:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:51:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-28 09:51:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:51:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-28 09:51:18,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 72 transitions. [2022-04-28 09:51:18,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:51:18,306 INFO L225 Difference]: With dead ends: 72 [2022-04-28 09:51:18,306 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 09:51:18,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 40 SyntacticMatches, 26 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=196, Invalid=3964, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 09:51:18,307 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 3191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-28 09:51:18,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 398 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3191 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-04-28 09:51:18,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 09:51:18,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 09:51:18,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:51:18,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:51:18,357 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:51:18,357 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:51:18,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:51:18,358 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-28 09:51:18,358 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-28 09:51:18,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:51:18,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:51:18,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 09:51:18,358 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 09:51:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:51:18,359 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-28 09:51:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-28 09:51:18,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:51:18,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:51:18,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:51:18,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:51:18,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:51:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2022-04-28 09:51:18,360 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2022-04-28 09:51:18,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:51:18,360 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2022-04-28 09:51:18,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:51:18,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 67 transitions. [2022-04-28 09:51:18,589 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 09:51:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-28 09:51:18,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 09:51:18,589 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:51:18,590 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:51:18,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-28 09:51:18,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 09:51:18,790 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:51:18,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:51:18,791 INFO L85 PathProgramCache]: Analyzing trace with hash 958848575, now seen corresponding path program 53 times [2022-04-28 09:51:18,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:51:18,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [275084076] [2022-04-28 09:51:18,793 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:51:18,793 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:51:18,793 INFO L85 PathProgramCache]: Analyzing trace with hash 958848575, now seen corresponding path program 54 times [2022-04-28 09:51:18,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:51:18,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854952289] [2022-04-28 09:51:18,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:51:18,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:51:18,819 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:51:18,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392351086] [2022-04-28 09:51:18,820 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:51:18,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:51:18,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:51:18,821 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:51:18,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 09:51:18,903 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-28 09:51:18,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:51:18,905 WARN L261 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 116 conjunts are in the unsatisfiable core [2022-04-28 09:51:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:51:18,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:51:21,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {14155#true} call ULTIMATE.init(); {14155#true} is VALID [2022-04-28 09:51:21,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {14155#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(9, 2); {14155#true} is VALID [2022-04-28 09:51:21,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {14155#true} assume true; {14155#true} is VALID [2022-04-28 09:51:21,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14155#true} {14155#true} #55#return; {14155#true} is VALID [2022-04-28 09:51:21,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {14155#true} call #t~ret3 := main(); {14155#true} is VALID [2022-04-28 09:51:21,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {14155#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {14155#true} is VALID [2022-04-28 09:51:21,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {14155#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {14178#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:51:21,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {14178#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14182#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:51:21,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {14182#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14186#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-28 09:51:21,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {14186#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14190#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:51:21,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {14190#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14194#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 2))))} is VALID [2022-04-28 09:51:21,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {14194#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14198#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} is VALID [2022-04-28 09:51:21,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {14198#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14202#(and (= (+ (- 6) (* main_~i~0 3)) main_~sum~0) (= (+ main_~i~0 (- 3)) 1))} is VALID [2022-04-28 09:51:21,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {14202#(and (= (+ (- 6) (* main_~i~0 3)) main_~sum~0) (= (+ main_~i~0 (- 3)) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14206#(and (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} is VALID [2022-04-28 09:51:21,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {14206#(and (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14210#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-28 09:51:21,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {14210#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14214#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} is VALID [2022-04-28 09:51:21,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {14214#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14218#(and (= (+ (- 1) main_~i~0) 5) (= 10 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-28 09:51:21,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {14218#(and (= (+ (- 1) main_~i~0) 5) (= 10 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14222#(and (= (+ (- 1) main_~i~0) 5) (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 10))} is VALID [2022-04-28 09:51:21,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {14222#(and (= (+ (- 1) main_~i~0) 5) (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14226#(and (= 10 (+ (- 11) main_~sum~0)) (= 7 main_~i~0))} is VALID [2022-04-28 09:51:21,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {14226#(and (= 10 (+ (- 11) main_~sum~0)) (= 7 main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14230#(and (= 7 main_~i~0) (= (+ (- 11) (* (- 1) main_~i~0) main_~sum~0) 10))} is VALID [2022-04-28 09:51:21,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {14230#(and (= 7 main_~i~0) (= (+ (- 11) (* (- 1) main_~i~0) main_~sum~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14234#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 10)) 10) (= 7 (+ (- 1) main_~i~0)))} is VALID [2022-04-28 09:51:21,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {14234#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 10)) 10) (= 7 (+ (- 1) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14238#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} is VALID [2022-04-28 09:51:21,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {14238#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14242#(and (= 7 (+ (- 2) main_~i~0)) (= (+ 18 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-28 09:51:21,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {14242#(and (= 7 (+ (- 2) main_~i~0)) (= (+ 18 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14246#(and (= main_~sum~0 (+ (* main_~i~0 3) 18)) (= 7 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:51:21,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {14246#(and (= main_~sum~0 (+ (* main_~i~0 3) 18)) (= 7 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14250#(and (= main_~sum~0 (+ 15 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 7))} is VALID [2022-04-28 09:51:21,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {14250#(and (= main_~sum~0 (+ 15 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14254#(and (= (+ main_~i~0 (- 3)) 7) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 15 (* main_~i~0 3))))} is VALID [2022-04-28 09:51:21,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {14254#(and (= (+ main_~i~0 (- 3)) 7) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 15 (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14258#(and (= (+ (* main_~i~0 3) 12) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= 7 (+ main_~i~0 (- 4))))} is VALID [2022-04-28 09:51:21,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {14258#(and (= (+ (* main_~i~0 3) 12) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= 7 (+ main_~i~0 (- 4))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14262#(and (= (+ (* main_~i~0 3) 12) (+ main_~sum~0 (* (- 2) main_~i~0) 1)) (= 7 (+ main_~i~0 (- 4))))} is VALID [2022-04-28 09:51:21,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {14262#(and (= (+ (* main_~i~0 3) 12) (+ main_~sum~0 (* (- 2) main_~i~0) 1)) (= 7 (+ main_~i~0 (- 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14266#(and (= (+ 9 (* main_~i~0 3)) (+ main_~sum~0 3 (* (- 2) main_~i~0))) (= (+ main_~i~0 (- 5)) 7))} is VALID [2022-04-28 09:51:21,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {14266#(and (= (+ 9 (* main_~i~0 3)) (+ main_~sum~0 3 (* (- 2) main_~i~0))) (= (+ main_~i~0 (- 5)) 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14270#(and (= main_~sum~0 (+ (* main_~i~0 6) 6)) (= (+ main_~i~0 (- 5)) 7))} is VALID [2022-04-28 09:51:21,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {14270#(and (= main_~sum~0 (+ (* main_~i~0 6) 6)) (= (+ main_~i~0 (- 5)) 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14274#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2022-04-28 09:51:21,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {14274#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14278#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2022-04-28 09:51:21,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {14278#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14282#(and (= 13 (+ main_~sum~0 (- 78))) (= (+ (- 77) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:51:21,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {14282#(and (= 13 (+ main_~sum~0 (- 78))) (= (+ (- 77) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14286#(and (= main_~sum~0 (+ 91 main_~i~0)) (= main_~i~0 14))} is VALID [2022-04-28 09:51:21,693 INFO L290 TraceCheckUtils]: 34: Hoare triple {14286#(and (= main_~sum~0 (+ 91 main_~i~0)) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14290#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} is VALID [2022-04-28 09:51:21,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {14290#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14294#(and (= main_~i~0 15) (= main_~sum~0 (+ main_~i~0 105)))} is VALID [2022-04-28 09:51:21,693 INFO L290 TraceCheckUtils]: 36: Hoare triple {14294#(and (= main_~i~0 15) (= main_~sum~0 (+ main_~i~0 105)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14298#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} is VALID [2022-04-28 09:51:21,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {14298#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14302#(and (= main_~i~0 16) (= (+ main_~i~0 120) main_~sum~0))} is VALID [2022-04-28 09:51:21,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {14302#(and (= main_~i~0 16) (= (+ main_~i~0 120) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14306#(and (= main_~i~0 (+ main_~sum~0 (- 119))) (= 16 (+ (- 120) main_~sum~0)))} is VALID [2022-04-28 09:51:21,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {14306#(and (= main_~i~0 (+ main_~sum~0 (- 119))) (= 16 (+ (- 120) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14310#(and (= (+ (* (- 1) main_~i~0) (- 120) main_~sum~0) 16) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 119))))} is VALID [2022-04-28 09:51:21,703 INFO L290 TraceCheckUtils]: 40: Hoare triple {14310#(and (= (+ (* (- 1) main_~i~0) (- 120) main_~sum~0) 16) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 119))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14314#(and (= (+ (* (- 1) main_~i~0) (- 118) main_~sum~0) (+ (- 1) main_~i~0)) (= 16 (+ (* (- 1) main_~i~0) main_~sum~0 (- 119))))} is VALID [2022-04-28 09:51:21,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {14314#(and (= (+ (* (- 1) main_~i~0) (- 118) main_~sum~0) (+ (- 1) main_~i~0)) (= 16 (+ (* (- 1) main_~i~0) main_~sum~0 (- 119))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14318#(and (= 16 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 117 (* main_~i~0 3))))} is VALID [2022-04-28 09:51:21,708 INFO L290 TraceCheckUtils]: 42: Hoare triple {14318#(and (= 16 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 117 (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14322#(and (= (+ main_~i~0 (- 3)) 16) (= (+ 114 (* main_~i~0 3)) main_~sum~0))} is VALID [2022-04-28 09:51:21,709 INFO L290 TraceCheckUtils]: 43: Hoare triple {14322#(and (= (+ main_~i~0 (- 3)) 16) (= (+ 114 (* main_~i~0 3)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14326#(and (= (+ main_~i~0 (- 3)) 16) (= (+ 114 (* main_~i~0 3)) (+ (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:51:21,709 INFO L290 TraceCheckUtils]: 44: Hoare triple {14326#(and (= (+ main_~i~0 (- 3)) 16) (= (+ 114 (* main_~i~0 3)) (+ (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14330#(and (= main_~i~0 20) (= 171 (+ main_~sum~0 (- 19))))} is VALID [2022-04-28 09:51:21,709 INFO L290 TraceCheckUtils]: 45: Hoare triple {14330#(and (= main_~i~0 20) (= 171 (+ main_~sum~0 (- 19))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14334#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} is VALID [2022-04-28 09:51:21,710 INFO L290 TraceCheckUtils]: 46: Hoare triple {14334#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14338#(and (= (+ main_~sum~0 (- 189)) main_~i~0) (= 20 (+ main_~sum~0 (- 190))))} is VALID [2022-04-28 09:51:21,710 INFO L290 TraceCheckUtils]: 47: Hoare triple {14338#(and (= (+ main_~sum~0 (- 189)) main_~i~0) (= 20 (+ main_~sum~0 (- 190))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14342#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 190)) 20) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 189)) main_~i~0))} is VALID [2022-04-28 09:51:21,717 INFO L290 TraceCheckUtils]: 48: Hoare triple {14342#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 190)) 20) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 189)) main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14346#(and (= (+ (- 210) main_~sum~0) 21) (= (+ main_~sum~0 (- 209)) main_~i~0))} is VALID [2022-04-28 09:51:21,718 INFO L290 TraceCheckUtils]: 49: Hoare triple {14346#(and (= (+ (- 210) main_~sum~0) 21) (= (+ main_~sum~0 (- 209)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14350#(and (= (+ 209 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} is VALID [2022-04-28 09:51:21,718 INFO L290 TraceCheckUtils]: 50: Hoare triple {14350#(and (= (+ 209 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14354#(and (= main_~sum~0 (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:51:21,719 INFO L290 TraceCheckUtils]: 51: Hoare triple {14354#(and (= main_~sum~0 (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14358#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:51:21,719 INFO L290 TraceCheckUtils]: 52: Hoare triple {14358#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14362#(and (= (+ (- 23) main_~sum~0) 253) (= main_~i~0 24))} is VALID [2022-04-28 09:51:21,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {14362#(and (= (+ (- 23) main_~sum~0) 253) (= main_~i~0 24))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14366#(and (= (+ (* (- 1) main_~i~0) (- 23) main_~sum~0) 253) (= main_~i~0 24))} is VALID [2022-04-28 09:51:21,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {14366#(and (= (+ (* (- 1) main_~i~0) (- 23) main_~sum~0) 253) (= main_~i~0 24))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14370#(and (= main_~i~0 25) (= (+ main_~sum~0 (- 47)) 253))} is VALID [2022-04-28 09:51:21,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {14370#(and (= main_~i~0 25) (= (+ main_~sum~0 (- 47)) 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14374#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} is VALID [2022-04-28 09:51:21,721 INFO L290 TraceCheckUtils]: 56: Hoare triple {14374#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14378#(and (= main_~sum~0 (+ main_~i~0 299)) (= (+ (- 1) main_~i~0) 25))} is VALID [2022-04-28 09:51:21,721 INFO L290 TraceCheckUtils]: 57: Hoare triple {14378#(and (= main_~sum~0 (+ main_~i~0 299)) (= (+ (- 1) main_~i~0) 25))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14382#(and (= main_~sum~0 (+ (* main_~i~0 2) 299)) (= (+ (- 1) main_~i~0) 25))} is VALID [2022-04-28 09:51:21,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {14382#(and (= main_~sum~0 (+ (* main_~i~0 2) 299)) (= (+ (- 1) main_~i~0) 25))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14386#(and (= main_~sum~0 351) (= main_~i~0 27))} is VALID [2022-04-28 09:51:21,722 INFO L290 TraceCheckUtils]: 59: Hoare triple {14386#(and (= main_~sum~0 351) (= main_~i~0 27))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14390#(and (= main_~i~0 27) (= main_~sum~0 (+ main_~i~0 351)) (<= main_~i~0 main_~n~0))} is VALID [2022-04-28 09:51:21,722 INFO L290 TraceCheckUtils]: 60: Hoare triple {14390#(and (= main_~i~0 27) (= main_~sum~0 (+ main_~i~0 351)) (<= main_~i~0 main_~n~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14394#(and (<= 27 main_~n~0) (= 378 main_~sum~0) (<= main_~i~0 28))} is VALID [2022-04-28 09:51:21,728 INFO L290 TraceCheckUtils]: 61: Hoare triple {14394#(and (<= 27 main_~n~0) (= 378 main_~sum~0) (<= main_~i~0 28))} assume !(~i~0 <= ~n~0); {14398#(and (<= 27 main_~n~0) (= 378 main_~sum~0) (< main_~n~0 28))} is VALID [2022-04-28 09:51:21,729 INFO L272 TraceCheckUtils]: 62: Hoare triple {14398#(and (<= 27 main_~n~0) (= 378 main_~sum~0) (< main_~n~0 28))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {14402#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:51:21,730 INFO L290 TraceCheckUtils]: 63: Hoare triple {14402#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14406#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:51:21,730 INFO L290 TraceCheckUtils]: 64: Hoare triple {14406#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14156#false} is VALID [2022-04-28 09:51:21,730 INFO L290 TraceCheckUtils]: 65: Hoare triple {14156#false} assume !false; {14156#false} is VALID [2022-04-28 09:51:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:51:21,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:51:59,920 INFO L290 TraceCheckUtils]: 65: Hoare triple {14156#false} assume !false; {14156#false} is VALID [2022-04-28 09:51:59,920 INFO L290 TraceCheckUtils]: 64: Hoare triple {14406#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14156#false} is VALID [2022-04-28 09:51:59,921 INFO L290 TraceCheckUtils]: 63: Hoare triple {14402#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14406#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:51:59,921 INFO L272 TraceCheckUtils]: 62: Hoare triple {14422#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {14402#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:51:59,921 INFO L290 TraceCheckUtils]: 61: Hoare triple {14426#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {14422#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:51:59,931 INFO L290 TraceCheckUtils]: 60: Hoare triple {14430#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14426#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:51:59,938 INFO L290 TraceCheckUtils]: 59: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14430#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:51:59,948 INFO L290 TraceCheckUtils]: 58: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:59,962 INFO L290 TraceCheckUtils]: 57: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:59,971 INFO L290 TraceCheckUtils]: 56: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:59,982 INFO L290 TraceCheckUtils]: 55: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:51:59,984 INFO L290 TraceCheckUtils]: 54: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:51:59,998 INFO L290 TraceCheckUtils]: 53: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,006 INFO L290 TraceCheckUtils]: 52: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,022 INFO L290 TraceCheckUtils]: 51: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,025 INFO L290 TraceCheckUtils]: 50: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,050 INFO L290 TraceCheckUtils]: 48: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,063 INFO L290 TraceCheckUtils]: 47: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,100 INFO L290 TraceCheckUtils]: 44: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,116 INFO L290 TraceCheckUtils]: 43: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,126 INFO L290 TraceCheckUtils]: 42: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,148 INFO L290 TraceCheckUtils]: 40: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,172 INFO L290 TraceCheckUtils]: 38: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:52:00,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {14155#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:52:00,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {14155#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {14155#true} is VALID [2022-04-28 09:52:00,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {14155#true} call #t~ret3 := main(); {14155#true} is VALID [2022-04-28 09:52:00,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14155#true} {14155#true} #55#return; {14155#true} is VALID [2022-04-28 09:52:00,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {14155#true} assume true; {14155#true} is VALID [2022-04-28 09:52:00,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {14155#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(9, 2); {14155#true} is VALID [2022-04-28 09:52:00,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {14155#true} call ULTIMATE.init(); {14155#true} is VALID [2022-04-28 09:52:00,543 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-28 09:52:00,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:52:00,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854952289] [2022-04-28 09:52:00,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:52:00,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392351086] [2022-04-28 09:52:00,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392351086] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:52:00,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:52:00,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 9] total 65 [2022-04-28 09:52:00,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:52:00,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [275084076] [2022-04-28 09:52:00,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [275084076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:52:00,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:52:00,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-28 09:52:00,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561301104] [2022-04-28 09:52:00,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:52:00,544 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 09:52:00,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:52:00,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:52:00,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:52:00,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-28 09:52:00,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:52:00,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-28 09:52:00,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3969, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 09:52:00,828 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:52:20,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:52:20,834 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-28 09:52:20,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-28 09:52:20,834 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 09:52:20,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:52:20,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:52:20,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-28 09:52:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:52:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-28 09:52:20,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 74 transitions. [2022-04-28 09:52:21,252 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 09:52:21,253 INFO L225 Difference]: With dead ends: 74 [2022-04-28 09:52:21,253 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 09:52:21,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 41 SyntacticMatches, 27 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 35.1s TimeCoverageRelationStatistics Valid=202, Invalid=4220, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 09:52:21,254 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 3421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 3422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-04-28 09:52:21,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 412 Invalid, 3422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3421 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2022-04-28 09:52:21,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 09:52:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-28 09:52:21,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:52:21,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:52:21,311 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:52:21,311 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:52:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:52:21,312 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-28 09:52:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-28 09:52:21,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:52:21,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:52:21,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-28 09:52:21,313 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-28 09:52:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:52:21,314 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-28 09:52:21,314 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-28 09:52:21,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:52:21,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:52:21,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:52:21,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:52:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:52:21,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2022-04-28 09:52:21,316 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2022-04-28 09:52:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:52:21,316 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2022-04-28 09:52:21,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:52:21,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 69 transitions. [2022-04-28 09:52:21,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:52:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-28 09:52:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 09:52:21,754 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:52:21,754 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:52:21,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 09:52:21,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 09:52:21,955 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:52:21,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:52:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash -862492579, now seen corresponding path program 55 times [2022-04-28 09:52:21,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:52:21,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2142839649] [2022-04-28 09:52:21,958 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:52:21,958 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:52:21,958 INFO L85 PathProgramCache]: Analyzing trace with hash -862492579, now seen corresponding path program 56 times [2022-04-28 09:52:21,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:52:21,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529962534] [2022-04-28 09:52:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:52:21,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:52:21,981 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:52:21,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606675683] [2022-04-28 09:52:21,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:52:21,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:52:21,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:52:21,990 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:52:22,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 09:52:22,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:52:22,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:52:22,054 WARN L261 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 120 conjunts are in the unsatisfiable core [2022-04-28 09:52:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:52:22,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:52:27,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {15043#true} call ULTIMATE.init(); {15043#true} is VALID [2022-04-28 09:52:27,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {15043#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(9, 2); {15043#true} is VALID [2022-04-28 09:52:27,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {15043#true} assume true; {15043#true} is VALID [2022-04-28 09:52:27,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15043#true} {15043#true} #55#return; {15043#true} is VALID [2022-04-28 09:52:27,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {15043#true} call #t~ret3 := main(); {15043#true} is VALID [2022-04-28 09:52:27,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {15043#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15043#true} is VALID [2022-04-28 09:52:27,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {15043#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {15066#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:52:27,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {15066#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15070#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:52:27,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {15070#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15074#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2022-04-28 09:52:27,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {15074#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15078#(and (= main_~i~0 2) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} is VALID [2022-04-28 09:52:27,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {15078#(and (= main_~i~0 2) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15082#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 1) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:52:27,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {15082#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 1) (= (+ (- 1) main_~i~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15086#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:52:27,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {15086#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15090#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-28 09:52:27,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {15090#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15094#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} is VALID [2022-04-28 09:52:27,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {15094#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15098#(and (= 6 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-28 09:52:27,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {15098#(and (= 6 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15102#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-28 09:52:27,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {15102#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15106#(and (= main_~i~0 6) (= main_~sum~0 15))} is VALID [2022-04-28 09:52:27,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {15106#(and (= main_~i~0 6) (= main_~sum~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15110#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} is VALID [2022-04-28 09:52:27,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {15110#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15114#(and (= 7 main_~i~0) (= main_~sum~0 21))} is VALID [2022-04-28 09:52:27,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {15114#(and (= 7 main_~i~0) (= main_~sum~0 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15118#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} is VALID [2022-04-28 09:52:27,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {15118#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15122#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2022-04-28 09:52:27,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {15122#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15126#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 28) (= main_~i~0 8))} is VALID [2022-04-28 09:52:27,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {15126#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 28) (= main_~i~0 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15130#(and (= 8 (+ (- 28) main_~sum~0)) (= (+ (- 27) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:52:27,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {15130#(and (= 8 (+ (- 28) main_~sum~0)) (= (+ (- 27) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15134#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-28 09:52:27,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {15134#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15138#(and (= main_~i~0 (+ main_~sum~0 (- 35))) (= (+ main_~sum~0 (- 36)) 9))} is VALID [2022-04-28 09:52:27,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {15138#(and (= main_~i~0 (+ main_~sum~0 (- 35))) (= (+ main_~sum~0 (- 36)) 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15142#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} is VALID [2022-04-28 09:52:27,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {15142#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15146#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2022-04-28 09:52:27,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {15146#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15150#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} is VALID [2022-04-28 09:52:27,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {15150#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15154#(and (= main_~i~0 12) (= 55 (+ (- 11) main_~sum~0)))} is VALID [2022-04-28 09:52:27,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {15154#(and (= main_~i~0 12) (= 55 (+ (- 11) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15158#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} is VALID [2022-04-28 09:52:27,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {15158#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15162#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2022-04-28 09:52:27,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {15162#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15166#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2022-04-28 09:52:27,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {15166#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15170#(and (= 13 (+ main_~sum~0 (- 78))) (= (+ (- 77) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:52:27,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {15170#(and (= 13 (+ main_~sum~0 (- 78))) (= (+ (- 77) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15174#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 78)) 13) (= (+ (* (- 1) main_~i~0) (- 77) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:52:27,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {15174#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 78)) 13) (= (+ (* (- 1) main_~i~0) (- 77) main_~sum~0) main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15178#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} is VALID [2022-04-28 09:52:27,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {15178#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15182#(and (= 14 (+ (* (- 1) main_~i~0) main_~sum~0 (- 91))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 90))))} is VALID [2022-04-28 09:52:27,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {15182#(and (= 14 (+ (* (- 1) main_~i~0) main_~sum~0 (- 91))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 90))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15186#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} is VALID [2022-04-28 09:52:27,594 INFO L290 TraceCheckUtils]: 37: Hoare triple {15186#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15190#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:52:27,607 INFO L290 TraceCheckUtils]: 38: Hoare triple {15190#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15194#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 104)) 15) (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 (- 103))))} is VALID [2022-04-28 09:52:27,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {15194#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 104)) 15) (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 (- 103))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15198#(and (= (+ (- 1) main_~i~0) 16) (= main_~sum~0 (+ 119 (* main_~i~0 2))))} is VALID [2022-04-28 09:52:27,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {15198#(and (= (+ (- 1) main_~i~0) 16) (= main_~sum~0 (+ 119 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15202#(and (= 153 main_~sum~0) (= main_~i~0 18))} is VALID [2022-04-28 09:52:27,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {15202#(and (= 153 main_~sum~0) (= main_~i~0 18))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15206#(and (= main_~i~0 18) (= (+ (* (- 1) main_~i~0) main_~sum~0) 153))} is VALID [2022-04-28 09:52:27,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {15206#(and (= main_~i~0 18) (= (+ (* (- 1) main_~i~0) main_~sum~0) 153))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15210#(and (= (+ (- 1) main_~i~0) 18) (= 153 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-28 09:52:27,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {15210#(and (= (+ (- 1) main_~i~0) 18) (= 153 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15214#(and (= (+ (- 1) main_~i~0) 18) (= 153 (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} is VALID [2022-04-28 09:52:27,616 INFO L290 TraceCheckUtils]: 44: Hoare triple {15214#(and (= (+ (- 1) main_~i~0) 18) (= 153 (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15218#(and (= main_~i~0 20) (= (+ (- 37) main_~sum~0) 153))} is VALID [2022-04-28 09:52:27,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {15218#(and (= main_~i~0 20) (= (+ (- 37) main_~sum~0) 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15222#(and (= main_~i~0 20) (= 153 (+ (* (- 1) main_~i~0) (- 37) main_~sum~0)))} is VALID [2022-04-28 09:52:27,617 INFO L290 TraceCheckUtils]: 46: Hoare triple {15222#(and (= main_~i~0 20) (= 153 (+ (* (- 1) main_~i~0) (- 37) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15226#(and (= main_~i~0 21) (= 153 (+ main_~sum~0 (- 57))))} is VALID [2022-04-28 09:52:27,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {15226#(and (= main_~i~0 21) (= 153 (+ main_~sum~0 (- 57))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15230#(and (= main_~i~0 21) (= 153 (+ (* (- 1) main_~i~0) main_~sum~0 (- 57))))} is VALID [2022-04-28 09:52:27,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {15230#(and (= main_~i~0 21) (= 153 (+ (* (- 1) main_~i~0) main_~sum~0 (- 57))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15234#(and (= main_~i~0 22) (= 153 (+ main_~sum~0 (- 78))))} is VALID [2022-04-28 09:52:27,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {15234#(and (= main_~i~0 22) (= 153 (+ main_~sum~0 (- 78))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15238#(and (= main_~i~0 22) (= 153 (+ (* (- 1) main_~i~0) main_~sum~0 (- 78))))} is VALID [2022-04-28 09:52:27,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {15238#(and (= main_~i~0 22) (= 153 (+ (* (- 1) main_~i~0) main_~sum~0 (- 78))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15242#(and (= (+ (- 1) main_~i~0) 22) (= 153 (+ (* (- 1) main_~i~0) (- 77) main_~sum~0)))} is VALID [2022-04-28 09:52:27,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {15242#(and (= (+ (- 1) main_~i~0) 22) (= 153 (+ (* (- 1) main_~i~0) (- 77) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15246#(and (= (+ (* main_~i~0 2) 230) main_~sum~0) (= (+ (- 1) main_~i~0) 22))} is VALID [2022-04-28 09:52:27,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {15246#(and (= (+ (* main_~i~0 2) 230) main_~sum~0) (= (+ (- 1) main_~i~0) 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15250#(and (= 22 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 228 (* main_~i~0 2))))} is VALID [2022-04-28 09:52:27,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {15250#(and (= 22 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 228 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15254#(and (= 22 (+ (- 2) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 228 (* main_~i~0 2))))} is VALID [2022-04-28 09:52:27,620 INFO L290 TraceCheckUtils]: 54: Hoare triple {15254#(and (= 22 (+ (- 2) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 228 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15258#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) (+ (* main_~i~0 2) 226)) (= (+ main_~i~0 (- 3)) 22))} is VALID [2022-04-28 09:52:27,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {15258#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) (+ (* main_~i~0 2) 226)) (= (+ main_~i~0 (- 3)) 22))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15262#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ (* main_~i~0 2) 226)) (= (+ main_~i~0 (- 3)) 22))} is VALID [2022-04-28 09:52:27,621 INFO L290 TraceCheckUtils]: 56: Hoare triple {15262#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ (* main_~i~0 2) 226)) (= (+ main_~i~0 (- 3)) 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15266#(and (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) (+ 224 (* main_~i~0 2))) (= 22 (+ main_~i~0 (- 4))))} is VALID [2022-04-28 09:52:27,621 INFO L290 TraceCheckUtils]: 57: Hoare triple {15266#(and (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) (+ 224 (* main_~i~0 2))) (= 22 (+ main_~i~0 (- 4))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15270#(and (= (+ 224 (* main_~i~0 2)) (+ main_~sum~0 3 (* main_~i~0 (- 3)))) (= 22 (+ main_~i~0 (- 4))))} is VALID [2022-04-28 09:52:27,622 INFO L290 TraceCheckUtils]: 58: Hoare triple {15270#(and (= (+ 224 (* main_~i~0 2)) (+ main_~sum~0 3 (* main_~i~0 (- 3)))) (= 22 (+ main_~i~0 (- 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15274#(and (= main_~i~0 27) (= (+ main_~sum~0 (- 75)) 276))} is VALID [2022-04-28 09:52:27,622 INFO L290 TraceCheckUtils]: 59: Hoare triple {15274#(and (= main_~i~0 27) (= (+ main_~sum~0 (- 75)) 276))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15278#(and (= main_~i~0 27) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 75)) 276))} is VALID [2022-04-28 09:52:27,622 INFO L290 TraceCheckUtils]: 60: Hoare triple {15278#(and (= main_~i~0 27) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 75)) 276))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15282#(and (= 276 (+ (- 102) main_~sum~0)) (= main_~i~0 28))} is VALID [2022-04-28 09:52:27,623 INFO L290 TraceCheckUtils]: 61: Hoare triple {15282#(and (= 276 (+ (- 102) main_~sum~0)) (= main_~i~0 28))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15286#(and (<= main_~i~0 main_~n~0) (= 276 (+ (- 102) (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 28))} is VALID [2022-04-28 09:52:27,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {15286#(and (<= main_~i~0 main_~n~0) (= 276 (+ (- 102) (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 28))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15290#(and (= (+ (- 378) main_~sum~0) 28) (<= (+ main_~i~0 377) main_~sum~0) (<= main_~sum~0 (+ 378 main_~n~0)))} is VALID [2022-04-28 09:52:27,624 INFO L290 TraceCheckUtils]: 63: Hoare triple {15290#(and (= (+ (- 378) main_~sum~0) 28) (<= (+ main_~i~0 377) main_~sum~0) (<= main_~sum~0 (+ 378 main_~n~0)))} assume !(~i~0 <= ~n~0); {15294#(and (= (+ (- 378) main_~sum~0) 28) (< (+ main_~n~0 377) main_~sum~0) (<= main_~sum~0 (+ 378 main_~n~0)))} is VALID [2022-04-28 09:52:27,625 INFO L272 TraceCheckUtils]: 64: Hoare triple {15294#(and (= (+ (- 378) main_~sum~0) 28) (< (+ main_~n~0 377) main_~sum~0) (<= main_~sum~0 (+ 378 main_~n~0)))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {15298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:52:27,626 INFO L290 TraceCheckUtils]: 65: Hoare triple {15298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:52:27,626 INFO L290 TraceCheckUtils]: 66: Hoare triple {15302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15044#false} is VALID [2022-04-28 09:52:27,626 INFO L290 TraceCheckUtils]: 67: Hoare triple {15044#false} assume !false; {15044#false} is VALID [2022-04-28 09:52:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:52:27,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:53:21,432 INFO L290 TraceCheckUtils]: 67: Hoare triple {15044#false} assume !false; {15044#false} is VALID [2022-04-28 09:53:21,433 INFO L290 TraceCheckUtils]: 66: Hoare triple {15302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15044#false} is VALID [2022-04-28 09:53:21,433 INFO L290 TraceCheckUtils]: 65: Hoare triple {15298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:53:21,434 INFO L272 TraceCheckUtils]: 64: Hoare triple {15318#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {15298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:53:21,434 INFO L290 TraceCheckUtils]: 63: Hoare triple {15322#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {15318#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:53:21,446 INFO L290 TraceCheckUtils]: 62: Hoare triple {15326#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15322#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:53:21,456 INFO L290 TraceCheckUtils]: 61: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15326#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:53:21,469 INFO L290 TraceCheckUtils]: 60: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,484 INFO L290 TraceCheckUtils]: 59: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,497 INFO L290 TraceCheckUtils]: 58: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,513 INFO L290 TraceCheckUtils]: 57: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,526 INFO L290 TraceCheckUtils]: 56: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,541 INFO L290 TraceCheckUtils]: 55: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,544 INFO L290 TraceCheckUtils]: 54: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,567 INFO L290 TraceCheckUtils]: 53: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,580 INFO L290 TraceCheckUtils]: 52: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,600 INFO L290 TraceCheckUtils]: 51: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,619 INFO L290 TraceCheckUtils]: 50: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,635 INFO L290 TraceCheckUtils]: 49: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,649 INFO L290 TraceCheckUtils]: 48: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,665 INFO L290 TraceCheckUtils]: 47: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,694 INFO L290 TraceCheckUtils]: 45: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,718 INFO L290 TraceCheckUtils]: 43: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,735 INFO L290 TraceCheckUtils]: 41: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,784 INFO L290 TraceCheckUtils]: 36: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:21,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:21,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:22,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:22,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:22,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:22,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:22,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:22,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:22,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:22,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:22,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:22,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:22,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:22,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:53:22,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {15043#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:53:22,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {15043#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15043#true} is VALID [2022-04-28 09:53:22,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {15043#true} call #t~ret3 := main(); {15043#true} is VALID [2022-04-28 09:53:22,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15043#true} {15043#true} #55#return; {15043#true} is VALID [2022-04-28 09:53:22,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {15043#true} assume true; {15043#true} is VALID [2022-04-28 09:53:22,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {15043#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(9, 2); {15043#true} is VALID [2022-04-28 09:53:22,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {15043#true} call ULTIMATE.init(); {15043#true} is VALID [2022-04-28 09:53:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2022-04-28 09:53:22,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:53:22,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529962534] [2022-04-28 09:53:22,168 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:53:22,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606675683] [2022-04-28 09:53:22,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606675683] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:53:22,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:53:22,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 9] total 67 [2022-04-28 09:53:22,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:53:22,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2142839649] [2022-04-28 09:53:22,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2142839649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:53:22,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:53:22,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-28 09:53:22,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763845760] [2022-04-28 09:53:22,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:53:22,170 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 09:53:22,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:53:22,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:53:22,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:53:22,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-28 09:53:22,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:53:22,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-28 09:53:22,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=4225, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 09:53:22,506 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 62 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:53:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:53:58,437 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-28 09:53:58,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-28 09:53:58,438 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 09:53:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:53:58,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:53:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-04-28 09:53:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:53:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-04-28 09:53:58,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 76 transitions. [2022-04-28 09:53:58,787 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 09:53:58,788 INFO L225 Difference]: With dead ends: 76 [2022-04-28 09:53:58,788 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 09:53:58,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 42 SyntacticMatches, 28 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 53.1s TimeCoverageRelationStatistics Valid=208, Invalid=4484, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 09:53:58,789 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 3719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:53:58,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 433 Invalid, 3719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 19.6s Time] [2022-04-28 09:53:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 09:53:58,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-28 09:53:58,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:53:58,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:53:58,837 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:53:58,837 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:53:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:53:58,838 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-28 09:53:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-28 09:53:58,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:53:58,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:53:58,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 09:53:58,838 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 09:53:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:53:58,839 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-28 09:53:58,839 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-28 09:53:58,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:53:58,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:53:58,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:53:58,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:53:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:53:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2022-04-28 09:53:58,841 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2022-04-28 09:53:58,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:53:58,841 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2022-04-28 09:53:58,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:53:58,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 71 transitions. [2022-04-28 09:53:59,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:53:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-28 09:53:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 09:53:59,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:53:59,259 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:53:59,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-28 09:53:59,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 09:53:59,480 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:53:59,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:53:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1175315195, now seen corresponding path program 57 times [2022-04-28 09:53:59,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:53:59,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [41593855] [2022-04-28 09:53:59,484 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:53:59,484 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:53:59,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1175315195, now seen corresponding path program 58 times [2022-04-28 09:53:59,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:53:59,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962943655] [2022-04-28 09:53:59,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:53:59,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:53:59,505 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:53:59,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717561699] [2022-04-28 09:53:59,505 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:53:59,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:53:59,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:53:59,507 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:53:59,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 09:53:59,566 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:53:59,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:53:59,568 WARN L261 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 124 conjunts are in the unsatisfiable core [2022-04-28 09:53:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:53:59,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:54:06,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {15957#true} call ULTIMATE.init(); {15957#true} is VALID [2022-04-28 09:54:06,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {15957#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(9, 2); {15957#true} is VALID [2022-04-28 09:54:06,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {15957#true} assume true; {15957#true} is VALID [2022-04-28 09:54:06,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15957#true} {15957#true} #55#return; {15957#true} is VALID [2022-04-28 09:54:06,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {15957#true} call #t~ret3 := main(); {15957#true} is VALID [2022-04-28 09:54:06,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {15957#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15957#true} is VALID [2022-04-28 09:54:06,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {15957#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {15980#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:54:06,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {15980#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15984#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:54:06,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {15984#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15988#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2022-04-28 09:54:06,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {15988#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15992#(and (= main_~i~0 2) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} is VALID [2022-04-28 09:54:06,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {15992#(and (= main_~i~0 2) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15996#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~sum~0) 2))} is VALID [2022-04-28 09:54:06,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {15996#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~sum~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16000#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:54:06,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {16000#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16004#(and (= main_~sum~0 (+ (- 2) (* main_~i~0 2))) (= 2 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:54:06,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {16004#(and (= main_~sum~0 (+ (- 2) (* main_~i~0 2))) (= 2 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16008#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 2) (* main_~i~0 2))) (= 2 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:54:06,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {16008#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 2) (* main_~i~0 2))) (= 2 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16012#(and (= 5 main_~i~0) (= (+ main_~sum~0 (- 4)) 6))} is VALID [2022-04-28 09:54:06,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {16012#(and (= 5 main_~i~0) (= (+ main_~sum~0 (- 4)) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16016#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} is VALID [2022-04-28 09:54:06,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {16016#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16020#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} is VALID [2022-04-28 09:54:06,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {16020#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16024#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} is VALID [2022-04-28 09:54:06,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {16024#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16028#(and (= (+ main_~i~0 14) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} is VALID [2022-04-28 09:54:06,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {16028#(and (= (+ main_~i~0 14) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16032#(and (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} is VALID [2022-04-28 09:54:06,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {16032#(and (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16036#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2022-04-28 09:54:06,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {16036#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16040#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} is VALID [2022-04-28 09:54:06,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {16040#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16044#(and (= (+ main_~i~0 27) main_~sum~0) (= (+ (- 1) main_~i~0) 8))} is VALID [2022-04-28 09:54:06,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {16044#(and (= (+ main_~i~0 27) main_~sum~0) (= (+ (- 1) main_~i~0) 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16048#(and (= main_~sum~0 (+ (* main_~i~0 2) 27)) (= (+ (- 1) main_~i~0) 8))} is VALID [2022-04-28 09:54:06,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {16048#(and (= main_~sum~0 (+ (* main_~i~0 2) 27)) (= (+ (- 1) main_~i~0) 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16052#(and (= main_~sum~0 (+ (* main_~i~0 2) 25)) (= 8 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:54:06,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {16052#(and (= main_~sum~0 (+ (* main_~i~0 2) 25)) (= 8 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16056#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 2) 25)) (= 8 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:54:06,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {16056#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 2) 25)) (= 8 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16060#(and (= (+ main_~i~0 (- 3)) 8) (= (+ 23 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-28 09:54:06,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {16060#(and (= (+ main_~i~0 (- 3)) 8) (= (+ 23 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16064#(and (= (+ main_~i~0 (- 3)) 8) (= (+ 23 (* main_~i~0 2)) (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} is VALID [2022-04-28 09:54:06,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {16064#(and (= (+ main_~i~0 (- 3)) 8) (= (+ 23 (* main_~i~0 2)) (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16068#(and (= 8 (+ main_~i~0 (- 4))) (= (+ 21 (* main_~i~0 2)) (+ main_~sum~0 3 (* (- 2) main_~i~0))))} is VALID [2022-04-28 09:54:06,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {16068#(and (= 8 (+ main_~i~0 (- 4))) (= (+ 21 (* main_~i~0 2)) (+ main_~sum~0 3 (* (- 2) main_~i~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16072#(and (= 8 (+ main_~i~0 (- 4))) (= (+ (* 5 main_~i~0) 18) main_~sum~0))} is VALID [2022-04-28 09:54:06,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {16072#(and (= 8 (+ main_~i~0 (- 4))) (= (+ (* 5 main_~i~0) 18) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16076#(and (= (+ main_~i~0 (- 5)) 8) (= main_~sum~0 (+ (* 5 main_~i~0) 13)))} is VALID [2022-04-28 09:54:06,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {16076#(and (= (+ main_~i~0 (- 5)) 8) (= main_~sum~0 (+ (* 5 main_~i~0) 13)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16080#(and (= (+ main_~i~0 (- 5)) 8) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* 5 main_~i~0) 13)))} is VALID [2022-04-28 09:54:06,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {16080#(and (= (+ main_~i~0 (- 5)) 8) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* 5 main_~i~0) 13)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16084#(and (= (+ (- 13) main_~sum~0) 78) (= main_~i~0 14))} is VALID [2022-04-28 09:54:06,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {16084#(and (= (+ (- 13) main_~sum~0) 78) (= main_~i~0 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16088#(and (= (+ (* (- 1) main_~i~0) (- 13) main_~sum~0) 78) (= main_~i~0 14))} is VALID [2022-04-28 09:54:06,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {16088#(and (= (+ (* (- 1) main_~i~0) (- 13) main_~sum~0) 78) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16092#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} is VALID [2022-04-28 09:54:06,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {16092#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16096#(and (= 14 (+ (* (- 1) main_~i~0) main_~sum~0 (- 91))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 90))))} is VALID [2022-04-28 09:54:06,683 INFO L290 TraceCheckUtils]: 36: Hoare triple {16096#(and (= 14 (+ (* (- 1) main_~i~0) main_~sum~0 (- 91))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 90))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16100#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} is VALID [2022-04-28 09:54:06,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {16100#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16104#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:54:06,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {16104#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16108#(and (= main_~i~0 (+ main_~sum~0 (- 119))) (= 16 (+ (- 120) main_~sum~0)))} is VALID [2022-04-28 09:54:06,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {16108#(and (= main_~i~0 (+ main_~sum~0 (- 119))) (= 16 (+ (- 120) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16112#(and (= (+ (- 1) main_~i~0) 16) (= main_~sum~0 (+ 119 (* main_~i~0 2))))} is VALID [2022-04-28 09:54:06,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {16112#(and (= (+ (- 1) main_~i~0) 16) (= main_~sum~0 (+ 119 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16116#(and (= 16 (+ (- 2) main_~i~0)) (= (+ 117 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-28 09:54:06,702 INFO L290 TraceCheckUtils]: 41: Hoare triple {16116#(and (= 16 (+ (- 2) main_~i~0)) (= (+ 117 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16120#(and (= 16 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 117 (* main_~i~0 3))))} is VALID [2022-04-28 09:54:06,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {16120#(and (= 16 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 117 (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16124#(and (= 19 main_~i~0) (= main_~sum~0 171))} is VALID [2022-04-28 09:54:06,703 INFO L290 TraceCheckUtils]: 43: Hoare triple {16124#(and (= 19 main_~i~0) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16128#(and (= (+ 171 main_~i~0) main_~sum~0) (= 19 main_~i~0))} is VALID [2022-04-28 09:54:06,703 INFO L290 TraceCheckUtils]: 44: Hoare triple {16128#(and (= (+ 171 main_~i~0) main_~sum~0) (= 19 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16132#(and (= main_~i~0 20) (= 190 main_~sum~0))} is VALID [2022-04-28 09:54:06,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {16132#(and (= main_~i~0 20) (= 190 main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16136#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} is VALID [2022-04-28 09:54:06,704 INFO L290 TraceCheckUtils]: 46: Hoare triple {16136#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16140#(and (= main_~sum~0 (+ main_~i~0 189)) (= (+ (- 1) main_~i~0) 20))} is VALID [2022-04-28 09:54:06,704 INFO L290 TraceCheckUtils]: 47: Hoare triple {16140#(and (= main_~sum~0 (+ main_~i~0 189)) (= (+ (- 1) main_~i~0) 20))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16144#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 189)) (= (+ (- 1) main_~i~0) 20))} is VALID [2022-04-28 09:54:06,705 INFO L290 TraceCheckUtils]: 48: Hoare triple {16144#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 189)) (= (+ (- 1) main_~i~0) 20))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16148#(and (= main_~i~0 22) (= (+ main_~sum~0 (- 21)) 210))} is VALID [2022-04-28 09:54:06,705 INFO L290 TraceCheckUtils]: 49: Hoare triple {16148#(and (= main_~i~0 22) (= (+ main_~sum~0 (- 21)) 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16152#(and (= main_~i~0 22) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 21)) 210))} is VALID [2022-04-28 09:54:06,705 INFO L290 TraceCheckUtils]: 50: Hoare triple {16152#(and (= main_~i~0 22) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 21)) 210))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16156#(and (= (+ main_~sum~0 (- 43)) 210) (= 23 main_~i~0))} is VALID [2022-04-28 09:54:06,706 INFO L290 TraceCheckUtils]: 51: Hoare triple {16156#(and (= (+ main_~sum~0 (- 43)) 210) (= 23 main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16160#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 43)) 210) (= 23 main_~i~0))} is VALID [2022-04-28 09:54:06,706 INFO L290 TraceCheckUtils]: 52: Hoare triple {16160#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 43)) 210) (= 23 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16164#(and (= 23 (+ (- 253) main_~sum~0)) (= main_~i~0 (+ main_~sum~0 (- 252))))} is VALID [2022-04-28 09:54:06,707 INFO L290 TraceCheckUtils]: 53: Hoare triple {16164#(and (= 23 (+ (- 253) main_~sum~0)) (= main_~i~0 (+ main_~sum~0 (- 252))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16168#(and (= (+ 252 (* main_~i~0 2)) main_~sum~0) (= 23 (+ (- 1) main_~i~0)))} is VALID [2022-04-28 09:54:06,707 INFO L290 TraceCheckUtils]: 54: Hoare triple {16168#(and (= (+ 252 (* main_~i~0 2)) main_~sum~0) (= 23 (+ (- 1) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16172#(and (= (+ 250 (* main_~i~0 2)) main_~sum~0) (= 23 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:54:06,707 INFO L290 TraceCheckUtils]: 55: Hoare triple {16172#(and (= (+ 250 (* main_~i~0 2)) main_~sum~0) (= 23 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16176#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 250 (* main_~i~0 2))) (= 23 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:54:06,708 INFO L290 TraceCheckUtils]: 56: Hoare triple {16176#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 250 (* main_~i~0 2))) (= 23 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16180#(and (= (+ main_~sum~0 (- 25)) 300) (= main_~i~0 26))} is VALID [2022-04-28 09:54:06,708 INFO L290 TraceCheckUtils]: 57: Hoare triple {16180#(and (= (+ main_~sum~0 (- 25)) 300) (= main_~i~0 26))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16184#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 25)) 300) (= main_~i~0 26))} is VALID [2022-04-28 09:54:06,709 INFO L290 TraceCheckUtils]: 58: Hoare triple {16184#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 25)) 300) (= main_~i~0 26))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16188#(and (= (+ main_~sum~0 (- 325)) 26) (= (+ (- 324) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:54:06,709 INFO L290 TraceCheckUtils]: 59: Hoare triple {16188#(and (= (+ main_~sum~0 (- 325)) 26) (= (+ (- 324) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16192#(and (= main_~i~0 27) (= main_~sum~0 (+ main_~i~0 351)))} is VALID [2022-04-28 09:54:06,709 INFO L290 TraceCheckUtils]: 60: Hoare triple {16192#(and (= main_~i~0 27) (= main_~sum~0 (+ main_~i~0 351)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16196#(and (= (+ main_~sum~0 (- 350)) main_~i~0) (= 27 (+ (- 351) main_~sum~0)))} is VALID [2022-04-28 09:54:06,710 INFO L290 TraceCheckUtils]: 61: Hoare triple {16196#(and (= (+ main_~sum~0 (- 350)) main_~i~0) (= 27 (+ (- 351) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16200#(and (= (+ (* (- 1) main_~i~0) (- 351) main_~sum~0) 27) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 350)) main_~i~0))} is VALID [2022-04-28 09:54:06,724 INFO L290 TraceCheckUtils]: 62: Hoare triple {16200#(and (= (+ (* (- 1) main_~i~0) (- 351) main_~sum~0) 27) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 350)) main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16204#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 350)) 27) (= (+ (- 1) main_~i~0) (+ (- 349) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:54:06,732 INFO L290 TraceCheckUtils]: 63: Hoare triple {16204#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 350)) 27) (= (+ (- 1) main_~i~0) (+ (- 349) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16208#(and (= (+ (- 1) main_~i~0) (+ (- 349) main_~sum~0 (* (- 2) main_~i~0))) (<= main_~i~0 main_~n~0) (= 27 (+ main_~sum~0 (- 350) (* (- 2) main_~i~0))))} is VALID [2022-04-28 09:54:06,745 INFO L290 TraceCheckUtils]: 64: Hoare triple {16208#(and (= (+ (- 1) main_~i~0) (+ (- 349) main_~sum~0 (* (- 2) main_~i~0))) (<= main_~i~0 main_~n~0) (= 27 (+ main_~sum~0 (- 350) (* (- 2) main_~i~0))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16212#(and (<= (div (+ (- 348) main_~sum~0) 3) main_~n~0) (<= main_~i~0 (+ (div (+ (- 348) main_~sum~0) 3) 1)) (= (mod main_~sum~0 3) 0) (= (+ (* (- 2) (div (+ (- 348) main_~sum~0) 3)) main_~sum~0 (- 350)) 27))} is VALID [2022-04-28 09:54:06,746 INFO L290 TraceCheckUtils]: 65: Hoare triple {16212#(and (<= (div (+ (- 348) main_~sum~0) 3) main_~n~0) (<= main_~i~0 (+ (div (+ (- 348) main_~sum~0) 3) 1)) (= (mod main_~sum~0 3) 0) (= (+ (* (- 2) (div (+ (- 348) main_~sum~0) 3)) main_~sum~0 (- 350)) 27))} assume !(~i~0 <= ~n~0); {16216#(and (< main_~n~0 (+ (div (+ (- 348) main_~sum~0) 3) 1)) (<= (div (+ (- 348) main_~sum~0) 3) main_~n~0) (= (mod main_~sum~0 3) 0) (= (+ (* (- 2) (div (+ (- 348) main_~sum~0) 3)) main_~sum~0 (- 350)) 27))} is VALID [2022-04-28 09:54:06,749 INFO L272 TraceCheckUtils]: 66: Hoare triple {16216#(and (< main_~n~0 (+ (div (+ (- 348) main_~sum~0) 3) 1)) (<= (div (+ (- 348) main_~sum~0) 3) main_~n~0) (= (mod main_~sum~0 3) 0) (= (+ (* (- 2) (div (+ (- 348) main_~sum~0) 3)) main_~sum~0 (- 350)) 27))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {16220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:54:06,749 INFO L290 TraceCheckUtils]: 67: Hoare triple {16220#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:54:06,749 INFO L290 TraceCheckUtils]: 68: Hoare triple {16224#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15958#false} is VALID [2022-04-28 09:54:06,749 INFO L290 TraceCheckUtils]: 69: Hoare triple {15958#false} assume !false; {15958#false} is VALID [2022-04-28 09:54:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:54:06,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:55:11,274 INFO L290 TraceCheckUtils]: 69: Hoare triple {15958#false} assume !false; {15958#false} is VALID [2022-04-28 09:55:11,275 INFO L290 TraceCheckUtils]: 68: Hoare triple {16224#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15958#false} is VALID [2022-04-28 09:55:11,275 INFO L290 TraceCheckUtils]: 67: Hoare triple {16220#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:55:11,276 INFO L272 TraceCheckUtils]: 66: Hoare triple {16240#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {16220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:55:11,276 INFO L290 TraceCheckUtils]: 65: Hoare triple {16244#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {16240#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:55:11,290 INFO L290 TraceCheckUtils]: 64: Hoare triple {16248#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16244#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:55:11,301 INFO L290 TraceCheckUtils]: 63: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16248#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:55:11,316 INFO L290 TraceCheckUtils]: 62: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,340 INFO L290 TraceCheckUtils]: 61: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,343 INFO L290 TraceCheckUtils]: 60: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,360 INFO L290 TraceCheckUtils]: 59: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,375 INFO L290 TraceCheckUtils]: 58: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,407 INFO L290 TraceCheckUtils]: 56: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,424 INFO L290 TraceCheckUtils]: 55: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,440 INFO L290 TraceCheckUtils]: 54: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,459 INFO L290 TraceCheckUtils]: 53: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,478 INFO L290 TraceCheckUtils]: 51: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,493 INFO L290 TraceCheckUtils]: 50: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,513 INFO L290 TraceCheckUtils]: 48: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,531 INFO L290 TraceCheckUtils]: 47: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,547 INFO L290 TraceCheckUtils]: 46: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,577 INFO L290 TraceCheckUtils]: 45: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,592 INFO L290 TraceCheckUtils]: 44: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,609 INFO L290 TraceCheckUtils]: 43: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,625 INFO L290 TraceCheckUtils]: 42: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,643 INFO L290 TraceCheckUtils]: 41: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,659 INFO L290 TraceCheckUtils]: 40: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:11,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:11,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:12,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:12,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:12,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:12,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:12,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:12,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:12,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:12,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:12,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:12,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:12,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:55:12,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {15957#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:55:12,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {15957#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15957#true} is VALID [2022-04-28 09:55:12,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {15957#true} call #t~ret3 := main(); {15957#true} is VALID [2022-04-28 09:55:12,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15957#true} {15957#true} #55#return; {15957#true} is VALID [2022-04-28 09:55:12,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {15957#true} assume true; {15957#true} is VALID [2022-04-28 09:55:12,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {15957#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(9, 2); {15957#true} is VALID [2022-04-28 09:55:12,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {15957#true} call ULTIMATE.init(); {15957#true} is VALID [2022-04-28 09:55:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2022-04-28 09:55:12,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:55:12,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962943655] [2022-04-28 09:55:12,156 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:55:12,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717561699] [2022-04-28 09:55:12,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717561699] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:55:12,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:55:12,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 9] total 69 [2022-04-28 09:55:12,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:55:12,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [41593855] [2022-04-28 09:55:12,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [41593855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:55:12,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:55:12,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-28 09:55:12,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393472257] [2022-04-28 09:55:12,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:55:12,159 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 09:55:12,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:55:12,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:55:12,501 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 09:55:12,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-28 09:55:12,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:55:12,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-28 09:55:12,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=4489, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 09:55:12,503 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 64 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:55:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:55:59,459 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-28 09:55:59,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-28 09:55:59,459 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 09:55:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:55:59,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:55:59,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2022-04-28 09:55:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:55:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2022-04-28 09:55:59,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 78 transitions. [2022-04-28 09:56:00,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:56:00,103 INFO L225 Difference]: With dead ends: 78 [2022-04-28 09:56:00,103 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 09:56:00,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 43 SyntacticMatches, 29 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 63.8s TimeCoverageRelationStatistics Valid=214, Invalid=4756, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 09:56:00,104 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 3966 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 3967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:56:00,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 447 Invalid, 3967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3966 Invalid, 0 Unknown, 0 Unchecked, 26.1s Time] [2022-04-28 09:56:00,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 09:56:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-28 09:56:00,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:56:00,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:56:00,153 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:56:00,153 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:56:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:56:00,154 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-28 09:56:00,154 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-28 09:56:00,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:56:00,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:56:00,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-28 09:56:00,154 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-28 09:56:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:56:00,155 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-28 09:56:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-28 09:56:00,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:56:00,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:56:00,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:56:00,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:56:00,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:56:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2022-04-28 09:56:00,157 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2022-04-28 09:56:00,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:56:00,157 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2022-04-28 09:56:00,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:56:00,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 73 transitions. [2022-04-28 09:56:00,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:56:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-28 09:56:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 09:56:00,618 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:56:00,618 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:56:00,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 09:56:00,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:56:00,823 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:56:00,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:56:00,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1003499033, now seen corresponding path program 59 times [2022-04-28 09:56:00,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:56:00,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1955112637] [2022-04-28 09:56:00,826 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:56:00,826 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:56:00,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1003499033, now seen corresponding path program 60 times [2022-04-28 09:56:00,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:56:00,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941140134] [2022-04-28 09:56:00,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:56:00,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:56:00,857 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:56:00,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656279550] [2022-04-28 09:56:00,857 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:56:00,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:56:00,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:56:00,859 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:56:00,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 09:56:00,929 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-28 09:56:00,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:56:00,933 WARN L261 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 128 conjunts are in the unsatisfiable core [2022-04-28 09:56:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:56:00,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:56:07,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {16897#true} call ULTIMATE.init(); {16897#true} is VALID [2022-04-28 09:56:07,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {16897#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(9, 2); {16897#true} is VALID [2022-04-28 09:56:07,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {16897#true} assume true; {16897#true} is VALID [2022-04-28 09:56:07,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16897#true} {16897#true} #55#return; {16897#true} is VALID [2022-04-28 09:56:07,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {16897#true} call #t~ret3 := main(); {16897#true} is VALID [2022-04-28 09:56:07,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {16897#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {16897#true} is VALID [2022-04-28 09:56:07,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {16897#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {16920#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:56:07,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {16920#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16924#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-28 09:56:07,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {16924#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16928#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:56:07,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {16928#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16932#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:56:07,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {16932#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16936#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2022-04-28 09:56:07,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {16936#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16940#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) main_~sum~0) 3))} is VALID [2022-04-28 09:56:07,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {16940#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) main_~sum~0) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16944#(and (= 3 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-28 09:56:07,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {16944#(and (= 3 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16948#(and (= main_~sum~0 (+ 2 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-28 09:56:07,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {16948#(and (= main_~sum~0 (+ 2 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16952#(and (= main_~sum~0 (* main_~i~0 2)) (= 3 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:56:07,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {16952#(and (= main_~sum~0 (* main_~i~0 2)) (= 3 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16956#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (* main_~i~0 2)) (= 3 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:56:07,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {16956#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (* main_~i~0 2)) (= 3 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16960#(and (= (+ main_~i~0 (- 3)) 3) (= (+ (- 2) (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-28 09:56:07,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {16960#(and (= (+ main_~i~0 (- 3)) 3) (= (+ (- 2) (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16964#(and (= main_~sum~0 (+ (- 3) (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 3))} is VALID [2022-04-28 09:56:07,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {16964#(and (= main_~sum~0 (+ (- 3) (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16968#(and (= main_~sum~0 (+ (- 7) (* main_~i~0 4))) (= 3 (+ main_~i~0 (- 4))))} is VALID [2022-04-28 09:56:07,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {16968#(and (= main_~sum~0 (+ (- 7) (* main_~i~0 4))) (= 3 (+ main_~i~0 (- 4))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16972#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 7) (* main_~i~0 4))) (= 3 (+ main_~i~0 (- 4))))} is VALID [2022-04-28 09:56:07,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {16972#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 7) (* main_~i~0 4))) (= 3 (+ main_~i~0 (- 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16976#(and (= (+ main_~i~0 (- 5)) 3) (= (+ (- 11) (* main_~i~0 4)) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-28 09:56:07,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {16976#(and (= (+ main_~i~0 (- 5)) 3) (= (+ (- 11) (* main_~i~0 4)) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16980#(and (= (+ main_~i~0 (- 5)) 3) (= (+ (* main_~i~0 6) (- 12)) main_~sum~0))} is VALID [2022-04-28 09:56:07,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {16980#(and (= (+ main_~i~0 (- 5)) 3) (= (+ (* main_~i~0 6) (- 12)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16984#(and (= main_~sum~0 (+ (* main_~i~0 6) (- 18))) (= (+ main_~i~0 (- 6)) 3))} is VALID [2022-04-28 09:56:07,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {16984#(and (= main_~sum~0 (+ (* main_~i~0 6) (- 18))) (= (+ main_~i~0 (- 6)) 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16988#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 6) (- 18))) (= (+ main_~i~0 (- 6)) 3))} is VALID [2022-04-28 09:56:07,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {16988#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 6) (- 18))) (= (+ main_~i~0 (- 6)) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16992#(and (= main_~i~0 10) (= (+ (- 9) main_~sum~0) 36))} is VALID [2022-04-28 09:56:07,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {16992#(and (= main_~i~0 10) (= (+ (- 9) main_~sum~0) 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16996#(and (= main_~i~0 10) (= (+ (- 9) (* (- 1) main_~i~0) main_~sum~0) 36))} is VALID [2022-04-28 09:56:07,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {16996#(and (= main_~i~0 10) (= (+ (- 9) (* (- 1) main_~i~0) main_~sum~0) 36))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17000#(and (= (+ main_~sum~0 (- 44)) main_~i~0) (= (+ (- 45) main_~sum~0) 10))} is VALID [2022-04-28 09:56:07,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {17000#(and (= (+ main_~sum~0 (- 44)) main_~i~0) (= (+ (- 45) main_~sum~0) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17004#(and (= (+ (- 1) main_~i~0) 10) (= main_~sum~0 (+ 44 (* main_~i~0 2))))} is VALID [2022-04-28 09:56:07,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {17004#(and (= (+ (- 1) main_~i~0) 10) (= main_~sum~0 (+ 44 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17008#(and (= (+ 42 (* main_~i~0 2)) main_~sum~0) (= (+ (- 2) main_~i~0) 10))} is VALID [2022-04-28 09:56:07,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {17008#(and (= (+ 42 (* main_~i~0 2)) main_~sum~0) (= (+ (- 2) main_~i~0) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17012#(and (= main_~sum~0 (+ 42 (* main_~i~0 3))) (= (+ (- 2) main_~i~0) 10))} is VALID [2022-04-28 09:56:07,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {17012#(and (= main_~sum~0 (+ 42 (* main_~i~0 3))) (= (+ (- 2) main_~i~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17016#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2022-04-28 09:56:07,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {17016#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17020#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 78) (= main_~i~0 13))} is VALID [2022-04-28 09:56:07,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {17020#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 78) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17024#(and (= (+ (- 13) main_~sum~0) 78) (= main_~i~0 14))} is VALID [2022-04-28 09:56:07,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {17024#(and (= (+ (- 13) main_~sum~0) 78) (= main_~i~0 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17028#(and (= (+ (* (- 1) main_~i~0) (- 13) main_~sum~0) 78) (= main_~i~0 14))} is VALID [2022-04-28 09:56:07,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {17028#(and (= (+ (* (- 1) main_~i~0) (- 13) main_~sum~0) 78) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17032#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} is VALID [2022-04-28 09:56:07,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {17032#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17036#(and (= main_~i~0 15) (= main_~sum~0 (+ main_~i~0 105)))} is VALID [2022-04-28 09:56:07,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {17036#(and (= main_~i~0 15) (= main_~sum~0 (+ main_~i~0 105)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17040#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} is VALID [2022-04-28 09:56:07,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {17040#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17044#(and (= main_~i~0 16) (= (+ main_~i~0 120) main_~sum~0))} is VALID [2022-04-28 09:56:07,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {17044#(and (= main_~i~0 16) (= (+ main_~i~0 120) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17048#(and (= main_~i~0 (+ main_~sum~0 (- 119))) (= 16 (+ (- 120) main_~sum~0)))} is VALID [2022-04-28 09:56:07,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {17048#(and (= main_~i~0 (+ main_~sum~0 (- 119))) (= 16 (+ (- 120) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17052#(and (= (+ (* (- 1) main_~i~0) (- 120) main_~sum~0) 16) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 119))))} is VALID [2022-04-28 09:56:07,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {17052#(and (= (+ (* (- 1) main_~i~0) (- 120) main_~sum~0) 16) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 119))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17056#(and (= (+ main_~sum~0 (- 136)) 17) (= main_~i~0 (+ main_~sum~0 (- 135))))} is VALID [2022-04-28 09:56:07,153 INFO L290 TraceCheckUtils]: 41: Hoare triple {17056#(and (= (+ main_~sum~0 (- 136)) 17) (= main_~i~0 (+ main_~sum~0 (- 135))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17060#(and (= main_~sum~0 (+ 153 main_~i~0)) (= main_~i~0 18))} is VALID [2022-04-28 09:56:07,153 INFO L290 TraceCheckUtils]: 42: Hoare triple {17060#(and (= main_~sum~0 (+ 153 main_~i~0)) (= main_~i~0 18))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17064#(and (= (+ (- 1) main_~i~0) 18) (= main_~sum~0 (+ 152 main_~i~0)))} is VALID [2022-04-28 09:56:07,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {17064#(and (= (+ (- 1) main_~i~0) 18) (= main_~sum~0 (+ 152 main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17068#(and (= (+ (- 1) main_~i~0) 18) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 152 main_~i~0)))} is VALID [2022-04-28 09:56:07,154 INFO L290 TraceCheckUtils]: 44: Hoare triple {17068#(and (= (+ (- 1) main_~i~0) 18) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 152 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17072#(and (= main_~i~0 20) (= 171 (+ main_~sum~0 (- 19))))} is VALID [2022-04-28 09:56:07,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {17072#(and (= main_~i~0 20) (= 171 (+ main_~sum~0 (- 19))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17076#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} is VALID [2022-04-28 09:56:07,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {17076#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17080#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2022-04-28 09:56:07,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {17080#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17084#(and (= main_~i~0 21) (= (+ (* (- 1) main_~i~0) main_~sum~0) 210))} is VALID [2022-04-28 09:56:07,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {17084#(and (= main_~i~0 21) (= (+ (* (- 1) main_~i~0) main_~sum~0) 210))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17088#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 210) (= (+ (- 1) main_~i~0) 21))} is VALID [2022-04-28 09:56:07,160 INFO L290 TraceCheckUtils]: 49: Hoare triple {17088#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 210) (= (+ (- 1) main_~i~0) 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17092#(and (= (+ 209 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} is VALID [2022-04-28 09:56:07,160 INFO L290 TraceCheckUtils]: 50: Hoare triple {17092#(and (= (+ 209 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17096#(and (= main_~sum~0 (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:56:07,161 INFO L290 TraceCheckUtils]: 51: Hoare triple {17096#(and (= main_~sum~0 (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17100#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:56:07,161 INFO L290 TraceCheckUtils]: 52: Hoare triple {17100#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17104#(and (= (+ (- 23) main_~sum~0) 253) (= main_~i~0 24))} is VALID [2022-04-28 09:56:07,162 INFO L290 TraceCheckUtils]: 53: Hoare triple {17104#(and (= (+ (- 23) main_~sum~0) 253) (= main_~i~0 24))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17108#(and (= main_~i~0 24) (= main_~sum~0 (+ 276 main_~i~0)))} is VALID [2022-04-28 09:56:07,162 INFO L290 TraceCheckUtils]: 54: Hoare triple {17108#(and (= main_~i~0 24) (= main_~sum~0 (+ 276 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17112#(and (= main_~i~0 (+ (- 275) main_~sum~0)) (= (+ main_~sum~0 (- 276)) 24))} is VALID [2022-04-28 09:56:07,163 INFO L290 TraceCheckUtils]: 55: Hoare triple {17112#(and (= main_~i~0 (+ (- 275) main_~sum~0)) (= (+ main_~sum~0 (- 276)) 24))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17116#(and (= (+ (* (- 1) main_~i~0) (- 275) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 276)) 24))} is VALID [2022-04-28 09:56:07,184 INFO L290 TraceCheckUtils]: 56: Hoare triple {17116#(and (= (+ (* (- 1) main_~i~0) (- 275) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 276)) 24))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17120#(and (= (+ (* (- 1) main_~i~0) (- 275) main_~sum~0) 24) (= (+ (- 1) main_~i~0) (+ (- 274) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:56:07,192 INFO L290 TraceCheckUtils]: 57: Hoare triple {17120#(and (= (+ (* (- 1) main_~i~0) (- 275) main_~sum~0) 24) (= (+ (- 1) main_~i~0) (+ (- 274) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17124#(and (= (+ (- 2) main_~i~0) 24) (= (+ 273 (* main_~i~0 3)) main_~sum~0))} is VALID [2022-04-28 09:56:07,193 INFO L290 TraceCheckUtils]: 58: Hoare triple {17124#(and (= (+ (- 2) main_~i~0) 24) (= (+ 273 (* main_~i~0 3)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17128#(and (= main_~sum~0 351) (= main_~i~0 27))} is VALID [2022-04-28 09:56:07,193 INFO L290 TraceCheckUtils]: 59: Hoare triple {17128#(and (= main_~sum~0 351) (= main_~i~0 27))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17132#(and (= main_~i~0 27) (= (+ (* (- 1) main_~i~0) main_~sum~0) 351))} is VALID [2022-04-28 09:56:07,194 INFO L290 TraceCheckUtils]: 60: Hoare triple {17132#(and (= main_~i~0 27) (= (+ (* (- 1) main_~i~0) main_~sum~0) 351))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17136#(and (= (+ main_~sum~0 (- 350)) main_~i~0) (= 27 (+ (- 351) main_~sum~0)))} is VALID [2022-04-28 09:56:07,194 INFO L290 TraceCheckUtils]: 61: Hoare triple {17136#(and (= (+ main_~sum~0 (- 350)) main_~i~0) (= 27 (+ (- 351) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17140#(and (= main_~sum~0 (+ (* main_~i~0 2) 350)) (= (+ (- 1) main_~i~0) 27))} is VALID [2022-04-28 09:56:07,194 INFO L290 TraceCheckUtils]: 62: Hoare triple {17140#(and (= main_~sum~0 (+ (* main_~i~0 2) 350)) (= (+ (- 1) main_~i~0) 27))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17144#(and (= 29 main_~i~0) (= main_~sum~0 406))} is VALID [2022-04-28 09:56:07,195 INFO L290 TraceCheckUtils]: 63: Hoare triple {17144#(and (= 29 main_~i~0) (= main_~sum~0 406))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17148#(and (= 29 main_~i~0) (= main_~sum~0 (+ main_~i~0 406)))} is VALID [2022-04-28 09:56:07,195 INFO L290 TraceCheckUtils]: 64: Hoare triple {17148#(and (= 29 main_~i~0) (= main_~sum~0 (+ main_~i~0 406)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17152#(and (= (+ (- 1) main_~i~0) 29) (= main_~sum~0 (+ 405 main_~i~0)))} is VALID [2022-04-28 09:56:07,196 INFO L290 TraceCheckUtils]: 65: Hoare triple {17152#(and (= (+ (- 1) main_~i~0) 29) (= main_~sum~0 (+ 405 main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17156#(and (= (+ (- 1) main_~i~0) 29) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 405 main_~i~0)) (<= main_~i~0 main_~n~0))} is VALID [2022-04-28 09:56:07,196 INFO L290 TraceCheckUtils]: 66: Hoare triple {17156#(and (= (+ (- 1) main_~i~0) 29) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 405 main_~i~0)) (<= main_~i~0 main_~n~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17160#(and (<= main_~i~0 31) (= 435 (+ main_~sum~0 (- 30))) (<= 30 main_~n~0))} is VALID [2022-04-28 09:56:07,209 INFO L290 TraceCheckUtils]: 67: Hoare triple {17160#(and (<= main_~i~0 31) (= 435 (+ main_~sum~0 (- 30))) (<= 30 main_~n~0))} assume !(~i~0 <= ~n~0); {17164#(and (= 435 (+ main_~sum~0 (- 30))) (<= 30 main_~n~0) (< main_~n~0 31))} is VALID [2022-04-28 09:56:07,211 INFO L272 TraceCheckUtils]: 68: Hoare triple {17164#(and (= 435 (+ main_~sum~0 (- 30))) (<= 30 main_~n~0) (< main_~n~0 31))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {17168#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:56:07,211 INFO L290 TraceCheckUtils]: 69: Hoare triple {17168#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17172#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:56:07,212 INFO L290 TraceCheckUtils]: 70: Hoare triple {17172#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16898#false} is VALID [2022-04-28 09:56:07,212 INFO L290 TraceCheckUtils]: 71: Hoare triple {16898#false} assume !false; {16898#false} is VALID [2022-04-28 09:56:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:56:07,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:57:23,848 INFO L290 TraceCheckUtils]: 71: Hoare triple {16898#false} assume !false; {16898#false} is VALID [2022-04-28 09:57:23,849 INFO L290 TraceCheckUtils]: 70: Hoare triple {17172#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16898#false} is VALID [2022-04-28 09:57:23,849 INFO L290 TraceCheckUtils]: 69: Hoare triple {17168#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17172#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:57:23,850 INFO L272 TraceCheckUtils]: 68: Hoare triple {17188#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {17168#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:57:23,850 INFO L290 TraceCheckUtils]: 67: Hoare triple {17192#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {17188#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:57:23,865 INFO L290 TraceCheckUtils]: 66: Hoare triple {17196#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17192#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:57:23,876 INFO L290 TraceCheckUtils]: 65: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17196#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:57:23,892 INFO L290 TraceCheckUtils]: 64: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:23,911 INFO L290 TraceCheckUtils]: 63: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:23,927 INFO L290 TraceCheckUtils]: 62: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:23,946 INFO L290 TraceCheckUtils]: 61: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:23,949 INFO L290 TraceCheckUtils]: 60: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:23,966 INFO L290 TraceCheckUtils]: 59: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:23,983 INFO L290 TraceCheckUtils]: 58: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,000 INFO L290 TraceCheckUtils]: 57: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,003 INFO L290 TraceCheckUtils]: 56: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,021 INFO L290 TraceCheckUtils]: 55: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,038 INFO L290 TraceCheckUtils]: 54: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,055 INFO L290 TraceCheckUtils]: 53: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,072 INFO L290 TraceCheckUtils]: 52: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,090 INFO L290 TraceCheckUtils]: 51: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,093 INFO L290 TraceCheckUtils]: 50: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,147 INFO L290 TraceCheckUtils]: 47: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,167 INFO L290 TraceCheckUtils]: 45: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,184 INFO L290 TraceCheckUtils]: 44: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,242 INFO L290 TraceCheckUtils]: 41: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,258 INFO L290 TraceCheckUtils]: 40: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,279 INFO L290 TraceCheckUtils]: 39: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,330 INFO L290 TraceCheckUtils]: 36: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,350 INFO L290 TraceCheckUtils]: 35: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:57:24,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {16897#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:57:24,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {16897#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {16897#true} is VALID [2022-04-28 09:57:24,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {16897#true} call #t~ret3 := main(); {16897#true} is VALID [2022-04-28 09:57:24,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16897#true} {16897#true} #55#return; {16897#true} is VALID [2022-04-28 09:57:24,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {16897#true} assume true; {16897#true} is VALID [2022-04-28 09:57:24,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {16897#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(9, 2); {16897#true} is VALID [2022-04-28 09:57:24,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {16897#true} call ULTIMATE.init(); {16897#true} is VALID [2022-04-28 09:57:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-28 09:57:24,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:57:24,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941140134] [2022-04-28 09:57:24,818 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:57:24,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656279550] [2022-04-28 09:57:24,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656279550] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:57:24,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:57:24,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 9] total 71 [2022-04-28 09:57:24,818 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:57:24,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1955112637] [2022-04-28 09:57:24,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1955112637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:57:24,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:57:24,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-28 09:57:24,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181925544] [2022-04-28 09:57:24,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:57:24,819 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-28 09:57:24,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:57:24,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:57:25,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:57:25,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-28 09:57:25,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:57:25,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-28 09:57:25,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=4761, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 09:57:25,336 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand has 66 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:58:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:58:09,607 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-28 09:58:09,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-28 09:58:09,608 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-28 09:58:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:58:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:58:09,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2022-04-28 09:58:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:58:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2022-04-28 09:58:09,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 80 transitions. [2022-04-28 09:58:10,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:58:10,151 INFO L225 Difference]: With dead ends: 80 [2022-04-28 09:58:10,151 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 09:58:10,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 44 SyntacticMatches, 30 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 75.4s TimeCoverageRelationStatistics Valid=220, Invalid=5036, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 09:58:10,152 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 4159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 4160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:58:10,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 454 Invalid, 4160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4159 Invalid, 0 Unknown, 0 Unchecked, 24.5s Time] [2022-04-28 09:58:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 09:58:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-28 09:58:10,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:58:10,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:58:10,201 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:58:10,201 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:58:10,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:58:10,202 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-28 09:58:10,202 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-28 09:58:10,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:58:10,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:58:10,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-28 09:58:10,203 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-28 09:58:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:58:10,204 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-28 09:58:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-28 09:58:10,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:58:10,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:58:10,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:58:10,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:58:10,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:58:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2022-04-28 09:58:10,206 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2022-04-28 09:58:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:58:10,206 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2022-04-28 09:58:10,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:58:10,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 75 transitions. [2022-04-28 09:58:10,925 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 09:58:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-28 09:58:10,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 09:58:10,925 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:58:10,925 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:58:10,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 09:58:11,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:58:11,131 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:58:11,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:58:11,132 INFO L85 PathProgramCache]: Analyzing trace with hash -903075401, now seen corresponding path program 61 times [2022-04-28 09:58:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:58:11,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [679183247] [2022-04-28 09:58:11,135 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:58:11,135 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:58:11,135 INFO L85 PathProgramCache]: Analyzing trace with hash -903075401, now seen corresponding path program 62 times [2022-04-28 09:58:11,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:58:11,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475244633] [2022-04-28 09:58:11,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:58:11,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:58:11,152 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:58:11,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [299105082] [2022-04-28 09:58:11,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:58:11,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:58:11,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:58:11,155 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:58:11,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 09:58:11,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:58:11,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:58:11,213 WARN L261 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 132 conjunts are in the unsatisfiable core [2022-04-28 09:58:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:58:11,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:58:23,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {17863#true} call ULTIMATE.init(); {17863#true} is VALID [2022-04-28 09:58:23,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {17863#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(9, 2); {17863#true} is VALID [2022-04-28 09:58:23,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {17863#true} assume true; {17863#true} is VALID [2022-04-28 09:58:23,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17863#true} {17863#true} #55#return; {17863#true} is VALID [2022-04-28 09:58:23,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {17863#true} call #t~ret3 := main(); {17863#true} is VALID [2022-04-28 09:58:23,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {17863#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {17863#true} is VALID [2022-04-28 09:58:23,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {17863#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {17886#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-28 09:58:23,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {17886#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17890#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-28 09:58:23,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {17890#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17894#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-28 09:58:23,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {17894#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17898#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:58:23,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {17898#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17902#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} is VALID [2022-04-28 09:58:23,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {17902#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17906#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} is VALID [2022-04-28 09:58:23,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {17906#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17910#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} is VALID [2022-04-28 09:58:23,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {17910#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17914#(and (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 3))} is VALID [2022-04-28 09:58:23,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {17914#(and (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17918#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} is VALID [2022-04-28 09:58:23,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {17918#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17922#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 4))} is VALID [2022-04-28 09:58:23,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {17922#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17926#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} is VALID [2022-04-28 09:58:23,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {17926#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17930#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} is VALID [2022-04-28 09:58:23,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {17930#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17934#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} is VALID [2022-04-28 09:58:23,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {17934#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17938#(and (= main_~i~0 (+ (- 14) (* (- 1) main_~i~0) main_~sum~0)) (= (+ (* (- 1) main_~i~0) (- 15) main_~sum~0) 6))} is VALID [2022-04-28 09:58:23,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {17938#(and (= main_~i~0 (+ (- 14) (* (- 1) main_~i~0) main_~sum~0)) (= (+ (* (- 1) main_~i~0) (- 15) main_~sum~0) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17942#(and (= (+ (- 14) (* (- 1) main_~i~0) main_~sum~0) 6) (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) (- 13) main_~sum~0)))} is VALID [2022-04-28 09:58:23,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {17942#(and (= (+ (- 14) (* (- 1) main_~i~0) main_~sum~0) 6) (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) (- 13) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17946#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} is VALID [2022-04-28 09:58:23,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {17946#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17950#(and (= 7 (+ (- 2) main_~i~0)) (= (+ 18 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-28 09:58:23,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {17950#(and (= 7 (+ (- 2) main_~i~0)) (= (+ 18 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17954#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 18 (* main_~i~0 2))) (= 7 (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:58:23,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {17954#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 18 (* main_~i~0 2))) (= 7 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17958#(and (= main_~i~0 10) (= (+ (- 9) main_~sum~0) 36))} is VALID [2022-04-28 09:58:23,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {17958#(and (= main_~i~0 10) (= (+ (- 9) main_~sum~0) 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17962#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} is VALID [2022-04-28 09:58:23,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {17962#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17966#(and (= (+ main_~sum~0 (- 44)) main_~i~0) (= (+ (- 45) main_~sum~0) 10))} is VALID [2022-04-28 09:58:23,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {17966#(and (= (+ main_~sum~0 (- 44)) main_~i~0) (= (+ (- 45) main_~sum~0) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17970#(and (= main_~i~0 11) (= main_~sum~0 (+ main_~i~0 55)))} is VALID [2022-04-28 09:58:23,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {17970#(and (= main_~i~0 11) (= main_~sum~0 (+ main_~i~0 55)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17974#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} is VALID [2022-04-28 09:58:23,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {17974#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17978#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 54)) main_~i~0) (= (+ (- 55) (* (- 1) main_~i~0) main_~sum~0) 11))} is VALID [2022-04-28 09:58:23,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {17978#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 54)) main_~i~0) (= (+ (- 55) (* (- 1) main_~i~0) main_~sum~0) 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17982#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 54)) 11) (= (+ (- 1) main_~i~0) (+ (- 53) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:58:23,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {17982#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 54)) 11) (= (+ (- 1) main_~i~0) (+ (- 53) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17986#(and (= (+ (- 1) main_~i~0) (+ (- 53) main_~sum~0 (* (- 2) main_~i~0))) (= (+ main_~sum~0 (* (- 2) main_~i~0) (- 54)) 11))} is VALID [2022-04-28 09:58:23,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {17986#(and (= (+ (- 1) main_~i~0) (+ (- 53) main_~sum~0 (* (- 2) main_~i~0))) (= (+ main_~sum~0 (* (- 2) main_~i~0) (- 54)) 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17990#(and (= (+ main_~sum~0 (- 52) (* (- 2) main_~i~0)) 11) (= (+ (- 51) main_~sum~0 (* (- 2) main_~i~0)) (+ (- 2) main_~i~0)))} is VALID [2022-04-28 09:58:23,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {17990#(and (= (+ main_~sum~0 (- 52) (* (- 2) main_~i~0)) 11) (= (+ (- 51) main_~sum~0 (* (- 2) main_~i~0)) (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17994#(and (= (+ main_~i~0 (- 3)) 11) (= main_~sum~0 (+ 49 (* main_~i~0 4))))} is VALID [2022-04-28 09:58:23,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {17994#(and (= (+ main_~i~0 (- 3)) 11) (= main_~sum~0 (+ 49 (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17998#(and (= main_~i~0 15) (= main_~sum~0 105))} is VALID [2022-04-28 09:58:23,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {17998#(and (= main_~i~0 15) (= main_~sum~0 105))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18002#(and (= main_~i~0 15) (= (+ (* (- 1) main_~i~0) main_~sum~0) 105))} is VALID [2022-04-28 09:58:23,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {18002#(and (= main_~i~0 15) (= (+ (* (- 1) main_~i~0) main_~sum~0) 105))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18006#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} is VALID [2022-04-28 09:58:23,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {18006#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18010#(and (= main_~sum~0 (+ 104 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 15))} is VALID [2022-04-28 09:58:23,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {18010#(and (= main_~sum~0 (+ 104 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18014#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-28 09:58:23,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {18014#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18018#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:58:23,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {18018#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18022#(and (= (+ (* main_~i~0 2) 100) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 15))} is VALID [2022-04-28 09:58:23,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {18022#(and (= (+ (* main_~i~0 2) 100) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18026#(and (= (+ main_~i~0 (- 3)) 15) (= main_~sum~0 (+ 99 (* main_~i~0 4))))} is VALID [2022-04-28 09:58:23,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {18026#(and (= (+ main_~i~0 (- 3)) 15) (= main_~sum~0 (+ 99 (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18030#(and (= 15 (+ main_~i~0 (- 4))) (= main_~sum~0 (+ 95 (* main_~i~0 4))))} is VALID [2022-04-28 09:58:23,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {18030#(and (= 15 (+ main_~i~0 (- 4))) (= main_~sum~0 (+ 95 (* main_~i~0 4))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18034#(and (= 15 (+ main_~i~0 (- 4))) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 95 (* main_~i~0 4))))} is VALID [2022-04-28 09:58:23,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {18034#(and (= 15 (+ main_~i~0 (- 4))) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 95 (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18038#(and (= (+ 91 (* main_~i~0 4)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 5)) 15))} is VALID [2022-04-28 09:58:23,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {18038#(and (= (+ 91 (* main_~i~0 4)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 5)) 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18042#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ 91 (* main_~i~0 4))) (= (+ main_~i~0 (- 5)) 15))} is VALID [2022-04-28 09:58:23,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {18042#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ 91 (* main_~i~0 4))) (= (+ main_~i~0 (- 5)) 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18046#(and (= main_~i~0 21) (= 171 (+ main_~sum~0 (- 39))))} is VALID [2022-04-28 09:58:23,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {18046#(and (= main_~i~0 21) (= 171 (+ main_~sum~0 (- 39))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18050#(and (= main_~i~0 21) (= (+ main_~i~0 210) main_~sum~0))} is VALID [2022-04-28 09:58:23,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {18050#(and (= main_~i~0 21) (= (+ main_~i~0 210) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18054#(and (= (+ main_~i~0 209) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} is VALID [2022-04-28 09:58:23,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {18054#(and (= (+ main_~i~0 209) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18058#(and (= (+ 209 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} is VALID [2022-04-28 09:58:23,938 INFO L290 TraceCheckUtils]: 50: Hoare triple {18058#(and (= (+ 209 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18062#(and (= 23 main_~i~0) (= main_~sum~0 253))} is VALID [2022-04-28 09:58:23,938 INFO L290 TraceCheckUtils]: 51: Hoare triple {18062#(and (= 23 main_~i~0) (= main_~sum~0 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18066#(and (= 23 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 253))} is VALID [2022-04-28 09:58:23,938 INFO L290 TraceCheckUtils]: 52: Hoare triple {18066#(and (= 23 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 253))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18070#(and (= 23 (+ (- 253) main_~sum~0)) (= main_~i~0 (+ main_~sum~0 (- 252))))} is VALID [2022-04-28 09:58:23,939 INFO L290 TraceCheckUtils]: 53: Hoare triple {18070#(and (= 23 (+ (- 253) main_~sum~0)) (= main_~i~0 (+ main_~sum~0 (- 252))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18074#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 252)) main_~i~0) (= (+ (* (- 1) main_~i~0) (- 253) main_~sum~0) 23))} is VALID [2022-04-28 09:58:23,954 INFO L290 TraceCheckUtils]: 54: Hoare triple {18074#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 252)) main_~i~0) (= (+ (* (- 1) main_~i~0) (- 253) main_~sum~0) 23))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18078#(and (= main_~i~0 (+ (- 275) main_~sum~0)) (= (+ main_~sum~0 (- 276)) 24))} is VALID [2022-04-28 09:58:23,955 INFO L290 TraceCheckUtils]: 55: Hoare triple {18078#(and (= main_~i~0 (+ (- 275) main_~sum~0)) (= (+ main_~sum~0 (- 276)) 24))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18082#(and (= (+ (* (- 1) main_~i~0) (- 275) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 276)) 24))} is VALID [2022-04-28 09:58:23,967 INFO L290 TraceCheckUtils]: 56: Hoare triple {18082#(and (= (+ (* (- 1) main_~i~0) (- 275) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 276)) 24))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18086#(and (= (+ (* (- 1) main_~i~0) (- 275) main_~sum~0) 24) (= (+ (- 1) main_~i~0) (+ (- 274) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-28 09:58:23,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {18086#(and (= (+ (* (- 1) main_~i~0) (- 275) main_~sum~0) 24) (= (+ (- 1) main_~i~0) (+ (- 274) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18090#(and (= (+ (- 2) main_~i~0) 24) (= (+ 273 (* main_~i~0 3)) main_~sum~0))} is VALID [2022-04-28 09:58:23,977 INFO L290 TraceCheckUtils]: 58: Hoare triple {18090#(and (= (+ (- 2) main_~i~0) 24) (= (+ 273 (* main_~i~0 3)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18094#(and (= main_~sum~0 351) (= main_~i~0 27))} is VALID [2022-04-28 09:58:23,977 INFO L290 TraceCheckUtils]: 59: Hoare triple {18094#(and (= main_~sum~0 351) (= main_~i~0 27))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18098#(and (= main_~i~0 27) (= main_~sum~0 (+ main_~i~0 351)))} is VALID [2022-04-28 09:58:23,978 INFO L290 TraceCheckUtils]: 60: Hoare triple {18098#(and (= main_~i~0 27) (= main_~sum~0 (+ main_~i~0 351)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18102#(and (= 378 main_~sum~0) (= main_~i~0 28))} is VALID [2022-04-28 09:58:23,978 INFO L290 TraceCheckUtils]: 61: Hoare triple {18102#(and (= 378 main_~sum~0) (= main_~i~0 28))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18106#(and (= main_~sum~0 (+ 378 main_~i~0)) (= main_~i~0 28))} is VALID [2022-04-28 09:58:23,978 INFO L290 TraceCheckUtils]: 62: Hoare triple {18106#(and (= main_~sum~0 (+ 378 main_~i~0)) (= main_~i~0 28))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18110#(and (= (+ (- 1) main_~i~0) 28) (= main_~sum~0 (+ main_~i~0 377)))} is VALID [2022-04-28 09:58:23,979 INFO L290 TraceCheckUtils]: 63: Hoare triple {18110#(and (= (+ (- 1) main_~i~0) 28) (= main_~sum~0 (+ main_~i~0 377)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18114#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 377)) (= (+ (- 1) main_~i~0) 28))} is VALID [2022-04-28 09:58:23,979 INFO L290 TraceCheckUtils]: 64: Hoare triple {18114#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 377)) (= (+ (- 1) main_~i~0) 28))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18118#(and (= (+ (- 2) main_~i~0) 28) (= (+ main_~i~0 376) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-28 09:58:23,980 INFO L290 TraceCheckUtils]: 65: Hoare triple {18118#(and (= (+ (- 2) main_~i~0) 28) (= (+ main_~i~0 376) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18122#(and (= main_~sum~0 (+ 375 (* main_~i~0 3))) (= (+ (- 2) main_~i~0) 28))} is VALID [2022-04-28 09:58:23,980 INFO L290 TraceCheckUtils]: 66: Hoare triple {18122#(and (= main_~sum~0 (+ 375 (* main_~i~0 3))) (= (+ (- 2) main_~i~0) 28))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18126#(and (= main_~sum~0 465) (= main_~i~0 31))} is VALID [2022-04-28 09:58:23,980 INFO L290 TraceCheckUtils]: 67: Hoare triple {18126#(and (= main_~sum~0 465) (= main_~i~0 31))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18130#(and (<= main_~i~0 main_~n~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 465) (= main_~i~0 31))} is VALID [2022-04-28 09:58:23,981 INFO L290 TraceCheckUtils]: 68: Hoare triple {18130#(and (<= main_~i~0 main_~n~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 465) (= main_~i~0 31))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18134#(and (<= main_~i~0 32) (= 465 (+ (- 31) main_~sum~0)) (<= 31 main_~n~0))} is VALID [2022-04-28 09:58:23,996 INFO L290 TraceCheckUtils]: 69: Hoare triple {18134#(and (<= main_~i~0 32) (= 465 (+ (- 31) main_~sum~0)) (<= 31 main_~n~0))} assume !(~i~0 <= ~n~0); {18138#(and (< main_~n~0 32) (= 465 (+ (- 31) main_~sum~0)) (<= 31 main_~n~0))} is VALID [2022-04-28 09:58:23,998 INFO L272 TraceCheckUtils]: 70: Hoare triple {18138#(and (< main_~n~0 32) (= 465 (+ (- 31) main_~sum~0)) (<= 31 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {18142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:58:23,998 INFO L290 TraceCheckUtils]: 71: Hoare triple {18142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:58:23,999 INFO L290 TraceCheckUtils]: 72: Hoare triple {18146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17864#false} is VALID [2022-04-28 09:58:23,999 INFO L290 TraceCheckUtils]: 73: Hoare triple {17864#false} assume !false; {17864#false} is VALID [2022-04-28 09:58:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:58:24,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:59:34,256 INFO L290 TraceCheckUtils]: 73: Hoare triple {17864#false} assume !false; {17864#false} is VALID [2022-04-28 09:59:34,257 INFO L290 TraceCheckUtils]: 72: Hoare triple {18146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17864#false} is VALID [2022-04-28 09:59:34,257 INFO L290 TraceCheckUtils]: 71: Hoare triple {18142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:59:34,258 INFO L272 TraceCheckUtils]: 70: Hoare triple {18162#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {18142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:59:34,258 INFO L290 TraceCheckUtils]: 69: Hoare triple {18166#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {18162#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-28 09:59:34,275 INFO L290 TraceCheckUtils]: 68: Hoare triple {18170#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18166#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:59:34,295 INFO L290 TraceCheckUtils]: 67: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18170#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-28 09:59:34,298 INFO L290 TraceCheckUtils]: 66: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,316 INFO L290 TraceCheckUtils]: 65: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,320 INFO L290 TraceCheckUtils]: 64: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,339 INFO L290 TraceCheckUtils]: 63: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,357 INFO L290 TraceCheckUtils]: 62: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,376 INFO L290 TraceCheckUtils]: 61: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,394 INFO L290 TraceCheckUtils]: 60: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,410 INFO L290 TraceCheckUtils]: 59: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,446 INFO L290 TraceCheckUtils]: 57: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,462 INFO L290 TraceCheckUtils]: 56: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,505 INFO L290 TraceCheckUtils]: 54: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,521 INFO L290 TraceCheckUtils]: 53: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,524 INFO L290 TraceCheckUtils]: 52: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,540 INFO L290 TraceCheckUtils]: 51: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,556 INFO L290 TraceCheckUtils]: 50: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,575 INFO L290 TraceCheckUtils]: 49: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,623 INFO L290 TraceCheckUtils]: 46: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,641 INFO L290 TraceCheckUtils]: 45: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,656 INFO L290 TraceCheckUtils]: 44: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,672 INFO L290 TraceCheckUtils]: 43: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,685 INFO L290 TraceCheckUtils]: 42: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,703 INFO L290 TraceCheckUtils]: 41: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,735 INFO L290 TraceCheckUtils]: 39: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,795 INFO L290 TraceCheckUtils]: 36: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:34,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:34,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:35,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:35,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:35,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:35,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:35,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:35,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:35,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:35,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:35,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:35,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:35,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:35,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:35,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-28 09:59:35,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {17863#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-28 09:59:35,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {17863#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {17863#true} is VALID [2022-04-28 09:59:35,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {17863#true} call #t~ret3 := main(); {17863#true} is VALID [2022-04-28 09:59:35,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17863#true} {17863#true} #55#return; {17863#true} is VALID [2022-04-28 09:59:35,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {17863#true} assume true; {17863#true} is VALID [2022-04-28 09:59:35,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {17863#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(9, 2); {17863#true} is VALID [2022-04-28 09:59:35,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {17863#true} call ULTIMATE.init(); {17863#true} is VALID [2022-04-28 09:59:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2022-04-28 09:59:35,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:59:35,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475244633] [2022-04-28 09:59:35,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:59:35,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299105082] [2022-04-28 09:59:35,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299105082] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:59:35,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:59:35,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 9] total 73 [2022-04-28 09:59:35,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:59:35,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [679183247] [2022-04-28 09:59:35,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [679183247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:59:35,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:59:35,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-28 09:59:35,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619522914] [2022-04-28 09:59:35,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:59:35,188 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-28 09:59:35,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:59:35,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:59:35,738 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 09:59:35,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-28 09:59:35,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:59:35,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-28 09:59:35,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=5041, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 09:59:35,739 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand has 68 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)