/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-new/gauss_sum.i.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:16:02,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:16:02,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:16:02,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:16:02,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:16:02,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:16:02,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:16:02,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:16:02,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:16:02,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:16:02,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:16:02,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:16:02,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:16:02,606 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:16:02,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:16:02,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:16:02,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:16:02,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:16:02,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:16:02,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:16:02,619 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:16:02,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:16:02,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:16:02,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:16:02,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:16:02,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:16:02,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:16:02,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:16:02,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:16:02,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:16:02,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:16:02,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:16:02,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:16:02,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:16:02,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:16:02,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:16:02,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:16:02,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:16:02,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:16:02,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:16:02,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:16:02,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:16:02,638 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:16:02,648 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:16:02,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:16:02,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:16:02,649 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:16:02,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:16:02,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:16:02,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:16:02,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:16:02,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:16:02,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:16:02,651 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:16:02,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:16:02,651 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:16:02,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:16:02,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:16:02,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:16:02,652 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:16:02,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:16:02,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:16:02,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:16:02,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:16:02,652 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:16:02,652 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:16:02,652 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:16:02,653 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:16:02,653 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 03:16:02,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:16:02,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:16:02,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:16:02,887 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:16:02,888 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:16:02,889 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum.i.p+cfa-reducer.c [2022-04-28 03:16:02,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b251e999/2f6e4655806d4e4c929b374a99292c4f/FLAG3a16675ae [2022-04-28 03:16:03,298 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:16:03,299 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.p+cfa-reducer.c [2022-04-28 03:16:03,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b251e999/2f6e4655806d4e4c929b374a99292c4f/FLAG3a16675ae [2022-04-28 03:16:03,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b251e999/2f6e4655806d4e4c929b374a99292c4f [2022-04-28 03:16:03,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:16:03,732 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:16:03,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:16:03,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:16:03,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:16:03,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:16:03" (1/1) ... [2022-04-28 03:16:03,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de0ccfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:03, skipping insertion in model container [2022-04-28 03:16:03,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:16:03" (1/1) ... [2022-04-28 03:16:03,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:16:03,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:16:03,916 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.p+cfa-reducer.c[1014,1027] [2022-04-28 03:16:03,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:16:03,935 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:16:03,957 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.p+cfa-reducer.c[1014,1027] [2022-04-28 03:16:03,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:16:03,969 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:16:03,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:03 WrapperNode [2022-04-28 03:16:03,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:16:03,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:16:03,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:16:03,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:16:03,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:03" (1/1) ... [2022-04-28 03:16:03,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:03" (1/1) ... [2022-04-28 03:16:03,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:03" (1/1) ... [2022-04-28 03:16:03,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:03" (1/1) ... [2022-04-28 03:16:04,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:03" (1/1) ... [2022-04-28 03:16:04,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:03" (1/1) ... [2022-04-28 03:16:04,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:03" (1/1) ... [2022-04-28 03:16:04,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:16:04,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:16:04,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:16:04,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:16:04,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:03" (1/1) ... [2022-04-28 03:16:04,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:16:04,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:04,044 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 03:16:04,067 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 03:16:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:16:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:16:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:16:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:16:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:16:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:16:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:16:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:16:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:16:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:16:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:16:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:16:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:16:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:16:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:16:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:16:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:16:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:16:04,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:16:04,148 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:16:04,149 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:16:04,250 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:16:04,255 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:16:04,255 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-28 03:16:04,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:16:04 BoogieIcfgContainer [2022-04-28 03:16:04,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:16:04,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:16:04,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:16:04,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:16:04,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:16:03" (1/3) ... [2022-04-28 03:16:04,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78cb605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:16:04, skipping insertion in model container [2022-04-28 03:16:04,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:03" (2/3) ... [2022-04-28 03:16:04,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78cb605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:16:04, skipping insertion in model container [2022-04-28 03:16:04,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:16:04" (3/3) ... [2022-04-28 03:16:04,264 INFO L111 eAbstractionObserver]: Analyzing ICFG gauss_sum.i.p+cfa-reducer.c [2022-04-28 03:16:04,275 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:16:04,275 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:16:04,329 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:16:04,334 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@29c5b1ae, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60c4f011 [2022-04-28 03:16:04,334 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:16:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:16:04,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:16:04,366 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:04,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:04,367 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:04,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:04,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1088558671, now seen corresponding path program 1 times [2022-04-28 03:16:04,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:04,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [25773507] [2022-04-28 03:16:04,391 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:16:04,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1088558671, now seen corresponding path program 2 times [2022-04-28 03:16:04,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:04,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746367573] [2022-04-28 03:16:04,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:04,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:04,466 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:16:04,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384003095] [2022-04-28 03:16:04,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:16:04,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:04,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:04,471 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 03:16:04,507 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 03:16:04,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 03:16:04,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:16:04,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 03:16:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:04,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:04,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {19#true} is VALID [2022-04-28 03:16:04,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {19#true} is VALID [2022-04-28 03:16:04,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2022-04-28 03:16:04,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #38#return; {19#true} is VALID [2022-04-28 03:16:04,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret5 := main(); {19#true} is VALID [2022-04-28 03:16:04,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {19#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {19#true} is VALID [2022-04-28 03:16:04,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {19#true} assume !!(1 <= ~main__n~0); {42#(<= 1 main_~main__n~0)} is VALID [2022-04-28 03:16:04,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {46#(and (<= main_~main__i~0 1) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:16:04,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#(and (<= main_~main__i~0 1) (<= 1 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20#false} is VALID [2022-04-28 03:16:04,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {20#false} assume 0 == ~__VERIFIER_assert__cond~0; {20#false} is VALID [2022-04-28 03:16:04,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-04-28 03:16:04,757 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 03:16:04,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 03:16:04,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:04,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746367573] [2022-04-28 03:16:04,758 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:16:04,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384003095] [2022-04-28 03:16:04,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384003095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:04,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:04,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:16:04,761 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:04,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [25773507] [2022-04-28 03:16:04,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [25773507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:04,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:04,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:16:04,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963024337] [2022-04-28 03:16:04,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:04,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:16:04,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:04,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:04,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:04,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:16:04,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:04,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:16:04,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:16:04,801 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:04,863 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 03:16:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:16:04,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:16:04,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-28 03:16:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-28 03:16:04,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-28 03:16:04,918 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 03:16:04,924 INFO L225 Difference]: With dead ends: 26 [2022-04-28 03:16:04,924 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 03:16:04,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:16:04,929 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:04,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:16:04,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 03:16:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 03:16:04,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:04,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:04,969 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:04,969 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:04,977 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 03:16:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 03:16:04,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:04,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:04,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 03:16:04,979 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 03:16:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:04,982 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 03:16:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 03:16:04,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:04,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:04,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:04,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:04,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-28 03:16:04,992 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-28 03:16:04,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:04,993 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-28 03:16:04,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:04,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-28 03:16:05,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 03:16:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:16:05,009 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:05,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:05,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 03:16:05,211 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 03:16:05,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:05,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:05,212 INFO L85 PathProgramCache]: Analyzing trace with hash 614357099, now seen corresponding path program 1 times [2022-04-28 03:16:05,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:05,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [377585896] [2022-04-28 03:16:05,213 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:16:05,214 INFO L85 PathProgramCache]: Analyzing trace with hash 614357099, now seen corresponding path program 2 times [2022-04-28 03:16:05,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:05,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136904135] [2022-04-28 03:16:05,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:05,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:05,232 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:16:05,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [800656556] [2022-04-28 03:16:05,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:16:05,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:05,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:05,239 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 03:16:05,243 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 03:16:05,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:16:05,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:16:05,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:16:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:05,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:05,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {159#true} is VALID [2022-04-28 03:16:05,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {159#true} is VALID [2022-04-28 03:16:05,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-28 03:16:05,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #38#return; {159#true} is VALID [2022-04-28 03:16:05,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret5 := main(); {159#true} is VALID [2022-04-28 03:16:05,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {159#true} is VALID [2022-04-28 03:16:05,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#true} assume !!(1 <= ~main__n~0); {182#(<= 1 main_~main__n~0)} is VALID [2022-04-28 03:16:05,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {186#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:16:05,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {190#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 1) (<= main_~main__i~0 (+ main_~main__sum~0 1)))} is VALID [2022-04-28 03:16:05,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 1) (<= main_~main__i~0 (+ main_~main__sum~0 1)))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {194#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:05,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {194#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {160#false} is VALID [2022-04-28 03:16:05,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-28 03:16:05,686 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 03:16:05,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:05,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-28 03:16:05,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {194#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {160#false} is VALID [2022-04-28 03:16:05,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {207#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {194#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:05,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {211#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {207#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:16:05,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {215#(or (= 2 (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= 2 main_~main__n~0))} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {211#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} is VALID [2022-04-28 03:16:05,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#true} assume !!(1 <= ~main__n~0); {215#(or (= 2 (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= 2 main_~main__n~0))} is VALID [2022-04-28 03:16:05,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {159#true} is VALID [2022-04-28 03:16:05,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret5 := main(); {159#true} is VALID [2022-04-28 03:16:05,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #38#return; {159#true} is VALID [2022-04-28 03:16:05,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-28 03:16:05,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {159#true} is VALID [2022-04-28 03:16:05,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {159#true} is VALID [2022-04-28 03:16:05,962 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 03:16:05,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:05,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136904135] [2022-04-28 03:16:05,963 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:16:05,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800656556] [2022-04-28 03:16:05,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800656556] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:05,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:16:05,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 03:16:05,964 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:05,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [377585896] [2022-04-28 03:16:05,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [377585896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:05,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:05,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:16:05,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345408588] [2022-04-28 03:16:05,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:05,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:16:05,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:05,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:05,983 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 03:16:05,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:16:05,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:05,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:16:05,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:16:05,985 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:06,062 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 03:16:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:16:06,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:16:06,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-28 03:16:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-28 03:16:06,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2022-04-28 03:16:06,082 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 03:16:06,084 INFO L225 Difference]: With dead ends: 17 [2022-04-28 03:16:06,084 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 03:16:06,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:16:06,090 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:06,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 26 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:16:06,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 03:16:06,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 03:16:06,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:06,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:06,100 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:06,100 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:06,102 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 03:16:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:16:06,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:06,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:06,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 03:16:06,103 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 03:16:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:06,104 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 03:16:06,104 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:16:06,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:06,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:06,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:06,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 03:16:06,107 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 03:16:06,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:06,111 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 03:16:06,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:06,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 03:16:06,126 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 03:16:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:16:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:16:06,127 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:06,127 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:06,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 03:16:06,350 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 03:16:06,350 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:06,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:06,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1865138417, now seen corresponding path program 3 times [2022-04-28 03:16:06,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:06,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2116526222] [2022-04-28 03:16:06,352 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:16:06,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1865138417, now seen corresponding path program 4 times [2022-04-28 03:16:06,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:06,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807873460] [2022-04-28 03:16:06,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:06,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:06,367 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:16:06,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1461289730] [2022-04-28 03:16:06,367 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:16:06,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:06,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:06,370 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 03:16:06,371 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 03:16:06,407 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:16:06,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:16:06,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:16:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:06,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:06,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {331#true} call ULTIMATE.init(); {331#true} is VALID [2022-04-28 03:16:06,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {331#true} is VALID [2022-04-28 03:16:06,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-28 03:16:06,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#true} {331#true} #38#return; {331#true} is VALID [2022-04-28 03:16:06,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {331#true} call #t~ret5 := main(); {331#true} is VALID [2022-04-28 03:16:06,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {331#true} is VALID [2022-04-28 03:16:06,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {331#true} assume !!(1 <= ~main__n~0); {331#true} is VALID [2022-04-28 03:16:06,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {357#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:16:06,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {357#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {361#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-28 03:16:06,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {365#(and (<= main_~main__i~0 3) (<= 2 main_~main__n~0) (= main_~main__sum~0 3))} is VALID [2022-04-28 03:16:06,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {365#(and (<= main_~main__i~0 3) (<= 2 main_~main__n~0) (= main_~main__sum~0 3))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {369#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:06,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {369#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {332#false} is VALID [2022-04-28 03:16:06,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {332#false} assume !false; {332#false} is VALID [2022-04-28 03:16:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:06,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:07,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {332#false} assume !false; {332#false} is VALID [2022-04-28 03:16:07,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {369#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {332#false} is VALID [2022-04-28 03:16:07,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {382#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {369#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:07,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {386#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {382#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:16:07,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {386#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {386#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:07,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {386#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:07,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {331#true} assume !!(1 <= ~main__n~0); {331#true} is VALID [2022-04-28 03:16:07,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {331#true} is VALID [2022-04-28 03:16:07,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {331#true} call #t~ret5 := main(); {331#true} is VALID [2022-04-28 03:16:07,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#true} {331#true} #38#return; {331#true} is VALID [2022-04-28 03:16:07,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-28 03:16:07,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {331#true} is VALID [2022-04-28 03:16:07,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {331#true} call ULTIMATE.init(); {331#true} is VALID [2022-04-28 03:16:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:16:07,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:07,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807873460] [2022-04-28 03:16:07,081 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:16:07,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461289730] [2022-04-28 03:16:07,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461289730] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:07,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:16:07,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2022-04-28 03:16:07,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:07,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2116526222] [2022-04-28 03:16:07,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2116526222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:07,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:07,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:16:07,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448582305] [2022-04-28 03:16:07,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:07,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:16:07,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:07,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:07,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:07,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:16:07,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:07,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:16:07,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:16:07,096 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:07,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:07,177 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 03:16:07,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:16:07,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:16:07,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-28 03:16:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-28 03:16:07,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-04-28 03:16:07,196 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 03:16:07,197 INFO L225 Difference]: With dead ends: 18 [2022-04-28 03:16:07,197 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 03:16:07,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:16:07,198 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:07,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:16:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 03:16:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 03:16:07,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:07,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:07,208 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:07,209 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:07,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:07,210 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:16:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:16:07,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:07,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:07,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:16:07,210 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:16:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:07,211 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:16:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:16:07,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:07,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:07,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:07,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 03:16:07,213 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 03:16:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:07,213 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 03:16:07,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:07,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 03:16:07,228 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 03:16:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:16:07,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:16:07,228 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:07,229 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:07,252 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 03:16:07,447 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 03:16:07,447 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:07,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:07,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1984653611, now seen corresponding path program 5 times [2022-04-28 03:16:07,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:07,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [801039627] [2022-04-28 03:16:07,449 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:16:07,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1984653611, now seen corresponding path program 6 times [2022-04-28 03:16:07,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:07,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435544308] [2022-04-28 03:16:07,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:07,465 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:16:07,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1479799726] [2022-04-28 03:16:07,466 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:16:07,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:07,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:07,467 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 03:16:07,475 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 03:16:07,504 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 03:16:07,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:16:07,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:16:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:07,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:07,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {514#true} is VALID [2022-04-28 03:16:07,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {514#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {514#true} is VALID [2022-04-28 03:16:07,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-28 03:16:07,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {514#true} {514#true} #38#return; {514#true} is VALID [2022-04-28 03:16:07,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {514#true} call #t~ret5 := main(); {514#true} is VALID [2022-04-28 03:16:07,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {514#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {514#true} is VALID [2022-04-28 03:16:07,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {514#true} assume !!(1 <= ~main__n~0); {514#true} is VALID [2022-04-28 03:16:07,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {540#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:16:07,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {540#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {544#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-28 03:16:07,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {544#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {548#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-28 03:16:07,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {548#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(and (= (+ main_~main__sum~0 (- 3)) 3) (<= 3 main_~main__n~0) (<= main_~main__i~0 4))} is VALID [2022-04-28 03:16:07,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {552#(and (= (+ main_~main__sum~0 (- 3)) 3) (<= 3 main_~main__n~0) (<= main_~main__i~0 4))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {556#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:07,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {556#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {515#false} is VALID [2022-04-28 03:16:07,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {515#false} assume !false; {515#false} is VALID [2022-04-28 03:16:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:07,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:08,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {515#false} assume !false; {515#false} is VALID [2022-04-28 03:16:08,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {556#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {515#false} is VALID [2022-04-28 03:16:08,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {569#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {556#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:08,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {573#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {569#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:16:08,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {573#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {573#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:08,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {573#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {573#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:08,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {573#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:08,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {514#true} assume !!(1 <= ~main__n~0); {514#true} is VALID [2022-04-28 03:16:08,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {514#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {514#true} is VALID [2022-04-28 03:16:08,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {514#true} call #t~ret5 := main(); {514#true} is VALID [2022-04-28 03:16:08,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {514#true} {514#true} #38#return; {514#true} is VALID [2022-04-28 03:16:08,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-28 03:16:08,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {514#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {514#true} is VALID [2022-04-28 03:16:08,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {514#true} is VALID [2022-04-28 03:16:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:16:08,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:08,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435544308] [2022-04-28 03:16:08,320 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:16:08,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479799726] [2022-04-28 03:16:08,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479799726] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:08,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:16:08,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2022-04-28 03:16:08,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:08,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [801039627] [2022-04-28 03:16:08,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [801039627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:08,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:08,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:16:08,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240110266] [2022-04-28 03:16:08,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:08,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:16:08,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:08,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:08,335 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 03:16:08,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:16:08,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:08,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:16:08,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:16:08,336 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:08,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:08,440 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 03:16:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:16:08,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:16:08,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2022-04-28 03:16:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2022-04-28 03:16:08,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2022-04-28 03:16:08,459 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 03:16:08,460 INFO L225 Difference]: With dead ends: 19 [2022-04-28 03:16:08,460 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 03:16:08,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:16:08,461 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:08,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 50 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:16:08,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 03:16:08,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 03:16:08,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:08,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:08,473 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:08,473 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:08,474 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 03:16:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:16:08,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:08,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:08,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:16:08,475 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:16:08,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:08,476 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 03:16:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:16:08,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:08,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:08,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:08,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 03:16:08,477 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-28 03:16:08,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:08,477 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 03:16:08,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:08,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 03:16:08,492 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 03:16:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:16:08,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:16:08,492 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:08,493 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:08,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 03:16:08,693 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 03:16:08,693 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:08,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:08,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1394657329, now seen corresponding path program 7 times [2022-04-28 03:16:08,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:08,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [551622070] [2022-04-28 03:16:08,695 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:16:08,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1394657329, now seen corresponding path program 8 times [2022-04-28 03:16:08,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:08,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414742576] [2022-04-28 03:16:08,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:08,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:08,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:16:08,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1655072117] [2022-04-28 03:16:08,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:16:08,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:08,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:08,715 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 03:16:08,721 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 03:16:08,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:16:08,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:16:08,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:16:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:08,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:09,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2022-04-28 03:16:09,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {710#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {710#true} is VALID [2022-04-28 03:16:09,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {710#true} assume true; {710#true} is VALID [2022-04-28 03:16:09,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {710#true} {710#true} #38#return; {710#true} is VALID [2022-04-28 03:16:09,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {710#true} call #t~ret5 := main(); {710#true} is VALID [2022-04-28 03:16:09,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {710#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {710#true} is VALID [2022-04-28 03:16:09,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {710#true} assume !!(1 <= ~main__n~0); {710#true} is VALID [2022-04-28 03:16:09,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {710#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {736#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:16:09,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {736#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {740#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-28 03:16:09,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {740#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {744#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-28 03:16:09,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {744#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {748#(and (= (+ main_~main__sum~0 (- 3)) 3) (= (+ (- 2) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-28 03:16:09,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {748#(and (= (+ main_~main__sum~0 (- 3)) 3) (= (+ (- 2) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {752#(and (= (+ main_~main__sum~0 (- 6)) 4) (<= main_~main__sum~0 (+ 6 main_~main__n~0)) (<= (+ 5 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-28 03:16:09,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {752#(and (= (+ main_~main__sum~0 (- 6)) 4) (<= main_~main__sum~0 (+ 6 main_~main__n~0)) (<= (+ 5 main_~main__i~0) main_~main__sum~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {756#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:09,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {756#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {711#false} is VALID [2022-04-28 03:16:09,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {711#false} assume !false; {711#false} is VALID [2022-04-28 03:16:09,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:09,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:09,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {711#false} assume !false; {711#false} is VALID [2022-04-28 03:16:09,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {756#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {711#false} is VALID [2022-04-28 03:16:09,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {769#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {756#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:09,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {773#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {769#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:16:09,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {773#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {773#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:09,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {773#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {773#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:09,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {773#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {773#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:09,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {710#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {773#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:09,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {710#true} assume !!(1 <= ~main__n~0); {710#true} is VALID [2022-04-28 03:16:09,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {710#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {710#true} is VALID [2022-04-28 03:16:09,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {710#true} call #t~ret5 := main(); {710#true} is VALID [2022-04-28 03:16:09,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {710#true} {710#true} #38#return; {710#true} is VALID [2022-04-28 03:16:09,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {710#true} assume true; {710#true} is VALID [2022-04-28 03:16:09,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {710#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {710#true} is VALID [2022-04-28 03:16:09,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2022-04-28 03:16:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:16:09,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:09,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414742576] [2022-04-28 03:16:09,754 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:16:09,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655072117] [2022-04-28 03:16:09,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655072117] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:09,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:16:09,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2022-04-28 03:16:09,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:09,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [551622070] [2022-04-28 03:16:09,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [551622070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:09,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:09,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:16:09,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937227134] [2022-04-28 03:16:09,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:09,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:16:09,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:09,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:09,769 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 03:16:09,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:16:09,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:09,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:16:09,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:16:09,770 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:09,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:09,899 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 03:16:09,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:16:09,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:16:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:09,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2022-04-28 03:16:09,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2022-04-28 03:16:09,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2022-04-28 03:16:09,923 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 03:16:09,923 INFO L225 Difference]: With dead ends: 20 [2022-04-28 03:16:09,924 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:16:09,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:16:09,925 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:09,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:16:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:16:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:16:09,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:09,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:09,935 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:09,936 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:09,936 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 03:16:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 03:16:09,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:09,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:09,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:16:09,937 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:16:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:09,938 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 03:16:09,938 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 03:16:09,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:09,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:09,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:09,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 03:16:09,939 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-28 03:16:09,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:09,940 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 03:16:09,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:09,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 03:16:09,961 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 03:16:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 03:16:09,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:16:09,961 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:09,961 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:09,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 03:16:10,161 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 03:16:10,162 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:10,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:10,162 INFO L85 PathProgramCache]: Analyzing trace with hash 284641771, now seen corresponding path program 9 times [2022-04-28 03:16:10,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:10,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [516754320] [2022-04-28 03:16:10,163 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:16:10,163 INFO L85 PathProgramCache]: Analyzing trace with hash 284641771, now seen corresponding path program 10 times [2022-04-28 03:16:10,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:10,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333464634] [2022-04-28 03:16:10,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:10,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:10,179 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:16:10,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325350801] [2022-04-28 03:16:10,179 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:16:10,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:10,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:10,180 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 03:16:10,211 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 03:16:10,231 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:16:10,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:16:10,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 03:16:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:10,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:10,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {919#true} call ULTIMATE.init(); {919#true} is VALID [2022-04-28 03:16:10,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {919#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {919#true} is VALID [2022-04-28 03:16:10,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {919#true} assume true; {919#true} is VALID [2022-04-28 03:16:10,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {919#true} {919#true} #38#return; {919#true} is VALID [2022-04-28 03:16:10,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {919#true} call #t~ret5 := main(); {919#true} is VALID [2022-04-28 03:16:10,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {919#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {919#true} is VALID [2022-04-28 03:16:10,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {919#true} assume !!(1 <= ~main__n~0); {919#true} is VALID [2022-04-28 03:16:10,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {919#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {945#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:16:10,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {945#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {949#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-28 03:16:10,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {949#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {953#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 0))} is VALID [2022-04-28 03:16:10,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {953#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {957#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 0))} is VALID [2022-04-28 03:16:10,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {957#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {961#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 10))) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-28 03:16:10,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {961#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 10))) (= (+ (- 4) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {965#(and (<= 5 main_~main__n~0) (<= main_~main__i~0 6) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-28 03:16:10,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {965#(and (<= 5 main_~main__n~0) (<= main_~main__i~0 6) (= (+ main_~main__sum~0 (- 5)) 10))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {969#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:10,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {969#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {920#false} is VALID [2022-04-28 03:16:10,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#false} assume !false; {920#false} is VALID [2022-04-28 03:16:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:10,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:11,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#false} assume !false; {920#false} is VALID [2022-04-28 03:16:11,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {969#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {920#false} is VALID [2022-04-28 03:16:11,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {982#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {969#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:11,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {986#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {982#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:16:11,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {986#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {986#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:11,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {986#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {986#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:11,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {986#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {986#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:11,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {986#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {986#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:11,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {919#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {986#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:11,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {919#true} assume !!(1 <= ~main__n~0); {919#true} is VALID [2022-04-28 03:16:11,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {919#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {919#true} is VALID [2022-04-28 03:16:11,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {919#true} call #t~ret5 := main(); {919#true} is VALID [2022-04-28 03:16:11,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {919#true} {919#true} #38#return; {919#true} is VALID [2022-04-28 03:16:11,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {919#true} assume true; {919#true} is VALID [2022-04-28 03:16:11,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {919#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {919#true} is VALID [2022-04-28 03:16:11,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {919#true} call ULTIMATE.init(); {919#true} is VALID [2022-04-28 03:16:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:16:11,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:11,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333464634] [2022-04-28 03:16:11,397 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:16:11,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325350801] [2022-04-28 03:16:11,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325350801] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:11,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:16:11,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2022-04-28 03:16:11,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:11,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [516754320] [2022-04-28 03:16:11,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [516754320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:11,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:11,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:16:11,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360566123] [2022-04-28 03:16:11,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:11,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:16:11,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:11,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:11,413 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 03:16:11,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:16:11,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:11,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:16:11,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:16:11,414 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:11,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:11,559 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 03:16:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:16:11,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:16:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:11,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2022-04-28 03:16:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2022-04-28 03:16:11,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 21 transitions. [2022-04-28 03:16:11,578 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 03:16:11,579 INFO L225 Difference]: With dead ends: 21 [2022-04-28 03:16:11,579 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 03:16:11,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:16:11,580 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:11,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:16:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 03:16:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 03:16:11,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:11,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:11,594 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:11,594 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:11,595 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 03:16:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 03:16:11,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:11,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:11,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 03:16:11,596 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 03:16:11,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:11,597 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 03:16:11,597 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 03:16:11,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:11,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:11,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:11,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-28 03:16:11,599 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-28 03:16:11,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:11,599 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-28 03:16:11,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:11,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-28 03:16:11,616 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 03:16:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 03:16:11,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:16:11,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:11,617 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:11,637 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 03:16:11,831 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 03:16:11,831 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:11,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash 233897841, now seen corresponding path program 11 times [2022-04-28 03:16:11,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:11,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [409267804] [2022-04-28 03:16:11,832 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:16:11,833 INFO L85 PathProgramCache]: Analyzing trace with hash 233897841, now seen corresponding path program 12 times [2022-04-28 03:16:11,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:11,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039692344] [2022-04-28 03:16:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:11,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:11,860 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:16:11,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1218645713] [2022-04-28 03:16:11,860 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:16:11,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:11,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:11,866 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 03:16:11,874 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 03:16:11,909 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 03:16:11,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:16:11,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:16:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:11,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:36,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {1141#true} call ULTIMATE.init(); {1141#true} is VALID [2022-04-28 03:16:36,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {1141#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {1141#true} is VALID [2022-04-28 03:16:36,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {1141#true} assume true; {1141#true} is VALID [2022-04-28 03:16:36,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1141#true} {1141#true} #38#return; {1141#true} is VALID [2022-04-28 03:16:36,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {1141#true} call #t~ret5 := main(); {1141#true} is VALID [2022-04-28 03:16:36,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {1141#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1141#true} is VALID [2022-04-28 03:16:36,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {1141#true} assume !!(1 <= ~main__n~0); {1141#true} is VALID [2022-04-28 03:16:36,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {1141#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1167#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:16:36,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {1167#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1171#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-28 03:16:36,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {1171#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1175#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 2))} is VALID [2022-04-28 03:16:36,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {1175#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1179#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-28 03:16:36,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {1179#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1183#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} is VALID [2022-04-28 03:16:36,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1187#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 4) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4))))} is VALID [2022-04-28 03:16:36,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {1187#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 4) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1191#(and (= (mod (+ main_~main__sum~0 1) 2) 0) (<= main_~main__sum~0 (+ (div (+ main_~main__sum~0 9) 2) main_~main__n~0)) (<= (+ (div (+ main_~main__sum~0 9) 2) main_~main__i~0) (+ main_~main__sum~0 1)) (= (+ (* (- 1) main_~main__sum~0) (* (div (+ main_~main__sum~0 9) 2) 2) (- 4)) (+ (- 1) main_~main__sum~0 (* (- 1) (div (+ main_~main__sum~0 9) 2)))))} is VALID [2022-04-28 03:16:36,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {1191#(and (= (mod (+ main_~main__sum~0 1) 2) 0) (<= main_~main__sum~0 (+ (div (+ main_~main__sum~0 9) 2) main_~main__n~0)) (<= (+ (div (+ main_~main__sum~0 9) 2) main_~main__i~0) (+ main_~main__sum~0 1)) (= (+ (* (- 1) main_~main__sum~0) (* (div (+ main_~main__sum~0 9) 2) 2) (- 4)) (+ (- 1) main_~main__sum~0 (* (- 1) (div (+ main_~main__sum~0 9) 2)))))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1195#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:36,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {1195#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1142#false} is VALID [2022-04-28 03:16:36,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {1142#false} assume !false; {1142#false} is VALID [2022-04-28 03:16:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:36,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:37,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {1142#false} assume !false; {1142#false} is VALID [2022-04-28 03:16:37,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {1195#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1142#false} is VALID [2022-04-28 03:16:37,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {1208#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1195#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:37,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {1212#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1208#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:16:37,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {1212#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1212#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:37,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {1212#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1212#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:37,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {1212#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1212#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:37,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {1212#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1212#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:37,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {1212#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1212#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:37,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {1141#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1212#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:37,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {1141#true} assume !!(1 <= ~main__n~0); {1141#true} is VALID [2022-04-28 03:16:37,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {1141#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1141#true} is VALID [2022-04-28 03:16:37,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {1141#true} call #t~ret5 := main(); {1141#true} is VALID [2022-04-28 03:16:37,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1141#true} {1141#true} #38#return; {1141#true} is VALID [2022-04-28 03:16:37,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {1141#true} assume true; {1141#true} is VALID [2022-04-28 03:16:37,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {1141#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {1141#true} is VALID [2022-04-28 03:16:37,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {1141#true} call ULTIMATE.init(); {1141#true} is VALID [2022-04-28 03:16:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 03:16:37,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:37,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039692344] [2022-04-28 03:16:37,466 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:16:37,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218645713] [2022-04-28 03:16:37,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218645713] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:37,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:16:37,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 12 [2022-04-28 03:16:37,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:37,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [409267804] [2022-04-28 03:16:37,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [409267804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:37,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:37,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:16:37,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767499804] [2022-04-28 03:16:37,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:37,468 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:16:37,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:37,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:37,483 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 03:16:37,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:16:37,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:37,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:16:37,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:16:37,484 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:37,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:37,664 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 03:16:37,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:16:37,665 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:16:37,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2022-04-28 03:16:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2022-04-28 03:16:37,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 22 transitions. [2022-04-28 03:16:37,691 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 03:16:37,692 INFO L225 Difference]: With dead ends: 22 [2022-04-28 03:16:37,692 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 03:16:37,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:16:37,693 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:37,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 74 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:16:37,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 03:16:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 03:16:37,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:37,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:37,712 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:37,712 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:37,713 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 03:16:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 03:16:37,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:37,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:37,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:16:37,714 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:16:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:37,714 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 03:16:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 03:16:37,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:37,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:37,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:37,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-28 03:16:37,716 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-28 03:16:37,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:37,716 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-28 03:16:37,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:37,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-28 03:16:37,738 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 03:16:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 03:16:37,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:16:37,739 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:37,739 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:37,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 03:16:37,963 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 03:16:37,964 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:37,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:37,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1339163989, now seen corresponding path program 13 times [2022-04-28 03:16:37,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:37,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [873902686] [2022-04-28 03:16:37,965 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:16:37,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1339163989, now seen corresponding path program 14 times [2022-04-28 03:16:37,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:37,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269869868] [2022-04-28 03:16:37,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:37,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:37,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:16:37,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [697809741] [2022-04-28 03:16:37,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:16:37,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:37,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:37,989 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 03:16:37,989 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 03:16:38,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:16:38,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:16:38,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 03:16:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:38,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:38,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {1376#true} call ULTIMATE.init(); {1376#true} is VALID [2022-04-28 03:16:38,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {1376#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {1376#true} is VALID [2022-04-28 03:16:38,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-04-28 03:16:38,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1376#true} {1376#true} #38#return; {1376#true} is VALID [2022-04-28 03:16:38,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {1376#true} call #t~ret5 := main(); {1376#true} is VALID [2022-04-28 03:16:38,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {1376#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1376#true} is VALID [2022-04-28 03:16:38,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {1376#true} assume !!(1 <= ~main__n~0); {1399#(<= 1 main_~main__n~0)} is VALID [2022-04-28 03:16:38,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {1399#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1403#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:16:38,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {1403#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1407#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 1))} is VALID [2022-04-28 03:16:38,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {1407#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1411#(and (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 2) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:16:38,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {1411#(and (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 2) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1415#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 1) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:16:38,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {1415#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 1) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1419#(and (= 2 (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 1) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:16:38,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {1419#(and (= 2 (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 1) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1423#(and (= 2 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ (- 9) (* 4 main_~main__i~0))) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:16:38,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {1423#(and (= 2 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ (- 9) (* 4 main_~main__i~0))) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1427#(and (= 2 (+ (- 5) main_~main__i~0)) (<= 1 main_~main__n~0) (= (+ (* 4 main_~main__i~0) (- 13)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:16:38,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {1427#(and (= 2 (+ (- 5) main_~main__i~0)) (<= 1 main_~main__n~0) (= (+ (* 4 main_~main__i~0) (- 13)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1431#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} is VALID [2022-04-28 03:16:38,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {1431#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1435#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:38,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {1435#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1377#false} is VALID [2022-04-28 03:16:38,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {1377#false} assume !false; {1377#false} is VALID [2022-04-28 03:16:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:38,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:38,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {1377#false} assume !false; {1377#false} is VALID [2022-04-28 03:16:38,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {1435#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1377#false} is VALID [2022-04-28 03:16:38,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {1448#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1435#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:38,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {1452#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1448#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:16:38,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {1456#(or (<= (+ 2 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 1) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 4 main_~main__i~0) 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1452#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} is VALID [2022-04-28 03:16:38,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {1460#(or (= (+ (* main_~main__sum~0 2) (* 6 main_~main__i~0) 6) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 3 main_~main__i~0) main_~main__n~0) (not (<= (+ 2 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1456#(or (<= (+ 2 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 1) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 4 main_~main__i~0) 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:16:38,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {1464#(or (not (<= (+ 3 main_~main__i~0) main_~main__n~0)) (<= (+ 4 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 8 main_~main__i~0) 12) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1460#(or (= (+ (* main_~main__sum~0 2) (* 6 main_~main__i~0) 6) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 3 main_~main__i~0) main_~main__n~0) (not (<= (+ 2 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-28 03:16:38,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {1468#(or (<= (+ 5 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) 20 (* 10 main_~main__i~0))) (not (<= (+ 4 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1464#(or (not (<= (+ 3 main_~main__i~0) main_~main__n~0)) (<= (+ 4 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 8 main_~main__i~0) 12) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:16:38,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {1472#(or (= (+ (* main_~main__sum~0 2) (* 12 main_~main__i~0) 30) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 6 main_~main__i~0) main_~main__n~0) (not (<= (+ 5 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1468#(or (<= (+ 5 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) 20 (* 10 main_~main__i~0))) (not (<= (+ 4 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-28 03:16:38,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {1476#(or (<= (+ 7 main_~main__i~0) main_~main__n~0) (not (<= (+ 6 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 14 main_~main__i~0) 42) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1472#(or (= (+ (* main_~main__sum~0 2) (* 12 main_~main__i~0) 30) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 6 main_~main__i~0) main_~main__n~0) (not (<= (+ 5 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-28 03:16:38,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {1376#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1476#(or (<= (+ 7 main_~main__i~0) main_~main__n~0) (not (<= (+ 6 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 14 main_~main__i~0) 42) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:16:38,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {1376#true} assume !!(1 <= ~main__n~0); {1376#true} is VALID [2022-04-28 03:16:38,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {1376#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1376#true} is VALID [2022-04-28 03:16:38,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {1376#true} call #t~ret5 := main(); {1376#true} is VALID [2022-04-28 03:16:38,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1376#true} {1376#true} #38#return; {1376#true} is VALID [2022-04-28 03:16:38,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-04-28 03:16:38,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {1376#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {1376#true} is VALID [2022-04-28 03:16:38,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {1376#true} call ULTIMATE.init(); {1376#true} is VALID [2022-04-28 03:16:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:38,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:38,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269869868] [2022-04-28 03:16:38,834 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:16:38,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697809741] [2022-04-28 03:16:38,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697809741] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:38,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:16:38,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-04-28 03:16:38,835 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:38,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [873902686] [2022-04-28 03:16:38,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [873902686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:38,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:38,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:16:38,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178021085] [2022-04-28 03:16:38,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:38,835 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:16:38,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:38,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:38,849 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 03:16:38,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:16:38,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:38,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:16:38,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:16:38,850 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:39,105 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 03:16:39,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:16:39,106 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:16:39,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2022-04-28 03:16:39,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2022-04-28 03:16:39,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 23 transitions. [2022-04-28 03:16:39,129 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 03:16:39,130 INFO L225 Difference]: With dead ends: 23 [2022-04-28 03:16:39,130 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 03:16:39,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:16:39,131 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:39,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:16:39,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 03:16:39,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 03:16:39,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:39,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:39,150 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:39,150 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:39,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:39,151 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 03:16:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 03:16:39,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:39,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:39,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:16:39,152 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:16:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:39,153 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 03:16:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 03:16:39,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:39,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:39,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:39,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-28 03:16:39,154 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-28 03:16:39,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:39,154 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-28 03:16:39,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:39,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-28 03:16:39,191 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 03:16:39,192 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 03:16:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:16:39,192 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:39,192 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:39,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 03:16:39,395 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 03:16:39,395 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:39,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:39,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1435526833, now seen corresponding path program 15 times [2022-04-28 03:16:39,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:39,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1609639361] [2022-04-28 03:16:39,396 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:16:39,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1435526833, now seen corresponding path program 16 times [2022-04-28 03:16:39,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:39,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395884510] [2022-04-28 03:16:39,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:39,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:39,416 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:16:39,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1532279315] [2022-04-28 03:16:39,417 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:16:39,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:39,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:39,425 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 03:16:39,451 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 03:16:39,484 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:16:39,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:16:39,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 03:16:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:39,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:39,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {1631#true} call ULTIMATE.init(); {1631#true} is VALID [2022-04-28 03:16:39,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {1631#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {1631#true} is VALID [2022-04-28 03:16:39,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {1631#true} assume true; {1631#true} is VALID [2022-04-28 03:16:39,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1631#true} #38#return; {1631#true} is VALID [2022-04-28 03:16:39,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {1631#true} call #t~ret5 := main(); {1631#true} is VALID [2022-04-28 03:16:39,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {1631#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1631#true} is VALID [2022-04-28 03:16:39,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {1631#true} assume !!(1 <= ~main__n~0); {1631#true} is VALID [2022-04-28 03:16:39,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {1631#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1657#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:16:39,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {1657#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1661#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-28 03:16:39,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {1661#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1665#(and (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-28 03:16:39,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {1665#(and (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1669#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 1))} is VALID [2022-04-28 03:16:39,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {1669#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1673#(and (= (+ (- 9) main_~main__sum~0) 1) (= 5 main_~main__i~0))} is VALID [2022-04-28 03:16:39,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {1673#(and (= (+ (- 9) main_~main__sum~0) 1) (= 5 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1677#(and (= 6 main_~main__i~0) (= (+ (- 14) main_~main__sum~0) 1))} is VALID [2022-04-28 03:16:39,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {1677#(and (= 6 main_~main__i~0) (= (+ (- 14) main_~main__sum~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1681#(and (= main_~main__sum~0 (+ 14 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 6))} is VALID [2022-04-28 03:16:39,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {1681#(and (= main_~main__sum~0 (+ 14 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1685#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-28 03:16:39,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {1685#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1689#(and (<= 8 main_~main__n~0) (<= main_~main__i~0 9) (= (+ main_~main__sum~0 (- 8)) 28))} is VALID [2022-04-28 03:16:39,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {1689#(and (<= 8 main_~main__n~0) (<= main_~main__i~0 9) (= (+ main_~main__sum~0 (- 8)) 28))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1693#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:39,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {1693#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1632#false} is VALID [2022-04-28 03:16:39,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {1632#false} assume !false; {1632#false} is VALID [2022-04-28 03:16:39,794 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 03:16:39,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:41,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {1632#false} assume !false; {1632#false} is VALID [2022-04-28 03:16:41,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {1693#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1632#false} is VALID [2022-04-28 03:16:41,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {1706#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1693#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:41,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {1710#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1706#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:16:41,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {1710#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1710#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:41,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {1710#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1710#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:41,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {1710#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1710#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:41,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {1710#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1710#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:41,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {1710#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1710#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:41,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {1710#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1710#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:41,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {1710#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1710#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:41,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {1631#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1710#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:41,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {1631#true} assume !!(1 <= ~main__n~0); {1631#true} is VALID [2022-04-28 03:16:41,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {1631#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1631#true} is VALID [2022-04-28 03:16:41,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {1631#true} call #t~ret5 := main(); {1631#true} is VALID [2022-04-28 03:16:41,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1631#true} #38#return; {1631#true} is VALID [2022-04-28 03:16:41,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {1631#true} assume true; {1631#true} is VALID [2022-04-28 03:16:41,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {1631#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {1631#true} is VALID [2022-04-28 03:16:41,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {1631#true} call ULTIMATE.init(); {1631#true} is VALID [2022-04-28 03:16:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 03:16:41,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:41,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395884510] [2022-04-28 03:16:41,300 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:16:41,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532279315] [2022-04-28 03:16:41,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532279315] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:41,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:16:41,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 14 [2022-04-28 03:16:41,301 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:41,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1609639361] [2022-04-28 03:16:41,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1609639361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:41,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:41,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:16:41,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078176009] [2022-04-28 03:16:41,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:41,302 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:16:41,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:41,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:41,317 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 03:16:41,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:16:41,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:41,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:16:41,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:16:41,318 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:41,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:41,575 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 03:16:41,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:16:41,575 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:16:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2022-04-28 03:16:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2022-04-28 03:16:41,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 24 transitions. [2022-04-28 03:16:41,602 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 03:16:41,602 INFO L225 Difference]: With dead ends: 24 [2022-04-28 03:16:41,602 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 03:16:41,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:16:41,603 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:41,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:16:41,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 03:16:41,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 03:16:41,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:41,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:41,623 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:41,623 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:41,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:41,624 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 03:16:41,624 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 03:16:41,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:41,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:41,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:16:41,625 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:16:41,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:41,626 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 03:16:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 03:16:41,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:41,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:41,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:41,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-28 03:16:41,627 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-28 03:16:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:41,627 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-28 03:16:41,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:41,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-28 03:16:41,651 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 03:16:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 03:16:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:16:41,652 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:41,652 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:41,669 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 03:16:41,855 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 03:16:41,855 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:41,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:41,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1551596395, now seen corresponding path program 17 times [2022-04-28 03:16:41,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:41,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1336393077] [2022-04-28 03:16:41,856 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:16:41,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1551596395, now seen corresponding path program 18 times [2022-04-28 03:16:41,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:41,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816819316] [2022-04-28 03:16:41,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:41,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:41,874 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:16:41,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146754354] [2022-04-28 03:16:41,874 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:16:41,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:41,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:41,875 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 03:16:41,884 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 03:16:41,919 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 03:16:41,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:16:41,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 03:16:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:41,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:42,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {1892#true} call ULTIMATE.init(); {1892#true} is VALID [2022-04-28 03:16:42,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {1892#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {1892#true} is VALID [2022-04-28 03:16:42,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {1892#true} assume true; {1892#true} is VALID [2022-04-28 03:16:42,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1892#true} {1892#true} #38#return; {1892#true} is VALID [2022-04-28 03:16:42,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {1892#true} call #t~ret5 := main(); {1892#true} is VALID [2022-04-28 03:16:42,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {1892#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1892#true} is VALID [2022-04-28 03:16:42,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {1892#true} assume !!(1 <= ~main__n~0); {1892#true} is VALID [2022-04-28 03:16:42,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {1892#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1918#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:16:42,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {1918#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1922#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-28 03:16:42,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {1922#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1926#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-28 03:16:42,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {1926#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1930#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-28 03:16:42,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {1930#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1934#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} is VALID [2022-04-28 03:16:42,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {1934#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1938#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 6)) 3))} is VALID [2022-04-28 03:16:42,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {1938#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 6)) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(and (= 5 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 7)))} is VALID [2022-04-28 03:16:42,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {1942#(and (= 5 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 7)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1946#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-28 03:16:42,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {1946#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1950#(and (= (+ main_~main__sum~0 (- 27)) main_~main__i~0) (= 8 (+ main_~main__sum~0 (- 28))))} is VALID [2022-04-28 03:16:42,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {1950#(and (= (+ main_~main__sum~0 (- 27)) main_~main__i~0) (= 8 (+ main_~main__sum~0 (- 28))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1954#(and (<= main_~main__sum~0 (+ 36 main_~main__n~0)) (= 9 (+ main_~main__sum~0 (- 36))) (<= (+ 35 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-28 03:16:42,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {1954#(and (<= main_~main__sum~0 (+ 36 main_~main__n~0)) (= 9 (+ main_~main__sum~0 (- 36))) (<= (+ 35 main_~main__i~0) main_~main__sum~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1958#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:42,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {1958#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1893#false} is VALID [2022-04-28 03:16:42,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {1893#false} assume !false; {1893#false} is VALID [2022-04-28 03:16:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:42,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:43,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {1893#false} assume !false; {1893#false} is VALID [2022-04-28 03:16:43,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {1958#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1893#false} is VALID [2022-04-28 03:16:43,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {1971#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1958#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:43,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1971#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:16:43,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:43,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:43,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:43,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:43,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:43,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:43,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:43,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:43,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {1892#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1975#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:43,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {1892#true} assume !!(1 <= ~main__n~0); {1892#true} is VALID [2022-04-28 03:16:43,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {1892#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1892#true} is VALID [2022-04-28 03:16:43,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {1892#true} call #t~ret5 := main(); {1892#true} is VALID [2022-04-28 03:16:43,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1892#true} {1892#true} #38#return; {1892#true} is VALID [2022-04-28 03:16:43,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {1892#true} assume true; {1892#true} is VALID [2022-04-28 03:16:43,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {1892#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {1892#true} is VALID [2022-04-28 03:16:43,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {1892#true} call ULTIMATE.init(); {1892#true} is VALID [2022-04-28 03:16:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 03:16:43,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:43,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816819316] [2022-04-28 03:16:43,910 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:16:43,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146754354] [2022-04-28 03:16:43,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146754354] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:43,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:16:43,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 15 [2022-04-28 03:16:43,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:43,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1336393077] [2022-04-28 03:16:43,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1336393077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:43,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:43,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:16:43,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817311169] [2022-04-28 03:16:43,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:43,911 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:16:43,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:43,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:43,927 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 03:16:43,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:16:43,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:43,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:16:43,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:16:43,928 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:44,190 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 03:16:44,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:16:44,190 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:16:44,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2022-04-28 03:16:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2022-04-28 03:16:44,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 25 transitions. [2022-04-28 03:16:44,218 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 03:16:44,219 INFO L225 Difference]: With dead ends: 25 [2022-04-28 03:16:44,219 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 03:16:44,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:16:44,220 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:44,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:16:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 03:16:44,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 03:16:44,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:44,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:44,237 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:44,237 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:44,238 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 03:16:44,238 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 03:16:44,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:44,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:44,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 03:16:44,238 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 03:16:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:44,239 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 03:16:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 03:16:44,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:44,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:44,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:44,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-28 03:16:44,240 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-28 03:16:44,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:44,240 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-28 03:16:44,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:44,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-28 03:16:44,264 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 03:16:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 03:16:44,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:16:44,265 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:44,265 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:44,282 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 03:16:44,471 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 03:16:44,471 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:44,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:44,472 INFO L85 PathProgramCache]: Analyzing trace with hash 854785521, now seen corresponding path program 19 times [2022-04-28 03:16:44,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:44,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [975788564] [2022-04-28 03:16:44,472 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:16:44,472 INFO L85 PathProgramCache]: Analyzing trace with hash 854785521, now seen corresponding path program 20 times [2022-04-28 03:16:44,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:44,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26821077] [2022-04-28 03:16:44,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:44,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:44,486 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:16:44,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103132165] [2022-04-28 03:16:44,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:16:44,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:44,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:44,488 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 03:16:44,494 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 03:16:44,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:16:44,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:16:44,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 03:16:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:44,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:44,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {2166#true} call ULTIMATE.init(); {2166#true} is VALID [2022-04-28 03:16:44,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {2166#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {2166#true} is VALID [2022-04-28 03:16:44,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {2166#true} assume true; {2166#true} is VALID [2022-04-28 03:16:44,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2166#true} {2166#true} #38#return; {2166#true} is VALID [2022-04-28 03:16:44,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {2166#true} call #t~ret5 := main(); {2166#true} is VALID [2022-04-28 03:16:44,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {2166#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2166#true} is VALID [2022-04-28 03:16:44,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {2166#true} assume !!(1 <= ~main__n~0); {2166#true} is VALID [2022-04-28 03:16:44,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {2166#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2192#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:16:44,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {2192#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2196#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-28 03:16:44,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {2196#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2200#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-28 03:16:44,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {2200#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2204#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-28 03:16:44,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {2204#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2208#(and (= 3 (+ (- 2) main_~main__i~0)) (= 3 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-28 03:16:44,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {2208#(and (= 3 (+ (- 2) main_~main__i~0)) (= 3 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2212#(and (= 6 main_~main__i~0) (= 3 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-28 03:16:44,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {2212#(and (= 6 main_~main__i~0) (= 3 (+ main_~main__sum~0 (- 12))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2216#(and (= main_~main__sum~0 (+ 14 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 6))} is VALID [2022-04-28 03:16:44,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {2216#(and (= main_~main__sum~0 (+ 14 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2220#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-28 03:16:44,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {2220#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2224#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-28 03:16:44,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {2224#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2228#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} is VALID [2022-04-28 03:16:44,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {2228#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2232#(and (<= 10 main_~main__n~0) (<= main_~main__i~0 11) (= main_~main__sum~0 55))} is VALID [2022-04-28 03:16:44,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {2232#(and (<= 10 main_~main__n~0) (<= main_~main__i~0 11) (= main_~main__sum~0 55))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2236#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:44,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {2236#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2167#false} is VALID [2022-04-28 03:16:44,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {2167#false} assume !false; {2167#false} is VALID [2022-04-28 03:16:44,861 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:44,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:46,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {2167#false} assume !false; {2167#false} is VALID [2022-04-28 03:16:46,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {2236#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2167#false} is VALID [2022-04-28 03:16:46,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {2249#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2236#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:46,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2249#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:16:46,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:46,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:46,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:46,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:46,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:46,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:46,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:46,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:46,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:46,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {2166#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2253#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:46,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {2166#true} assume !!(1 <= ~main__n~0); {2166#true} is VALID [2022-04-28 03:16:46,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {2166#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2166#true} is VALID [2022-04-28 03:16:46,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {2166#true} call #t~ret5 := main(); {2166#true} is VALID [2022-04-28 03:16:46,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2166#true} {2166#true} #38#return; {2166#true} is VALID [2022-04-28 03:16:46,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {2166#true} assume true; {2166#true} is VALID [2022-04-28 03:16:46,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {2166#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {2166#true} is VALID [2022-04-28 03:16:46,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {2166#true} call ULTIMATE.init(); {2166#true} is VALID [2022-04-28 03:16:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 03:16:46,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:46,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26821077] [2022-04-28 03:16:46,660 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:16:46,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103132165] [2022-04-28 03:16:46,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103132165] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:46,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:16:46,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 16 [2022-04-28 03:16:46,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:46,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [975788564] [2022-04-28 03:16:46,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [975788564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:46,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:46,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:16:46,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722459728] [2022-04-28 03:16:46,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:46,661 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:16:46,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:46,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:46,682 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 03:16:46,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:16:46,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:46,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:16:46,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:16:46,683 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:47,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:47,011 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 03:16:47,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:16:47,012 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:16:47,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2022-04-28 03:16:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:47,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2022-04-28 03:16:47,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 26 transitions. [2022-04-28 03:16:47,039 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 03:16:47,039 INFO L225 Difference]: With dead ends: 26 [2022-04-28 03:16:47,040 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:16:47,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:16:47,040 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:47,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 106 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:16:47,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:16:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 03:16:47,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:47,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:47,062 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:47,062 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:47,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:47,063 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 03:16:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 03:16:47,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:47,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:47,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:16:47,064 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:16:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:47,065 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 03:16:47,065 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 03:16:47,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:47,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:47,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:47,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-28 03:16:47,066 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-28 03:16:47,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:47,066 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-28 03:16:47,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:47,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-28 03:16:47,093 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 03:16:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 03:16:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:16:47,093 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:47,094 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:47,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 03:16:47,295 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 03:16:47,295 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:47,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash 728484907, now seen corresponding path program 21 times [2022-04-28 03:16:47,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:47,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [237995902] [2022-04-28 03:16:47,296 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:16:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash 728484907, now seen corresponding path program 22 times [2022-04-28 03:16:47,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:47,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287084371] [2022-04-28 03:16:47,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:47,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:47,311 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:16:47,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2147190906] [2022-04-28 03:16:47,311 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:16:47,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:47,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:47,312 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 03:16:47,313 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 03:16:47,355 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:16:47,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:16:47,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 03:16:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:47,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:47,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {2453#true} call ULTIMATE.init(); {2453#true} is VALID [2022-04-28 03:16:47,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {2453#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {2453#true} is VALID [2022-04-28 03:16:47,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {2453#true} assume true; {2453#true} is VALID [2022-04-28 03:16:47,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2453#true} {2453#true} #38#return; {2453#true} is VALID [2022-04-28 03:16:47,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {2453#true} call #t~ret5 := main(); {2453#true} is VALID [2022-04-28 03:16:47,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {2453#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2453#true} is VALID [2022-04-28 03:16:47,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {2453#true} assume !!(1 <= ~main__n~0); {2453#true} is VALID [2022-04-28 03:16:47,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {2453#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2479#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:16:47,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {2479#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2483#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-28 03:16:47,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {2483#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2487#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-28 03:16:47,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {2487#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2491#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} is VALID [2022-04-28 03:16:47,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {2491#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2495#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0))} is VALID [2022-04-28 03:16:47,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {2495#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2499#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-28 03:16:47,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {2499#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2503#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} is VALID [2022-04-28 03:16:47,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {2503#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2507#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 15) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-28 03:16:47,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {2507#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 15) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2511#(and (= (+ main_~main__sum~0 (- 21)) 15) (= 9 main_~main__i~0))} is VALID [2022-04-28 03:16:47,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {2511#(and (= (+ main_~main__sum~0 (- 21)) 15) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2515#(and (= 10 main_~main__i~0) (= 15 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-28 03:16:47,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {2515#(and (= 10 main_~main__i~0) (= 15 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2519#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} is VALID [2022-04-28 03:16:47,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {2519#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2523#(and (= 66 main_~main__sum~0) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} is VALID [2022-04-28 03:16:47,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {2523#(and (= 66 main_~main__sum~0) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2527#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:47,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {2527#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2454#false} is VALID [2022-04-28 03:16:47,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {2454#false} assume !false; {2454#false} is VALID [2022-04-28 03:16:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:47,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:49,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {2454#false} assume !false; {2454#false} is VALID [2022-04-28 03:16:49,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {2527#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2454#false} is VALID [2022-04-28 03:16:49,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {2540#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2527#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:49,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2540#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:16:49,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:49,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:49,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:49,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:49,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:49,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:49,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:49,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:49,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:49,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:49,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {2453#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2544#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:49,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {2453#true} assume !!(1 <= ~main__n~0); {2453#true} is VALID [2022-04-28 03:16:49,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {2453#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2453#true} is VALID [2022-04-28 03:16:49,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {2453#true} call #t~ret5 := main(); {2453#true} is VALID [2022-04-28 03:16:49,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2453#true} {2453#true} #38#return; {2453#true} is VALID [2022-04-28 03:16:49,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {2453#true} assume true; {2453#true} is VALID [2022-04-28 03:16:49,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {2453#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {2453#true} is VALID [2022-04-28 03:16:49,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {2453#true} call ULTIMATE.init(); {2453#true} is VALID [2022-04-28 03:16:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 03:16:49,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:49,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287084371] [2022-04-28 03:16:49,741 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:16:49,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147190906] [2022-04-28 03:16:49,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147190906] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:49,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:16:49,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 17 [2022-04-28 03:16:49,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:49,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [237995902] [2022-04-28 03:16:49,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [237995902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:49,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:49,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:16:49,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043921234] [2022-04-28 03:16:49,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:49,742 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:16:49,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:49,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:49,761 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 03:16:49,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:16:49,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:49,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:16:49,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:16:49,762 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:50,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:50,129 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 03:16:50,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:16:50,129 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:16:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2022-04-28 03:16:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2022-04-28 03:16:50,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 27 transitions. [2022-04-28 03:16:50,156 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 03:16:50,156 INFO L225 Difference]: With dead ends: 27 [2022-04-28 03:16:50,156 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 03:16:50,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:16:50,157 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:50,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 114 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:16:50,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 03:16:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 03:16:50,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:50,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:50,177 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:50,177 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:50,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:50,177 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 03:16:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 03:16:50,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:50,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:50,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 03:16:50,178 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 03:16:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:50,178 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 03:16:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 03:16:50,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:50,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:50,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:50,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-28 03:16:50,180 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-28 03:16:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:50,180 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-28 03:16:50,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:50,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-28 03:16:50,206 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 03:16:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 03:16:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:16:50,207 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:50,207 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:50,237 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 03:16:50,423 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 03:16:50,423 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:50,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1108133169, now seen corresponding path program 23 times [2022-04-28 03:16:50,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:50,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1154769063] [2022-04-28 03:16:50,425 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:16:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1108133169, now seen corresponding path program 24 times [2022-04-28 03:16:50,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:50,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517718473] [2022-04-28 03:16:50,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:50,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:50,446 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:16:50,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314228060] [2022-04-28 03:16:50,446 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:16:50,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:50,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:50,448 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 03:16:50,449 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 03:16:50,486 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 03:16:50,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:16:50,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-28 03:16:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:50,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:50,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {2753#true} call ULTIMATE.init(); {2753#true} is VALID [2022-04-28 03:16:50,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {2753#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {2753#true} is VALID [2022-04-28 03:16:50,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {2753#true} assume true; {2753#true} is VALID [2022-04-28 03:16:50,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2753#true} {2753#true} #38#return; {2753#true} is VALID [2022-04-28 03:16:50,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {2753#true} call #t~ret5 := main(); {2753#true} is VALID [2022-04-28 03:16:50,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {2753#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2753#true} is VALID [2022-04-28 03:16:50,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {2753#true} assume !!(1 <= ~main__n~0); {2753#true} is VALID [2022-04-28 03:16:50,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {2753#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2779#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:16:50,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {2779#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2783#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-28 03:16:50,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {2783#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2787#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-28 03:16:50,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {2787#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2791#(and (= (+ main_~main__sum~0 (- 3)) 3) (= (+ (- 2) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-28 03:16:50,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {2791#(and (= (+ main_~main__sum~0 (- 3)) 3) (= (+ (- 2) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2795#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} is VALID [2022-04-28 03:16:50,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {2795#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2799#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 4) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4))))} is VALID [2022-04-28 03:16:50,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {2799#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 4) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2803#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 3)) 4) (= (+ (- 2) main_~main__sum~0 (* (- 2) main_~main__i~0)) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-28 03:16:50,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {2803#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 3)) 4) (= (+ (- 2) main_~main__sum~0 (* (- 2) main_~main__i~0)) (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2807#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0)) 4) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 1) (+ (- 3) main_~main__i~0)))} is VALID [2022-04-28 03:16:50,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {2807#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0)) 4) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 1) (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2811#(and (= (* 4 main_~main__i~0) main_~main__sum~0) (= 5 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-28 03:16:50,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {2811#(and (= (* 4 main_~main__i~0) main_~main__sum~0) (= 5 (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2815#(and (= (+ (- 9) main_~main__sum~0) 36) (= 10 main_~main__i~0))} is VALID [2022-04-28 03:16:50,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {2815#(and (= (+ (- 9) main_~main__sum~0) 36) (= 10 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2819#(and (= (+ main_~main__sum~0 (- 19)) 36) (= 11 main_~main__i~0))} is VALID [2022-04-28 03:16:50,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {2819#(and (= (+ main_~main__sum~0 (- 19)) 36) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2823#(and (= 12 main_~main__i~0) (= 36 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-28 03:16:50,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {2823#(and (= 12 main_~main__i~0) (= 36 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2827#(and (<= main_~main__i~0 13) (<= 12 main_~main__n~0) (= (+ main_~main__sum~0 (- 42)) 36))} is VALID [2022-04-28 03:16:50,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {2827#(and (<= main_~main__i~0 13) (<= 12 main_~main__n~0) (= (+ main_~main__sum~0 (- 42)) 36))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2831#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:50,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {2831#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2754#false} is VALID [2022-04-28 03:16:50,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {2754#false} assume !false; {2754#false} is VALID [2022-04-28 03:16:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:50,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:53,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {2754#false} assume !false; {2754#false} is VALID [2022-04-28 03:16:53,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {2831#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2754#false} is VALID [2022-04-28 03:16:53,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {2844#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2831#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:53,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2844#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:16:53,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:53,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:53,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:53,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:53,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:53,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:53,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:53,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:53,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:53,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:53,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:53,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {2753#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2848#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:53,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {2753#true} assume !!(1 <= ~main__n~0); {2753#true} is VALID [2022-04-28 03:16:53,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {2753#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2753#true} is VALID [2022-04-28 03:16:53,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {2753#true} call #t~ret5 := main(); {2753#true} is VALID [2022-04-28 03:16:53,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2753#true} {2753#true} #38#return; {2753#true} is VALID [2022-04-28 03:16:53,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {2753#true} assume true; {2753#true} is VALID [2022-04-28 03:16:53,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {2753#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {2753#true} is VALID [2022-04-28 03:16:53,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {2753#true} call ULTIMATE.init(); {2753#true} is VALID [2022-04-28 03:16:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 03:16:53,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:53,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517718473] [2022-04-28 03:16:53,337 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:16:53,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314228060] [2022-04-28 03:16:53,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314228060] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:53,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:16:53,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 18 [2022-04-28 03:16:53,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:53,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1154769063] [2022-04-28 03:16:53,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1154769063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:53,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:53,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:16:53,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023705981] [2022-04-28 03:16:53,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:53,340 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:16:53,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:53,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:53,358 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 03:16:53,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:16:53,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:53,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:16:53,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:16:53,359 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:53,834 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 03:16:53,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:16:53,835 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:16:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2022-04-28 03:16:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2022-04-28 03:16:53,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 28 transitions. [2022-04-28 03:16:53,861 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 03:16:53,862 INFO L225 Difference]: With dead ends: 28 [2022-04-28 03:16:53,862 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 03:16:53,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 12 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:16:53,863 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:53,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 122 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:16:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 03:16:53,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 03:16:53,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:53,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:53,888 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:53,889 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:53,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:53,889 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 03:16:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 03:16:53,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:53,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:53,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:16:53,890 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:16:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:53,890 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 03:16:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 03:16:53,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:53,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:53,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:53,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-28 03:16:53,892 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-28 03:16:53,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:53,892 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-28 03:16:53,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:53,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-28 03:16:53,925 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 03:16:53,926 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 03:16:53,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:16:53,926 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:53,926 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:53,947 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 03:16:54,139 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 03:16:54,140 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:54,140 INFO L85 PathProgramCache]: Analyzing trace with hash -7672597, now seen corresponding path program 25 times [2022-04-28 03:16:54,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:54,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [828833484] [2022-04-28 03:16:54,141 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:16:54,141 INFO L85 PathProgramCache]: Analyzing trace with hash -7672597, now seen corresponding path program 26 times [2022-04-28 03:16:54,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:54,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978179030] [2022-04-28 03:16:54,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:54,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:54,155 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:16:54,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1157388905] [2022-04-28 03:16:54,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:16:54,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:54,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:54,156 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 03:16:54,167 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 03:16:54,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:16:54,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:16:54,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 03:16:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:54,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:54,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {3066#true} call ULTIMATE.init(); {3066#true} is VALID [2022-04-28 03:16:54,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {3066#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {3066#true} is VALID [2022-04-28 03:16:54,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-28 03:16:54,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3066#true} {3066#true} #38#return; {3066#true} is VALID [2022-04-28 03:16:54,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {3066#true} call #t~ret5 := main(); {3066#true} is VALID [2022-04-28 03:16:54,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {3066#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3066#true} is VALID [2022-04-28 03:16:54,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {3066#true} assume !!(1 <= ~main__n~0); {3066#true} is VALID [2022-04-28 03:16:54,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {3066#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3092#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:16:54,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {3092#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3096#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-28 03:16:54,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {3096#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3100#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-28 03:16:54,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {3100#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3104#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-28 03:16:54,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {3104#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3108#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} is VALID [2022-04-28 03:16:54,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {3108#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3112#(and (= (+ 4 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-28 03:16:54,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {3112#(and (= (+ 4 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3116#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ 3 main_~main__i~0)) (= (+ (- 3) main_~main__i~0) 4))} is VALID [2022-04-28 03:16:54,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {3116#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ 3 main_~main__i~0)) (= (+ (- 3) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3120#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} is VALID [2022-04-28 03:16:54,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {3120#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3124#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} is VALID [2022-04-28 03:16:54,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {3124#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3128#(and (= (+ 26 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 8))} is VALID [2022-04-28 03:16:54,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {3128#(and (= (+ 26 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 8))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3132#(and (= 8 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 22)))} is VALID [2022-04-28 03:16:54,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {3132#(and (= 8 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 22)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3136#(and (= 8 (+ (- 4) main_~main__i~0)) (= (+ (* 4 main_~main__i~0) 18) main_~main__sum~0))} is VALID [2022-04-28 03:16:54,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {3136#(and (= 8 (+ (- 4) main_~main__i~0)) (= (+ (* 4 main_~main__i~0) 18) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3140#(and (= (+ (- 5) main_~main__i~0) 8) (= (+ (* 4 main_~main__i~0) 14) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:16:54,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {3140#(and (= (+ (- 5) main_~main__i~0) 8) (= (+ (* 4 main_~main__i~0) 14) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3144#(and (= 66 (+ main_~main__sum~0 (- 25))) (<= 13 main_~main__n~0) (<= main_~main__i~0 14))} is VALID [2022-04-28 03:16:54,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {3144#(and (= 66 (+ main_~main__sum~0 (- 25))) (<= 13 main_~main__n~0) (<= main_~main__i~0 14))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3148#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:54,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {3148#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3067#false} is VALID [2022-04-28 03:16:54,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {3067#false} assume !false; {3067#false} is VALID [2022-04-28 03:16:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:54,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:56,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {3067#false} assume !false; {3067#false} is VALID [2022-04-28 03:16:56,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {3148#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3067#false} is VALID [2022-04-28 03:16:56,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {3161#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3148#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:56,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3161#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:16:57,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:57,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:57,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:57,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:57,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:57,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:57,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:57,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:57,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:57,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:57,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:57,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:57,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {3066#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3165#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:16:57,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {3066#true} assume !!(1 <= ~main__n~0); {3066#true} is VALID [2022-04-28 03:16:57,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {3066#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3066#true} is VALID [2022-04-28 03:16:57,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {3066#true} call #t~ret5 := main(); {3066#true} is VALID [2022-04-28 03:16:57,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3066#true} {3066#true} #38#return; {3066#true} is VALID [2022-04-28 03:16:57,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-28 03:16:57,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {3066#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {3066#true} is VALID [2022-04-28 03:16:57,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {3066#true} call ULTIMATE.init(); {3066#true} is VALID [2022-04-28 03:16:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 03:16:57,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:57,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978179030] [2022-04-28 03:16:57,169 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:16:57,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157388905] [2022-04-28 03:16:57,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157388905] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:57,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:16:57,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5] total 19 [2022-04-28 03:16:57,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:57,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [828833484] [2022-04-28 03:16:57,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [828833484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:57,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:57,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:16:57,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61299487] [2022-04-28 03:16:57,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:57,171 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:16:57,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:57,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:57,189 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 03:16:57,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 03:16:57,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:57,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 03:16:57,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:16:57,190 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:57,677 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 03:16:57,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 03:16:57,677 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:16:57,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2022-04-28 03:16:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2022-04-28 03:16:57,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 29 transitions. [2022-04-28 03:16:57,705 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 03:16:57,706 INFO L225 Difference]: With dead ends: 29 [2022-04-28 03:16:57,706 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 03:16:57,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 13 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:16:57,707 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:57,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:16:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 03:16:57,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 03:16:57,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:57,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:57,735 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:57,735 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:57,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:57,736 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 03:16:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 03:16:57,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:57,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:57,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 03:16:57,736 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 03:16:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:57,737 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 03:16:57,737 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 03:16:57,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:57,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:57,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:57,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-28 03:16:57,738 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-28 03:16:57,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:57,738 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-28 03:16:57,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:16:57,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-28 03:16:57,763 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 03:16:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 03:16:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:16:57,763 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:57,763 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:57,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 03:16:57,967 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 03:16:57,967 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:57,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:57,968 INFO L85 PathProgramCache]: Analyzing trace with hash -237912975, now seen corresponding path program 27 times [2022-04-28 03:16:57,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:57,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [941671593] [2022-04-28 03:16:57,968 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:16:57,968 INFO L85 PathProgramCache]: Analyzing trace with hash -237912975, now seen corresponding path program 28 times [2022-04-28 03:16:57,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:57,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970462613] [2022-04-28 03:16:57,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:57,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:57,987 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:16:57,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1627531492] [2022-04-28 03:16:57,987 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:16:57,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:57,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:57,988 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 03:16:57,989 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 03:16:58,026 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:16:58,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:16:58,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-28 03:16:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:58,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:58,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {3392#true} call ULTIMATE.init(); {3392#true} is VALID [2022-04-28 03:16:58,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {3392#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {3392#true} is VALID [2022-04-28 03:16:58,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {3392#true} assume true; {3392#true} is VALID [2022-04-28 03:16:58,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3392#true} {3392#true} #38#return; {3392#true} is VALID [2022-04-28 03:16:58,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {3392#true} call #t~ret5 := main(); {3392#true} is VALID [2022-04-28 03:16:58,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {3392#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3392#true} is VALID [2022-04-28 03:16:58,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {3392#true} assume !!(1 <= ~main__n~0); {3392#true} is VALID [2022-04-28 03:16:58,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {3392#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3418#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:16:58,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {3418#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3422#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-28 03:16:58,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {3422#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3426#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 2)) (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:16:58,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {3426#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 2)) (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3430#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 4) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-28 03:16:58,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {3430#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 4) (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3434#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 10))) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-28 03:16:58,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {3434#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 10))) (= (+ (- 4) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3438#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-28 03:16:58,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {3438#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3442#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} is VALID [2022-04-28 03:16:58,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {3442#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3446#(and (= 6 (+ (- 2) main_~main__i~0)) (= (+ (- 2) main_~main__sum~0 (* (- 2) main_~main__i~0)) 10))} is VALID [2022-04-28 03:16:58,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {3446#(and (= 6 (+ (- 2) main_~main__i~0)) (= (+ (- 2) main_~main__sum~0 (* (- 2) main_~main__i~0)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3450#(and (= (+ main_~main__sum~0 (- 26)) 10) (= 9 main_~main__i~0))} is VALID [2022-04-28 03:16:58,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {3450#(and (= (+ main_~main__sum~0 (- 26)) 10) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3454#(and (= (+ main_~main__sum~0 (- 35)) 10) (= 10 main_~main__i~0))} is VALID [2022-04-28 03:16:58,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {3454#(and (= (+ main_~main__sum~0 (- 35)) 10) (= 10 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3458#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 34)) 10) (= (+ (- 1) main_~main__i~0) 10))} is VALID [2022-04-28 03:16:58,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {3458#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 34)) 10) (= (+ (- 1) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3462#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} is VALID [2022-04-28 03:16:58,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {3462#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3466#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2022-04-28 03:16:58,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {3466#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3470#(and (= (+ (- 1) main_~main__i~0) 13) (= 78 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:16:58,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {3470#(and (= (+ (- 1) main_~main__i~0) 13) (= 78 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3474#(and (= main_~main__sum~0 105) (<= main_~main__i~0 15) (<= 14 main_~main__n~0))} is VALID [2022-04-28 03:16:58,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {3474#(and (= main_~main__sum~0 105) (<= main_~main__i~0 15) (<= 14 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3478#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:16:58,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {3478#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3393#false} is VALID [2022-04-28 03:16:58,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {3393#false} assume !false; {3393#false} is VALID [2022-04-28 03:16:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:58,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:01,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {3393#false} assume !false; {3393#false} is VALID [2022-04-28 03:17:01,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {3478#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3393#false} is VALID [2022-04-28 03:17:01,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {3491#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3478#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:01,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3491#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:17:01,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:01,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:01,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:01,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:01,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:01,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:01,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:01,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:01,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:01,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:01,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:01,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:01,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:01,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {3392#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3495#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:01,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {3392#true} assume !!(1 <= ~main__n~0); {3392#true} is VALID [2022-04-28 03:17:01,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {3392#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3392#true} is VALID [2022-04-28 03:17:01,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {3392#true} call #t~ret5 := main(); {3392#true} is VALID [2022-04-28 03:17:01,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3392#true} {3392#true} #38#return; {3392#true} is VALID [2022-04-28 03:17:01,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {3392#true} assume true; {3392#true} is VALID [2022-04-28 03:17:01,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {3392#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {3392#true} is VALID [2022-04-28 03:17:01,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {3392#true} call ULTIMATE.init(); {3392#true} is VALID [2022-04-28 03:17:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 03:17:01,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:01,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970462613] [2022-04-28 03:17:01,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:17:01,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627531492] [2022-04-28 03:17:01,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627531492] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:01,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:17:01,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 20 [2022-04-28 03:17:01,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:01,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [941671593] [2022-04-28 03:17:01,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [941671593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:01,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:01,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 03:17:01,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686380062] [2022-04-28 03:17:01,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:01,175 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:17:01,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:01,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:01,195 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 03:17:01,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 03:17:01,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:01,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 03:17:01,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:17:01,196 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:01,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:01,750 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 03:17:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:17:01,751 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:17:01,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2022-04-28 03:17:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2022-04-28 03:17:01,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 30 transitions. [2022-04-28 03:17:01,777 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 03:17:01,778 INFO L225 Difference]: With dead ends: 30 [2022-04-28 03:17:01,778 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 03:17:01,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 14 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:17:01,779 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:01,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 138 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:17:01,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 03:17:01,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 03:17:01,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:01,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:01,804 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:01,804 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:01,805 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 03:17:01,805 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 03:17:01,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:01,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:01,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:17:01,805 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:17:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:01,806 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 03:17:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 03:17:01,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:01,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:01,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:01,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-28 03:17:01,807 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-28 03:17:01,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:01,807 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-28 03:17:01,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:01,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-28 03:17:01,835 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 03:17:01,835 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 03:17:01,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:17:01,835 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:01,835 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:01,852 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 03:17:02,036 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 03:17:02,036 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:02,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:02,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1214569899, now seen corresponding path program 29 times [2022-04-28 03:17:02,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:02,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1762677864] [2022-04-28 03:17:02,037 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:17:02,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1214569899, now seen corresponding path program 30 times [2022-04-28 03:17:02,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:02,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034224459] [2022-04-28 03:17:02,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:02,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:02,051 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:17:02,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1765296918] [2022-04-28 03:17:02,052 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:17:02,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:02,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:02,053 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 03:17:02,056 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 03:17:02,094 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 03:17:02,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:17:02,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-28 03:17:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:02,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:02,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {3731#true} call ULTIMATE.init(); {3731#true} is VALID [2022-04-28 03:17:02,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {3731#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {3731#true} is VALID [2022-04-28 03:17:02,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-04-28 03:17:02,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3731#true} {3731#true} #38#return; {3731#true} is VALID [2022-04-28 03:17:02,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {3731#true} call #t~ret5 := main(); {3731#true} is VALID [2022-04-28 03:17:02,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {3731#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3731#true} is VALID [2022-04-28 03:17:02,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {3731#true} assume !!(1 <= ~main__n~0); {3731#true} is VALID [2022-04-28 03:17:02,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {3731#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3757#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:17:02,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {3757#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3761#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-28 03:17:02,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {3761#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3765#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ (- 2) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:17:02,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {3765#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ (- 2) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3769#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (- 3) main_~main__i~0)))} is VALID [2022-04-28 03:17:02,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {3769#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3773#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-28 03:17:02,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {3773#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3777#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} is VALID [2022-04-28 03:17:02,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {3777#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3781#(and (= 5 (+ (- 2) main_~main__i~0)) (= (+ 8 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:17:02,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {3781#(and (= 5 (+ (- 2) main_~main__i~0)) (= (+ 8 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3785#(and (= (+ 7 main_~main__i~0) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= 5 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-28 03:17:02,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {3785#(and (= (+ 7 main_~main__i~0) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= 5 (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3789#(and (= 5 (+ (- 4) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ 6 main_~main__i~0)))} is VALID [2022-04-28 03:17:02,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {3789#(and (= 5 (+ (- 4) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ 6 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3793#(and (= 5 (+ (- 5) main_~main__i~0)) (= (+ 5 main_~main__i~0) (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)))} is VALID [2022-04-28 03:17:02,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {3793#(and (= 5 (+ (- 5) main_~main__i~0)) (= (+ 5 main_~main__i~0) (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3797#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-28 03:17:02,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {3797#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3801#(and (= main_~main__sum~0 (+ main_~main__i~0 54)) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-28 03:17:02,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {3801#(and (= main_~main__sum~0 (+ main_~main__i~0 54)) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3805#(and (= (+ 53 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 11))} is VALID [2022-04-28 03:17:02,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {3805#(and (= (+ 53 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3809#(and (= (+ 52 main_~main__i~0) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 3) main_~main__i~0) 11))} is VALID [2022-04-28 03:17:02,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {3809#(and (= (+ 52 main_~main__i~0) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 3) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3813#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ 51 main_~main__i~0)) (= (+ (- 4) main_~main__i~0) 11))} is VALID [2022-04-28 03:17:02,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {3813#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ 51 main_~main__i~0)) (= (+ (- 4) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3817#(and (<= main_~main__i~0 16) (= 66 (+ main_~main__sum~0 (- 54))) (<= 15 main_~main__n~0))} is VALID [2022-04-28 03:17:02,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {3817#(and (<= main_~main__i~0 16) (= 66 (+ main_~main__sum~0 (- 54))) (<= 15 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3821#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:02,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {3821#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3732#false} is VALID [2022-04-28 03:17:02,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {3732#false} assume !false; {3732#false} is VALID [2022-04-28 03:17:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:17:02,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:05,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {3732#false} assume !false; {3732#false} is VALID [2022-04-28 03:17:05,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {3821#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3732#false} is VALID [2022-04-28 03:17:05,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {3834#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3821#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:05,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3834#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:17:05,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:05,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:05,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:05,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:05,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:05,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:05,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:05,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:05,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:05,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:05,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:05,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:05,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:05,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:05,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {3731#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3838#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:05,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {3731#true} assume !!(1 <= ~main__n~0); {3731#true} is VALID [2022-04-28 03:17:05,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {3731#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3731#true} is VALID [2022-04-28 03:17:05,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {3731#true} call #t~ret5 := main(); {3731#true} is VALID [2022-04-28 03:17:05,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3731#true} {3731#true} #38#return; {3731#true} is VALID [2022-04-28 03:17:05,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-04-28 03:17:05,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {3731#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {3731#true} is VALID [2022-04-28 03:17:05,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {3731#true} call ULTIMATE.init(); {3731#true} is VALID [2022-04-28 03:17:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 03:17:05,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:05,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034224459] [2022-04-28 03:17:05,701 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:17:05,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765296918] [2022-04-28 03:17:05,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765296918] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:05,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:17:05,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5] total 21 [2022-04-28 03:17:05,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:05,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1762677864] [2022-04-28 03:17:05,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1762677864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:05,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:05,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 03:17:05,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775715379] [2022-04-28 03:17:05,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:05,703 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:17:05,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:05,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:05,723 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 03:17:05,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 03:17:05,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:05,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 03:17:05,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:17:05,724 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:06,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:06,330 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 03:17:06,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:17:06,330 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:17:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2022-04-28 03:17:06,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2022-04-28 03:17:06,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 31 transitions. [2022-04-28 03:17:06,356 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 03:17:06,359 INFO L225 Difference]: With dead ends: 31 [2022-04-28 03:17:06,359 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 03:17:06,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 15 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:17:06,360 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:06,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:17:06,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 03:17:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 03:17:06,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:06,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:06,395 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:06,395 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:06,395 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 03:17:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 03:17:06,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:06,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:06,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 03:17:06,396 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 03:17:06,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:06,396 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 03:17:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 03:17:06,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:06,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:06,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:06,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-28 03:17:06,404 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-28 03:17:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:06,404 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-28 03:17:06,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:06,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-28 03:17:06,436 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 03:17:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 03:17:06,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:17:06,436 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:06,436 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:06,452 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 03:17:06,636 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 03:17:06,637 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:06,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1003101263, now seen corresponding path program 31 times [2022-04-28 03:17:06,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:06,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [369955408] [2022-04-28 03:17:06,638 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:17:06,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1003101263, now seen corresponding path program 32 times [2022-04-28 03:17:06,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:06,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47769292] [2022-04-28 03:17:06,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:06,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:06,653 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:17:06,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078932052] [2022-04-28 03:17:06,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:17:06,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:06,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:06,655 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 03:17:06,661 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 03:17:06,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:17:06,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:17:06,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-28 03:17:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:06,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:07,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {4083#true} call ULTIMATE.init(); {4083#true} is VALID [2022-04-28 03:17:07,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {4083#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {4083#true} is VALID [2022-04-28 03:17:07,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {4083#true} assume true; {4083#true} is VALID [2022-04-28 03:17:07,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4083#true} {4083#true} #38#return; {4083#true} is VALID [2022-04-28 03:17:07,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {4083#true} call #t~ret5 := main(); {4083#true} is VALID [2022-04-28 03:17:07,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {4083#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {4083#true} is VALID [2022-04-28 03:17:07,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {4083#true} assume !!(1 <= ~main__n~0); {4083#true} is VALID [2022-04-28 03:17:07,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {4083#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4109#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:17:07,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {4109#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4113#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-28 03:17:07,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {4113#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4117#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} is VALID [2022-04-28 03:17:07,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {4117#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4121#(and (= (+ main_~main__sum~0 (- 3)) 3) (= (+ (- 2) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-28 03:17:07,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {4121#(and (= (+ main_~main__sum~0 (- 3)) 3) (= (+ (- 2) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4125#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-28 03:17:07,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {4125#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4129#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-28 03:17:07,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {4129#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4133#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} is VALID [2022-04-28 03:17:07,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {4133#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4137#(and (= 6 (+ (- 2) main_~main__i~0)) (= (+ (- 2) main_~main__sum~0 (* (- 2) main_~main__i~0)) 10))} is VALID [2022-04-28 03:17:07,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {4137#(and (= 6 (+ (- 2) main_~main__i~0)) (= (+ (- 2) main_~main__sum~0 (* (- 2) main_~main__i~0)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4141#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-28 03:17:07,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {4141#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4145#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-28 03:17:07,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {4145#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4149#(and (= (+ (- 1) main_~main__i~0) 10) (= 45 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:17:07,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {4149#(and (= (+ (- 1) main_~main__i~0) 10) (= 45 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4153#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} is VALID [2022-04-28 03:17:07,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {4153#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4157#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2022-04-28 03:17:07,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {4157#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4161#(and (= (+ main_~main__sum~0 (- 78)) 13) (= (+ (- 77) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-28 03:17:07,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {4161#(and (= (+ main_~main__sum~0 (- 78)) 13) (= (+ (- 77) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4165#(and (= 13 (+ (- 77) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (- 76) (* (- 1) main_~main__i~0))))} is VALID [2022-04-28 03:17:07,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {4165#(and (= 13 (+ (- 77) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (- 76) (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4169#(and (= main_~main__sum~0 (+ 88 (* 2 main_~main__i~0))) (= 14 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-28 03:17:07,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {4169#(and (= main_~main__sum~0 (+ 88 (* 2 main_~main__i~0))) (= 14 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4173#(and (= (+ main_~main__sum~0 (- 16)) 120) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} is VALID [2022-04-28 03:17:07,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {4173#(and (= (+ main_~main__sum~0 (- 16)) 120) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4177#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:07,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {4177#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4084#false} is VALID [2022-04-28 03:17:07,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {4084#false} assume !false; {4084#false} is VALID [2022-04-28 03:17:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:17:07,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:10,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {4084#false} assume !false; {4084#false} is VALID [2022-04-28 03:17:10,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {4177#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4084#false} is VALID [2022-04-28 03:17:10,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {4190#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4177#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:10,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4190#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:17:10,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:10,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:10,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:10,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:10,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:10,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:10,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:10,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:10,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:10,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:10,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:10,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:10,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:10,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:10,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:10,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {4083#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4194#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:10,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {4083#true} assume !!(1 <= ~main__n~0); {4083#true} is VALID [2022-04-28 03:17:10,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {4083#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {4083#true} is VALID [2022-04-28 03:17:10,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {4083#true} call #t~ret5 := main(); {4083#true} is VALID [2022-04-28 03:17:10,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4083#true} {4083#true} #38#return; {4083#true} is VALID [2022-04-28 03:17:10,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {4083#true} assume true; {4083#true} is VALID [2022-04-28 03:17:10,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {4083#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {4083#true} is VALID [2022-04-28 03:17:10,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {4083#true} call ULTIMATE.init(); {4083#true} is VALID [2022-04-28 03:17:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 03:17:10,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:10,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47769292] [2022-04-28 03:17:10,560 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:17:10,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078932052] [2022-04-28 03:17:10,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078932052] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:10,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:17:10,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 5] total 22 [2022-04-28 03:17:10,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:10,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [369955408] [2022-04-28 03:17:10,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [369955408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:10,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:10,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 03:17:10,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765238035] [2022-04-28 03:17:10,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:10,561 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 03:17:10,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:10,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:10,581 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 03:17:10,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 03:17:10,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:10,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 03:17:10,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:17:10,582 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:11,382 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 03:17:11,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 03:17:11,383 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 03:17:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2022-04-28 03:17:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2022-04-28 03:17:11,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 32 transitions. [2022-04-28 03:17:11,416 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 03:17:11,416 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:17:11,416 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 03:17:11,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 16 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:17:11,417 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:11,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 154 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:17:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 03:17:11,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 03:17:11,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:11,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:11,453 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:11,453 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:11,454 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 03:17:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 03:17:11,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:11,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:11,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:17:11,455 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:17:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:11,455 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 03:17:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 03:17:11,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:11,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:11,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:11,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-28 03:17:11,457 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-28 03:17:11,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:11,457 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-28 03:17:11,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:11,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-28 03:17:11,489 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 03:17:11,489 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 03:17:11,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 03:17:11,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:11,490 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:11,506 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 03:17:11,691 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 03:17:11,691 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:11,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1031430549, now seen corresponding path program 33 times [2022-04-28 03:17:11,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:11,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1297795276] [2022-04-28 03:17:11,692 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:17:11,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1031430549, now seen corresponding path program 34 times [2022-04-28 03:17:11,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:11,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126390841] [2022-04-28 03:17:11,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:11,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:11,724 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:17:11,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [911305033] [2022-04-28 03:17:11,725 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:17:11,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:11,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:11,726 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 03:17:11,735 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 03:17:11,783 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:17:11,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:17:11,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-28 03:17:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:11,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:12,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {4448#true} call ULTIMATE.init(); {4448#true} is VALID [2022-04-28 03:17:12,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {4448#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {4448#true} is VALID [2022-04-28 03:17:12,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {4448#true} assume true; {4448#true} is VALID [2022-04-28 03:17:12,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4448#true} {4448#true} #38#return; {4448#true} is VALID [2022-04-28 03:17:12,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {4448#true} call #t~ret5 := main(); {4448#true} is VALID [2022-04-28 03:17:12,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {4448#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {4448#true} is VALID [2022-04-28 03:17:12,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {4448#true} assume !!(1 <= ~main__n~0); {4448#true} is VALID [2022-04-28 03:17:12,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {4448#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4474#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:17:12,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {4474#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4478#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-28 03:17:12,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {4478#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4482#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-28 03:17:12,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {4482#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4486#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-28 03:17:12,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {4486#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4490#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-28 03:17:12,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {4490#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4494#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-28 03:17:12,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {4494#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4498#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} is VALID [2022-04-28 03:17:12,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {4498#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4502#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} is VALID [2022-04-28 03:17:12,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {4502#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4506#(and (= 21 (+ main_~main__sum~0 (- 15))) (= 9 main_~main__i~0))} is VALID [2022-04-28 03:17:12,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {4506#(and (= 21 (+ main_~main__sum~0 (- 15))) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4510#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-28 03:17:12,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {4510#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4514#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-28 03:17:12,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {4514#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4518#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} is VALID [2022-04-28 03:17:12,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {4518#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4522#(and (= 12 (+ main_~main__sum~0 (- 66))) (= (+ main_~main__sum~0 (- 65)) main_~main__i~0))} is VALID [2022-04-28 03:17:12,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {4522#(and (= 12 (+ main_~main__sum~0 (- 66))) (= (+ main_~main__sum~0 (- 65)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4526#(and (= (+ (* 2 main_~main__i~0) 63) main_~main__sum~0) (= (+ (- 2) main_~main__i~0) 12))} is VALID [2022-04-28 03:17:12,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {4526#(and (= (+ (* 2 main_~main__i~0) 63) main_~main__sum~0) (= (+ (- 2) main_~main__i~0) 12))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4530#(and (= 12 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 61) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:17:12,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {4530#(and (= 12 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 61) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4534#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} is VALID [2022-04-28 03:17:12,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {4534#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4538#(and (= 17 main_~main__i~0) (= 91 (+ (- 45) main_~main__sum~0)))} is VALID [2022-04-28 03:17:12,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {4538#(and (= 17 main_~main__i~0) (= 91 (+ (- 45) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4542#(and (= (+ main_~main__sum~0 (- 136)) 17) (<= (+ 135 main_~main__i~0) main_~main__sum~0) (<= main_~main__sum~0 (+ 136 main_~main__n~0)))} is VALID [2022-04-28 03:17:12,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {4542#(and (= (+ main_~main__sum~0 (- 136)) 17) (<= (+ 135 main_~main__i~0) main_~main__sum~0) (<= main_~main__sum~0 (+ 136 main_~main__n~0)))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4546#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:12,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {4546#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4449#false} is VALID [2022-04-28 03:17:12,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {4449#false} assume !false; {4449#false} is VALID [2022-04-28 03:17:12,301 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:17:12,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:15,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {4449#false} assume !false; {4449#false} is VALID [2022-04-28 03:17:15,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {4546#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4449#false} is VALID [2022-04-28 03:17:15,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {4559#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4546#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:15,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4559#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:17:15,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:15,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:15,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:16,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:16,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:16,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:16,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:16,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:16,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:16,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:16,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:16,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:16,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:16,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:16,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:16,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:16,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {4448#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4563#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:16,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {4448#true} assume !!(1 <= ~main__n~0); {4448#true} is VALID [2022-04-28 03:17:16,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {4448#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {4448#true} is VALID [2022-04-28 03:17:16,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {4448#true} call #t~ret5 := main(); {4448#true} is VALID [2022-04-28 03:17:16,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4448#true} {4448#true} #38#return; {4448#true} is VALID [2022-04-28 03:17:16,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {4448#true} assume true; {4448#true} is VALID [2022-04-28 03:17:16,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {4448#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {4448#true} is VALID [2022-04-28 03:17:16,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {4448#true} call ULTIMATE.init(); {4448#true} is VALID [2022-04-28 03:17:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 03:17:16,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:16,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126390841] [2022-04-28 03:17:16,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:17:16,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911305033] [2022-04-28 03:17:16,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911305033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:16,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:17:16,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 5] total 23 [2022-04-28 03:17:16,233 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:16,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1297795276] [2022-04-28 03:17:16,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1297795276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:16,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:16,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 03:17:16,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258441030] [2022-04-28 03:17:16,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:16,234 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:17:16,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:16,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:16,256 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 03:17:16,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 03:17:16,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:16,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 03:17:16,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:17:16,256 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:17,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:17,037 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 03:17:17,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 03:17:17,037 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:17:17,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2022-04-28 03:17:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2022-04-28 03:17:17,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 33 transitions. [2022-04-28 03:17:17,075 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 03:17:17,075 INFO L225 Difference]: With dead ends: 33 [2022-04-28 03:17:17,075 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 03:17:17,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 17 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:17:17,076 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:17,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 162 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:17:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 03:17:17,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 03:17:17,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:17,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:17,113 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:17,114 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:17,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:17,114 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 03:17:17,114 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 03:17:17,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:17,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:17,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 03:17:17,115 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 03:17:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:17,115 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 03:17:17,115 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 03:17:17,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:17,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:17,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:17,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-28 03:17:17,116 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-28 03:17:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:17,116 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-28 03:17:17,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:17,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-28 03:17:17,158 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 03:17:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 03:17:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:17:17,159 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:17,159 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:17,183 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 03:17:17,359 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 03:17:17,360 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:17,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:17,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1909638415, now seen corresponding path program 35 times [2022-04-28 03:17:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:17,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [738928353] [2022-04-28 03:17:17,361 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:17:17,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1909638415, now seen corresponding path program 36 times [2022-04-28 03:17:17,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:17,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245799429] [2022-04-28 03:17:17,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:17,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:17,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:17:17,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [970114757] [2022-04-28 03:17:17,375 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:17:17,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:17,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:17,376 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 03:17:17,383 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 03:17:17,435 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 03:17:17,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:17:17,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-28 03:17:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:17,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:17,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {4826#true} call ULTIMATE.init(); {4826#true} is VALID [2022-04-28 03:17:17,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {4826#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {4826#true} is VALID [2022-04-28 03:17:17,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {4826#true} assume true; {4826#true} is VALID [2022-04-28 03:17:17,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4826#true} {4826#true} #38#return; {4826#true} is VALID [2022-04-28 03:17:17,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {4826#true} call #t~ret5 := main(); {4826#true} is VALID [2022-04-28 03:17:17,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {4826#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {4826#true} is VALID [2022-04-28 03:17:17,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {4826#true} assume !!(1 <= ~main__n~0); {4826#true} is VALID [2022-04-28 03:17:17,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {4826#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4852#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:17:17,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {4852#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4856#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-28 03:17:17,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {4856#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4860#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-28 03:17:17,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {4860#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4864#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} is VALID [2022-04-28 03:17:17,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {4864#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4868#(and (= (+ (- 1) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 0))} is VALID [2022-04-28 03:17:17,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {4868#(and (= (+ (- 1) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4872#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-28 03:17:17,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {4872#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4876#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} is VALID [2022-04-28 03:17:17,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {4876#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4880#(and (= 7 (+ main_~main__sum~0 (- 21))) (= (+ (- 20) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-28 03:17:17,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {4880#(and (= 7 (+ main_~main__sum~0 (- 21))) (= (+ (- 20) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4884#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-28 03:17:17,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {4884#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4888#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} is VALID [2022-04-28 03:17:17,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {4888#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4892#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 36) (= 9 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-28 03:17:17,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {4892#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 36) (= 9 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4896#(and (= 9 (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 36))} is VALID [2022-04-28 03:17:17,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {4896#(and (= 9 (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4900#(and (= 36 (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)) (= 9 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-28 03:17:17,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {4900#(and (= 36 (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)) (= 9 (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4904#(and (= (+ 21 (* 5 main_~main__i~0)) main_~main__sum~0) (= 9 (+ (- 5) main_~main__i~0)))} is VALID [2022-04-28 03:17:17,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {4904#(and (= (+ 21 (* 5 main_~main__i~0)) main_~main__sum~0) (= 9 (+ (- 5) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4908#(and (= (+ (- 6) main_~main__i~0) 9) (= (+ 16 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:17:17,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {4908#(and (= (+ (- 6) main_~main__i~0) 9) (= (+ 16 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4912#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} is VALID [2022-04-28 03:17:17,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {4912#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4916#(and (= 91 (+ main_~main__sum~0 (- 28) (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-28 03:17:17,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {4916#(and (= 91 (+ main_~main__sum~0 (- 28) (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4920#(and (= 18 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 62))))} is VALID [2022-04-28 03:17:17,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {4920#(and (= 18 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 62))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4924#(and (<= main_~main__i~0 19) (<= 18 main_~main__n~0) (= 91 (+ main_~main__sum~0 (- 80))))} is VALID [2022-04-28 03:17:17,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {4924#(and (<= main_~main__i~0 19) (<= 18 main_~main__n~0) (= 91 (+ main_~main__sum~0 (- 80))))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4928#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:17,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {4928#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4827#false} is VALID [2022-04-28 03:17:17,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {4827#false} assume !false; {4827#false} is VALID [2022-04-28 03:17:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:17:17,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:22,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {4827#false} assume !false; {4827#false} is VALID [2022-04-28 03:17:22,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {4928#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4827#false} is VALID [2022-04-28 03:17:22,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {4941#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4928#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:22,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4941#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:17:22,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {4826#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4945#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:22,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {4826#true} assume !!(1 <= ~main__n~0); {4826#true} is VALID [2022-04-28 03:17:22,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {4826#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {4826#true} is VALID [2022-04-28 03:17:22,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {4826#true} call #t~ret5 := main(); {4826#true} is VALID [2022-04-28 03:17:22,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4826#true} {4826#true} #38#return; {4826#true} is VALID [2022-04-28 03:17:22,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {4826#true} assume true; {4826#true} is VALID [2022-04-28 03:17:22,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {4826#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {4826#true} is VALID [2022-04-28 03:17:22,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {4826#true} call ULTIMATE.init(); {4826#true} is VALID [2022-04-28 03:17:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-28 03:17:22,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:22,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245799429] [2022-04-28 03:17:22,459 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:17:22,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970114757] [2022-04-28 03:17:22,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970114757] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:22,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:17:22,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 5] total 24 [2022-04-28 03:17:22,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:22,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [738928353] [2022-04-28 03:17:22,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [738928353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:22,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:22,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 03:17:22,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259332843] [2022-04-28 03:17:22,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:22,460 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 03:17:22,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:22,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:22,485 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 03:17:22,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 03:17:22,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:22,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 03:17:22,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:17:22,486 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:23,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:23,389 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 03:17:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 03:17:23,389 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 03:17:23,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2022-04-28 03:17:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2022-04-28 03:17:23,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 34 transitions. [2022-04-28 03:17:23,419 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 03:17:23,419 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:17:23,419 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 03:17:23,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 17 SyntacticMatches, 18 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:17:23,420 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:23,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:17:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 03:17:23,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 03:17:23,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:23,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:23,456 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:23,456 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:23,456 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 03:17:23,457 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 03:17:23,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:23,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:23,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:17:23,457 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:17:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:23,457 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 03:17:23,457 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 03:17:23,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:23,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:23,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:23,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 03:17:23,458 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-28 03:17:23,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:23,459 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 03:17:23,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:23,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 03:17:23,495 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 03:17:23,495 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 03:17:23,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 03:17:23,496 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:23,496 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:23,511 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 03:17:23,696 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 03:17:23,696 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:23,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:23,697 INFO L85 PathProgramCache]: Analyzing trace with hash 930688811, now seen corresponding path program 37 times [2022-04-28 03:17:23,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:23,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1120324117] [2022-04-28 03:17:23,697 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:17:23,697 INFO L85 PathProgramCache]: Analyzing trace with hash 930688811, now seen corresponding path program 38 times [2022-04-28 03:17:23,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:23,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236902152] [2022-04-28 03:17:23,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:23,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:23,714 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:17:23,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [441651633] [2022-04-28 03:17:23,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:17:23,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:23,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:23,716 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 03:17:23,725 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 03:17:23,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:17:23,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:17:23,768 WARN L261 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 84 conjunts are in the unsatisfiable core [2022-04-28 03:17:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:23,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:24,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {5217#true} call ULTIMATE.init(); {5217#true} is VALID [2022-04-28 03:17:24,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {5217#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {5217#true} is VALID [2022-04-28 03:17:24,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {5217#true} assume true; {5217#true} is VALID [2022-04-28 03:17:24,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5217#true} {5217#true} #38#return; {5217#true} is VALID [2022-04-28 03:17:24,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {5217#true} call #t~ret5 := main(); {5217#true} is VALID [2022-04-28 03:17:24,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {5217#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {5217#true} is VALID [2022-04-28 03:17:24,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {5217#true} assume !!(1 <= ~main__n~0); {5217#true} is VALID [2022-04-28 03:17:24,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {5217#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5243#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:17:24,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {5243#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5247#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-28 03:17:24,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {5247#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5251#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-28 03:17:24,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {5251#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5255#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-28 03:17:24,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {5255#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5259#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} is VALID [2022-04-28 03:17:24,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {5259#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5263#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 6)) 3))} is VALID [2022-04-28 03:17:24,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {5263#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 6)) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5267#(and (= 7 main_~main__i~0) (= 3 (+ main_~main__sum~0 (- 18))))} is VALID [2022-04-28 03:17:24,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {5267#(and (= 7 main_~main__i~0) (= 3 (+ main_~main__sum~0 (- 18))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5271#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 17))) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-28 03:17:24,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {5271#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 17))) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5275#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-28 03:17:24,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {5275#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5279#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} is VALID [2022-04-28 03:17:24,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {5279#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-28 03:17:24,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {5283#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5287#(and (= 45 (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-28 03:17:24,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {5287#(and (= 45 (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5291#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2022-04-28 03:17:24,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {5291#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5295#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} is VALID [2022-04-28 03:17:24,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {5295#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5299#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2022-04-28 03:17:24,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {5299#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5303#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} is VALID [2022-04-28 03:17:24,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {5303#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5307#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 103))) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 104))))} is VALID [2022-04-28 03:17:24,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {5307#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 103))) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 104))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5311#(and (= (+ (- 102) main_~main__sum~0 (* (- 2) main_~main__i~0)) 15) (= (+ (- 2) main_~main__i~0) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 101))))} is VALID [2022-04-28 03:17:24,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {5311#(and (= (+ (- 102) main_~main__sum~0 (* (- 2) main_~main__i~0)) 15) (= (+ (- 2) main_~main__i~0) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 101))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5315#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 98)) (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 99)) 15))} is VALID [2022-04-28 03:17:24,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {5315#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 98)) (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 99)) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5319#(and (= (+ (- 98) (* (div (+ (* main_~main__sum~0 (- 3)) (- 114)) (- 4)) 4) (* main_~main__sum~0 (- 3))) (+ main_~main__sum~0 (- 3) (* (- 1) (div (+ (* main_~main__sum~0 (- 3)) (- 114)) (- 4))))) (<= main_~main__sum~0 (+ (div (+ (* main_~main__sum~0 (- 3)) (- 114)) (- 4)) main_~main__n~0)) (<= (+ (div (+ (* main_~main__sum~0 (- 3)) (- 114)) (- 4)) main_~main__i~0) (+ main_~main__sum~0 1)) (= (mod (+ main_~main__sum~0 2) 4) 0))} is VALID [2022-04-28 03:17:24,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {5319#(and (= (+ (- 98) (* (div (+ (* main_~main__sum~0 (- 3)) (- 114)) (- 4)) 4) (* main_~main__sum~0 (- 3))) (+ main_~main__sum~0 (- 3) (* (- 1) (div (+ (* main_~main__sum~0 (- 3)) (- 114)) (- 4))))) (<= main_~main__sum~0 (+ (div (+ (* main_~main__sum~0 (- 3)) (- 114)) (- 4)) main_~main__n~0)) (<= (+ (div (+ (* main_~main__sum~0 (- 3)) (- 114)) (- 4)) main_~main__i~0) (+ main_~main__sum~0 1)) (= (mod (+ main_~main__sum~0 2) 4) 0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5323#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:24,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {5323#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {5218#false} is VALID [2022-04-28 03:17:24,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {5218#false} assume !false; {5218#false} is VALID [2022-04-28 03:17:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:17:24,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:29,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {5218#false} assume !false; {5218#false} is VALID [2022-04-28 03:17:29,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {5323#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {5218#false} is VALID [2022-04-28 03:17:29,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {5336#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5323#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:29,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5336#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:17:29,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {5217#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5340#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:29,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {5217#true} assume !!(1 <= ~main__n~0); {5217#true} is VALID [2022-04-28 03:17:29,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {5217#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {5217#true} is VALID [2022-04-28 03:17:29,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {5217#true} call #t~ret5 := main(); {5217#true} is VALID [2022-04-28 03:17:29,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5217#true} {5217#true} #38#return; {5217#true} is VALID [2022-04-28 03:17:29,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {5217#true} assume true; {5217#true} is VALID [2022-04-28 03:17:29,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {5217#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {5217#true} is VALID [2022-04-28 03:17:29,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {5217#true} call ULTIMATE.init(); {5217#true} is VALID [2022-04-28 03:17:29,719 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-04-28 03:17:29,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:29,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236902152] [2022-04-28 03:17:29,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:17:29,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441651633] [2022-04-28 03:17:29,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441651633] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:29,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:17:29,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5] total 25 [2022-04-28 03:17:29,720 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:29,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1120324117] [2022-04-28 03:17:29,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1120324117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:29,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:29,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 03:17:29,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845885322] [2022-04-28 03:17:29,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:29,721 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:17:29,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:29,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:29,749 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 03:17:29,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 03:17:29,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:29,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 03:17:29,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:17:29,750 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:30,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:30,907 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 03:17:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 03:17:30,907 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:17:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2022-04-28 03:17:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2022-04-28 03:17:30,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 35 transitions. [2022-04-28 03:17:30,941 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 03:17:30,942 INFO L225 Difference]: With dead ends: 35 [2022-04-28 03:17:30,942 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 03:17:30,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 19 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:17:30,943 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:30,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:17:30,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 03:17:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 03:17:30,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:30,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:30,978 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:30,978 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:30,979 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 03:17:30,979 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 03:17:30,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:30,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:30,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 03:17:30,979 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 03:17:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:30,980 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 03:17:30,980 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 03:17:30,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:30,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:30,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:30,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-28 03:17:30,981 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-28 03:17:30,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:30,981 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-28 03:17:30,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:30,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-28 03:17:31,022 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 03:17:31,023 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 03:17:31,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:17:31,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:31,023 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:31,039 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 03:17:31,223 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 03:17:31,223 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:31,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:31,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1213480399, now seen corresponding path program 39 times [2022-04-28 03:17:31,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:31,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [905482597] [2022-04-28 03:17:31,224 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:17:31,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1213480399, now seen corresponding path program 40 times [2022-04-28 03:17:31,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:31,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168375921] [2022-04-28 03:17:31,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:31,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:31,245 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:17:31,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [764589727] [2022-04-28 03:17:31,245 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:17:31,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:31,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:31,247 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 03:17:31,247 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 03:17:31,290 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:17:31,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:17:31,292 WARN L261 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-28 03:17:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:31,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:31,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {5621#true} call ULTIMATE.init(); {5621#true} is VALID [2022-04-28 03:17:31,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {5621#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {5621#true} is VALID [2022-04-28 03:17:31,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {5621#true} assume true; {5621#true} is VALID [2022-04-28 03:17:31,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5621#true} {5621#true} #38#return; {5621#true} is VALID [2022-04-28 03:17:31,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {5621#true} call #t~ret5 := main(); {5621#true} is VALID [2022-04-28 03:17:31,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {5621#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {5621#true} is VALID [2022-04-28 03:17:31,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {5621#true} assume !!(1 <= ~main__n~0); {5621#true} is VALID [2022-04-28 03:17:31,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {5621#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5647#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:17:31,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {5647#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5651#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-28 03:17:31,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {5651#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5655#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-28 03:17:31,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {5655#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__i~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5659#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:17:31,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {5659#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5663#(and (= 2 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 5))))} is VALID [2022-04-28 03:17:31,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {5663#(and (= 2 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 5))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5667#(and (= 2 (+ (- 4) main_~main__i~0)) (= (+ (* 3 main_~main__i~0) (- 8)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:17:31,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {5667#(and (= 2 (+ (- 4) main_~main__i~0)) (= (+ (* 3 main_~main__i~0) (- 8)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5671#(and (= 2 (+ (- 5) main_~main__i~0)) (= main_~main__sum~0 (+ (- 14) (* 5 main_~main__i~0))))} is VALID [2022-04-28 03:17:31,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {5671#(and (= 2 (+ (- 5) main_~main__i~0)) (= main_~main__sum~0 (+ (- 14) (* 5 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5675#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-28 03:17:31,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {5675#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5679#(and (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} is VALID [2022-04-28 03:17:31,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {5679#(and (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5683#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-28 03:17:31,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {5683#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5687#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-28 03:17:31,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {5687#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5691#(and (= (+ (- 55) main_~main__sum~0) 11) (= (+ main_~main__sum~0 (- 54)) main_~main__i~0))} is VALID [2022-04-28 03:17:31,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {5691#(and (= (+ (- 55) main_~main__sum~0) 11) (= (+ main_~main__sum~0 (- 54)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5695#(and (= 12 (+ main_~main__sum~0 (- 66))) (= (+ main_~main__sum~0 (- 65)) main_~main__i~0))} is VALID [2022-04-28 03:17:31,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {5695#(and (= 12 (+ main_~main__sum~0 (- 66))) (= (+ main_~main__sum~0 (- 65)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5699#(and (= (+ main_~main__sum~0 (- 78)) 13) (= (+ (- 77) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-28 03:17:31,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {5699#(and (= (+ main_~main__sum~0 (- 78)) 13) (= (+ (- 77) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5703#(and (= 13 (+ (- 77) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (- 76) (* (- 1) main_~main__i~0))))} is VALID [2022-04-28 03:17:31,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {5703#(and (= 13 (+ (- 77) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (- 76) (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5707#(and (= (+ (- 3) main_~main__i~0) 13) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 72)))} is VALID [2022-04-28 03:17:31,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {5707#(and (= (+ (- 3) main_~main__i~0) 13) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 72)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5711#(and (= (+ (* 3 main_~main__i~0) 69) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 13))} is VALID [2022-04-28 03:17:31,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {5711#(and (= (+ (* 3 main_~main__i~0) 69) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5715#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 33)) 120))} is VALID [2022-04-28 03:17:31,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {5715#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 33)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5719#(and (= 19 main_~main__i~0) (= 120 (+ (- 51) main_~main__sum~0)))} is VALID [2022-04-28 03:17:31,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {5719#(and (= 19 main_~main__i~0) (= 120 (+ (- 51) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5723#(and (= (+ (- 1) main_~main__i~0) 19) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 50)) 120))} is VALID [2022-04-28 03:17:31,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {5723#(and (= (+ (- 1) main_~main__i~0) 19) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 50)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5727#(and (<= 20 main_~main__n~0) (= (+ main_~main__sum~0 (- 90)) 120) (<= main_~main__i~0 21))} is VALID [2022-04-28 03:17:31,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {5727#(and (<= 20 main_~main__n~0) (= (+ main_~main__sum~0 (- 90)) 120) (<= main_~main__i~0 21))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5731#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:31,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {5731#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {5622#false} is VALID [2022-04-28 03:17:31,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {5622#false} assume !false; {5622#false} is VALID [2022-04-28 03:17:31,868 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:17:31,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:36,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {5622#false} assume !false; {5622#false} is VALID [2022-04-28 03:17:36,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {5731#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {5622#false} is VALID [2022-04-28 03:17:36,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {5744#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5731#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:36,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5744#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:17:36,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:36,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:36,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {5621#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5748#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:37,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {5621#true} assume !!(1 <= ~main__n~0); {5621#true} is VALID [2022-04-28 03:17:37,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {5621#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {5621#true} is VALID [2022-04-28 03:17:37,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {5621#true} call #t~ret5 := main(); {5621#true} is VALID [2022-04-28 03:17:37,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5621#true} {5621#true} #38#return; {5621#true} is VALID [2022-04-28 03:17:37,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {5621#true} assume true; {5621#true} is VALID [2022-04-28 03:17:37,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {5621#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {5621#true} is VALID [2022-04-28 03:17:37,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {5621#true} call ULTIMATE.init(); {5621#true} is VALID [2022-04-28 03:17:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-28 03:17:37,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:37,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168375921] [2022-04-28 03:17:37,303 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:17:37,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764589727] [2022-04-28 03:17:37,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764589727] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:37,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:17:37,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 5] total 26 [2022-04-28 03:17:37,304 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:37,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [905482597] [2022-04-28 03:17:37,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [905482597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:37,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:37,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 03:17:37,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625875845] [2022-04-28 03:17:37,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:37,305 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 03:17:37,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:37,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:37,345 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 03:17:37,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 03:17:37,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:37,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 03:17:37,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:17:37,346 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:38,582 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 03:17:38,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 03:17:38,582 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 03:17:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2022-04-28 03:17:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2022-04-28 03:17:38,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 36 transitions. [2022-04-28 03:17:38,619 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 03:17:38,619 INFO L225 Difference]: With dead ends: 36 [2022-04-28 03:17:38,619 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 03:17:38,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 20 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:17:38,620 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:38,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 186 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:17:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 03:17:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 03:17:38,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:38,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:38,663 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:38,663 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:38,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:38,664 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 03:17:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 03:17:38,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:38,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:38,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:17:38,664 INFO L87 Difference]: Start difference. First operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:17:38,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:38,665 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 03:17:38,665 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 03:17:38,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:38,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:38,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:38,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-28 03:17:38,666 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-28 03:17:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:38,666 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-28 03:17:38,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:38,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-28 03:17:38,714 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 03:17:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 03:17:38,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 03:17:38,715 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:38,715 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:38,731 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 03:17:38,915 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 03:17:38,915 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:38,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:38,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1036750827, now seen corresponding path program 41 times [2022-04-28 03:17:38,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:38,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1770447617] [2022-04-28 03:17:38,916 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:17:38,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1036750827, now seen corresponding path program 42 times [2022-04-28 03:17:38,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:38,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214283718] [2022-04-28 03:17:38,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:38,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:38,932 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:17:38,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654680511] [2022-04-28 03:17:38,932 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:17:38,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:38,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:38,933 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 03:17:38,936 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 03:17:38,983 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 03:17:38,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:17:38,985 WARN L261 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-28 03:17:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:38,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:39,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {6038#true} call ULTIMATE.init(); {6038#true} is VALID [2022-04-28 03:17:39,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {6038#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {6038#true} is VALID [2022-04-28 03:17:39,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {6038#true} assume true; {6038#true} is VALID [2022-04-28 03:17:39,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6038#true} {6038#true} #38#return; {6038#true} is VALID [2022-04-28 03:17:39,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {6038#true} call #t~ret5 := main(); {6038#true} is VALID [2022-04-28 03:17:39,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {6038#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6038#true} is VALID [2022-04-28 03:17:39,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {6038#true} assume !!(1 <= ~main__n~0); {6038#true} is VALID [2022-04-28 03:17:39,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {6038#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6064#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:17:39,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {6064#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6068#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-28 03:17:39,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {6068#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6072#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 0))} is VALID [2022-04-28 03:17:39,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {6072#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6076#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} is VALID [2022-04-28 03:17:39,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {6076#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6080#(and (= (+ (- 1) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 0))} is VALID [2022-04-28 03:17:39,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {6080#(and (= (+ (- 1) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6084#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-28 03:17:39,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {6084#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6088#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:17:39,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {6088#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6092#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} is VALID [2022-04-28 03:17:39,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {6092#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6096#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} is VALID [2022-04-28 03:17:39,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {6096#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6100#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-28 03:17:39,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {6100#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6104#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} is VALID [2022-04-28 03:17:39,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {6104#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6108#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} is VALID [2022-04-28 03:17:39,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {6108#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6112#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 39)) (= (+ (- 3) main_~main__i~0) 10))} is VALID [2022-04-28 03:17:39,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {6112#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 39)) (= (+ (- 3) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6116#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 35)) (= (+ (- 4) main_~main__i~0) 10))} is VALID [2022-04-28 03:17:39,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {6116#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 35)) (= (+ (- 4) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6120#(and (= (+ (- 5) main_~main__i~0) 10) (= main_~main__sum~0 (+ 30 (* 5 main_~main__i~0))))} is VALID [2022-04-28 03:17:39,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {6120#(and (= (+ (- 5) main_~main__i~0) 10) (= main_~main__sum~0 (+ 30 (* 5 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6124#(and (= (+ (- 6) main_~main__i~0) 10) (= main_~main__sum~0 (+ (* 6 main_~main__i~0) 24)))} is VALID [2022-04-28 03:17:39,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {6124#(and (= (+ (- 6) main_~main__i~0) 10) (= main_~main__sum~0 (+ (* 6 main_~main__i~0) 24)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6128#(and (= 10 (+ (- 7) main_~main__i~0)) (= (+ (* 6 main_~main__i~0) 18) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:17:39,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {6128#(and (= 10 (+ (- 7) main_~main__i~0)) (= (+ (* 6 main_~main__i~0) 18) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6132#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 33)) 120))} is VALID [2022-04-28 03:17:39,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {6132#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 33)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6136#(and (= 19 main_~main__i~0) (= 120 (+ (- 51) main_~main__sum~0)))} is VALID [2022-04-28 03:17:39,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {6136#(and (= 19 main_~main__i~0) (= 120 (+ (- 51) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6140#(and (= (+ (- 1) main_~main__i~0) 19) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 50)) 120))} is VALID [2022-04-28 03:17:39,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {6140#(and (= (+ (- 1) main_~main__i~0) 19) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 50)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6144#(and (= (+ main_~main__sum~0 (- 90)) 120) (= 21 main_~main__i~0))} is VALID [2022-04-28 03:17:39,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {6144#(and (= (+ main_~main__sum~0 (- 90)) 120) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6148#(and (<= main_~main__i~0 22) (= main_~main__sum~0 231) (<= 21 main_~main__n~0))} is VALID [2022-04-28 03:17:39,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {6148#(and (<= main_~main__i~0 22) (= main_~main__sum~0 231) (<= 21 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6152#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:39,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {6152#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6039#false} is VALID [2022-04-28 03:17:39,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {6039#false} assume !false; {6039#false} is VALID [2022-04-28 03:17:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:17:39,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:45,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {6039#false} assume !false; {6039#false} is VALID [2022-04-28 03:17:45,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {6152#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6039#false} is VALID [2022-04-28 03:17:45,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {6165#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6152#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:45,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6165#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:17:45,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {6038#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6169#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:45,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {6038#true} assume !!(1 <= ~main__n~0); {6038#true} is VALID [2022-04-28 03:17:45,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {6038#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6038#true} is VALID [2022-04-28 03:17:45,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {6038#true} call #t~ret5 := main(); {6038#true} is VALID [2022-04-28 03:17:45,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6038#true} {6038#true} #38#return; {6038#true} is VALID [2022-04-28 03:17:45,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {6038#true} assume true; {6038#true} is VALID [2022-04-28 03:17:45,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {6038#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {6038#true} is VALID [2022-04-28 03:17:45,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {6038#true} call ULTIMATE.init(); {6038#true} is VALID [2022-04-28 03:17:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-28 03:17:45,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:45,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214283718] [2022-04-28 03:17:45,610 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:17:45,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654680511] [2022-04-28 03:17:45,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654680511] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:45,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:17:45,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 5] total 27 [2022-04-28 03:17:45,611 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:45,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1770447617] [2022-04-28 03:17:45,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1770447617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:45,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:45,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 03:17:45,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889536218] [2022-04-28 03:17:45,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:45,611 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:17:45,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:45,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:45,638 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 03:17:45,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 03:17:45,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:45,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 03:17:45,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:17:45,639 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:46,926 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 03:17:46,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 03:17:46,927 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:17:46,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:46,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2022-04-28 03:17:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2022-04-28 03:17:46,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 37 transitions. [2022-04-28 03:17:46,961 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 03:17:46,961 INFO L225 Difference]: With dead ends: 37 [2022-04-28 03:17:46,961 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 03:17:46,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 17 SyntacticMatches, 21 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:17:46,962 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:46,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 194 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:17:46,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 03:17:46,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 03:17:46,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:46,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:46,998 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:46,998 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:46,999 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 03:17:46,999 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 03:17:46,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:46,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:47,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 03:17:47,000 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 03:17:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:47,000 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 03:17:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 03:17:47,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:47,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:47,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:47,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-28 03:17:47,001 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-28 03:17:47,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:47,002 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-28 03:17:47,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:47,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-28 03:17:47,052 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 03:17:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 03:17:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 03:17:47,052 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:47,053 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:47,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 03:17:47,253 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 03:17:47,253 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:47,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:47,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2074442097, now seen corresponding path program 43 times [2022-04-28 03:17:47,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:47,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1082538883] [2022-04-28 03:17:47,254 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:17:47,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2074442097, now seen corresponding path program 44 times [2022-04-28 03:17:47,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:47,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781500957] [2022-04-28 03:17:47,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:47,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:47,272 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:17:47,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [259232835] [2022-04-28 03:17:47,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:17:47,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:47,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:47,274 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 03:17:47,275 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 03:17:47,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:17:47,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:17:47,332 WARN L261 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-28 03:17:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:47,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:47,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {6468#true} call ULTIMATE.init(); {6468#true} is VALID [2022-04-28 03:17:47,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {6468#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {6468#true} is VALID [2022-04-28 03:17:47,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {6468#true} assume true; {6468#true} is VALID [2022-04-28 03:17:47,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6468#true} {6468#true} #38#return; {6468#true} is VALID [2022-04-28 03:17:47,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {6468#true} call #t~ret5 := main(); {6468#true} is VALID [2022-04-28 03:17:47,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {6468#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6468#true} is VALID [2022-04-28 03:17:47,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {6468#true} assume !!(1 <= ~main__n~0); {6468#true} is VALID [2022-04-28 03:17:47,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {6468#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6494#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:17:47,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {6494#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6498#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-28 03:17:47,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {6498#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6502#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-28 03:17:47,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {6502#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__i~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6506#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-28 03:17:47,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {6506#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6510#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 4)) 6))} is VALID [2022-04-28 03:17:47,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {6510#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 4)) 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6514#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 3)) 6))} is VALID [2022-04-28 03:17:47,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {6514#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 3)) 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6518#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} is VALID [2022-04-28 03:17:47,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {6518#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6522#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} is VALID [2022-04-28 03:17:47,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {6522#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6526#(and (= (+ (- 1) main_~main__i~0) 8) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 6)) 21))} is VALID [2022-04-28 03:17:47,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {6526#(and (= (+ (- 1) main_~main__i~0) 8) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 6)) 21))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6530#(and (= (+ (- 2) main_~main__i~0) 8) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 25)))} is VALID [2022-04-28 03:17:47,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {6530#(and (= (+ (- 2) main_~main__i~0) 8) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 25)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6534#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-28 03:17:47,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {6534#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6538#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} is VALID [2022-04-28 03:17:47,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {6538#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6542#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-28 03:17:47,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {6542#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6546#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-28 03:17:47,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {6546#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6550#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2022-04-28 03:17:47,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {6550#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6554#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 15)) 105))} is VALID [2022-04-28 03:17:47,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {6554#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 15)) 105))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6558#(and (= (+ main_~main__sum~0 (- 119)) main_~main__i~0) (= 16 (+ main_~main__sum~0 (- 120))))} is VALID [2022-04-28 03:17:47,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {6558#(and (= (+ main_~main__sum~0 (- 119)) main_~main__i~0) (= 16 (+ main_~main__sum~0 (- 120))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6562#(and (= (+ main_~main__sum~0 (- 136)) 17) (= (+ main_~main__sum~0 (- 135)) main_~main__i~0))} is VALID [2022-04-28 03:17:47,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {6562#(and (= (+ main_~main__sum~0 (- 136)) 17) (= (+ main_~main__sum~0 (- 135)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6566#(and (= (+ (- 1) main_~main__i~0) (+ (- 134) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 135)) 17))} is VALID [2022-04-28 03:17:47,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {6566#(and (= (+ (- 1) main_~main__i~0) (+ (- 134) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 135)) 17))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6570#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-28 03:17:47,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {6570#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6574#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} is VALID [2022-04-28 03:17:47,961 INFO L290 TraceCheckUtils]: 28: Hoare triple {6574#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6578#(and (= 22 main_~main__i~0) (= main_~main__sum~0 231))} is VALID [2022-04-28 03:17:47,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {6578#(and (= 22 main_~main__i~0) (= main_~main__sum~0 231))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6582#(and (= main_~main__sum~0 253) (<= 22 main_~main__n~0) (<= main_~main__i~0 23))} is VALID [2022-04-28 03:17:47,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {6582#(and (= main_~main__sum~0 253) (<= 22 main_~main__n~0) (<= main_~main__i~0 23))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6586#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:47,963 INFO L290 TraceCheckUtils]: 31: Hoare triple {6586#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6469#false} is VALID [2022-04-28 03:17:47,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {6469#false} assume !false; {6469#false} is VALID [2022-04-28 03:17:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:17:47,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:54,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {6469#false} assume !false; {6469#false} is VALID [2022-04-28 03:17:54,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {6586#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6469#false} is VALID [2022-04-28 03:17:54,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {6599#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6586#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:54,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6599#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:17:54,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {6468#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6603#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:17:54,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {6468#true} assume !!(1 <= ~main__n~0); {6468#true} is VALID [2022-04-28 03:17:54,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {6468#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6468#true} is VALID [2022-04-28 03:17:54,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {6468#true} call #t~ret5 := main(); {6468#true} is VALID [2022-04-28 03:17:54,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6468#true} {6468#true} #38#return; {6468#true} is VALID [2022-04-28 03:17:54,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {6468#true} assume true; {6468#true} is VALID [2022-04-28 03:17:54,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {6468#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {6468#true} is VALID [2022-04-28 03:17:54,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {6468#true} call ULTIMATE.init(); {6468#true} is VALID [2022-04-28 03:17:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-04-28 03:17:54,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:54,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781500957] [2022-04-28 03:17:54,688 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:17:54,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259232835] [2022-04-28 03:17:54,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259232835] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:54,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:17:54,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 5] total 28 [2022-04-28 03:17:54,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:54,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1082538883] [2022-04-28 03:17:54,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1082538883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:54,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:54,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 03:17:54,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630197487] [2022-04-28 03:17:54,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:54,689 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 03:17:54,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:54,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:54,717 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 03:17:54,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 03:17:54,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:54,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 03:17:54,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:17:54,718 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:56,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:56,171 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 03:17:56,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 03:17:56,171 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 03:17:56,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2022-04-28 03:17:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2022-04-28 03:17:56,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 38 transitions. [2022-04-28 03:17:56,212 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 03:17:56,213 INFO L225 Difference]: With dead ends: 38 [2022-04-28 03:17:56,213 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 03:17:56,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 22 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-28 03:17:56,213 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:56,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 202 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:17:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 03:17:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 03:17:56,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:56,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:56,250 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:56,250 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:56,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:56,250 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 03:17:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 03:17:56,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:56,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:56,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:17:56,251 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:17:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:56,251 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 03:17:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 03:17:56,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:56,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:56,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:56,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-28 03:17:56,252 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-28 03:17:56,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:56,252 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-28 03:17:56,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:17:56,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-28 03:17:56,301 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 03:17:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 03:17:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 03:17:56,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:56,302 INFO L195 NwaCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:56,317 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 03:17:56,502 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 03:17:56,502 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:56,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:56,502 INFO L85 PathProgramCache]: Analyzing trace with hash -116866901, now seen corresponding path program 45 times [2022-04-28 03:17:56,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:56,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [40019689] [2022-04-28 03:17:56,503 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:17:56,503 INFO L85 PathProgramCache]: Analyzing trace with hash -116866901, now seen corresponding path program 46 times [2022-04-28 03:17:56,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:56,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383453023] [2022-04-28 03:17:56,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:56,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:56,517 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:17:56,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1803497859] [2022-04-28 03:17:56,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:17:56,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:56,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:56,519 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 03:17:56,531 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 03:17:56,587 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:17:56,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:17:56,588 WARN L261 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-28 03:17:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:56,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:57,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {6911#true} call ULTIMATE.init(); {6911#true} is VALID [2022-04-28 03:17:57,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {6911#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {6911#true} is VALID [2022-04-28 03:17:57,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {6911#true} assume true; {6911#true} is VALID [2022-04-28 03:17:57,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6911#true} {6911#true} #38#return; {6911#true} is VALID [2022-04-28 03:17:57,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {6911#true} call #t~ret5 := main(); {6911#true} is VALID [2022-04-28 03:17:57,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {6911#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6911#true} is VALID [2022-04-28 03:17:57,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {6911#true} assume !!(1 <= ~main__n~0); {6911#true} is VALID [2022-04-28 03:17:57,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {6911#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6937#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:17:57,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {6937#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6941#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-28 03:17:57,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {6941#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6945#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-28 03:17:57,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {6945#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6949#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-28 03:17:57,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {6949#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6953#(and (= 3 (+ (- 2) main_~main__i~0)) (= 3 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-28 03:17:57,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {6953#(and (= 3 (+ (- 2) main_~main__i~0)) (= 3 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6957#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-28 03:17:57,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {6957#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6961#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} is VALID [2022-04-28 03:17:57,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {6961#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6965#(and (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-28 03:17:57,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {6965#(and (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6969#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 18)) (= 7 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-28 03:17:57,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {6969#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 18)) (= 7 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6973#(and (= 7 (+ (- 3) main_~main__i~0)) (= (+ (* 3 main_~main__i~0) 15) main_~main__sum~0))} is VALID [2022-04-28 03:17:57,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {6973#(and (= 7 (+ (- 3) main_~main__i~0)) (= (+ (* 3 main_~main__i~0) 15) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6977#(and (= (+ (* 3 main_~main__i~0) 12) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 7 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-28 03:17:57,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {6977#(and (= (+ (* 3 main_~main__i~0) 12) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 7 (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6981#(and (= 7 (+ (- 5) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 3 main_~main__i~0) 9)))} is VALID [2022-04-28 03:17:57,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {6981#(and (= 7 (+ (- 5) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 3 main_~main__i~0) 9)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6985#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2022-04-28 03:17:57,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {6985#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6989#(and (= main_~main__sum~0 (+ 77 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 13))} is VALID [2022-04-28 03:17:57,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {6989#(and (= main_~main__sum~0 (+ 77 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6993#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 75)) (= (+ (- 2) main_~main__i~0) 13))} is VALID [2022-04-28 03:17:57,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {6993#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 75)) (= (+ (- 2) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6997#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-28 03:17:57,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {6997#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7001#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 16)) 120))} is VALID [2022-04-28 03:17:57,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {7001#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 16)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7005#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 33)) 120))} is VALID [2022-04-28 03:17:57,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {7005#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 33)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7009#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} is VALID [2022-04-28 03:17:57,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {7009#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7013#(and (= (+ (- 1) main_~main__i~0) 19) (= 171 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:17:57,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {7013#(and (= (+ (- 1) main_~main__i~0) 19) (= 171 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7017#(and (= 21 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 171))} is VALID [2022-04-28 03:17:57,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {7017#(and (= 21 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7021#(and (= (+ (- 1) main_~main__i~0) 21) (= main_~main__sum~0 (+ 209 main_~main__i~0)))} is VALID [2022-04-28 03:17:57,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {7021#(and (= (+ (- 1) main_~main__i~0) 21) (= main_~main__sum~0 (+ 209 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7025#(and (= 21 (+ (- 2) main_~main__i~0)) (= (+ main_~main__i~0 208) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:17:57,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {7025#(and (= 21 (+ (- 2) main_~main__i~0)) (= (+ main_~main__i~0 208) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7029#(and (<= 23 main_~main__n~0) (<= main_~main__i~0 24) (= (+ (- 45) main_~main__sum~0) 231))} is VALID [2022-04-28 03:17:57,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {7029#(and (<= 23 main_~main__n~0) (<= main_~main__i~0 24) (= (+ (- 45) main_~main__sum~0) 231))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7033#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:17:57,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {7033#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6912#false} is VALID [2022-04-28 03:17:57,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {6912#false} assume !false; {6912#false} is VALID [2022-04-28 03:17:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:17:57,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:18:04,570 INFO L290 TraceCheckUtils]: 33: Hoare triple {6912#false} assume !false; {6912#false} is VALID [2022-04-28 03:18:04,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {7033#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6912#false} is VALID [2022-04-28 03:18:04,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {7046#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7033#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:18:04,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7046#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:18:04,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {6911#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7050#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:04,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {6911#true} assume !!(1 <= ~main__n~0); {6911#true} is VALID [2022-04-28 03:18:04,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {6911#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6911#true} is VALID [2022-04-28 03:18:04,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {6911#true} call #t~ret5 := main(); {6911#true} is VALID [2022-04-28 03:18:04,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6911#true} {6911#true} #38#return; {6911#true} is VALID [2022-04-28 03:18:04,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {6911#true} assume true; {6911#true} is VALID [2022-04-28 03:18:04,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {6911#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {6911#true} is VALID [2022-04-28 03:18:04,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {6911#true} call ULTIMATE.init(); {6911#true} is VALID [2022-04-28 03:18:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-04-28 03:18:04,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:18:04,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383453023] [2022-04-28 03:18:04,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:18:04,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803497859] [2022-04-28 03:18:04,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803497859] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:18:04,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:18:04,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 5] total 29 [2022-04-28 03:18:04,927 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:18:04,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [40019689] [2022-04-28 03:18:04,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [40019689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:18:04,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:18:04,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 03:18:04,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674945700] [2022-04-28 03:18:04,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:18:04,928 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:18:04,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:18:04,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:04,959 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 03:18:04,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 03:18:04,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:04,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 03:18:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2022-04-28 03:18:04,960 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:06,630 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 03:18:06,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 03:18:06,630 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:18:06,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:18:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2022-04-28 03:18:06,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2022-04-28 03:18:06,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 39 transitions. [2022-04-28 03:18:06,669 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 03:18:06,670 INFO L225 Difference]: With dead ends: 39 [2022-04-28 03:18:06,670 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 03:18:06,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 17 SyntacticMatches, 23 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:18:06,670 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:18:06,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 210 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:18:06,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 03:18:06,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 03:18:06,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:18:06,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:06,707 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:06,707 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:06,708 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 03:18:06,708 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 03:18:06,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:06,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:06,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 03:18:06,709 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 03:18:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:06,709 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 03:18:06,709 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 03:18:06,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:06,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:06,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:18:06,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:18:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:06,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-28 03:18:06,711 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-28 03:18:06,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:18:06,711 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-28 03:18:06,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:06,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-28 03:18:06,780 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 03:18:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 03:18:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 03:18:06,780 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:18:06,780 INFO L195 NwaCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:18:06,798 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 03:18:06,981 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 03:18:06,981 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:18:06,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:18:06,981 INFO L85 PathProgramCache]: Analyzing trace with hash 672030897, now seen corresponding path program 47 times [2022-04-28 03:18:06,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:06,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1752625986] [2022-04-28 03:18:06,981 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:18:06,982 INFO L85 PathProgramCache]: Analyzing trace with hash 672030897, now seen corresponding path program 48 times [2022-04-28 03:18:06,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:18:06,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866755578] [2022-04-28 03:18:06,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:06,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:18:06,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:18:06,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [278551408] [2022-04-28 03:18:06,999 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:18:06,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:18:06,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:18:07,000 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 03:18:07,022 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 03:18:07,064 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 03:18:07,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:18:07,066 WARN L261 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-28 03:18:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:07,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:18:07,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {7367#true} call ULTIMATE.init(); {7367#true} is VALID [2022-04-28 03:18:07,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {7367#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {7367#true} is VALID [2022-04-28 03:18:07,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {7367#true} assume true; {7367#true} is VALID [2022-04-28 03:18:07,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7367#true} {7367#true} #38#return; {7367#true} is VALID [2022-04-28 03:18:07,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {7367#true} call #t~ret5 := main(); {7367#true} is VALID [2022-04-28 03:18:07,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {7367#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {7367#true} is VALID [2022-04-28 03:18:07,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {7367#true} assume !!(1 <= ~main__n~0); {7367#true} is VALID [2022-04-28 03:18:07,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {7367#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7393#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:18:07,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {7393#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7397#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-28 03:18:07,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7401#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-28 03:18:07,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {7401#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7405#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ (* 2 main_~main__i~0) (- 5)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:18:07,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {7405#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ (* 2 main_~main__i~0) (- 5)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7409#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-28 03:18:07,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {7409#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7413#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} is VALID [2022-04-28 03:18:07,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {7413#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7417#(and (= 5 (+ (- 2) main_~main__i~0)) (= (+ 8 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:18:07,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {7417#(and (= 5 (+ (- 2) main_~main__i~0)) (= (+ 8 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7421#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} is VALID [2022-04-28 03:18:07,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {7421#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7425#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} is VALID [2022-04-28 03:18:07,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {7425#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7429#(and (= (+ 26 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 8))} is VALID [2022-04-28 03:18:07,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {7429#(and (= (+ 26 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 8))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7433#(and (= 8 (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ 25 main_~main__i~0)))} is VALID [2022-04-28 03:18:07,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {7433#(and (= 8 (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ 25 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7437#(and (= 12 main_~main__i~0) (= 36 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-28 03:18:07,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {7437#(and (= 12 main_~main__i~0) (= 36 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7441#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 29))) (= (+ (- 1) main_~main__i~0) 12))} is VALID [2022-04-28 03:18:07,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {7441#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 29))) (= (+ (- 1) main_~main__i~0) 12))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7445#(and (= (+ main_~main__sum~0 (- 27) (* (- 2) main_~main__i~0)) 36) (= (+ (- 2) main_~main__i~0) 12))} is VALID [2022-04-28 03:18:07,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {7445#(and (= (+ main_~main__sum~0 (- 27) (* (- 2) main_~main__i~0)) 36) (= (+ (- 2) main_~main__i~0) 12))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7449#(and (= 12 (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 24)) 36))} is VALID [2022-04-28 03:18:07,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {7449#(and (= 12 (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 24)) 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7453#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 84)) 36))} is VALID [2022-04-28 03:18:07,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {7453#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 84)) 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7457#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-28 03:18:07,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {7457#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7461#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} is VALID [2022-04-28 03:18:07,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {7461#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7465#(and (= (+ 152 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 18))} is VALID [2022-04-28 03:18:07,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {7465#(and (= (+ 152 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 18))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7469#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-28 03:18:07,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {7469#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7473#(and (= (+ (- 1) main_~main__i~0) 20) (= main_~main__sum~0 (+ 189 main_~main__i~0)))} is VALID [2022-04-28 03:18:07,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {7473#(and (= (+ (- 1) main_~main__i~0) 20) (= main_~main__sum~0 (+ 189 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7477#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} is VALID [2022-04-28 03:18:07,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {7477#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7481#(and (= (+ (- 3) main_~main__i~0) 20) (= (+ (* 2 main_~main__i~0) 185) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:18:07,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {7481#(and (= (+ (- 3) main_~main__i~0) 20) (= (+ (* 2 main_~main__i~0) 185) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7485#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) 183)) (= (+ (- 4) main_~main__i~0) 20))} is VALID [2022-04-28 03:18:07,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {7485#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) 183)) (= (+ (- 4) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7489#(and (<= main_~main__i~0 25) (= 231 (+ (- 69) main_~main__sum~0)) (<= 24 main_~main__n~0))} is VALID [2022-04-28 03:18:07,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {7489#(and (<= main_~main__i~0 25) (= 231 (+ (- 69) main_~main__sum~0)) (<= 24 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7493#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:18:07,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {7493#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {7368#false} is VALID [2022-04-28 03:18:07,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {7368#false} assume !false; {7368#false} is VALID [2022-04-28 03:18:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:18:07,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:18:16,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {7368#false} assume !false; {7368#false} is VALID [2022-04-28 03:18:16,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {7493#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {7368#false} is VALID [2022-04-28 03:18:16,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {7506#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7493#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:18:16,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7506#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:18:16,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {7367#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7510#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:16,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {7367#true} assume !!(1 <= ~main__n~0); {7367#true} is VALID [2022-04-28 03:18:16,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {7367#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {7367#true} is VALID [2022-04-28 03:18:16,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {7367#true} call #t~ret5 := main(); {7367#true} is VALID [2022-04-28 03:18:16,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7367#true} {7367#true} #38#return; {7367#true} is VALID [2022-04-28 03:18:16,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {7367#true} assume true; {7367#true} is VALID [2022-04-28 03:18:16,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {7367#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {7367#true} is VALID [2022-04-28 03:18:16,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {7367#true} call ULTIMATE.init(); {7367#true} is VALID [2022-04-28 03:18:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-28 03:18:16,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:18:16,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866755578] [2022-04-28 03:18:16,929 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:18:16,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278551408] [2022-04-28 03:18:16,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278551408] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:18:16,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:18:16,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 5] total 30 [2022-04-28 03:18:16,929 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:18:16,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1752625986] [2022-04-28 03:18:16,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1752625986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:18:16,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:18:16,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 03:18:16,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174726758] [2022-04-28 03:18:16,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:18:16,930 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 03:18:16,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:18:16,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:16,963 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 03:18:16,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 03:18:16,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:16,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 03:18:16,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:18:16,964 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:18,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:18,906 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 03:18:18,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 03:18:18,906 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 03:18:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:18:18,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:18,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2022-04-28 03:18:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2022-04-28 03:18:18,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 40 transitions. [2022-04-28 03:18:18,947 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 03:18:18,948 INFO L225 Difference]: With dead ends: 40 [2022-04-28 03:18:18,948 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 03:18:18,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 17 SyntacticMatches, 24 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-04-28 03:18:18,949 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:18:18,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 218 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 03:18:18,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 03:18:18,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 03:18:18,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:18:18,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:18,987 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:18,987 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:18,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:18,988 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 03:18:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 03:18:18,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:18,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:18,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:18:18,988 INFO L87 Difference]: Start difference. First operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:18:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:18,989 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 03:18:18,989 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 03:18:18,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:18,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:18,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:18:18,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:18:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-28 03:18:18,990 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-28 03:18:18,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:18:18,990 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-28 03:18:18,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:18,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-28 03:18:19,050 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 03:18:19,050 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 03:18:19,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 03:18:19,050 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:18:19,050 INFO L195 NwaCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:18:19,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 03:18:19,251 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 03:18:19,251 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:18:19,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:18:19,252 INFO L85 PathProgramCache]: Analyzing trace with hash -641941141, now seen corresponding path program 49 times [2022-04-28 03:18:19,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:19,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [241352719] [2022-04-28 03:18:19,252 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:18:19,252 INFO L85 PathProgramCache]: Analyzing trace with hash -641941141, now seen corresponding path program 50 times [2022-04-28 03:18:19,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:18:19,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156673830] [2022-04-28 03:18:19,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:19,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:18:19,267 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:18:19,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241134790] [2022-04-28 03:18:19,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:18:19,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:18:19,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:18:19,269 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 03:18:19,277 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 03:18:19,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:18:19,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:18:19,338 WARN L261 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-28 03:18:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:19,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:18:20,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {7836#true} call ULTIMATE.init(); {7836#true} is VALID [2022-04-28 03:18:20,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {7836#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {7836#true} is VALID [2022-04-28 03:18:20,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {7836#true} assume true; {7836#true} is VALID [2022-04-28 03:18:20,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7836#true} {7836#true} #38#return; {7836#true} is VALID [2022-04-28 03:18:20,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {7836#true} call #t~ret5 := main(); {7836#true} is VALID [2022-04-28 03:18:20,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {7836#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {7836#true} is VALID [2022-04-28 03:18:20,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {7836#true} assume !!(1 <= ~main__n~0); {7836#true} is VALID [2022-04-28 03:18:20,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {7836#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7862#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:18:20,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {7862#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7866#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-28 03:18:20,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {7866#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7870#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-28 03:18:20,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {7870#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7874#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-28 03:18:20,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {7874#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7878#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-28 03:18:20,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {7878#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7882#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-28 03:18:20,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {7882#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7886#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} is VALID [2022-04-28 03:18:20,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {7886#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7890#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-28 03:18:20,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {7890#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7894#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} is VALID [2022-04-28 03:18:20,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {7894#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7898#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-28 03:18:20,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {7898#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7902#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-28 03:18:20,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {7902#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7906#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-28 03:18:20,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {7906#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7910#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2022-04-28 03:18:20,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {7910#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7914#(and (= (+ (- 1) main_~main__i~0) 13) (= 78 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:18:20,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {7914#(and (= (+ (- 1) main_~main__i~0) 13) (= 78 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7918#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} is VALID [2022-04-28 03:18:20,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {7918#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7922#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 26)) 78) (= (+ (- 1) main_~main__i~0) 15))} is VALID [2022-04-28 03:18:20,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {7922#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 26)) 78) (= (+ (- 1) main_~main__i~0) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7926#(and (= 15 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 102)))} is VALID [2022-04-28 03:18:20,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {7926#(and (= 15 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 102)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7930#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} is VALID [2022-04-28 03:18:20,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {7930#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7934#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} is VALID [2022-04-28 03:18:20,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {7934#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7938#(and (= (+ (- 1) main_~main__i~0) 19) (= main_~main__sum~0 (+ 170 main_~main__i~0)))} is VALID [2022-04-28 03:18:20,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {7938#(and (= (+ (- 1) main_~main__i~0) 19) (= main_~main__sum~0 (+ 170 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7942#(and (= 19 (+ (- 2) main_~main__i~0)) (= (+ 169 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:18:20,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {7942#(and (= 19 (+ (- 2) main_~main__i~0)) (= (+ 169 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7946#(and (= 22 main_~main__i~0) (= 190 (+ main_~main__sum~0 (- 41))))} is VALID [2022-04-28 03:18:20,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {7946#(and (= 22 main_~main__i~0) (= 190 (+ main_~main__sum~0 (- 41))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7950#(and (= (+ main_~main__sum~0 (- 231)) 22) (= (+ main_~main__sum~0 (- 230)) main_~main__i~0))} is VALID [2022-04-28 03:18:20,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {7950#(and (= (+ main_~main__sum~0 (- 231)) 22) (= (+ main_~main__sum~0 (- 230)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7954#(and (= (+ 228 (* 2 main_~main__i~0)) main_~main__sum~0) (= 22 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-28 03:18:20,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {7954#(and (= (+ 228 (* 2 main_~main__i~0)) main_~main__sum~0) (= 22 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7958#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2022-04-28 03:18:20,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {7958#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7962#(and (<= main_~main__i~0 26) (<= 25 main_~main__n~0) (= (+ main_~main__sum~0 (- 25)) 300))} is VALID [2022-04-28 03:18:20,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {7962#(and (<= main_~main__i~0 26) (<= 25 main_~main__n~0) (= (+ main_~main__sum~0 (- 25)) 300))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7966#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:18:20,073 INFO L290 TraceCheckUtils]: 34: Hoare triple {7966#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {7837#false} is VALID [2022-04-28 03:18:20,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {7837#false} assume !false; {7837#false} is VALID [2022-04-28 03:18:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:18:20,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:18:29,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {7837#false} assume !false; {7837#false} is VALID [2022-04-28 03:18:29,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {7966#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {7837#false} is VALID [2022-04-28 03:18:29,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {7979#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7966#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:18:29,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7979#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:18:29,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {7836#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7983#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:29,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {7836#true} assume !!(1 <= ~main__n~0); {7836#true} is VALID [2022-04-28 03:18:29,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {7836#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {7836#true} is VALID [2022-04-28 03:18:29,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {7836#true} call #t~ret5 := main(); {7836#true} is VALID [2022-04-28 03:18:29,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7836#true} {7836#true} #38#return; {7836#true} is VALID [2022-04-28 03:18:29,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {7836#true} assume true; {7836#true} is VALID [2022-04-28 03:18:29,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {7836#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {7836#true} is VALID [2022-04-28 03:18:29,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {7836#true} call ULTIMATE.init(); {7836#true} is VALID [2022-04-28 03:18:29,906 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-04-28 03:18:29,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:18:29,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156673830] [2022-04-28 03:18:29,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:18:29,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241134790] [2022-04-28 03:18:29,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241134790] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:18:29,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:18:29,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 5] total 31 [2022-04-28 03:18:29,907 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:18:29,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [241352719] [2022-04-28 03:18:29,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [241352719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:18:29,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:18:29,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 03:18:29,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871926167] [2022-04-28 03:18:29,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:18:29,908 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:18:29,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:18:29,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:29,938 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 03:18:29,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 03:18:29,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:29,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 03:18:29,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2022-04-28 03:18:29,939 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:32,079 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 03:18:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 03:18:32,079 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:18:32,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:18:32,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-04-28 03:18:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-04-28 03:18:32,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 41 transitions. [2022-04-28 03:18:32,143 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 03:18:32,143 INFO L225 Difference]: With dead ends: 41 [2022-04-28 03:18:32,143 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 03:18:32,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 17 SyntacticMatches, 25 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:18:32,144 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:18:32,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 226 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 03:18:32,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 03:18:32,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 03:18:32,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:18:32,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:32,189 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:32,189 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:32,189 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 03:18:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 03:18:32,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:32,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:32,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 03:18:32,190 INFO L87 Difference]: Start difference. First operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 03:18:32,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:32,190 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 03:18:32,190 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 03:18:32,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:32,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:32,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:18:32,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:18:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-28 03:18:32,191 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-28 03:18:32,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:18:32,191 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-28 03:18:32,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:32,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-28 03:18:32,258 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 03:18:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 03:18:32,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 03:18:32,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:18:32,258 INFO L195 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:18:32,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 03:18:32,458 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 03:18:32,459 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:18:32,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:18:32,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1574598641, now seen corresponding path program 51 times [2022-04-28 03:18:32,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:32,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1836355776] [2022-04-28 03:18:32,459 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:18:32,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1574598641, now seen corresponding path program 52 times [2022-04-28 03:18:32,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:18:32,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687635015] [2022-04-28 03:18:32,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:32,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:18:32,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:18:32,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394343744] [2022-04-28 03:18:32,474 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:18:32,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:18:32,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:18:32,476 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 03:18:32,504 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 03:18:32,543 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:18:32,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:18:32,544 WARN L261 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-28 03:18:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:32,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:18:33,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {8318#true} call ULTIMATE.init(); {8318#true} is VALID [2022-04-28 03:18:33,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {8318#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {8318#true} is VALID [2022-04-28 03:18:33,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {8318#true} assume true; {8318#true} is VALID [2022-04-28 03:18:33,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8318#true} {8318#true} #38#return; {8318#true} is VALID [2022-04-28 03:18:33,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {8318#true} call #t~ret5 := main(); {8318#true} is VALID [2022-04-28 03:18:33,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {8318#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {8318#true} is VALID [2022-04-28 03:18:33,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {8318#true} assume !!(1 <= ~main__n~0); {8318#true} is VALID [2022-04-28 03:18:33,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {8318#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8344#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:18:33,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {8344#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8348#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-28 03:18:33,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {8348#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8352#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-28 03:18:33,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {8352#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__i~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8356#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:18:33,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {8356#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8360#(and (= 2 (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-28 03:18:33,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {8360#(and (= 2 (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8364#(and (= 2 (+ (- 4) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (- 3) main_~main__i~0)))} is VALID [2022-04-28 03:18:33,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {8364#(and (= 2 (+ (- 4) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8368#(and (= 7 main_~main__i~0) (= 3 (+ main_~main__sum~0 (- 18))))} is VALID [2022-04-28 03:18:33,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {8368#(and (= 7 main_~main__i~0) (= 3 (+ main_~main__sum~0 (- 18))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8372#(and (= 3 (+ main_~main__sum~0 (- 25))) (= 8 main_~main__i~0))} is VALID [2022-04-28 03:18:33,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {8372#(and (= 3 (+ main_~main__sum~0 (- 25))) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8376#(and (= (+ main_~main__sum~0 (- 33)) 3) (= 9 main_~main__i~0))} is VALID [2022-04-28 03:18:33,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {8376#(and (= (+ main_~main__sum~0 (- 33)) 3) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8380#(and (= (+ (- 1) main_~main__i~0) 9) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 32)) 3))} is VALID [2022-04-28 03:18:33,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {8380#(and (= (+ (- 1) main_~main__i~0) 9) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 32)) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8384#(and (= 3 (+ main_~main__sum~0 (- 52))) (= 11 main_~main__i~0))} is VALID [2022-04-28 03:18:33,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {8384#(and (= 3 (+ main_~main__sum~0 (- 52))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8388#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} is VALID [2022-04-28 03:18:33,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {8388#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8392#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-28 03:18:33,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {8392#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8396#(and (= (+ (- 1) main_~main__i~0) 13) (= 66 (+ (- 11) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-28 03:18:33,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {8396#(and (= (+ (- 1) main_~main__i~0) 13) (= 66 (+ (- 11) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8400#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 75)) (= (+ (- 2) main_~main__i~0) 13))} is VALID [2022-04-28 03:18:33,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {8400#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 75)) (= (+ (- 2) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8404#(and (= (+ (- 3) main_~main__i~0) 13) (= (+ (* 2 main_~main__i~0) 73) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:18:33,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {8404#(and (= (+ (- 3) main_~main__i~0) 13) (= (+ (* 2 main_~main__i~0) 73) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8408#(and (= (+ (* 2 main_~main__i~0) 71) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 4) main_~main__i~0) 13))} is VALID [2022-04-28 03:18:33,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {8408#(and (= (+ (* 2 main_~main__i~0) 71) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 4) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8412#(and (= (+ (- 5) main_~main__i~0) 13) (= main_~main__sum~0 (+ (* 5 main_~main__i~0) 63)))} is VALID [2022-04-28 03:18:33,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {8412#(and (= (+ (- 5) main_~main__i~0) 13) (= main_~main__sum~0 (+ (* 5 main_~main__i~0) 63)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8416#(and (= (+ (- 6) main_~main__i~0) 13) (= (+ (* 5 main_~main__i~0) 58) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:18:33,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {8416#(and (= (+ (- 6) main_~main__i~0) 13) (= (+ (* 5 main_~main__i~0) 58) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8420#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-28 03:18:33,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {8420#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8424#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} is VALID [2022-04-28 03:18:33,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {8424#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8428#(and (= (+ (- 1) main_~main__i~0) 21) (= main_~main__sum~0 (+ 209 main_~main__i~0)))} is VALID [2022-04-28 03:18:33,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {8428#(and (= (+ (- 1) main_~main__i~0) 21) (= main_~main__sum~0 (+ 209 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8432#(and (= main_~main__sum~0 253) (= 23 main_~main__i~0))} is VALID [2022-04-28 03:18:33,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {8432#(and (= main_~main__sum~0 253) (= 23 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8436#(and (= 253 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 23))} is VALID [2022-04-28 03:18:33,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {8436#(and (= 253 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 23))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8440#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2022-04-28 03:18:33,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {8440#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8444#(and (= 300 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 25))} is VALID [2022-04-28 03:18:33,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {8444#(and (= 300 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 25))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8448#(and (<= main_~main__i~0 27) (= (+ (- 51) main_~main__sum~0) 300) (<= 26 main_~main__n~0))} is VALID [2022-04-28 03:18:33,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {8448#(and (<= main_~main__i~0 27) (= (+ (- 51) main_~main__sum~0) 300) (<= 26 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8452#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:18:33,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {8452#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {8319#false} is VALID [2022-04-28 03:18:33,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {8319#false} assume !false; {8319#false} is VALID [2022-04-28 03:18:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:18:33,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:18:44,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {8319#false} assume !false; {8319#false} is VALID [2022-04-28 03:18:44,221 INFO L290 TraceCheckUtils]: 35: Hoare triple {8452#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {8319#false} is VALID [2022-04-28 03:18:44,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {8465#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8452#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:18:44,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8465#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:18:44,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {8318#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8469#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:18:44,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {8318#true} assume !!(1 <= ~main__n~0); {8318#true} is VALID [2022-04-28 03:18:44,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {8318#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {8318#true} is VALID [2022-04-28 03:18:44,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {8318#true} call #t~ret5 := main(); {8318#true} is VALID [2022-04-28 03:18:44,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8318#true} {8318#true} #38#return; {8318#true} is VALID [2022-04-28 03:18:44,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {8318#true} assume true; {8318#true} is VALID [2022-04-28 03:18:44,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {8318#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {8318#true} is VALID [2022-04-28 03:18:44,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {8318#true} call ULTIMATE.init(); {8318#true} is VALID [2022-04-28 03:18:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-28 03:18:44,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:18:44,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687635015] [2022-04-28 03:18:44,880 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:18:44,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394343744] [2022-04-28 03:18:44,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394343744] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:18:44,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:18:44,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 5] total 32 [2022-04-28 03:18:44,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:18:44,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1836355776] [2022-04-28 03:18:44,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1836355776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:18:44,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:18:44,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 03:18:44,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002322981] [2022-04-28 03:18:44,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:18:44,881 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-28 03:18:44,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:18:44,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:44,928 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 03:18:44,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 03:18:44,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:44,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 03:18:44,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:18:44,929 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:47,424 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 03:18:47,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 03:18:47,424 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-28 03:18:47,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:18:47,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-04-28 03:18:47,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:47,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-04-28 03:18:47,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 42 transitions. [2022-04-28 03:18:47,485 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 03:18:47,486 INFO L225 Difference]: With dead ends: 42 [2022-04-28 03:18:47,486 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 03:18:47,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 17 SyntacticMatches, 26 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:18:47,487 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:18:47,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 234 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 03:18:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 03:18:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 03:18:47,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:18:47,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:47,541 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:47,541 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:47,542 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 03:18:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 03:18:47,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:47,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:47,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:18:47,542 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:18:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:47,543 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 03:18:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 03:18:47,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:47,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:47,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:18:47,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:18:47,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-28 03:18:47,544 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-28 03:18:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:18:47,544 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-28 03:18:47,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:18:47,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-28 03:18:47,614 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 03:18:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 03:18:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 03:18:47,614 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:18:47,614 INFO L195 NwaCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:18:47,631 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 03:18:47,819 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 03:18:47,820 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:18:47,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:18:47,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1567855147, now seen corresponding path program 53 times [2022-04-28 03:18:47,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:47,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1582323258] [2022-04-28 03:18:47,820 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:18:47,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1567855147, now seen corresponding path program 54 times [2022-04-28 03:18:47,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:18:47,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061670482] [2022-04-28 03:18:47,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:47,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:18:47,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:18:47,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1228371042] [2022-04-28 03:18:47,840 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:18:47,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:18:47,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:18:47,841 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 03:18:47,844 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 03:18:47,902 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-28 03:18:47,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:18:47,903 WARN L261 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 116 conjunts are in the unsatisfiable core [2022-04-28 03:18:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:47,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:18:48,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {8813#true} call ULTIMATE.init(); {8813#true} is VALID [2022-04-28 03:18:48,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {8813#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {8813#true} is VALID [2022-04-28 03:18:48,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {8813#true} assume true; {8813#true} is VALID [2022-04-28 03:18:48,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8813#true} {8813#true} #38#return; {8813#true} is VALID [2022-04-28 03:18:48,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {8813#true} call #t~ret5 := main(); {8813#true} is VALID [2022-04-28 03:18:48,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {8813#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {8813#true} is VALID [2022-04-28 03:18:48,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {8813#true} assume !!(1 <= ~main__n~0); {8813#true} is VALID [2022-04-28 03:18:48,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {8813#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8839#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:18:48,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {8839#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8843#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-28 03:18:48,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {8843#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8847#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-28 03:18:48,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {8847#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8851#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0))} is VALID [2022-04-28 03:18:48,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {8851#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8855#(and (= 2 (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 5) 0))} is VALID [2022-04-28 03:18:48,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {8855#(and (= 2 (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 5) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8859#(and (= 2 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ (- 9) (* 4 main_~main__i~0))))} is VALID [2022-04-28 03:18:48,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {8859#(and (= 2 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ (- 9) (* 4 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8863#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} is VALID [2022-04-28 03:18:48,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {8863#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8867#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-28 03:18:48,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {8867#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8871#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-28 03:18:48,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {8871#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8875#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} is VALID [2022-04-28 03:18:48,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {8875#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8879#(and (= 9 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 33)))} is VALID [2022-04-28 03:18:48,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {8879#(and (= 9 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 33)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8883#(and (= 9 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 31) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:18:48,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {8883#(and (= 9 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 31) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8887#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} is VALID [2022-04-28 03:18:48,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {8887#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8891#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 22)) 55) (= (+ (- 1) main_~main__i~0) 13))} is VALID [2022-04-28 03:18:48,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {8891#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 22)) 55) (= (+ (- 1) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8895#(and (= 55 (+ main_~main__sum~0 (- 50))) (= 15 main_~main__i~0))} is VALID [2022-04-28 03:18:48,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {8895#(and (= 55 (+ main_~main__sum~0 (- 50))) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8899#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} is VALID [2022-04-28 03:18:48,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {8899#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8903#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 103))) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 104))))} is VALID [2022-04-28 03:18:48,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {8903#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 103))) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 104))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8907#(and (= (+ (- 102) main_~main__sum~0 (* (- 2) main_~main__i~0)) 15) (= (+ (- 2) main_~main__i~0) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 101))))} is VALID [2022-04-28 03:18:48,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {8907#(and (= (+ (- 102) main_~main__sum~0 (* (- 2) main_~main__i~0)) 15) (= (+ (- 2) main_~main__i~0) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 101))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8911#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 98)) (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 99)) 15))} is VALID [2022-04-28 03:18:48,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {8911#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 98)) (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 99)) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8915#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 95)) 15) (= (+ (- 94) main_~main__sum~0 (* (- 4) main_~main__i~0)) (+ (- 4) main_~main__i~0)))} is VALID [2022-04-28 03:18:48,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {8915#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 95)) 15) (= (+ (- 94) main_~main__sum~0 (* (- 4) main_~main__i~0)) (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8919#(and (= (+ (* 5 main_~main__i~0) 105) main_~main__sum~0) (= 16 (+ (- 5) main_~main__i~0)))} is VALID [2022-04-28 03:18:48,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {8919#(and (= (+ (* 5 main_~main__i~0) 105) main_~main__sum~0) (= 16 (+ (- 5) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8923#(and (= 22 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 210))} is VALID [2022-04-28 03:18:48,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {8923#(and (= 22 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8927#(and (= main_~main__sum~0 (+ main_~main__i~0 230)) (= (+ (- 1) main_~main__i~0) 22))} is VALID [2022-04-28 03:18:48,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {8927#(and (= main_~main__sum~0 (+ main_~main__i~0 230)) (= (+ (- 1) main_~main__i~0) 22))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8931#(and (= (+ 228 (* 2 main_~main__i~0)) main_~main__sum~0) (= 22 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-28 03:18:48,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {8931#(and (= (+ 228 (* 2 main_~main__i~0)) main_~main__sum~0) (= 22 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8935#(and (= 25 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 24))))} is VALID [2022-04-28 03:18:48,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {8935#(and (= 25 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 24))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8939#(and (= (+ (- 1) main_~main__i~0) 25) (= 276 (+ main_~main__sum~0 (- 23) (* (- 1) main_~main__i~0))))} is VALID [2022-04-28 03:18:48,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {8939#(and (= (+ (- 1) main_~main__i~0) 25) (= 276 (+ main_~main__sum~0 (- 23) (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8943#(and (= 276 (+ main_~main__sum~0 (- 75))) (= main_~main__i~0 27))} is VALID [2022-04-28 03:18:48,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {8943#(and (= 276 (+ main_~main__sum~0 (- 75))) (= main_~main__i~0 27))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8947#(and (<= main_~main__i~0 28) (= 276 (+ (- 102) main_~main__sum~0)) (<= 27 main_~main__n~0))} is VALID [2022-04-28 03:18:48,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {8947#(and (<= main_~main__i~0 28) (= 276 (+ (- 102) main_~main__sum~0)) (<= 27 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8951#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:18:48,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {8951#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {8814#false} is VALID [2022-04-28 03:18:48,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {8814#false} assume !false; {8814#false} is VALID [2022-04-28 03:18:48,738 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:18:48,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:19:01,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {8814#false} assume !false; {8814#false} is VALID [2022-04-28 03:19:01,486 INFO L290 TraceCheckUtils]: 36: Hoare triple {8951#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {8814#false} is VALID [2022-04-28 03:19:01,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {8964#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8951#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:19:01,492 INFO L290 TraceCheckUtils]: 34: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8964#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:19:01,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:01,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:02,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:02,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:02,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:02,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:06,202 WARN L290 TraceCheckUtils]: 11: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is UNKNOWN [2022-04-28 03:19:06,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:06,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:06,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:06,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {8813#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:06,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {8813#true} assume !!(1 <= ~main__n~0); {8813#true} is VALID [2022-04-28 03:19:06,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {8813#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {8813#true} is VALID [2022-04-28 03:19:06,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {8813#true} call #t~ret5 := main(); {8813#true} is VALID [2022-04-28 03:19:06,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8813#true} {8813#true} #38#return; {8813#true} is VALID [2022-04-28 03:19:06,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {8813#true} assume true; {8813#true} is VALID [2022-04-28 03:19:06,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {8813#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {8813#true} is VALID [2022-04-28 03:19:06,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {8813#true} call ULTIMATE.init(); {8813#true} is VALID [2022-04-28 03:19:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2022-04-28 03:19:06,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:19:06,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061670482] [2022-04-28 03:19:06,299 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:19:06,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228371042] [2022-04-28 03:19:06,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228371042] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:19:06,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:19:06,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 5] total 33 [2022-04-28 03:19:06,300 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:19:06,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1582323258] [2022-04-28 03:19:06,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1582323258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:19:06,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:19:06,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 03:19:06,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910574734] [2022-04-28 03:19:06,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:19:06,300 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:19:06,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:19:06,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:06,341 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 03:19:06,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 03:19:06,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:06,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 03:19:06,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:19:06,342 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:09,388 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 03:19:09,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 03:19:09,388 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:19:09,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:19:09,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:09,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-04-28 03:19:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-04-28 03:19:09,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 43 transitions. [2022-04-28 03:19:09,438 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 03:19:09,439 INFO L225 Difference]: With dead ends: 43 [2022-04-28 03:19:09,439 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 03:19:09,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 17 SyntacticMatches, 27 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 03:19:09,440 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:19:09,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 242 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 03:19:09,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 03:19:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-28 03:19:09,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:19:09,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:09,483 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:09,483 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:09,484 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 03:19:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 03:19:09,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:09,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:09,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-28 03:19:09,484 INFO L87 Difference]: Start difference. First operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-28 03:19:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:09,485 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 03:19:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 03:19:09,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:09,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:09,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:19:09,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:19:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-28 03:19:09,486 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-28 03:19:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:19:09,486 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-28 03:19:09,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:09,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-28 03:19:09,561 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 03:19:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 03:19:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 03:19:09,562 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:19:09,562 INFO L195 NwaCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:19:09,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-28 03:19:09,762 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 03:19:09,763 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:19:09,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:19:09,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1358806833, now seen corresponding path program 55 times [2022-04-28 03:19:09,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:09,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1447914265] [2022-04-28 03:19:09,763 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:19:09,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1358806833, now seen corresponding path program 56 times [2022-04-28 03:19:09,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:19:09,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259970590] [2022-04-28 03:19:09,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:19:09,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:19:09,778 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:19:09,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1660541892] [2022-04-28 03:19:09,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:19:09,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:19:09,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:19:09,780 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 03:19:09,780 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 03:19:09,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:19:09,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:19:09,835 WARN L261 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 120 conjunts are in the unsatisfiable core [2022-04-28 03:19:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:09,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:19:10,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {9321#true} call ULTIMATE.init(); {9321#true} is VALID [2022-04-28 03:19:10,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {9321#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {9321#true} is VALID [2022-04-28 03:19:10,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {9321#true} assume true; {9321#true} is VALID [2022-04-28 03:19:10,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9321#true} {9321#true} #38#return; {9321#true} is VALID [2022-04-28 03:19:10,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {9321#true} call #t~ret5 := main(); {9321#true} is VALID [2022-04-28 03:19:10,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {9321#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {9321#true} is VALID [2022-04-28 03:19:10,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {9321#true} assume !!(1 <= ~main__n~0); {9321#true} is VALID [2022-04-28 03:19:10,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {9321#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9347#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:19:10,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {9347#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9351#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-28 03:19:10,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {9351#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9355#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-28 03:19:10,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {9355#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9359#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ (* 2 main_~main__i~0) (- 5)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:19:10,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {9359#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ (* 2 main_~main__i~0) (- 5)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9363#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} is VALID [2022-04-28 03:19:10,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {9363#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9367#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 6)) 3))} is VALID [2022-04-28 03:19:10,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {9367#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 6)) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9371#(and (= 5 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 7)))} is VALID [2022-04-28 03:19:10,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {9371#(and (= 5 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 7)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9375#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-28 03:19:10,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {9375#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9379#(and (= (+ main_~main__sum~0 (- 27)) main_~main__i~0) (= 8 (+ main_~main__sum~0 (- 28))))} is VALID [2022-04-28 03:19:10,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {9379#(and (= (+ main_~main__sum~0 (- 27)) main_~main__i~0) (= 8 (+ main_~main__sum~0 (- 28))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9383#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} is VALID [2022-04-28 03:19:10,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {9383#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9387#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-28 03:19:10,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {9387#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9391#(and (= main_~main__sum~0 (+ main_~main__i~0 54)) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-28 03:19:10,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {9391#(and (= main_~main__sum~0 (+ main_~main__i~0 54)) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9395#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 52) main_~main__sum~0))} is VALID [2022-04-28 03:19:10,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {9395#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 52) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9399#(and (= (+ (- 3) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 50) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:19:10,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {9399#(and (= (+ (- 3) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 50) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9403#(and (= (+ (- 4) main_~main__i~0) 11) (= (+ (* 4 main_~main__i~0) 45) main_~main__sum~0))} is VALID [2022-04-28 03:19:10,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {9403#(and (= (+ (- 4) main_~main__i~0) 11) (= (+ (* 4 main_~main__i~0) 45) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9407#(and (= (+ (- 5) main_~main__i~0) 11) (= (+ 41 (* 4 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:19:10,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {9407#(and (= (+ (- 5) main_~main__i~0) 11) (= (+ 41 (* 4 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9411#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 31)) 105))} is VALID [2022-04-28 03:19:10,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {9411#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 31)) 105))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9415#(and (= (+ (- 1) main_~main__i~0) 17) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 30)) 105))} is VALID [2022-04-28 03:19:10,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {9415#(and (= (+ (- 1) main_~main__i~0) 17) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 30)) 105))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9419#(and (= (+ (- 2) main_~main__i~0) 17) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 133)))} is VALID [2022-04-28 03:19:10,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {9419#(and (= (+ (- 2) main_~main__i~0) 17) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 133)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9423#(and (= (+ (- 3) main_~main__i~0) 17) (= (+ 131 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:19:10,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {9423#(and (= (+ (- 3) main_~main__i~0) 17) (= (+ 131 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9427#(and (= 21 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 171))} is VALID [2022-04-28 03:19:10,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {9427#(and (= 21 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9431#(and (= (+ (- 38) main_~main__sum~0 (* (- 1) main_~main__i~0)) 171) (= (+ (- 1) main_~main__i~0) 21))} is VALID [2022-04-28 03:19:10,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {9431#(and (= (+ (- 38) main_~main__sum~0 (* (- 1) main_~main__i~0)) 171) (= (+ (- 1) main_~main__i~0) 21))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9435#(and (= 171 (+ main_~main__sum~0 (- 82))) (= 23 main_~main__i~0))} is VALID [2022-04-28 03:19:10,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {9435#(and (= 171 (+ main_~main__sum~0 (- 82))) (= 23 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9439#(and (= (+ (- 1) main_~main__i~0) 23) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 81)) 171))} is VALID [2022-04-28 03:19:10,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {9439#(and (= (+ (- 1) main_~main__i~0) 23) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 81)) 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9443#(and (= 23 (+ (- 2) main_~main__i~0)) (= 171 (+ (- 79) main_~main__sum~0 (* (- 2) main_~main__i~0))))} is VALID [2022-04-28 03:19:10,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {9443#(and (= 23 (+ (- 2) main_~main__i~0)) (= 171 (+ (- 79) main_~main__sum~0 (* (- 2) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9447#(and (= 23 (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 76)) 171))} is VALID [2022-04-28 03:19:10,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {9447#(and (= 23 (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 76)) 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9451#(and (= 23 (+ (- 4) main_~main__i~0)) (= 171 (+ main_~main__sum~0 (- 72) (* (- 4) main_~main__i~0))))} is VALID [2022-04-28 03:19:10,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {9451#(and (= 23 (+ (- 4) main_~main__i~0)) (= 171 (+ main_~main__sum~0 (- 72) (* (- 4) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9455#(and (= (+ (- 207) main_~main__sum~0) 171) (= 28 main_~main__i~0))} is VALID [2022-04-28 03:19:10,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {9455#(and (= (+ (- 207) main_~main__sum~0) 171) (= 28 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9459#(and (<= 28 main_~main__n~0) (= 171 (+ main_~main__sum~0 (- 235))) (<= main_~main__i~0 29))} is VALID [2022-04-28 03:19:10,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {9459#(and (<= 28 main_~main__n~0) (= 171 (+ main_~main__sum~0 (- 235))) (<= main_~main__i~0 29))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9463#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:19:10,691 INFO L290 TraceCheckUtils]: 37: Hoare triple {9463#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {9322#false} is VALID [2022-04-28 03:19:10,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {9322#false} assume !false; {9322#false} is VALID [2022-04-28 03:19:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:19:10,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:19:25,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {9322#false} assume !false; {9322#false} is VALID [2022-04-28 03:19:25,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {9463#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {9322#false} is VALID [2022-04-28 03:19:25,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {9476#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9463#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:19:25,656 INFO L290 TraceCheckUtils]: 35: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9476#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:19:25,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:25,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:25,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:25,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:25,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:25,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:25,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:25,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:25,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:25,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:25,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {9321#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9480#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:26,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {9321#true} assume !!(1 <= ~main__n~0); {9321#true} is VALID [2022-04-28 03:19:26,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {9321#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {9321#true} is VALID [2022-04-28 03:19:26,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {9321#true} call #t~ret5 := main(); {9321#true} is VALID [2022-04-28 03:19:26,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9321#true} {9321#true} #38#return; {9321#true} is VALID [2022-04-28 03:19:26,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {9321#true} assume true; {9321#true} is VALID [2022-04-28 03:19:26,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {9321#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {9321#true} is VALID [2022-04-28 03:19:26,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {9321#true} call ULTIMATE.init(); {9321#true} is VALID [2022-04-28 03:19:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-04-28 03:19:26,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:19:26,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259970590] [2022-04-28 03:19:26,450 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:19:26,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660541892] [2022-04-28 03:19:26,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660541892] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:19:26,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:19:26,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 5] total 34 [2022-04-28 03:19:26,450 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:19:26,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1447914265] [2022-04-28 03:19:26,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1447914265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:19:26,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:19:26,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 03:19:26,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477087806] [2022-04-28 03:19:26,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:19:26,451 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 03:19:26,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:19:26,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:26,493 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 03:19:26,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 03:19:26,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:26,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 03:19:26,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1028, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 03:19:26,495 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:29,832 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 03:19:29,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 03:19:29,833 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 03:19:29,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:19:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-04-28 03:19:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:29,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-04-28 03:19:29,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 44 transitions. [2022-04-28 03:19:29,884 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 03:19:29,885 INFO L225 Difference]: With dead ends: 44 [2022-04-28 03:19:29,885 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 03:19:29,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 17 SyntacticMatches, 28 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 03:19:29,886 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:19:29,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 250 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 03:19:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 03:19:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-28 03:19:29,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:19:29,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:29,935 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:29,936 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:29,936 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 03:19:29,936 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 03:19:29,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:29,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:29,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:19:29,936 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:19:29,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:29,937 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 03:19:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 03:19:29,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:29,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:29,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:19:29,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:19:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-28 03:19:29,938 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-28 03:19:29,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:19:29,938 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-28 03:19:29,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:29,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-28 03:19:30,028 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 03:19:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 03:19:30,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 03:19:30,029 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:19:30,029 INFO L195 NwaCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:19:30,045 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 03:19:30,229 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 03:19:30,229 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:19:30,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:19:30,230 INFO L85 PathProgramCache]: Analyzing trace with hash -826723605, now seen corresponding path program 57 times [2022-04-28 03:19:30,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:30,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1879227922] [2022-04-28 03:19:30,231 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:19:30,231 INFO L85 PathProgramCache]: Analyzing trace with hash -826723605, now seen corresponding path program 58 times [2022-04-28 03:19:30,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:19:30,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968987571] [2022-04-28 03:19:30,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:19:30,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:19:30,252 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:19:30,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [222340094] [2022-04-28 03:19:30,252 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:19:30,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:19:30,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:19:30,253 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 03:19:30,254 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 03:19:30,306 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:19:30,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:19:30,308 WARN L261 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 124 conjunts are in the unsatisfiable core [2022-04-28 03:19:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:30,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:19:31,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {9842#true} call ULTIMATE.init(); {9842#true} is VALID [2022-04-28 03:19:31,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {9842#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {9842#true} is VALID [2022-04-28 03:19:31,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {9842#true} assume true; {9842#true} is VALID [2022-04-28 03:19:31,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9842#true} {9842#true} #38#return; {9842#true} is VALID [2022-04-28 03:19:31,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {9842#true} call #t~ret5 := main(); {9842#true} is VALID [2022-04-28 03:19:31,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {9842#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {9842#true} is VALID [2022-04-28 03:19:31,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {9842#true} assume !!(1 <= ~main__n~0); {9842#true} is VALID [2022-04-28 03:19:31,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {9842#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9868#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:19:31,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {9868#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9872#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-28 03:19:31,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {9872#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9876#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-28 03:19:31,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {9876#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9880#(and (= (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-28 03:19:31,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {9880#(and (= (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (= (+ (- 1) main_~main__i~0) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9884#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-28 03:19:31,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {9884#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9888#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-28 03:19:31,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {9888#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9892#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} is VALID [2022-04-28 03:19:31,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {9892#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9896#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} is VALID [2022-04-28 03:19:31,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {9896#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9900#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-28 03:19:31,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {9900#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9904#(and (= (+ (- 9) main_~main__sum~0) 36) (= 10 main_~main__i~0))} is VALID [2022-04-28 03:19:31,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {9904#(and (= (+ (- 9) main_~main__sum~0) 36) (= 10 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9908#(and (= (+ main_~main__sum~0 (- 19)) 36) (= 11 main_~main__i~0))} is VALID [2022-04-28 03:19:31,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {9908#(and (= (+ main_~main__sum~0 (- 19)) 36) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9912#(and (= 12 main_~main__i~0) (= 36 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-28 03:19:31,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {9912#(and (= 12 main_~main__i~0) (= 36 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9916#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-28 03:19:31,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {9916#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9920#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-28 03:19:31,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {9920#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9924#(and (= (+ (- 1) main_~main__i~0) 14) (= main_~main__sum~0 (+ 90 main_~main__i~0)))} is VALID [2022-04-28 03:19:31,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {9924#(and (= (+ (- 1) main_~main__i~0) 14) (= main_~main__sum~0 (+ 90 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9928#(and (= (+ 89 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 14 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-28 03:19:31,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {9928#(and (= (+ 89 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 14 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9932#(and (= (+ 88 main_~main__i~0) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= 14 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-28 03:19:31,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {9932#(and (= (+ 88 main_~main__i~0) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= 14 (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9936#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 81)) (= 14 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-28 03:19:31,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {9936#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 81)) (= 14 (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9940#(and (= 14 (+ (- 5) main_~main__i~0)) (= (+ 77 (* 4 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:19:31,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {9940#(and (= 14 (+ (- 5) main_~main__i~0)) (= (+ 77 (* 4 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9944#(and (= (+ (- 6) main_~main__i~0) 14) (= (+ (* 4 main_~main__i~0) 73) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-28 03:19:31,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {9944#(and (= (+ (- 6) main_~main__i~0) 14) (= (+ (* 4 main_~main__i~0) 73) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9948#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 4 main_~main__i~0) 69)) (= 14 (+ (- 7) main_~main__i~0)))} is VALID [2022-04-28 03:19:31,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {9948#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 4 main_~main__i~0) 69)) (= 14 (+ (- 7) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9952#(and (= (+ (* 4 main_~main__i~0) 65) (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)) (= 14 (+ main_~main__i~0 (- 8))))} is VALID [2022-04-28 03:19:31,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {9952#(and (= (+ (* 4 main_~main__i~0) 65) (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)) (= 14 (+ main_~main__i~0 (- 8))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9956#(and (= (+ (- 9) main_~main__i~0) 14) (= (+ main_~main__sum~0 15 (* (- 5) main_~main__i~0)) (+ (* 4 main_~main__i~0) 61)))} is VALID [2022-04-28 03:19:31,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {9956#(and (= (+ (- 9) main_~main__i~0) 14) (= (+ main_~main__sum~0 15 (* (- 5) main_~main__i~0)) (+ (* 4 main_~main__i~0) 61)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9960#(and (= main_~main__sum~0 276) (= main_~main__i~0 24))} is VALID [2022-04-28 03:19:31,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {9960#(and (= main_~main__sum~0 276) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9964#(and (= (+ (- 1) main_~main__i~0) 24) (= main_~main__sum~0 (+ 275 main_~main__i~0)))} is VALID [2022-04-28 03:19:31,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {9964#(and (= (+ (- 1) main_~main__i~0) 24) (= main_~main__sum~0 (+ 275 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9968#(and (= 26 main_~main__i~0) (= (+ main_~main__sum~0 (- 25)) 300))} is VALID [2022-04-28 03:19:31,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {9968#(and (= 26 main_~main__i~0) (= (+ main_~main__sum~0 (- 25)) 300))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9972#(and (= (+ (- 51) main_~main__sum~0) 300) (= main_~main__i~0 27))} is VALID [2022-04-28 03:19:31,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {9972#(and (= (+ (- 51) main_~main__sum~0) 300) (= main_~main__i~0 27))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9976#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2022-04-28 03:19:31,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {9976#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9980#(and (= 378 (+ main_~main__sum~0 (- 28))) (= 29 main_~main__i~0))} is VALID [2022-04-28 03:19:31,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {9980#(and (= 378 (+ main_~main__sum~0 (- 28))) (= 29 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9984#(and (= 378 (+ main_~main__sum~0 (- 57))) (<= main_~main__i~0 30) (<= 29 main_~main__n~0))} is VALID [2022-04-28 03:19:31,135 INFO L290 TraceCheckUtils]: 37: Hoare triple {9984#(and (= 378 (+ main_~main__sum~0 (- 57))) (<= main_~main__i~0 30) (<= 29 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9988#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:19:31,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {9988#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {9843#false} is VALID [2022-04-28 03:19:31,136 INFO L290 TraceCheckUtils]: 39: Hoare triple {9843#false} assume !false; {9843#false} is VALID [2022-04-28 03:19:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:19:31,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:19:48,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {9843#false} assume !false; {9843#false} is VALID [2022-04-28 03:19:48,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {9988#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {9843#false} is VALID [2022-04-28 03:19:48,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {10001#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9988#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:19:48,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10001#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:19:48,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:48,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:49,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:49,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:49,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:49,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:49,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:49,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:49,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:49,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:49,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {9842#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10005#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:19:49,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {9842#true} assume !!(1 <= ~main__n~0); {9842#true} is VALID [2022-04-28 03:19:49,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {9842#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {9842#true} is VALID [2022-04-28 03:19:49,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {9842#true} call #t~ret5 := main(); {9842#true} is VALID [2022-04-28 03:19:49,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9842#true} {9842#true} #38#return; {9842#true} is VALID [2022-04-28 03:19:49,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {9842#true} assume true; {9842#true} is VALID [2022-04-28 03:19:49,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {9842#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {9842#true} is VALID [2022-04-28 03:19:49,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {9842#true} call ULTIMATE.init(); {9842#true} is VALID [2022-04-28 03:19:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2022-04-28 03:19:49,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:19:49,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968987571] [2022-04-28 03:19:49,210 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:19:49,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222340094] [2022-04-28 03:19:49,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222340094] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:19:49,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:19:49,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 5] total 35 [2022-04-28 03:19:49,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:19:49,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1879227922] [2022-04-28 03:19:49,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1879227922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:19:49,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:19:49,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 03:19:49,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007190184] [2022-04-28 03:19:49,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:19:49,212 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:19:49,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:19:49,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:49,262 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 03:19:49,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 03:19:49,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:49,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 03:19:49,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1093, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 03:19:49,263 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 33 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:53,006 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 03:19:53,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 03:19:53,006 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:19:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:19:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2022-04-28 03:19:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2022-04-28 03:19:53,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 45 transitions. [2022-04-28 03:19:53,061 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 03:19:53,062 INFO L225 Difference]: With dead ends: 45 [2022-04-28 03:19:53,062 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 03:19:53,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 17 SyntacticMatches, 29 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 03:19:53,063 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:19:53,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 258 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 03:19:53,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 03:19:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-28 03:19:53,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:19:53,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:53,122 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:53,122 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:53,122 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 03:19:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 03:19:53,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:53,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:53,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 03:19:53,123 INFO L87 Difference]: Start difference. First operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 03:19:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:53,123 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 03:19:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 03:19:53,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:53,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:53,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:19:53,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:19:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-28 03:19:53,125 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-04-28 03:19:53,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:19:53,125 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-28 03:19:53,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:19:53,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-28 03:19:53,224 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 03:19:53,225 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 03:19:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 03:19:53,225 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:19:53,225 INFO L195 NwaCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:19:53,244 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 03:19:53,435 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 03:19:53,435 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:19:53,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:19:53,436 INFO L85 PathProgramCache]: Analyzing trace with hash 141309553, now seen corresponding path program 59 times [2022-04-28 03:19:53,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:53,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2097580719] [2022-04-28 03:19:53,436 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:19:53,436 INFO L85 PathProgramCache]: Analyzing trace with hash 141309553, now seen corresponding path program 60 times [2022-04-28 03:19:53,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:19:53,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990910387] [2022-04-28 03:19:53,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:19:53,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:19:53,454 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:19:53,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413152563] [2022-04-28 03:19:53,454 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:19:53,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:19:53,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:19:53,455 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 03:19:53,458 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 03:19:53,520 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 03:19:53,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:19:53,522 WARN L261 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 128 conjunts are in the unsatisfiable core [2022-04-28 03:19:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:53,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:19:54,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {10376#true} call ULTIMATE.init(); {10376#true} is VALID [2022-04-28 03:19:54,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {10376#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {10376#true} is VALID [2022-04-28 03:19:54,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {10376#true} assume true; {10376#true} is VALID [2022-04-28 03:19:54,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10376#true} {10376#true} #38#return; {10376#true} is VALID [2022-04-28 03:19:54,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {10376#true} call #t~ret5 := main(); {10376#true} is VALID [2022-04-28 03:19:54,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {10376#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {10376#true} is VALID [2022-04-28 03:19:54,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {10376#true} assume !!(1 <= ~main__n~0); {10376#true} is VALID [2022-04-28 03:19:54,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {10376#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10402#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:19:54,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {10402#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10406#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-28 03:19:54,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {10406#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10410#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-28 03:19:54,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {10410#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10414#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-28 03:19:54,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {10414#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10418#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} is VALID [2022-04-28 03:19:54,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {10418#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10422#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-28 03:19:54,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {10422#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10426#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} is VALID [2022-04-28 03:19:54,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {10426#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10430#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} is VALID [2022-04-28 03:19:54,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {10430#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10434#(and (= (+ (- 1) main_~main__i~0) 8) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 17)) 10))} is VALID [2022-04-28 03:19:54,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {10434#(and (= (+ (- 1) main_~main__i~0) 8) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 17)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10438#(and (= (+ main_~main__sum~0 (- 35)) 10) (= 10 main_~main__i~0))} is VALID [2022-04-28 03:19:54,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {10438#(and (= (+ main_~main__sum~0 (- 35)) 10) (= 10 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10442#(and (= (+ main_~main__sum~0 (- 44)) main_~main__i~0) (= (+ (- 45) main_~main__sum~0) 10))} is VALID [2022-04-28 03:19:54,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {10442#(and (= (+ main_~main__sum~0 (- 44)) main_~main__i~0) (= (+ (- 45) main_~main__sum~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10446#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 44)) 10) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 43))))} is VALID [2022-04-28 03:19:54,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {10446#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 44)) 10) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 43))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10450#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 39)) (= (+ (- 3) main_~main__i~0) 10))} is VALID [2022-04-28 03:19:54,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {10450#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 39)) (= (+ (- 3) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10454#(and (= (+ (* 3 main_~main__i~0) 36) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 10))} is VALID [2022-04-28 03:19:54,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {10454#(and (= (+ (* 3 main_~main__i~0) 36) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10458#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2022-04-28 03:19:54,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {10458#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10462#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} is VALID [2022-04-28 03:19:54,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {10462#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10466#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-28 03:19:54,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {10466#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10470#(and (= 16 (+ (- 2) main_~main__i~0)) (= (+ 118 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:19:54,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {10470#(and (= 16 (+ (- 2) main_~main__i~0)) (= (+ 118 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10474#(and (= 19 main_~main__i~0) (= (+ main_~main__sum~0 (- 35)) 136))} is VALID [2022-04-28 03:19:54,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {10474#(and (= 19 main_~main__i~0) (= (+ main_~main__sum~0 (- 35)) 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10478#(and (= 20 main_~main__i~0) (= (+ main_~main__sum~0 (- 54)) 136))} is VALID [2022-04-28 03:19:54,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {10478#(and (= 20 main_~main__i~0) (= (+ main_~main__sum~0 (- 54)) 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10482#(and (= (+ (- 1) main_~main__i~0) 20) (= (+ (- 53) main_~main__sum~0 (* (- 1) main_~main__i~0)) 136))} is VALID [2022-04-28 03:19:54,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {10482#(and (= (+ (- 1) main_~main__i~0) 20) (= (+ (- 53) main_~main__sum~0 (* (- 1) main_~main__i~0)) 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10486#(and (= 22 main_~main__i~0) (= 136 (+ main_~main__sum~0 (- 95))))} is VALID [2022-04-28 03:19:54,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {10486#(and (= 22 main_~main__i~0) (= 136 (+ main_~main__sum~0 (- 95))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10490#(and (= (+ main_~main__sum~0 (- 231)) 22) (= (+ main_~main__sum~0 (- 230)) main_~main__i~0))} is VALID [2022-04-28 03:19:54,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {10490#(and (= (+ main_~main__sum~0 (- 231)) 22) (= (+ main_~main__sum~0 (- 230)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10494#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 229))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 230)) 22))} is VALID [2022-04-28 03:19:54,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {10494#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 229))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 230)) 22))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10498#(and (= (+ (- 227) main_~main__sum~0 (* (- 2) main_~main__i~0)) (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 228)) 22))} is VALID [2022-04-28 03:19:54,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {10498#(and (= (+ (- 227) main_~main__sum~0 (* (- 2) main_~main__i~0)) (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 228)) 22))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10502#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 224)) (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 225)) 22))} is VALID [2022-04-28 03:19:54,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {10502#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 224)) (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 225)) 22))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10506#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 220)) (+ (- 4) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 221)) 22))} is VALID [2022-04-28 03:19:54,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {10506#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 220)) (+ (- 4) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 221)) 22))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10510#(and (= (+ (- 5) main_~main__i~0) (+ main_~main__sum~0 (- 215) (* (- 5) main_~main__i~0))) (= 22 (+ (- 216) main_~main__sum~0 (* (- 5) main_~main__i~0))))} is VALID [2022-04-28 03:19:54,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {10510#(and (= (+ (- 5) main_~main__i~0) (+ main_~main__sum~0 (- 215) (* (- 5) main_~main__i~0))) (= 22 (+ (- 216) main_~main__sum~0 (* (- 5) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10514#(and (= main_~main__sum~0 (+ 203 (* 7 main_~main__i~0))) (= 22 (+ (- 7) main_~main__i~0)))} is VALID [2022-04-28 03:19:54,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {10514#(and (= main_~main__sum~0 (+ 203 (* 7 main_~main__i~0))) (= 22 (+ (- 7) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10518#(and (= (+ 196 (* 7 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 22 (+ main_~main__i~0 (- 8))))} is VALID [2022-04-28 03:19:54,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {10518#(and (= (+ 196 (* 7 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 22 (+ main_~main__i~0 (- 8))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10522#(and (<= 30 main_~main__n~0) (<= main_~main__i~0 31) (= main_~main__sum~0 465))} is VALID [2022-04-28 03:19:54,537 INFO L290 TraceCheckUtils]: 38: Hoare triple {10522#(and (<= 30 main_~main__n~0) (<= main_~main__i~0 31) (= main_~main__sum~0 465))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10526#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:19:54,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {10526#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {10377#false} is VALID [2022-04-28 03:19:54,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {10377#false} assume !false; {10377#false} is VALID [2022-04-28 03:19:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:19:54,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:20:14,911 INFO L290 TraceCheckUtils]: 40: Hoare triple {10377#false} assume !false; {10377#false} is VALID [2022-04-28 03:20:14,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {10526#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {10377#false} is VALID [2022-04-28 03:20:14,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {10539#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10526#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:20:14,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10539#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:20:14,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:14,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,020 INFO L290 TraceCheckUtils]: 34: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {10376#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10543#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:15,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {10376#true} assume !!(1 <= ~main__n~0); {10376#true} is VALID [2022-04-28 03:20:15,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {10376#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {10376#true} is VALID [2022-04-28 03:20:15,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {10376#true} call #t~ret5 := main(); {10376#true} is VALID [2022-04-28 03:20:15,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10376#true} {10376#true} #38#return; {10376#true} is VALID [2022-04-28 03:20:15,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {10376#true} assume true; {10376#true} is VALID [2022-04-28 03:20:15,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {10376#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {10376#true} is VALID [2022-04-28 03:20:15,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {10376#true} call ULTIMATE.init(); {10376#true} is VALID [2022-04-28 03:20:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-04-28 03:20:15,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:20:15,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990910387] [2022-04-28 03:20:15,869 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:20:15,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413152563] [2022-04-28 03:20:15,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413152563] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:20:15,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:20:15,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 5] total 36 [2022-04-28 03:20:15,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:20:15,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2097580719] [2022-04-28 03:20:15,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2097580719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:20:15,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:20:15,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 03:20:15,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455051598] [2022-04-28 03:20:15,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:20:15,870 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-28 03:20:15,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:20:15,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:15,926 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 03:20:15,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 03:20:15,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:20:15,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 03:20:15,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 03:20:15,927 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:20,716 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 03:20:20,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 03:20:20,716 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-28 03:20:20,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:20:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-28 03:20:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-28 03:20:20,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 46 transitions. [2022-04-28 03:20:20,788 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 03:20:20,789 INFO L225 Difference]: With dead ends: 46 [2022-04-28 03:20:20,789 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 03:20:20,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 30 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 03:20:20,790 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:20:20,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 266 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 03:20:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 03:20:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 03:20:20,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:20:20,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:20,836 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:20,836 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:20,837 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 03:20:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 03:20:20,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:20:20,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:20:20,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:20:20,838 INFO L87 Difference]: Start difference. First operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:20:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:20,838 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 03:20:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 03:20:20,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:20:20,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:20:20,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:20:20,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:20:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-28 03:20:20,840 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-04-28 03:20:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:20:20,840 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-28 03:20:20,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:20,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-28 03:20:21,005 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 03:20:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 03:20:21,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 03:20:21,005 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:20:21,005 INFO L195 NwaCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:20:21,032 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 03:20:21,206 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 03:20:21,206 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:20:21,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:20:21,207 INFO L85 PathProgramCache]: Analyzing trace with hash 85566379, now seen corresponding path program 61 times [2022-04-28 03:20:21,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:20:21,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1756962417] [2022-04-28 03:20:21,207 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:20:21,207 INFO L85 PathProgramCache]: Analyzing trace with hash 85566379, now seen corresponding path program 62 times [2022-04-28 03:20:21,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:20:21,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310144764] [2022-04-28 03:20:21,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:20:21,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:20:21,230 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:20:21,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [346485753] [2022-04-28 03:20:21,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:20:21,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:20:21,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:20:21,233 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 03:20:21,234 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 03:20:21,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:20:21,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:20:21,313 WARN L261 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 132 conjunts are in the unsatisfiable core [2022-04-28 03:20:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:21,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:20:22,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {10923#true} call ULTIMATE.init(); {10923#true} is VALID [2022-04-28 03:20:22,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {10923#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {10923#true} is VALID [2022-04-28 03:20:22,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {10923#true} assume true; {10923#true} is VALID [2022-04-28 03:20:22,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10923#true} {10923#true} #38#return; {10923#true} is VALID [2022-04-28 03:20:22,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {10923#true} call #t~ret5 := main(); {10923#true} is VALID [2022-04-28 03:20:22,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {10923#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {10923#true} is VALID [2022-04-28 03:20:22,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {10923#true} assume !!(1 <= ~main__n~0); {10923#true} is VALID [2022-04-28 03:20:22,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {10923#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10949#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:20:22,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {10949#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10953#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-28 03:20:22,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {10953#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10957#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-28 03:20:22,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {10957#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10961#(and (= (+ main_~main__sum~0 (- 3)) 3) (= (+ (- 2) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-28 03:20:22,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {10961#(and (= (+ main_~main__sum~0 (- 3)) 3) (= (+ (- 2) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10965#(and (= 3 (+ (- 2) main_~main__i~0)) (= (* 2 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-28 03:20:22,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {10965#(and (= 3 (+ (- 2) main_~main__i~0)) (= (* 2 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10969#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-28 03:20:22,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {10969#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10973#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} is VALID [2022-04-28 03:20:22,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {10973#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10977#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} is VALID [2022-04-28 03:20:22,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {10977#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10981#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} is VALID [2022-04-28 03:20:22,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {10981#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10985#(and (= (+ (- 2) main_~main__i~0) 8) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 25)))} is VALID [2022-04-28 03:20:22,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {10985#(and (= (+ (- 2) main_~main__i~0) 8) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 25)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10989#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-28 03:20:22,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {10989#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10993#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} is VALID [2022-04-28 03:20:22,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {10993#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10997#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 10)) 55) (= (+ (- 1) main_~main__i~0) 12))} is VALID [2022-04-28 03:20:22,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {10997#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 10)) 55) (= (+ (- 1) main_~main__i~0) 12))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11001#(and (= (+ main_~main__sum~0 (- 36)) 55) (= 14 main_~main__i~0))} is VALID [2022-04-28 03:20:22,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {11001#(and (= (+ main_~main__sum~0 (- 36)) 55) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11005#(and (= (+ main_~main__sum~0 (- 91)) 14) (= (+ main_~main__sum~0 (- 90)) main_~main__i~0))} is VALID [2022-04-28 03:20:22,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {11005#(and (= (+ main_~main__sum~0 (- 91)) 14) (= (+ main_~main__sum~0 (- 90)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11009#(and (= main_~main__sum~0 (+ 104 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 15))} is VALID [2022-04-28 03:20:22,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {11009#(and (= main_~main__sum~0 (+ 104 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11013#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 16)) 120))} is VALID [2022-04-28 03:20:22,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {11013#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 16)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11017#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 33)) 120))} is VALID [2022-04-28 03:20:22,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {11017#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 33)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11021#(and (= 19 main_~main__i~0) (= 120 (+ (- 51) main_~main__sum~0)))} is VALID [2022-04-28 03:20:22,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {11021#(and (= 19 main_~main__i~0) (= 120 (+ (- 51) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11025#(and (= main_~main__i~0 (+ (- 170) main_~main__sum~0)) (= 19 (+ main_~main__sum~0 (- 171))))} is VALID [2022-04-28 03:20:22,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {11025#(and (= main_~main__i~0 (+ (- 170) main_~main__sum~0)) (= 19 (+ main_~main__sum~0 (- 171))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11029#(and (= (+ (- 1) main_~main__i~0) (+ (- 169) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 170) main_~main__sum~0 (* (- 1) main_~main__i~0)) 19))} is VALID [2022-04-28 03:20:22,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {11029#(and (= (+ (- 1) main_~main__i~0) (+ (- 169) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 170) main_~main__sum~0 (* (- 1) main_~main__i~0)) 19))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11033#(and (= 19 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 168))) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 167)) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-28 03:20:22,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {11033#(and (= 19 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 168))) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 167)) (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11037#(and (= (+ (- 3) main_~main__i~0) (+ (- 164) main_~main__sum~0 (* (- 3) main_~main__i~0))) (= 19 (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 165))))} is VALID [2022-04-28 03:20:22,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {11037#(and (= (+ (- 3) main_~main__i~0) (+ (- 164) main_~main__sum~0 (* (- 3) main_~main__i~0))) (= 19 (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 165))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11041#(and (= 19 (+ (- 5) main_~main__i~0)) (= main_~main__sum~0 (+ 156 (* 5 main_~main__i~0))))} is VALID [2022-04-28 03:20:22,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {11041#(and (= 19 (+ (- 5) main_~main__i~0)) (= main_~main__sum~0 (+ 156 (* 5 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11045#(and (= (+ (- 6) main_~main__i~0) 19) (= (+ (* 6 main_~main__i~0) 150) main_~main__sum~0))} is VALID [2022-04-28 03:20:22,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {11045#(and (= (+ (- 6) main_~main__i~0) 19) (= (+ (* 6 main_~main__i~0) 150) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11049#(and (= 26 main_~main__i~0) (= (+ main_~main__sum~0 (- 25)) 300))} is VALID [2022-04-28 03:20:22,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {11049#(and (= 26 main_~main__i~0) (= (+ main_~main__sum~0 (- 25)) 300))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11053#(and (= (+ (- 1) main_~main__i~0) 26) (= main_~main__sum~0 (+ 324 main_~main__i~0)))} is VALID [2022-04-28 03:20:22,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {11053#(and (= (+ (- 1) main_~main__i~0) 26) (= main_~main__sum~0 (+ 324 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11057#(and (= (+ (- 2) main_~main__i~0) 26) (= (+ 323 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:20:22,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {11057#(and (= (+ (- 2) main_~main__i~0) 26) (= (+ 323 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11061#(and (= (+ (- 55) main_~main__sum~0) 351) (= 29 main_~main__i~0))} is VALID [2022-04-28 03:20:22,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {11061#(and (= (+ (- 55) main_~main__sum~0) 351) (= 29 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11065#(and (= main_~main__sum~0 (+ 405 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 29))} is VALID [2022-04-28 03:20:22,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {11065#(and (= main_~main__sum~0 (+ 405 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 29))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11069#(and (= 29 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ 403 (* 2 main_~main__i~0))))} is VALID [2022-04-28 03:20:22,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {11069#(and (= 29 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ 403 (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11073#(and (<= 31 main_~main__n~0) (= 465 (+ main_~main__sum~0 (- 31))) (<= main_~main__i~0 32))} is VALID [2022-04-28 03:20:22,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {11073#(and (<= 31 main_~main__n~0) (= 465 (+ main_~main__sum~0 (- 31))) (<= main_~main__i~0 32))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11077#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:20:22,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {11077#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {10924#false} is VALID [2022-04-28 03:20:22,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {10924#false} assume !false; {10924#false} is VALID [2022-04-28 03:20:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:20:22,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:20:45,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {10924#false} assume !false; {10924#false} is VALID [2022-04-28 03:20:45,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {11077#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {10924#false} is VALID [2022-04-28 03:20:45,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {11090#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11077#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:20:45,997 INFO L290 TraceCheckUtils]: 38: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11090#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:20:46,027 INFO L290 TraceCheckUtils]: 37: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:46,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:47,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:47,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:47,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:47,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:47,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {10923#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11094#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:20:47,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {10923#true} assume !!(1 <= ~main__n~0); {10923#true} is VALID [2022-04-28 03:20:47,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {10923#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {10923#true} is VALID [2022-04-28 03:20:47,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {10923#true} call #t~ret5 := main(); {10923#true} is VALID [2022-04-28 03:20:47,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10923#true} {10923#true} #38#return; {10923#true} is VALID [2022-04-28 03:20:47,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {10923#true} assume true; {10923#true} is VALID [2022-04-28 03:20:47,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {10923#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {10923#true} is VALID [2022-04-28 03:20:47,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {10923#true} call ULTIMATE.init(); {10923#true} is VALID [2022-04-28 03:20:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-04-28 03:20:47,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:20:47,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310144764] [2022-04-28 03:20:47,104 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:20:47,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346485753] [2022-04-28 03:20:47,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346485753] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:20:47,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:20:47,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 5] total 37 [2022-04-28 03:20:47,105 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:20:47,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1756962417] [2022-04-28 03:20:47,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1756962417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:20:47,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:20:47,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 03:20:47,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843445683] [2022-04-28 03:20:47,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:20:47,105 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:20:47,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:20:47,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:47,161 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 03:20:47,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 03:20:47,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:20:47,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 03:20:47,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1229, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 03:20:47,163 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:52,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:52,839 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 03:20:52,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 03:20:52,840 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:20:52,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:20:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-04-28 03:20:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-04-28 03:20:52,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 47 transitions. [2022-04-28 03:20:52,909 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 03:20:52,910 INFO L225 Difference]: With dead ends: 47 [2022-04-28 03:20:52,910 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 03:20:52,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 17 SyntacticMatches, 31 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 03:20:52,911 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:20:52,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 03:20:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 03:20:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 03:20:52,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:20:52,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:52,964 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:52,964 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:52,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:52,965 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 03:20:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 03:20:52,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:20:52,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:20:52,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-28 03:20:52,965 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-28 03:20:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:52,966 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 03:20:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 03:20:52,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:20:52,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:20:52,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:20:52,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:20:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-28 03:20:52,967 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2022-04-28 03:20:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:20:52,967 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-28 03:20:52,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:52,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-28 03:20:53,086 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 03:20:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 03:20:53,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 03:20:53,086 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:20:53,086 INFO L195 NwaCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:20:53,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 03:20:53,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:20:53,287 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:20:53,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:20:53,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1642472015, now seen corresponding path program 63 times [2022-04-28 03:20:53,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:20:53,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2092255014] [2022-04-28 03:20:53,288 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:20:53,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1642472015, now seen corresponding path program 64 times [2022-04-28 03:20:53,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:20:53,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919934072] [2022-04-28 03:20:53,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:20:53,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:20:53,308 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:20:53,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1986373773] [2022-04-28 03:20:53,309 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:20:53,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:20:53,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:20:53,310 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:20:53,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 03:20:53,370 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:20:53,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:20:53,373 WARN L261 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 136 conjunts are in the unsatisfiable core [2022-04-28 03:20:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:53,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:20:54,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {11483#true} call ULTIMATE.init(); {11483#true} is VALID [2022-04-28 03:20:54,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {11483#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {11483#true} is VALID [2022-04-28 03:20:54,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {11483#true} assume true; {11483#true} is VALID [2022-04-28 03:20:54,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11483#true} {11483#true} #38#return; {11483#true} is VALID [2022-04-28 03:20:54,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {11483#true} call #t~ret5 := main(); {11483#true} is VALID [2022-04-28 03:20:54,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {11483#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {11483#true} is VALID [2022-04-28 03:20:54,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {11483#true} assume !!(1 <= ~main__n~0); {11483#true} is VALID [2022-04-28 03:20:54,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {11483#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11509#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:20:54,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {11509#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11513#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-28 03:20:54,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {11513#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11517#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-28 03:20:54,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {11517#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11521#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ (* 2 main_~main__i~0) (- 5)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:20:54,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {11521#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ (* 2 main_~main__i~0) (- 5)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11525#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} is VALID [2022-04-28 03:20:54,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {11525#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11529#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-28 03:20:54,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {11529#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11533#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} is VALID [2022-04-28 03:20:54,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {11533#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11537#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 15) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-28 03:20:54,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {11537#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 15) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11541#(and (= (+ main_~main__sum~0 (- 21)) 15) (= 9 main_~main__i~0))} is VALID [2022-04-28 03:20:54,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {11541#(and (= (+ main_~main__sum~0 (- 21)) 15) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11545#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-28 03:20:54,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {11545#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11549#(and (= (+ main_~main__sum~0 (- 44)) main_~main__i~0) (= (+ (- 45) main_~main__sum~0) 10))} is VALID [2022-04-28 03:20:54,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {11549#(and (= (+ main_~main__sum~0 (- 44)) main_~main__i~0) (= (+ (- 45) main_~main__sum~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11553#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} is VALID [2022-04-28 03:20:54,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {11553#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11557#(and (= (+ 40 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 3) main_~main__i~0) 10))} is VALID [2022-04-28 03:20:54,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {11557#(and (= (+ 40 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 3) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11561#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-28 03:20:54,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {11561#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11565#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2022-04-28 03:20:54,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {11565#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11569#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} is VALID [2022-04-28 03:20:54,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {11569#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11573#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 103))) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 104))))} is VALID [2022-04-28 03:20:54,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {11573#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 103))) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 104))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11577#(and (= (+ (- 102) main_~main__sum~0 (* (- 2) main_~main__i~0)) 15) (= (+ (- 2) main_~main__i~0) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 101))))} is VALID [2022-04-28 03:20:54,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {11577#(and (= (+ (- 102) main_~main__sum~0 (* (- 2) main_~main__i~0)) 15) (= (+ (- 2) main_~main__i~0) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 101))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11581#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 98)) (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 99)) 15))} is VALID [2022-04-28 03:20:54,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {11581#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 98)) (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 99)) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11585#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 95)) 15) (= (+ (- 94) main_~main__sum~0 (* (- 4) main_~main__i~0)) (+ (- 4) main_~main__i~0)))} is VALID [2022-04-28 03:20:54,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {11585#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 95)) 15) (= (+ (- 94) main_~main__sum~0 (* (- 4) main_~main__i~0)) (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11589#(and (= (+ main_~main__sum~0 (- 90) (* (- 5) main_~main__i~0)) 15) (= (+ (- 5) main_~main__i~0) (+ (- 89) main_~main__sum~0 (* (- 5) main_~main__i~0))))} is VALID [2022-04-28 03:20:54,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {11589#(and (= (+ main_~main__sum~0 (- 90) (* (- 5) main_~main__i~0)) 15) (= (+ (- 5) main_~main__i~0) (+ (- 89) main_~main__sum~0 (* (- 5) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11593#(and (= (+ (- 6) main_~main__i~0) 16) (= main_~main__sum~0 (+ (* 6 main_~main__i~0) 99)))} is VALID [2022-04-28 03:20:54,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {11593#(and (= (+ (- 6) main_~main__i~0) 16) (= main_~main__sum~0 (+ (* 6 main_~main__i~0) 99)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11597#(and (= (+ (* 6 main_~main__i~0) 93) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 16 (+ (- 7) main_~main__i~0)))} is VALID [2022-04-28 03:20:54,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {11597#(and (= (+ (* 6 main_~main__i~0) 93) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 16 (+ (- 7) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11601#(and (= main_~main__i~0 24) (= (+ (- 45) main_~main__sum~0) 231))} is VALID [2022-04-28 03:20:54,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {11601#(and (= main_~main__i~0 24) (= (+ (- 45) main_~main__sum~0) 231))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11605#(and (= (+ (- 1) main_~main__i~0) 24) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 44)) 231))} is VALID [2022-04-28 03:20:54,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {11605#(and (= (+ (- 1) main_~main__i~0) 24) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 44)) 231))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11609#(and (= (+ (- 2) main_~main__i~0) 24) (= 231 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 42))))} is VALID [2022-04-28 03:20:54,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {11609#(and (= (+ (- 2) main_~main__i~0) 24) (= 231 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 42))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11613#(and (= (+ (- 3) main_~main__i~0) 24) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 270)))} is VALID [2022-04-28 03:20:54,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {11613#(and (= (+ (- 3) main_~main__i~0) 24) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 270)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11617#(and (= (+ (- 4) main_~main__i~0) 24) (= (+ (* 3 main_~main__i~0) 267) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:20:54,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {11617#(and (= (+ (- 4) main_~main__i~0) 24) (= (+ (* 3 main_~main__i~0) 267) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11621#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} is VALID [2022-04-28 03:20:54,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {11621#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11625#(and (= 406 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 29))} is VALID [2022-04-28 03:20:54,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {11625#(and (= 406 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 29))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11629#(and (= 29 (+ (- 2) main_~main__i~0)) (= 406 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-28 03:20:54,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {11629#(and (= 29 (+ (- 2) main_~main__i~0)) (= 406 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11633#(and (= (+ main_~main__sum~0 (- 90)) 406) (= 32 main_~main__i~0))} is VALID [2022-04-28 03:20:54,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {11633#(and (= (+ main_~main__sum~0 (- 90)) 406) (= 32 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11637#(and (<= main_~main__i~0 33) (<= 32 main_~main__n~0) (= 406 (+ main_~main__sum~0 (- 122))))} is VALID [2022-04-28 03:20:54,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {11637#(and (<= main_~main__i~0 33) (<= 32 main_~main__n~0) (= 406 (+ main_~main__sum~0 (- 122))))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11641#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:20:54,462 INFO L290 TraceCheckUtils]: 41: Hoare triple {11641#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {11484#false} is VALID [2022-04-28 03:20:54,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {11484#false} assume !false; {11484#false} is VALID [2022-04-28 03:20:54,463 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:20:54,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:21:22,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {11484#false} assume !false; {11484#false} is VALID [2022-04-28 03:21:22,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {11641#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {11484#false} is VALID [2022-04-28 03:21:22,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {11654#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11641#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:21:22,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11654#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:21:22,455 INFO L290 TraceCheckUtils]: 38: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:22,489 INFO L290 TraceCheckUtils]: 37: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:22,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:22,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:22,602 INFO L290 TraceCheckUtils]: 34: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:22,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:22,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:22,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:22,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:22,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:22,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:22,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {11483#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11658#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:21:23,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {11483#true} assume !!(1 <= ~main__n~0); {11483#true} is VALID [2022-04-28 03:21:23,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {11483#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {11483#true} is VALID [2022-04-28 03:21:23,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {11483#true} call #t~ret5 := main(); {11483#true} is VALID [2022-04-28 03:21:23,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11483#true} {11483#true} #38#return; {11483#true} is VALID [2022-04-28 03:21:23,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {11483#true} assume true; {11483#true} is VALID [2022-04-28 03:21:23,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {11483#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {11483#true} is VALID [2022-04-28 03:21:23,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {11483#true} call ULTIMATE.init(); {11483#true} is VALID [2022-04-28 03:21:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-28 03:21:23,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:21:23,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919934072] [2022-04-28 03:21:23,801 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:21:23,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986373773] [2022-04-28 03:21:23,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986373773] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:21:23,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:21:23,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 5] total 38 [2022-04-28 03:21:23,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:21:23,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2092255014] [2022-04-28 03:21:23,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2092255014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:23,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:23,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 03:21:23,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248399904] [2022-04-28 03:21:23,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:21:23,802 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 03:21:23,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:21:23,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:23,883 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 03:21:23,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 03:21:23,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:23,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 03:21:23,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 03:21:23,885 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:31,182 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 03:21:31,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 03:21:31,182 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 03:21:31,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:21:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-28 03:21:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:31,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-28 03:21:31,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 48 transitions. [2022-04-28 03:21:31,264 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 03:21:31,265 INFO L225 Difference]: With dead ends: 48 [2022-04-28 03:21:31,265 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 03:21:31,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 17 SyntacticMatches, 32 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 03:21:31,266 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:21:31,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 282 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-28 03:21:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 03:21:31,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 03:21:31,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:21:31,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:31,317 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:31,317 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:31,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:31,318 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 03:21:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 03:21:31,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:31,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:31,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:21:31,318 INFO L87 Difference]: Start difference. First operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:21:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:31,319 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 03:21:31,319 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 03:21:31,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:31,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:31,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:21:31,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:21:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-28 03:21:31,320 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2022-04-28 03:21:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:21:31,320 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-28 03:21:31,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:31,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-28 03:21:31,459 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 03:21:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 03:21:31,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 03:21:31,459 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:21:31,460 INFO L195 NwaCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:21:31,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-28 03:21:31,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-28 03:21:31,660 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:21:31,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:21:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash 622912619, now seen corresponding path program 65 times [2022-04-28 03:21:31,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:31,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1543615990] [2022-04-28 03:21:31,661 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:21:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash 622912619, now seen corresponding path program 66 times [2022-04-28 03:21:31,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:21:31,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160436470] [2022-04-28 03:21:31,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:21:31,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:21:31,679 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:21:31,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [524933274] [2022-04-28 03:21:31,680 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:21:31,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:21:31,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:21:31,681 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:21:31,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 03:21:31,781 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-04-28 03:21:31,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:21:31,784 WARN L261 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 140 conjunts are in the unsatisfiable core [2022-04-28 03:21:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:31,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:21:32,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {12056#true} call ULTIMATE.init(); {12056#true} is VALID [2022-04-28 03:21:32,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {12056#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {12056#true} is VALID [2022-04-28 03:21:32,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {12056#true} assume true; {12056#true} is VALID [2022-04-28 03:21:32,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12056#true} {12056#true} #38#return; {12056#true} is VALID [2022-04-28 03:21:32,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {12056#true} call #t~ret5 := main(); {12056#true} is VALID [2022-04-28 03:21:32,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {12056#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {12056#true} is VALID [2022-04-28 03:21:32,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {12056#true} assume !!(1 <= ~main__n~0); {12056#true} is VALID [2022-04-28 03:21:32,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {12056#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {12082#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:21:32,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {12082#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12086#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-28 03:21:32,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {12086#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12090#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-28 03:21:32,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {12090#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12094#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-28 03:21:32,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {12094#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12098#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} is VALID [2022-04-28 03:21:32,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {12098#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12102#(and (= (+ 4 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-28 03:21:32,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {12102#(and (= (+ 4 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12106#(and (= (+ (- 3) main_~main__i~0) 4) (= main_~main__sum~0 (* 3 main_~main__i~0)))} is VALID [2022-04-28 03:21:32,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {12106#(and (= (+ (- 3) main_~main__i~0) 4) (= main_~main__sum~0 (* 3 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12110#(and (= (+ (- 4) main_~main__i~0) 4) (= (+ (* 3 main_~main__i~0) (- 3)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:21:32,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {12110#(and (= (+ (- 4) main_~main__i~0) 4) (= (+ (* 3 main_~main__i~0) (- 3)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12114#(and (= (+ (- 5) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 3 main_~main__i~0) (- 6))))} is VALID [2022-04-28 03:21:32,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {12114#(and (= (+ (- 5) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 3 main_~main__i~0) (- 6))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12118#(and (= (+ main_~main__sum~0 (- 24)) 21) (= 10 main_~main__i~0))} is VALID [2022-04-28 03:21:32,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {12118#(and (= (+ main_~main__sum~0 (- 24)) 21) (= 10 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12122#(and (= 21 (+ main_~main__sum~0 (- 34))) (= 11 main_~main__i~0))} is VALID [2022-04-28 03:21:32,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {12122#(and (= 21 (+ main_~main__sum~0 (- 34))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12126#(and (= (+ (- 45) main_~main__sum~0) 21) (= 12 main_~main__i~0))} is VALID [2022-04-28 03:21:32,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {12126#(and (= (+ (- 45) main_~main__sum~0) 21) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12130#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2022-04-28 03:21:32,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {12130#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12134#(and (= main_~main__sum~0 (+ 77 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 13))} is VALID [2022-04-28 03:21:32,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {12134#(and (= main_~main__sum~0 (+ 77 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12138#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 75)) (= (+ (- 2) main_~main__i~0) 13))} is VALID [2022-04-28 03:21:32,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {12138#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 75)) (= (+ (- 2) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12142#(and (= (+ (- 3) main_~main__i~0) 13) (= (+ (* 2 main_~main__i~0) 73) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:21:32,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {12142#(and (= (+ (- 3) main_~main__i~0) 13) (= (+ (* 2 main_~main__i~0) 73) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12146#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 31)) 105))} is VALID [2022-04-28 03:21:32,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {12146#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 31)) 105))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12150#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17))} is VALID [2022-04-28 03:21:32,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {12150#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12154#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} is VALID [2022-04-28 03:21:32,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {12154#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12158#(and (= (+ (- 1) main_~main__i~0) 19) (= 171 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:21:32,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {12158#(and (= (+ (- 1) main_~main__i~0) 19) (= 171 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12162#(and (= 21 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 171))} is VALID [2022-04-28 03:21:32,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {12162#(and (= 21 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12166#(and (= 22 main_~main__i~0) (= main_~main__sum~0 231))} is VALID [2022-04-28 03:21:32,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {12166#(and (= 22 main_~main__i~0) (= main_~main__sum~0 231))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12170#(and (= 23 main_~main__i~0) (= 231 (+ main_~main__sum~0 (- 22))))} is VALID [2022-04-28 03:21:32,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {12170#(and (= 23 main_~main__i~0) (= 231 (+ main_~main__sum~0 (- 22))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12174#(and (= (+ main_~main__sum~0 (- 252)) main_~main__i~0) (= 23 (+ main_~main__sum~0 (- 253))))} is VALID [2022-04-28 03:21:32,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {12174#(and (= (+ main_~main__sum~0 (- 252)) main_~main__i~0) (= 23 (+ main_~main__sum~0 (- 253))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12178#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 250)) (= 23 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-28 03:21:32,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {12178#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 250)) (= 23 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12182#(and (= (+ (* 2 main_~main__i~0) 248) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 23 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-28 03:21:32,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {12182#(and (= (+ (* 2 main_~main__i~0) 248) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 23 (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12186#(and (= main_~main__sum~0 351) (= main_~main__i~0 27))} is VALID [2022-04-28 03:21:32,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {12186#(and (= main_~main__sum~0 351) (= main_~main__i~0 27))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12190#(and (= (+ (- 1) main_~main__i~0) 27) (= 351 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:21:32,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {12190#(and (= (+ (- 1) main_~main__i~0) 27) (= 351 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12194#(and (= (+ (- 55) main_~main__sum~0) 351) (= 29 main_~main__i~0))} is VALID [2022-04-28 03:21:32,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {12194#(and (= (+ (- 55) main_~main__sum~0) 351) (= 29 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12198#(and (= main_~main__sum~0 (+ 405 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 29))} is VALID [2022-04-28 03:21:32,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {12198#(and (= main_~main__sum~0 (+ 405 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 29))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12202#(and (= 29 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ 403 (* 2 main_~main__i~0))))} is VALID [2022-04-28 03:21:32,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {12202#(and (= 29 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ 403 (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12206#(and (= 465 (+ main_~main__sum~0 (- 31))) (= 32 main_~main__i~0))} is VALID [2022-04-28 03:21:32,757 INFO L290 TraceCheckUtils]: 39: Hoare triple {12206#(and (= 465 (+ main_~main__sum~0 (- 31))) (= 32 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12210#(and (= main_~main__sum~0 528) (= 33 main_~main__i~0))} is VALID [2022-04-28 03:21:32,757 INFO L290 TraceCheckUtils]: 40: Hoare triple {12210#(and (= main_~main__sum~0 528) (= 33 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12214#(and (= (+ main_~main__sum~0 (- 33)) 528) (<= main_~main__i~0 34) (<= 33 main_~main__n~0))} is VALID [2022-04-28 03:21:32,759 INFO L290 TraceCheckUtils]: 41: Hoare triple {12214#(and (= (+ main_~main__sum~0 (- 33)) 528) (<= main_~main__i~0 34) (<= 33 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12218#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:21:32,760 INFO L290 TraceCheckUtils]: 42: Hoare triple {12218#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {12057#false} is VALID [2022-04-28 03:21:32,760 INFO L290 TraceCheckUtils]: 43: Hoare triple {12057#false} assume !false; {12057#false} is VALID [2022-04-28 03:21:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:21:32,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:22:05,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {12057#false} assume !false; {12057#false} is VALID [2022-04-28 03:22:05,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {12218#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {12057#false} is VALID [2022-04-28 03:22:05,459 INFO L290 TraceCheckUtils]: 41: Hoare triple {12231#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12218#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:22:05,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12231#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:22:05,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:05,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:05,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:05,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:05,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:05,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:05,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:05,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:05,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:05,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:05,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:06,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:07,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:07,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {12056#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {12235#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:07,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {12056#true} assume !!(1 <= ~main__n~0); {12056#true} is VALID [2022-04-28 03:22:07,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {12056#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {12056#true} is VALID [2022-04-28 03:22:07,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {12056#true} call #t~ret5 := main(); {12056#true} is VALID [2022-04-28 03:22:07,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12056#true} {12056#true} #38#return; {12056#true} is VALID [2022-04-28 03:22:07,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {12056#true} assume true; {12056#true} is VALID [2022-04-28 03:22:07,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {12056#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {12056#true} is VALID [2022-04-28 03:22:07,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {12056#true} call ULTIMATE.init(); {12056#true} is VALID [2022-04-28 03:22:07,040 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2022-04-28 03:22:07,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:07,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160436470] [2022-04-28 03:22:07,040 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:22:07,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524933274] [2022-04-28 03:22:07,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524933274] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:22:07,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:22:07,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 5] total 39 [2022-04-28 03:22:07,041 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:07,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1543615990] [2022-04-28 03:22:07,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1543615990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:07,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:07,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 03:22:07,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984707254] [2022-04-28 03:22:07,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:07,048 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:22:07,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:07,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:07,121 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 03:22:07,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 03:22:07,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:07,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 03:22:07,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1373, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 03:22:07,122 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:14,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:14,906 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 03:22:14,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 03:22:14,906 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:22:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-04-28 03:22:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-04-28 03:22:14,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 49 transitions. [2022-04-28 03:22:14,989 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 03:22:14,990 INFO L225 Difference]: With dead ends: 49 [2022-04-28 03:22:14,990 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 03:22:14,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 17 SyntacticMatches, 33 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:22:14,991 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:22:14,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 290 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-28 03:22:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 03:22:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 03:22:15,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:15,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:15,045 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:15,045 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:15,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:15,045 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 03:22:15,046 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 03:22:15,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:15,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:15,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-28 03:22:15,046 INFO L87 Difference]: Start difference. First operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-28 03:22:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:15,047 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 03:22:15,047 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 03:22:15,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:15,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:15,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:15,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-28 03:22:15,048 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2022-04-28 03:22:15,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:15,048 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-28 03:22:15,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:15,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-28 03:22:15,219 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 03:22:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 03:22:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 03:22:15,219 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:15,220 INFO L195 NwaCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:22:15,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-28 03:22:15,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:22:15,420 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:15,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:15,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2130359537, now seen corresponding path program 67 times [2022-04-28 03:22:15,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:15,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1069970021] [2022-04-28 03:22:15,421 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:22:15,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2130359537, now seen corresponding path program 68 times [2022-04-28 03:22:15,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:15,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700439546] [2022-04-28 03:22:15,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:15,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:15,439 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:22:15,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656946439] [2022-04-28 03:22:15,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:22:15,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:22:15,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:22:15,440 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:22:15,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 03:22:15,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:22:15,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:22:15,510 WARN L261 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 144 conjunts are in the unsatisfiable core [2022-04-28 03:22:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:15,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:22:16,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {12642#true} call ULTIMATE.init(); {12642#true} is VALID [2022-04-28 03:22:16,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {12642#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {12642#true} is VALID [2022-04-28 03:22:16,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {12642#true} assume true; {12642#true} is VALID [2022-04-28 03:22:16,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12642#true} {12642#true} #38#return; {12642#true} is VALID [2022-04-28 03:22:16,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {12642#true} call #t~ret5 := main(); {12642#true} is VALID [2022-04-28 03:22:16,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {12642#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {12642#true} is VALID [2022-04-28 03:22:16,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {12642#true} assume !!(1 <= ~main__n~0); {12642#true} is VALID [2022-04-28 03:22:16,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {12642#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {12668#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:22:16,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {12668#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12672#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-28 03:22:16,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {12672#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12676#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} is VALID [2022-04-28 03:22:16,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {12676#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12680#(and (= (+ main_~main__sum~0 (- 5)) 1) (= 4 main_~main__i~0))} is VALID [2022-04-28 03:22:16,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {12680#(and (= (+ main_~main__sum~0 (- 5)) 1) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12684#(and (= (+ (- 9) main_~main__sum~0) 1) (= 5 main_~main__i~0))} is VALID [2022-04-28 03:22:16,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {12684#(and (= (+ (- 9) main_~main__sum~0) 1) (= 5 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12688#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 8)) 1))} is VALID [2022-04-28 03:22:16,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {12688#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 8)) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12692#(and (= 5 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 6)) 1))} is VALID [2022-04-28 03:22:16,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {12692#(and (= 5 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 6)) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12696#(and (= 5 (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 3)) 1))} is VALID [2022-04-28 03:22:16,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {12696#(and (= 5 (+ (- 3) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 3)) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12700#(and (= 5 (+ (- 4) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 1) 1))} is VALID [2022-04-28 03:22:16,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {12700#(and (= 5 (+ (- 4) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 1) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12704#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 44)) 1))} is VALID [2022-04-28 03:22:16,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {12704#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 44)) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12708#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-28 03:22:16,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {12708#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12712#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-28 03:22:16,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {12712#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12716#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 55))} is VALID [2022-04-28 03:22:16,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {12716#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12720#(and (= main_~main__sum~0 (+ 49 (* 3 main_~main__i~0))) (= (+ (- 3) main_~main__i~0) 11))} is VALID [2022-04-28 03:22:16,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {12720#(and (= main_~main__sum~0 (+ 49 (* 3 main_~main__i~0))) (= (+ (- 3) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12724#(and (= 91 (+ (- 14) main_~main__sum~0)) (= 15 main_~main__i~0))} is VALID [2022-04-28 03:22:16,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {12724#(and (= 91 (+ (- 14) main_~main__sum~0)) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12728#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} is VALID [2022-04-28 03:22:16,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {12728#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12732#(and (= 91 (+ main_~main__sum~0 (- 28) (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-28 03:22:16,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {12732#(and (= 91 (+ main_~main__sum~0 (- 28) (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12736#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-28 03:22:16,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {12736#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12740#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} is VALID [2022-04-28 03:22:16,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {12740#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12744#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} is VALID [2022-04-28 03:22:16,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {12744#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12748#(and (= (+ (- 1) main_~main__i~0) 20) (= main_~main__sum~0 (+ 189 main_~main__i~0)))} is VALID [2022-04-28 03:22:16,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {12748#(and (= (+ (- 1) main_~main__i~0) 20) (= main_~main__sum~0 (+ 189 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12752#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} is VALID [2022-04-28 03:22:16,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {12752#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12756#(and (= (+ (- 3) main_~main__i~0) 20) (= (+ (* 2 main_~main__i~0) 185) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:22:16,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {12756#(and (= (+ (- 3) main_~main__i~0) 20) (= (+ (* 2 main_~main__i~0) 185) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12760#(and (= main_~main__i~0 24) (= (+ (- 45) main_~main__sum~0) 231))} is VALID [2022-04-28 03:22:16,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {12760#(and (= main_~main__i~0 24) (= (+ (- 45) main_~main__sum~0) 231))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12764#(and (= 25 main_~main__i~0) (= 231 (+ (- 69) main_~main__sum~0)))} is VALID [2022-04-28 03:22:16,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {12764#(and (= 25 main_~main__i~0) (= 231 (+ (- 69) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12768#(and (= 26 main_~main__i~0) (= (+ (- 94) main_~main__sum~0) 231))} is VALID [2022-04-28 03:22:16,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {12768#(and (= 26 main_~main__i~0) (= (+ (- 94) main_~main__sum~0) 231))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12772#(and (= 231 (+ main_~main__sum~0 (- 120))) (= main_~main__i~0 27))} is VALID [2022-04-28 03:22:16,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {12772#(and (= 231 (+ main_~main__sum~0 (- 120))) (= main_~main__i~0 27))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12776#(and (= (+ main_~main__sum~0 (- 147)) 231) (= 28 main_~main__i~0))} is VALID [2022-04-28 03:22:16,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {12776#(and (= (+ main_~main__sum~0 (- 147)) 231) (= 28 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12780#(and (= 231 (+ (- 175) main_~main__sum~0)) (= 29 main_~main__i~0))} is VALID [2022-04-28 03:22:16,532 INFO L290 TraceCheckUtils]: 36: Hoare triple {12780#(and (= 231 (+ (- 175) main_~main__sum~0)) (= 29 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12784#(and (= 231 (+ (- 204) main_~main__sum~0)) (= 30 main_~main__i~0))} is VALID [2022-04-28 03:22:16,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {12784#(and (= 231 (+ (- 204) main_~main__sum~0)) (= 30 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12788#(and (= 31 main_~main__i~0) (= main_~main__sum~0 465))} is VALID [2022-04-28 03:22:16,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {12788#(and (= 31 main_~main__i~0) (= main_~main__sum~0 465))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12792#(and (= 465 (+ main_~main__sum~0 (- 31))) (= 32 main_~main__i~0))} is VALID [2022-04-28 03:22:16,533 INFO L290 TraceCheckUtils]: 39: Hoare triple {12792#(and (= 465 (+ main_~main__sum~0 (- 31))) (= 32 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12796#(and (= main_~main__sum~0 528) (= 33 main_~main__i~0))} is VALID [2022-04-28 03:22:16,533 INFO L290 TraceCheckUtils]: 40: Hoare triple {12796#(and (= main_~main__sum~0 528) (= 33 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12800#(and (= 528 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 33))} is VALID [2022-04-28 03:22:16,534 INFO L290 TraceCheckUtils]: 41: Hoare triple {12800#(and (= 528 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 33))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12804#(and (<= 34 main_~main__n~0) (= (+ (- 67) main_~main__sum~0) 528) (<= main_~main__i~0 35))} is VALID [2022-04-28 03:22:16,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {12804#(and (<= 34 main_~main__n~0) (= (+ (- 67) main_~main__sum~0) 528) (<= main_~main__i~0 35))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12808#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:22:16,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {12808#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {12643#false} is VALID [2022-04-28 03:22:16,537 INFO L290 TraceCheckUtils]: 44: Hoare triple {12643#false} assume !false; {12643#false} is VALID [2022-04-28 03:22:16,538 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:22:16,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:22:49,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {12643#false} assume !false; {12643#false} is VALID [2022-04-28 03:22:49,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {12808#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {12643#false} is VALID [2022-04-28 03:22:49,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {12821#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12808#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:22:49,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12821#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:22:49,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:49,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:49,863 INFO L290 TraceCheckUtils]: 38: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:49,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:49,943 INFO L290 TraceCheckUtils]: 36: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:49,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:50,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:51,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:51,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:51,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:51,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {12642#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {12825#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:22:51,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {12642#true} assume !!(1 <= ~main__n~0); {12642#true} is VALID [2022-04-28 03:22:51,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {12642#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {12642#true} is VALID [2022-04-28 03:22:51,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {12642#true} call #t~ret5 := main(); {12642#true} is VALID [2022-04-28 03:22:51,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12642#true} {12642#true} #38#return; {12642#true} is VALID [2022-04-28 03:22:51,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {12642#true} assume true; {12642#true} is VALID [2022-04-28 03:22:51,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {12642#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {12642#true} is VALID [2022-04-28 03:22:51,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {12642#true} call ULTIMATE.init(); {12642#true} is VALID [2022-04-28 03:22:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2022-04-28 03:22:51,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:51,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700439546] [2022-04-28 03:22:51,193 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:22:51,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656946439] [2022-04-28 03:22:51,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656946439] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:22:51,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:22:51,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 5] total 40 [2022-04-28 03:22:51,193 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:51,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1069970021] [2022-04-28 03:22:51,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1069970021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:51,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:51,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 03:22:51,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817038246] [2022-04-28 03:22:51,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:51,194 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-28 03:22:51,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:51,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:51,272 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 03:22:51,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 03:22:51,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:51,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 03:22:51,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1448, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:22:51,273 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:59,497 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 03:22:59,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 03:22:59,497 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-28 03:22:59,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:59,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:59,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2022-04-28 03:22:59,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:59,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2022-04-28 03:22:59,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 50 transitions. [2022-04-28 03:22:59,590 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 03:22:59,590 INFO L225 Difference]: With dead ends: 50 [2022-04-28 03:22:59,590 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 03:22:59,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 17 SyntacticMatches, 34 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 03:22:59,591 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:22:59,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 298 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 03:22:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 03:22:59,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 03:22:59,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:59,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:59,646 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:59,646 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:59,647 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 03:22:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 03:22:59,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:59,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:59,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:22:59,648 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:22:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:59,648 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 03:22:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 03:22:59,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:59,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:59,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:59,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-28 03:22:59,650 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2022-04-28 03:22:59,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:59,650 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-28 03:22:59,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:59,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-28 03:22:59,833 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 03:22:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 03:22:59,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 03:22:59,834 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:59,834 INFO L195 NwaCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:22:59,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 03:23:00,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-28 03:23:00,035 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:23:00,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:23:00,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1616573739, now seen corresponding path program 69 times [2022-04-28 03:23:00,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:23:00,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105571867] [2022-04-28 03:23:00,036 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:23:00,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1616573739, now seen corresponding path program 70 times [2022-04-28 03:23:00,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:23:00,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195550515] [2022-04-28 03:23:00,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:23:00,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:23:00,057 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:23:00,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [866277282] [2022-04-28 03:23:00,057 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:23:00,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:23:00,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:23:00,058 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:23:00,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 03:23:00,132 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:23:00,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:23:00,135 WARN L261 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 148 conjunts are in the unsatisfiable core [2022-04-28 03:23:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:00,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:23:01,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {13241#true} call ULTIMATE.init(); {13241#true} is VALID [2022-04-28 03:23:01,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {13241#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {13241#true} is VALID [2022-04-28 03:23:01,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {13241#true} assume true; {13241#true} is VALID [2022-04-28 03:23:01,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13241#true} {13241#true} #38#return; {13241#true} is VALID [2022-04-28 03:23:01,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {13241#true} call #t~ret5 := main(); {13241#true} is VALID [2022-04-28 03:23:01,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {13241#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {13241#true} is VALID [2022-04-28 03:23:01,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {13241#true} assume !!(1 <= ~main__n~0); {13241#true} is VALID [2022-04-28 03:23:01,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {13241#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13267#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:23:01,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {13267#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13271#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-28 03:23:01,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {13271#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13275#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ (- 2) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:23:01,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {13275#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ (- 2) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13279#(and (= (+ main_~main__sum~0 (- 5)) 1) (= 4 main_~main__i~0))} is VALID [2022-04-28 03:23:01,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {13279#(and (= (+ main_~main__sum~0 (- 5)) 1) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13283#(and (= (+ (- 1) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 1))} is VALID [2022-04-28 03:23:01,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {13283#(and (= (+ (- 1) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13287#(and (= (+ (- 2) main_~main__i~0) 4) (= (+ (- 2) main_~main__sum~0 (* (- 2) main_~main__i~0)) 1))} is VALID [2022-04-28 03:23:01,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {13287#(and (= (+ (- 2) main_~main__i~0) 4) (= (+ (- 2) main_~main__sum~0 (* (- 2) main_~main__i~0)) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13291#(and (= 7 main_~main__i~0) (= (+ (- 20) main_~main__sum~0) 1))} is VALID [2022-04-28 03:23:01,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {13291#(and (= 7 main_~main__i~0) (= (+ (- 20) main_~main__sum~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13295#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-28 03:23:01,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {13295#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13299#(and (= (+ (- 1) main_~main__i~0) 8) (= 28 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:23:01,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {13299#(and (= (+ (- 1) main_~main__i~0) 8) (= 28 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13303#(and (= (+ (- 2) main_~main__i~0) 8) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 28))} is VALID [2022-04-28 03:23:01,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {13303#(and (= (+ (- 2) main_~main__i~0) 8) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13307#(and (= 8 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 22)))} is VALID [2022-04-28 03:23:01,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {13307#(and (= 8 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 22)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13311#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} is VALID [2022-04-28 03:23:01,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {13311#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13315#(and (= 12 (+ main_~main__sum~0 (- 66))) (= (+ main_~main__sum~0 (- 65)) main_~main__i~0))} is VALID [2022-04-28 03:23:01,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {13315#(and (= 12 (+ main_~main__sum~0 (- 66))) (= (+ main_~main__sum~0 (- 65)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13319#(and (= (+ (* 2 main_~main__i~0) 63) main_~main__sum~0) (= (+ (- 2) main_~main__i~0) 12))} is VALID [2022-04-28 03:23:01,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {13319#(and (= (+ (* 2 main_~main__i~0) 63) main_~main__sum~0) (= (+ (- 2) main_~main__i~0) 12))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13323#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2022-04-28 03:23:01,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {13323#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13327#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} is VALID [2022-04-28 03:23:01,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {13327#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13331#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 103))) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 104))))} is VALID [2022-04-28 03:23:01,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {13331#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 103))) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 104))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13335#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} is VALID [2022-04-28 03:23:01,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {13335#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13339#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} is VALID [2022-04-28 03:23:01,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {13339#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13343#(and (= (+ (- 1) main_~main__i~0) 19) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 17))))} is VALID [2022-04-28 03:23:01,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {13343#(and (= (+ (- 1) main_~main__i~0) 19) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 17))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13347#(and (= 21 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 57))))} is VALID [2022-04-28 03:23:01,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {13347#(and (= 21 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 57))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13351#(and (= (+ (- 1) main_~main__i~0) 21) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 56)) 153))} is VALID [2022-04-28 03:23:01,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {13351#(and (= (+ (- 1) main_~main__i~0) 21) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 56)) 153))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13355#(and (= 23 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 100))))} is VALID [2022-04-28 03:23:01,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {13355#(and (= 23 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 100))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13359#(and (= main_~main__i~0 24) (= 153 (+ main_~main__sum~0 (- 123))))} is VALID [2022-04-28 03:23:01,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {13359#(and (= main_~main__i~0 24) (= 153 (+ main_~main__sum~0 (- 123))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13363#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2022-04-28 03:23:01,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {13363#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13367#(and (= (+ main_~main__sum~0 (- 300)) 25) (= (+ main_~main__sum~0 (- 299)) main_~main__i~0))} is VALID [2022-04-28 03:23:01,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {13367#(and (= (+ main_~main__sum~0 (- 300)) 25) (= (+ main_~main__sum~0 (- 299)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13371#(and (= (+ (- 324) main_~main__sum~0) main_~main__i~0) (= (+ main_~main__sum~0 (- 325)) 26))} is VALID [2022-04-28 03:23:01,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {13371#(and (= (+ (- 324) main_~main__sum~0) main_~main__i~0) (= (+ main_~main__sum~0 (- 325)) 26))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13375#(and (= (+ main_~main__sum~0 (- 351)) 27) (= (+ main_~main__sum~0 (- 350)) main_~main__i~0))} is VALID [2022-04-28 03:23:01,448 INFO L290 TraceCheckUtils]: 35: Hoare triple {13375#(and (= (+ main_~main__sum~0 (- 351)) 27) (= (+ main_~main__sum~0 (- 350)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13379#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} is VALID [2022-04-28 03:23:01,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {13379#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13383#(and (= (+ main_~main__sum~0 (- 406)) 29) (= (+ (- 405) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-28 03:23:01,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {13383#(and (= (+ main_~main__sum~0 (- 406)) 29) (= (+ (- 405) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13387#(and (= 29 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ 403 (* 2 main_~main__i~0))))} is VALID [2022-04-28 03:23:01,449 INFO L290 TraceCheckUtils]: 38: Hoare triple {13387#(and (= 29 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ 403 (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13391#(and (= (+ (* 2 main_~main__i~0) 401) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 29 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-28 03:23:01,450 INFO L290 TraceCheckUtils]: 39: Hoare triple {13391#(and (= (+ (* 2 main_~main__i~0) 401) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 29 (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13395#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) 399)) (= 29 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-28 03:23:01,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {13395#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) 399)) (= 29 (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13399#(and (= 34 main_~main__i~0) (= (+ main_~main__sum~0 (- 96)) 465))} is VALID [2022-04-28 03:23:01,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {13399#(and (= 34 main_~main__i~0) (= (+ main_~main__sum~0 (- 96)) 465))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13403#(and (= main_~main__i~0 (+ (- 560) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 561)) 34))} is VALID [2022-04-28 03:23:01,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {13403#(and (= main_~main__i~0 (+ (- 560) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 561)) 34))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13407#(and (<= main_~main__sum~0 (+ 595 main_~main__n~0)) (<= (+ 594 main_~main__i~0) main_~main__sum~0) (= (+ main_~main__sum~0 (- 595)) 35))} is VALID [2022-04-28 03:23:01,454 INFO L290 TraceCheckUtils]: 43: Hoare triple {13407#(and (<= main_~main__sum~0 (+ 595 main_~main__n~0)) (<= (+ 594 main_~main__i~0) main_~main__sum~0) (= (+ main_~main__sum~0 (- 595)) 35))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13411#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:23:01,455 INFO L290 TraceCheckUtils]: 44: Hoare triple {13411#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {13242#false} is VALID [2022-04-28 03:23:01,455 INFO L290 TraceCheckUtils]: 45: Hoare triple {13242#false} assume !false; {13242#false} is VALID [2022-04-28 03:23:01,455 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:23:01,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:23:41,059 INFO L290 TraceCheckUtils]: 45: Hoare triple {13242#false} assume !false; {13242#false} is VALID [2022-04-28 03:23:41,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {13411#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {13242#false} is VALID [2022-04-28 03:23:41,060 INFO L290 TraceCheckUtils]: 43: Hoare triple {13424#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13411#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:23:41,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13424#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:23:41,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,297 INFO L290 TraceCheckUtils]: 37: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,340 INFO L290 TraceCheckUtils]: 36: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,383 INFO L290 TraceCheckUtils]: 35: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:41,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:42,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:42,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:42,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:42,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:42,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:42,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:42,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:42,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:42,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:42,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:42,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:42,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:42,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:42,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {13241#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13428#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:23:42,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {13241#true} assume !!(1 <= ~main__n~0); {13241#true} is VALID [2022-04-28 03:23:42,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {13241#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {13241#true} is VALID [2022-04-28 03:23:42,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {13241#true} call #t~ret5 := main(); {13241#true} is VALID [2022-04-28 03:23:42,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13241#true} {13241#true} #38#return; {13241#true} is VALID [2022-04-28 03:23:42,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {13241#true} assume true; {13241#true} is VALID [2022-04-28 03:23:42,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {13241#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {13241#true} is VALID [2022-04-28 03:23:42,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {13241#true} call ULTIMATE.init(); {13241#true} is VALID [2022-04-28 03:23:42,550 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2022-04-28 03:23:42,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:23:42,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195550515] [2022-04-28 03:23:42,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:23:42,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866277282] [2022-04-28 03:23:42,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866277282] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:23:42,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:23:42,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 5] total 41 [2022-04-28 03:23:42,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:23:42,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105571867] [2022-04-28 03:23:42,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105571867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:23:42,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:23:42,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 03:23:42,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752831570] [2022-04-28 03:23:42,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:23:42,552 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:23:42,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:23:42,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:42,626 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 03:23:42,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 03:23:42,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:23:42,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 03:23:42,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 03:23:42,627 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:00,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:00,957 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 03:24:00,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 03:24:00,958 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:24:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:24:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-04-28 03:24:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-04-28 03:24:00,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 51 transitions. [2022-04-28 03:24:01,092 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 03:24:01,093 INFO L225 Difference]: With dead ends: 51 [2022-04-28 03:24:01,093 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 03:24:01,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 17 SyntacticMatches, 35 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 03:24:01,094 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:24:01,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 306 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2022-04-28 03:24:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 03:24:01,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-28 03:24:01,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:24:01,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:01,156 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:01,157 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:01,157 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 03:24:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 03:24:01,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:24:01,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:24:01,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-28 03:24:01,158 INFO L87 Difference]: Start difference. First operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-28 03:24:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:01,158 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 03:24:01,158 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 03:24:01,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:24:01,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:24:01,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:24:01,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:24:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-28 03:24:01,159 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2022-04-28 03:24:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:24:01,159 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-28 03:24:01,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:01,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-28 03:24:01,367 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 03:24:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 03:24:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 03:24:01,367 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:24:01,367 INFO L195 NwaCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:24:01,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-28 03:24:01,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:24:01,568 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:24:01,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:24:01,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1425884111, now seen corresponding path program 71 times [2022-04-28 03:24:01,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:24:01,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1533135367] [2022-04-28 03:24:01,568 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:24:01,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1425884111, now seen corresponding path program 72 times [2022-04-28 03:24:01,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:24:01,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522828493] [2022-04-28 03:24:01,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:24:01,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:24:01,587 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:24:01,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1151132796] [2022-04-28 03:24:01,587 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:24:01,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:24:01,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:24:01,589 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:24:01,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 03:24:01,675 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 03:24:01,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:24:01,677 WARN L261 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 152 conjunts are in the unsatisfiable core [2022-04-28 03:24:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:24:01,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:24:02,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {13853#true} call ULTIMATE.init(); {13853#true} is VALID [2022-04-28 03:24:02,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {13853#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {13853#true} is VALID [2022-04-28 03:24:02,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {13853#true} assume true; {13853#true} is VALID [2022-04-28 03:24:02,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13853#true} {13853#true} #38#return; {13853#true} is VALID [2022-04-28 03:24:02,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {13853#true} call #t~ret5 := main(); {13853#true} is VALID [2022-04-28 03:24:02,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {13853#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {13853#true} is VALID [2022-04-28 03:24:02,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {13853#true} assume !!(1 <= ~main__n~0); {13853#true} is VALID [2022-04-28 03:24:02,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {13853#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13879#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:24:02,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {13879#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13883#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-28 03:24:02,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {13883#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13887#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 0))} is VALID [2022-04-28 03:24:02,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {13887#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13891#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-28 03:24:02,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {13891#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13895#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 4)) 6))} is VALID [2022-04-28 03:24:02,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {13895#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 4)) 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13899#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} is VALID [2022-04-28 03:24:02,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {13899#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13903#(and (= 5 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 7)))} is VALID [2022-04-28 03:24:02,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {13903#(and (= 5 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 7)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13907#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-28 03:24:02,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {13907#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13911#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-28 03:24:02,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {13911#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13915#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-28 03:24:02,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {13915#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13919#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-28 03:24:02,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {13919#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13923#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-28 03:24:02,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {13923#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13927#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2022-04-28 03:24:02,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {13927#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13931#(and (= main_~main__sum~0 (+ 77 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 13))} is VALID [2022-04-28 03:24:02,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {13931#(and (= main_~main__sum~0 (+ 77 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13935#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 75)) (= (+ (- 2) main_~main__i~0) 13))} is VALID [2022-04-28 03:24:02,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {13935#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 75)) (= (+ (- 2) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13939#(and (= (+ (- 3) main_~main__i~0) 13) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 72)))} is VALID [2022-04-28 03:24:02,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {13939#(and (= (+ (- 3) main_~main__i~0) 13) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 72)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13943#(and (= (+ (* 3 main_~main__i~0) 69) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 13))} is VALID [2022-04-28 03:24:02,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {13943#(and (= (+ (* 3 main_~main__i~0) 69) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13947#(and (= (+ 66 (* 3 main_~main__i~0)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 5) main_~main__i~0) 13))} is VALID [2022-04-28 03:24:02,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {13947#(and (= (+ 66 (* 3 main_~main__i~0)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 5) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13951#(and (= (+ (* 3 main_~main__i~0) 63) (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6)) (= (+ (- 6) main_~main__i~0) 13))} is VALID [2022-04-28 03:24:02,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {13951#(and (= (+ (* 3 main_~main__i~0) 63) (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6)) (= (+ (- 6) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13955#(and (= (+ (* 3 main_~main__i~0) 60) (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)) (= 13 (+ (- 7) main_~main__i~0)))} is VALID [2022-04-28 03:24:02,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {13955#(and (= (+ (* 3 main_~main__i~0) 60) (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)) (= 13 (+ (- 7) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13959#(and (= (+ main_~main__sum~0 (- 90)) 120) (= 21 main_~main__i~0))} is VALID [2022-04-28 03:24:02,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {13959#(and (= (+ main_~main__sum~0 (- 90)) 120) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13963#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} is VALID [2022-04-28 03:24:02,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {13963#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13967#(and (= (+ main_~main__sum~0 (- 231)) 22) (= (+ main_~main__sum~0 (- 230)) main_~main__i~0))} is VALID [2022-04-28 03:24:02,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {13967#(and (= (+ main_~main__sum~0 (- 231)) 22) (= (+ main_~main__sum~0 (- 230)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13971#(and (= (+ 252 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 23))} is VALID [2022-04-28 03:24:02,882 INFO L290 TraceCheckUtils]: 31: Hoare triple {13971#(and (= (+ 252 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 23))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13975#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2022-04-28 03:24:02,882 INFO L290 TraceCheckUtils]: 32: Hoare triple {13975#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13979#(and (= 300 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 25))} is VALID [2022-04-28 03:24:02,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {13979#(and (= 300 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 25))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13983#(and (= main_~main__sum~0 351) (= main_~main__i~0 27))} is VALID [2022-04-28 03:24:02,883 INFO L290 TraceCheckUtils]: 34: Hoare triple {13983#(and (= main_~main__sum~0 351) (= main_~main__i~0 27))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13987#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2022-04-28 03:24:02,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {13987#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13991#(and (= 378 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 28))} is VALID [2022-04-28 03:24:02,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {13991#(and (= 378 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13995#(and (= (+ (- 2) main_~main__i~0) 28) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 375)))} is VALID [2022-04-28 03:24:02,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {13995#(and (= (+ (- 2) main_~main__i~0) 28) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 375)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13999#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-28 03:24:02,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {13999#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14003#(and (= (+ (- 1) main_~main__i~0) 31) (= 435 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 29))))} is VALID [2022-04-28 03:24:02,885 INFO L290 TraceCheckUtils]: 39: Hoare triple {14003#(and (= (+ (- 1) main_~main__i~0) 31) (= 435 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 29))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14007#(and (= (+ main_~main__sum~0 (- 93)) 435) (= 33 main_~main__i~0))} is VALID [2022-04-28 03:24:02,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {14007#(and (= (+ main_~main__sum~0 (- 93)) 435) (= 33 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14011#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2022-04-28 03:24:02,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {14011#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14015#(and (= (+ (- 1) main_~main__i~0) 34) (= 561 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:24:02,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {14015#(and (= (+ (- 1) main_~main__i~0) 34) (= 561 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14019#(and (= 630 main_~main__sum~0) (= 36 main_~main__i~0))} is VALID [2022-04-28 03:24:02,887 INFO L290 TraceCheckUtils]: 43: Hoare triple {14019#(and (= 630 main_~main__sum~0) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14023#(and (= (+ (- 630) main_~main__sum~0) 36) (<= main_~main__sum~0 (+ 630 main_~main__n~0)) (<= (+ 629 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-28 03:24:02,890 INFO L290 TraceCheckUtils]: 44: Hoare triple {14023#(and (= (+ (- 630) main_~main__sum~0) 36) (<= main_~main__sum~0 (+ 630 main_~main__n~0)) (<= (+ 629 main_~main__i~0) main_~main__sum~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {14027#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:24:02,890 INFO L290 TraceCheckUtils]: 45: Hoare triple {14027#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {13854#false} is VALID [2022-04-28 03:24:02,890 INFO L290 TraceCheckUtils]: 46: Hoare triple {13854#false} assume !false; {13854#false} is VALID [2022-04-28 03:24:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:24:02,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:25:11,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {13854#false} assume !false; {13854#false} is VALID [2022-04-28 03:25:11,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {14027#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {13854#false} is VALID [2022-04-28 03:25:11,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {14040#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {14027#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:25:11,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14040#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:25:11,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:11,595 INFO L290 TraceCheckUtils]: 41: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:11,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:11,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:11,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:11,878 INFO L290 TraceCheckUtils]: 37: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:11,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:11,995 INFO L290 TraceCheckUtils]: 35: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:12,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:12,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:12,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:12,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:12,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:12,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:12,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:12,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:12,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:12,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:12,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:12,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:12,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:12,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:12,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:12,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:13,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:13,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:13,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:13,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:13,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:13,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:13,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:13,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:13,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:13,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:13,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:13,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {13853#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {14044#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:25:13,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {13853#true} assume !!(1 <= ~main__n~0); {13853#true} is VALID [2022-04-28 03:25:13,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {13853#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {13853#true} is VALID [2022-04-28 03:25:13,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {13853#true} call #t~ret5 := main(); {13853#true} is VALID [2022-04-28 03:25:13,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13853#true} {13853#true} #38#return; {13853#true} is VALID [2022-04-28 03:25:13,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {13853#true} assume true; {13853#true} is VALID [2022-04-28 03:25:13,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {13853#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {13853#true} is VALID [2022-04-28 03:25:13,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {13853#true} call ULTIMATE.init(); {13853#true} is VALID [2022-04-28 03:25:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2022-04-28 03:25:13,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:25:13,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522828493] [2022-04-28 03:25:13,682 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:25:13,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151132796] [2022-04-28 03:25:13,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151132796] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:25:13,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:25:13,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 5] total 42 [2022-04-28 03:25:13,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:25:13,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1533135367] [2022-04-28 03:25:13,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1533135367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:25:13,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:25:13,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 03:25:13,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025655823] [2022-04-28 03:25:13,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:25:13,683 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-28 03:25:13,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:25:13,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:13,821 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 03:25:13,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 03:25:13,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:25:13,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 03:25:13,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1604, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 03:25:13,822 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:32,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:25:32,659 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 03:25:32,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 03:25:32,660 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-28 03:25:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:25:32,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:32,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-04-28 03:25:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-04-28 03:25:32,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 52 transitions. [2022-04-28 03:25:32,791 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 03:25:32,792 INFO L225 Difference]: With dead ends: 52 [2022-04-28 03:25:32,792 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 03:25:32,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 17 SyntacticMatches, 36 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 66.0s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 03:25:32,793 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:25:32,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 314 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2022-04-28 03:25:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 03:25:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-28 03:25:32,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:25:32,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:32,847 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:32,848 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:32,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:25:32,848 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 03:25:32,848 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 03:25:32,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:25:32,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:25:32,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:25:32,849 INFO L87 Difference]: Start difference. First operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:25:32,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:25:32,849 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 03:25:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 03:25:32,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:25:32,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:25:32,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:25:32,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:25:32,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-28 03:25:32,851 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2022-04-28 03:25:32,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:25:32,851 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-28 03:25:32,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:32,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-28 03:25:33,120 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 03:25:33,121 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 03:25:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 03:25:33,121 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:25:33,121 INFO L195 NwaCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:25:33,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 03:25:33,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-28 03:25:33,322 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:25:33,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:25:33,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1252796949, now seen corresponding path program 73 times [2022-04-28 03:25:33,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:25:33,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [417403130] [2022-04-28 03:25:33,322 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:25:33,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1252796949, now seen corresponding path program 74 times [2022-04-28 03:25:33,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:25:33,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301694472] [2022-04-28 03:25:33,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:25:33,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:25:33,343 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:25:33,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1017457082] [2022-04-28 03:25:33,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:25:33,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:25:33,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:25:33,344 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:25:33,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 03:25:33,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:25:33,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:25:33,427 WARN L261 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 156 conjunts are in the unsatisfiable core [2022-04-28 03:25:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:33,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:25:34,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {14478#true} call ULTIMATE.init(); {14478#true} is VALID [2022-04-28 03:25:34,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {14478#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {14478#true} is VALID [2022-04-28 03:25:34,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {14478#true} assume true; {14478#true} is VALID [2022-04-28 03:25:34,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14478#true} {14478#true} #38#return; {14478#true} is VALID [2022-04-28 03:25:34,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {14478#true} call #t~ret5 := main(); {14478#true} is VALID [2022-04-28 03:25:34,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {14478#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {14478#true} is VALID [2022-04-28 03:25:34,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {14478#true} assume !!(1 <= ~main__n~0); {14478#true} is VALID [2022-04-28 03:25:34,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {14478#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {14504#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:25:34,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {14504#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14508#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-28 03:25:34,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {14508#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14512#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 2))} is VALID [2022-04-28 03:25:34,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {14512#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14516#(and (= 2 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:25:34,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {14516#(and (= 2 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14520#(and (= 3 (+ (- 2) main_~main__i~0)) (= (* 2 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-28 03:25:34,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {14520#(and (= 3 (+ (- 2) main_~main__i~0)) (= (* 2 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14524#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-28 03:25:34,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {14524#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14528#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} is VALID [2022-04-28 03:25:34,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {14528#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14532#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} is VALID [2022-04-28 03:25:34,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {14532#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14536#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} is VALID [2022-04-28 03:25:34,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {14536#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14540#(and (= (+ (- 9) main_~main__sum~0) 36) (= 10 main_~main__i~0))} is VALID [2022-04-28 03:25:34,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {14540#(and (= (+ (- 9) main_~main__sum~0) 36) (= 10 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14544#(and (= (+ main_~main__sum~0 (- 19)) 36) (= 11 main_~main__i~0))} is VALID [2022-04-28 03:25:34,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {14544#(and (= (+ main_~main__sum~0 (- 19)) 36) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14548#(and (= main_~main__sum~0 (+ main_~main__i~0 54)) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-28 03:25:34,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {14548#(and (= main_~main__sum~0 (+ main_~main__i~0 54)) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14552#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-28 03:25:34,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {14552#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14556#(and (= (+ main_~main__sum~0 (- 78)) 13) (= (+ (- 77) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-28 03:25:34,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {14556#(and (= (+ main_~main__sum~0 (- 78)) 13) (= (+ (- 77) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14560#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 75)) (= (+ (- 2) main_~main__i~0) 13))} is VALID [2022-04-28 03:25:34,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {14560#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 75)) (= (+ (- 2) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14564#(and (= (+ (- 3) main_~main__i~0) 13) (= (+ (* 2 main_~main__i~0) 73) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:25:34,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {14564#(and (= (+ (- 3) main_~main__i~0) 13) (= (+ (* 2 main_~main__i~0) 73) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14568#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 31)) 105))} is VALID [2022-04-28 03:25:34,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {14568#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 31)) 105))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14572#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} is VALID [2022-04-28 03:25:34,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {14572#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14576#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} is VALID [2022-04-28 03:25:34,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {14576#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14580#(and (= (+ (- 1) main_~main__i~0) 19) (= main_~main__sum~0 (+ 170 main_~main__i~0)))} is VALID [2022-04-28 03:25:34,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {14580#(and (= (+ (- 1) main_~main__i~0) 19) (= main_~main__sum~0 (+ 170 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14584#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} is VALID [2022-04-28 03:25:34,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {14584#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14588#(and (= 22 main_~main__i~0) (= 190 (+ main_~main__sum~0 (- 41))))} is VALID [2022-04-28 03:25:34,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {14588#(and (= 22 main_~main__i~0) (= 190 (+ main_~main__sum~0 (- 41))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14592#(and (= 23 main_~main__i~0) (= 190 (+ (- 63) main_~main__sum~0)))} is VALID [2022-04-28 03:25:34,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {14592#(and (= 23 main_~main__i~0) (= 190 (+ (- 63) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14596#(and (= 190 (+ (- 86) main_~main__sum~0)) (= main_~main__i~0 24))} is VALID [2022-04-28 03:25:34,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {14596#(and (= 190 (+ (- 86) main_~main__sum~0)) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14600#(and (= (+ (- 1) main_~main__i~0) 24) (= main_~main__sum~0 (+ 275 main_~main__i~0)))} is VALID [2022-04-28 03:25:34,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {14600#(and (= (+ (- 1) main_~main__i~0) 24) (= main_~main__sum~0 (+ 275 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14604#(and (= (+ (- 2) main_~main__i~0) 24) (= (+ (* 2 main_~main__i~0) 273) main_~main__sum~0))} is VALID [2022-04-28 03:25:34,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {14604#(and (= (+ (- 2) main_~main__i~0) 24) (= (+ (* 2 main_~main__i~0) 273) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14608#(and (= (+ (- 3) main_~main__i~0) 24) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 270)))} is VALID [2022-04-28 03:25:34,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {14608#(and (= (+ (- 3) main_~main__i~0) 24) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 270)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14612#(and (= (+ (- 4) main_~main__i~0) 24) (= (+ (* 3 main_~main__i~0) 267) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:25:34,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {14612#(and (= (+ (- 4) main_~main__i~0) 24) (= (+ (* 3 main_~main__i~0) 267) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14616#(and (= (+ (- 5) main_~main__i~0) 24) (= (+ (* 3 main_~main__i~0) 264) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-28 03:25:34,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {14616#(and (= (+ (- 5) main_~main__i~0) 24) (= (+ (* 3 main_~main__i~0) 264) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14620#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2022-04-28 03:25:34,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {14620#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14624#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-28 03:25:34,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {14624#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14628#(and (= (+ main_~main__sum~0 (- 61)) 435) (= 32 main_~main__i~0))} is VALID [2022-04-28 03:25:34,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {14628#(and (= (+ main_~main__sum~0 (- 61)) 435) (= 32 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14632#(and (= (+ main_~main__sum~0 (- 93)) 435) (= 33 main_~main__i~0))} is VALID [2022-04-28 03:25:34,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {14632#(and (= (+ main_~main__sum~0 (- 93)) 435) (= 33 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14636#(and (= (+ main_~main__sum~0 (- 126)) 435) (= 34 main_~main__i~0))} is VALID [2022-04-28 03:25:34,675 INFO L290 TraceCheckUtils]: 41: Hoare triple {14636#(and (= (+ main_~main__sum~0 (- 126)) 435) (= 34 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14640#(and (= (+ (- 1) main_~main__i~0) 34) (= 435 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 125))))} is VALID [2022-04-28 03:25:34,675 INFO L290 TraceCheckUtils]: 42: Hoare triple {14640#(and (= (+ (- 1) main_~main__i~0) 34) (= 435 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 125))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14644#(and (= 34 (+ (- 2) main_~main__i~0)) (= 435 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 123))))} is VALID [2022-04-28 03:25:34,676 INFO L290 TraceCheckUtils]: 43: Hoare triple {14644#(and (= 34 (+ (- 2) main_~main__i~0)) (= 435 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 123))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14648#(and (= 37 main_~main__i~0) (= (+ main_~main__sum~0 (- 231)) 435))} is VALID [2022-04-28 03:25:34,676 INFO L290 TraceCheckUtils]: 44: Hoare triple {14648#(and (= 37 main_~main__i~0) (= (+ main_~main__sum~0 (- 231)) 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14652#(and (<= 37 main_~main__n~0) (= 435 (+ main_~main__sum~0 (- 268))) (<= main_~main__i~0 38))} is VALID [2022-04-28 03:25:34,680 INFO L290 TraceCheckUtils]: 45: Hoare triple {14652#(and (<= 37 main_~main__n~0) (= 435 (+ main_~main__sum~0 (- 268))) (<= main_~main__i~0 38))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {14656#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:25:34,680 INFO L290 TraceCheckUtils]: 46: Hoare triple {14656#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {14479#false} is VALID [2022-04-28 03:25:34,680 INFO L290 TraceCheckUtils]: 47: Hoare triple {14479#false} assume !false; {14479#false} is VALID [2022-04-28 03:25:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:25:34,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:26:51,721 INFO L290 TraceCheckUtils]: 47: Hoare triple {14479#false} assume !false; {14479#false} is VALID [2022-04-28 03:26:51,721 INFO L290 TraceCheckUtils]: 46: Hoare triple {14656#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {14479#false} is VALID [2022-04-28 03:26:51,722 INFO L290 TraceCheckUtils]: 45: Hoare triple {14669#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {14656#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:26:51,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14669#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:26:51,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:51,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:51,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:52,005 INFO L290 TraceCheckUtils]: 40: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:52,071 INFO L290 TraceCheckUtils]: 39: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:52,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:52,196 INFO L290 TraceCheckUtils]: 37: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:52,261 INFO L290 TraceCheckUtils]: 36: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:52,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:52,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:52,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:52,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:52,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:52,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:52,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:52,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:52,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:52,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:52,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:53,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:53,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:53,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:53,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:53,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:53,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:53,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:53,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:53,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:53,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:53,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:53,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:53,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:53,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:53,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:53,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:54,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:54,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {14478#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {14673#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:26:54,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {14478#true} assume !!(1 <= ~main__n~0); {14478#true} is VALID [2022-04-28 03:26:54,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {14478#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {14478#true} is VALID [2022-04-28 03:26:54,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {14478#true} call #t~ret5 := main(); {14478#true} is VALID [2022-04-28 03:26:54,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14478#true} {14478#true} #38#return; {14478#true} is VALID [2022-04-28 03:26:54,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {14478#true} assume true; {14478#true} is VALID [2022-04-28 03:26:54,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {14478#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {14478#true} is VALID [2022-04-28 03:26:54,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {14478#true} call ULTIMATE.init(); {14478#true} is VALID [2022-04-28 03:26:54,062 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2022-04-28 03:26:54,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:26:54,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301694472] [2022-04-28 03:26:54,062 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:26:54,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017457082] [2022-04-28 03:26:54,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017457082] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:26:54,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:26:54,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 5] total 43 [2022-04-28 03:26:54,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:26:54,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [417403130] [2022-04-28 03:26:54,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [417403130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:26:54,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:26:54,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 03:26:54,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963550646] [2022-04-28 03:26:54,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:26:54,064 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:26:54,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:26:54,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:54,184 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 03:26:54,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 03:26:54,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:26:54,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 03:26:54,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1685, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 03:26:54,185 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:27:18,562 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 03:27:18,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 03:27:18,562 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:27:18,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:27:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2022-04-28 03:27:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2022-04-28 03:27:18,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 53 transitions. [2022-04-28 03:27:18,711 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 03:27:18,712 INFO L225 Difference]: With dead ends: 53 [2022-04-28 03:27:18,712 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 03:27:18,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 17 SyntacticMatches, 37 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 74.4s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 03:27:18,713 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:27:18,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 322 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 13.7s Time] [2022-04-28 03:27:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 03:27:18,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 03:27:18,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:27:18,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:18,769 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:18,769 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:18,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:27:18,770 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 03:27:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 03:27:18,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:27:18,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:27:18,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-28 03:27:18,770 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-28 03:27:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:27:18,771 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 03:27:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 03:27:18,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:27:18,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:27:18,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:27:18,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:27:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-28 03:27:18,772 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2022-04-28 03:27:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:27:18,772 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-28 03:27:18,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:18,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-28 03:27:19,081 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 03:27:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 03:27:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 03:27:19,082 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:27:19,082 INFO L195 NwaCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:27:19,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-28 03:27:19,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 03:27:19,283 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:27:19,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:27:19,283 INFO L85 PathProgramCache]: Analyzing trace with hash -182062223, now seen corresponding path program 75 times [2022-04-28 03:27:19,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:27:19,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [399048136] [2022-04-28 03:27:19,284 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:27:19,284 INFO L85 PathProgramCache]: Analyzing trace with hash -182062223, now seen corresponding path program 76 times [2022-04-28 03:27:19,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:27:19,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094773455] [2022-04-28 03:27:19,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:27:19,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:27:19,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:27:19,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821554260] [2022-04-28 03:27:19,304 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:27:19,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:27:19,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:27:19,305 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:27:19,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 03:27:19,366 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:27:19,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:27:19,368 WARN L261 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 160 conjunts are in the unsatisfiable core [2022-04-28 03:27:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:27:19,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:27:20,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {15116#true} call ULTIMATE.init(); {15116#true} is VALID [2022-04-28 03:27:20,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {15116#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {15116#true} is VALID [2022-04-28 03:27:20,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {15116#true} assume true; {15116#true} is VALID [2022-04-28 03:27:20,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15116#true} {15116#true} #38#return; {15116#true} is VALID [2022-04-28 03:27:20,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {15116#true} call #t~ret5 := main(); {15116#true} is VALID [2022-04-28 03:27:20,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {15116#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {15116#true} is VALID [2022-04-28 03:27:20,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {15116#true} assume !!(1 <= ~main__n~0); {15116#true} is VALID [2022-04-28 03:27:20,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {15116#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {15142#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:27:20,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {15142#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15146#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-28 03:27:20,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {15146#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15150#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-28 03:27:20,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {15150#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__i~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15154#(and (= 2 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 2))))} is VALID [2022-04-28 03:27:20,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {15154#(and (= 2 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 2))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15158#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-28 03:27:20,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {15158#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15162#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-28 03:27:20,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {15162#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15166#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} is VALID [2022-04-28 03:27:20,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {15166#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15170#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 10)) 10) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-28 03:27:20,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {15170#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 10)) 10) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15174#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 18)) (= 7 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-28 03:27:20,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {15174#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 18)) (= 7 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15178#(and (= 7 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 16) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:27:20,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {15178#(and (= 7 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 16) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15182#(and (= 7 (+ (- 4) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) 14)))} is VALID [2022-04-28 03:27:20,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {15182#(and (= 7 (+ (- 4) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) 14)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15186#(and (= 12 main_~main__i~0) (= 36 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-28 03:27:20,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {15186#(and (= 12 main_~main__i~0) (= 36 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15190#(and (= 13 main_~main__i~0) (= (+ main_~main__sum~0 (- 42)) 36))} is VALID [2022-04-28 03:27:20,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {15190#(and (= 13 main_~main__i~0) (= (+ main_~main__sum~0 (- 42)) 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15194#(and (= (+ main_~main__sum~0 (- 78)) 13) (= (+ (- 77) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-28 03:27:20,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {15194#(and (= (+ main_~main__sum~0 (- 78)) 13) (= (+ (- 77) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15198#(and (= 13 (+ (- 77) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (- 76) (* (- 1) main_~main__i~0))))} is VALID [2022-04-28 03:27:20,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {15198#(and (= 13 (+ (- 77) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (- 76) (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15202#(and (= main_~main__sum~0 (+ 88 (* 2 main_~main__i~0))) (= 14 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-28 03:27:20,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {15202#(and (= main_~main__sum~0 (+ 88 (* 2 main_~main__i~0))) (= 14 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15206#(and (= (+ (* 2 main_~main__i~0) 86) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 14 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-28 03:27:20,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {15206#(and (= (+ (* 2 main_~main__i~0) 86) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 14 (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15210#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 33)) 120))} is VALID [2022-04-28 03:27:20,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {15210#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 33)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15214#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} is VALID [2022-04-28 03:27:20,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {15214#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15218#(and (= (+ (- 1) main_~main__i~0) 19) (= main_~main__sum~0 (+ 170 main_~main__i~0)))} is VALID [2022-04-28 03:27:20,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {15218#(and (= (+ (- 1) main_~main__i~0) 19) (= main_~main__sum~0 (+ 170 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15222#(and (= 19 (+ (- 2) main_~main__i~0)) (= (+ 169 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:27:20,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {15222#(and (= 19 (+ (- 2) main_~main__i~0)) (= (+ 169 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15226#(and (= 19 (+ (- 3) main_~main__i~0)) (= (+ 168 main_~main__i~0) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-28 03:27:20,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {15226#(and (= 19 (+ (- 3) main_~main__i~0)) (= (+ 168 main_~main__i~0) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15230#(and (= main_~main__sum~0 253) (= 23 main_~main__i~0))} is VALID [2022-04-28 03:27:20,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {15230#(and (= main_~main__sum~0 253) (= 23 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15234#(and (= main_~main__sum~0 276) (= main_~main__i~0 24))} is VALID [2022-04-28 03:27:20,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {15234#(and (= main_~main__sum~0 276) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15238#(and (= (+ (- 1) main_~main__i~0) 24) (= main_~main__sum~0 (+ 275 main_~main__i~0)))} is VALID [2022-04-28 03:27:20,656 INFO L290 TraceCheckUtils]: 32: Hoare triple {15238#(and (= (+ (- 1) main_~main__i~0) 24) (= main_~main__sum~0 (+ 275 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15242#(and (= 26 main_~main__i~0) (= (+ main_~main__sum~0 (- 25)) 300))} is VALID [2022-04-28 03:27:20,657 INFO L290 TraceCheckUtils]: 33: Hoare triple {15242#(and (= 26 main_~main__i~0) (= (+ main_~main__sum~0 (- 25)) 300))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15246#(and (= (+ (- 1) main_~main__i~0) 26) (= main_~main__sum~0 (+ 324 main_~main__i~0)))} is VALID [2022-04-28 03:27:20,657 INFO L290 TraceCheckUtils]: 34: Hoare triple {15246#(and (= (+ (- 1) main_~main__i~0) 26) (= main_~main__sum~0 (+ 324 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15250#(and (= (+ (- 2) main_~main__i~0) 26) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 322)))} is VALID [2022-04-28 03:27:20,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {15250#(and (= (+ (- 2) main_~main__i~0) 26) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 322)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15254#(and (= (+ (- 3) main_~main__i~0) 26) (= (+ (* 2 main_~main__i~0) 320) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:27:20,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {15254#(and (= (+ (- 3) main_~main__i~0) 26) (= (+ (* 2 main_~main__i~0) 320) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15258#(and (= (+ (- 4) main_~main__i~0) 26) (= (+ 315 (* 4 main_~main__i~0)) main_~main__sum~0))} is VALID [2022-04-28 03:27:20,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {15258#(and (= (+ (- 4) main_~main__i~0) 26) (= (+ 315 (* 4 main_~main__i~0)) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15262#(and (= (+ (- 5) main_~main__i~0) 26) (= (+ (* 4 main_~main__i~0) 311) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-28 03:27:20,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {15262#(and (= (+ (- 5) main_~main__i~0) 26) (= (+ (* 4 main_~main__i~0) 311) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15266#(and (= main_~main__sum~0 496) (= 32 main_~main__i~0))} is VALID [2022-04-28 03:27:20,659 INFO L290 TraceCheckUtils]: 39: Hoare triple {15266#(and (= main_~main__sum~0 496) (= 32 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15270#(and (= main_~main__sum~0 528) (= 33 main_~main__i~0))} is VALID [2022-04-28 03:27:20,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {15270#(and (= main_~main__sum~0 528) (= 33 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15274#(and (= (+ (- 528) main_~main__sum~0) 33) (= (+ main_~main__sum~0 (- 527)) main_~main__i~0))} is VALID [2022-04-28 03:27:20,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {15274#(and (= (+ (- 528) main_~main__sum~0) 33) (= (+ main_~main__sum~0 (- 527)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15278#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2022-04-28 03:27:20,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {15278#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15282#(and (= 36 main_~main__i~0) (= (+ main_~main__sum~0 (- 35)) 595))} is VALID [2022-04-28 03:27:20,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {15282#(and (= 36 main_~main__i~0) (= (+ main_~main__sum~0 (- 35)) 595))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15286#(and (= 37 main_~main__i~0) (= 595 (+ main_~main__sum~0 (- 71))))} is VALID [2022-04-28 03:27:20,661 INFO L290 TraceCheckUtils]: 44: Hoare triple {15286#(and (= 37 main_~main__i~0) (= 595 (+ main_~main__sum~0 (- 71))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15290#(and (= (+ (- 1) main_~main__i~0) 37) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 70)) 595))} is VALID [2022-04-28 03:27:20,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {15290#(and (= (+ (- 1) main_~main__i~0) 37) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 70)) 595))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15294#(and (= main_~main__sum~0 741) (<= main_~main__i~0 39) (<= 38 main_~main__n~0))} is VALID [2022-04-28 03:27:20,664 INFO L290 TraceCheckUtils]: 46: Hoare triple {15294#(and (= main_~main__sum~0 741) (<= main_~main__i~0 39) (<= 38 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {15298#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:27:20,664 INFO L290 TraceCheckUtils]: 47: Hoare triple {15298#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {15117#false} is VALID [2022-04-28 03:27:20,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {15117#false} assume !false; {15117#false} is VALID [2022-04-28 03:27:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:27:20,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:28:48,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {15117#false} assume !false; {15117#false} is VALID [2022-04-28 03:28:48,223 INFO L290 TraceCheckUtils]: 47: Hoare triple {15298#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {15117#false} is VALID [2022-04-28 03:28:48,223 INFO L290 TraceCheckUtils]: 46: Hoare triple {15311#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {15298#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:28:48,243 INFO L290 TraceCheckUtils]: 45: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15311#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:28:48,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:48,381 INFO L290 TraceCheckUtils]: 43: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:48,439 INFO L290 TraceCheckUtils]: 42: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:48,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:48,569 INFO L290 TraceCheckUtils]: 40: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:48,634 INFO L290 TraceCheckUtils]: 39: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:48,698 INFO L290 TraceCheckUtils]: 38: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:48,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:48,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:48,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:48,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:49,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:50,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:50,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:50,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:50,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:50,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:50,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:50,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:50,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:50,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:50,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {15116#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {15315#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-28 03:28:50,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {15116#true} assume !!(1 <= ~main__n~0); {15116#true} is VALID [2022-04-28 03:28:50,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {15116#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {15116#true} is VALID [2022-04-28 03:28:50,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {15116#true} call #t~ret5 := main(); {15116#true} is VALID [2022-04-28 03:28:50,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15116#true} {15116#true} #38#return; {15116#true} is VALID [2022-04-28 03:28:50,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {15116#true} assume true; {15116#true} is VALID [2022-04-28 03:28:50,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {15116#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {15116#true} is VALID [2022-04-28 03:28:50,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {15116#true} call ULTIMATE.init(); {15116#true} is VALID [2022-04-28 03:28:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2022-04-28 03:28:50,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:28:50,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094773455] [2022-04-28 03:28:50,549 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:28:50,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821554260] [2022-04-28 03:28:50,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821554260] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:28:50,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:28:50,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 5] total 44 [2022-04-28 03:28:50,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:28:50,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [399048136] [2022-04-28 03:28:50,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [399048136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:28:50,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:28:50,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 03:28:50,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530483957] [2022-04-28 03:28:50,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:28:50,550 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 03:28:50,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:28:50,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:50,674 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 03:28:50,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 03:28:50,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:28:50,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 03:28:50,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1768, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 03:28:50,675 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:29:22,663 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 03:29:22,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 03:29:22,663 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 03:29:22,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:29:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2022-04-28 03:29:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2022-04-28 03:29:22,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 54 transitions. [2022-04-28 03:29:22,854 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 03:29:22,854 INFO L225 Difference]: With dead ends: 54 [2022-04-28 03:29:22,855 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 03:29:22,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 17 SyntacticMatches, 38 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 84.8s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 03:29:22,856 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:29:22,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 330 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 18.2s Time] [2022-04-28 03:29:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 03:29:22,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 03:29:22,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:29:22,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:22,915 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:22,915 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:22,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:29:22,916 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 03:29:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 03:29:22,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:29:22,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:29:22,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:29:22,916 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 03:29:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:29:22,917 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 03:29:22,917 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 03:29:22,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:29:22,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:29:22,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:29:22,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:29:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-28 03:29:22,918 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2022-04-28 03:29:22,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:29:22,918 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-28 03:29:22,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:22,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-28 03:29:23,198 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 03:29:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 03:29:23,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 03:29:23,199 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:29:23,199 INFO L195 NwaCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:29:23,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 03:29:23,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 03:29:23,400 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:29:23,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:29:23,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1349024085, now seen corresponding path program 77 times [2022-04-28 03:29:23,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:29:23,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1363071579] [2022-04-28 03:29:23,400 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:29:23,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1349024085, now seen corresponding path program 78 times [2022-04-28 03:29:23,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:29:23,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644833710] [2022-04-28 03:29:23,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:29:23,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:29:23,418 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:29:23,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1852666720] [2022-04-28 03:29:23,419 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:29:23,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:29:23,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:29:23,420 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:29:23,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 03:29:23,499 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2022-04-28 03:29:23,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:29:23,501 WARN L261 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 165 conjunts are in the unsatisfiable core [2022-04-28 03:29:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:29:23,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:29:25,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {15767#true} call ULTIMATE.init(); {15767#true} is VALID [2022-04-28 03:29:25,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {15767#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {15767#true} is VALID [2022-04-28 03:29:25,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {15767#true} assume true; {15767#true} is VALID [2022-04-28 03:29:25,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15767#true} {15767#true} #38#return; {15767#true} is VALID [2022-04-28 03:29:25,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {15767#true} call #t~ret5 := main(); {15767#true} is VALID [2022-04-28 03:29:25,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {15767#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {15767#true} is VALID [2022-04-28 03:29:25,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {15767#true} assume !!(1 <= ~main__n~0); {15790#(<= 1 main_~main__n~0)} is VALID [2022-04-28 03:29:25,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {15790#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {15794#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-28 03:29:25,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {15794#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15798#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-28 03:29:25,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {15798#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15802#(and (<= 1 main_~main__n~0) (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-28 03:29:25,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {15802#(and (<= 1 main_~main__n~0) (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15806#(and (= (+ main_~main__sum~0 (- 3)) 3) (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-28 03:29:25,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {15806#(and (= (+ main_~main__sum~0 (- 3)) 3) (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15810#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:29:25,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {15810#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15814#(and (= (+ (- 1) main_~main__i~0) 5) (<= 1 main_~main__n~0) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} is VALID [2022-04-28 03:29:25,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {15814#(and (= (+ (- 1) main_~main__i~0) 5) (<= 1 main_~main__n~0) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15818#(and (= 5 (+ (- 2) main_~main__i~0)) (= (+ 8 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:29:25,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {15818#(and (= 5 (+ (- 2) main_~main__i~0)) (= (+ 8 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15822#(and (= (+ 7 main_~main__i~0) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= 5 (+ (- 3) main_~main__i~0)) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:29:25,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {15822#(and (= (+ 7 main_~main__i~0) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= 5 (+ (- 3) main_~main__i~0)) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15826#(and (= (+ main_~main__sum~0 (- 21)) 15) (<= 1 main_~main__n~0) (= 9 main_~main__i~0))} is VALID [2022-04-28 03:29:25,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {15826#(and (= (+ main_~main__sum~0 (- 21)) 15) (<= 1 main_~main__n~0) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15830#(and (= 10 main_~main__i~0) (<= 1 main_~main__n~0) (= 15 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-28 03:29:25,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {15830#(and (= 10 main_~main__i~0) (<= 1 main_~main__n~0) (= 15 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15834#(and (= (+ (- 1) main_~main__i~0) 10) (<= 1 main_~main__n~0) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} is VALID [2022-04-28 03:29:25,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {15834#(and (= (+ (- 1) main_~main__i~0) 10) (<= 1 main_~main__n~0) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15838#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:29:25,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {15838#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15842#(and (= (+ 40 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= (+ (- 3) main_~main__i~0) 10))} is VALID [2022-04-28 03:29:25,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {15842#(and (= (+ 40 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= (+ (- 3) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15846#(and (= 91 main_~main__sum~0) (<= 1 main_~main__n~0) (= 14 main_~main__i~0))} is VALID [2022-04-28 03:29:25,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {15846#(and (= 91 main_~main__sum~0) (<= 1 main_~main__n~0) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15850#(and (= (+ main_~main__sum~0 (- 91)) 14) (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 90)) main_~main__i~0))} is VALID [2022-04-28 03:29:25,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {15850#(and (= (+ main_~main__sum~0 (- 91)) 14) (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 90)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15854#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:29:25,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {15854#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15858#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 16)) 120) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:29:25,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {15858#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 16)) 120) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15862#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:29:25,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {15862#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15866#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:29:25,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {15866#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15870#(and (= 20 main_~main__i~0) (<= 1 main_~main__n~0) (= 153 (+ main_~main__sum~0 (- 37))))} is VALID [2022-04-28 03:29:25,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {15870#(and (= 20 main_~main__i~0) (<= 1 main_~main__n~0) (= 153 (+ main_~main__sum~0 (- 37))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15874#(and (= 21 main_~main__i~0) (<= 1 main_~main__n~0) (= 153 (+ main_~main__sum~0 (- 57))))} is VALID [2022-04-28 03:29:25,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {15874#(and (= 21 main_~main__i~0) (<= 1 main_~main__n~0) (= 153 (+ main_~main__sum~0 (- 57))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15878#(and (= (+ (- 1) main_~main__i~0) 21) (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 56)) 153))} is VALID [2022-04-28 03:29:25,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {15878#(and (= (+ (- 1) main_~main__i~0) 21) (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 56)) 153))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15882#(and (= 21 (+ (- 2) main_~main__i~0)) (<= 1 main_~main__n~0) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 207)))} is VALID [2022-04-28 03:29:25,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {15882#(and (= 21 (+ (- 2) main_~main__i~0)) (<= 1 main_~main__n~0) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 207)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15886#(and (= 21 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 205) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:29:25,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {15886#(and (= 21 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 205) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15890#(and (= 25 main_~main__i~0) (= 253 (+ main_~main__sum~0 (- 47))) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:29:25,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {15890#(and (= 25 main_~main__i~0) (= 253 (+ main_~main__sum~0 (- 47))) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15894#(and (= 26 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 325))} is VALID [2022-04-28 03:29:25,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {15894#(and (= 26 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15898#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 26))} is VALID [2022-04-28 03:29:25,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {15898#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 26))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15902#(and (= 325 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 26) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:29:25,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {15902#(and (= 325 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 26) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15906#(and (= 325 (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6)) (= (+ (- 3) main_~main__i~0) 26) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:29:25,092 INFO L290 TraceCheckUtils]: 36: Hoare triple {15906#(and (= 325 (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6)) (= (+ (- 3) main_~main__i~0) 26) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15910#(and (= 325 (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)) (<= 1 main_~main__n~0) (= (+ (- 4) main_~main__i~0) 26))} is VALID [2022-04-28 03:29:25,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {15910#(and (= 325 (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)) (<= 1 main_~main__n~0) (= (+ (- 4) main_~main__i~0) 26))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15914#(and (= 31 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ (- 140) main_~main__sum~0) 325))} is VALID [2022-04-28 03:29:25,094 INFO L290 TraceCheckUtils]: 38: Hoare triple {15914#(and (= 31 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ (- 140) main_~main__sum~0) 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15918#(and (= main_~main__sum~0 (+ 464 main_~main__i~0)) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 31))} is VALID [2022-04-28 03:29:25,094 INFO L290 TraceCheckUtils]: 39: Hoare triple {15918#(and (= main_~main__sum~0 (+ 464 main_~main__i~0)) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 31))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15922#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 528) (= 33 main_~main__i~0))} is VALID [2022-04-28 03:29:25,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {15922#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 528) (= 33 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15926#(and (= (+ main_~main__sum~0 (- 33)) 528) (= 34 main_~main__i~0) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:29:25,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {15926#(and (= (+ main_~main__sum~0 (- 33)) 528) (= 34 main_~main__i~0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15930#(and (= (+ (- 1) main_~main__i~0) 34) (<= 1 main_~main__n~0) (= (+ 560 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-28 03:29:25,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {15930#(and (= (+ (- 1) main_~main__i~0) 34) (<= 1 main_~main__n~0) (= (+ 560 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15934#(and (= 34 (+ (- 2) main_~main__i~0)) (= (+ main_~main__i~0 559) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0))} is VALID [2022-04-28 03:29:25,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {15934#(and (= 34 (+ (- 2) main_~main__i~0)) (= (+ main_~main__i~0 559) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15938#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ 558 main_~main__i~0)) (<= 1 main_~main__n~0) (= 34 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-28 03:29:25,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {15938#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ 558 main_~main__i~0)) (<= 1 main_~main__n~0) (= 34 (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15942#(and (= 34 (+ (- 4) main_~main__i~0)) (<= 1 main_~main__n~0) (= (+ 557 main_~main__i~0) (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6)))} is VALID [2022-04-28 03:29:25,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {15942#(and (= 34 (+ (- 4) main_~main__i~0)) (<= 1 main_~main__n~0) (= (+ 557 main_~main__i~0) (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15946#(and (= 595 (+ main_~main__sum~0 (- 146))) (<= 1 main_~main__n~0) (= 39 main_~main__i~0))} is VALID [2022-04-28 03:29:25,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {15946#(and (= 595 (+ main_~main__sum~0 (- 146))) (<= 1 main_~main__n~0) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15950#(and (= main_~main__sum~0 780) (<= main_~main__sum~0 (+ 741 main_~main__n~0)) (<= (+ main_~main__i~0 740) main_~main__sum~0))} is VALID [2022-04-28 03:29:25,112 INFO L290 TraceCheckUtils]: 47: Hoare triple {15950#(and (= main_~main__sum~0 780) (<= main_~main__sum~0 (+ 741 main_~main__n~0)) (<= (+ main_~main__i~0 740) main_~main__sum~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {15954#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:29:25,113 INFO L290 TraceCheckUtils]: 48: Hoare triple {15954#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {15768#false} is VALID [2022-04-28 03:29:25,113 INFO L290 TraceCheckUtils]: 49: Hoare triple {15768#false} assume !false; {15768#false} is VALID [2022-04-28 03:29:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:29:25,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:29:30,597 INFO L290 TraceCheckUtils]: 49: Hoare triple {15768#false} assume !false; {15768#false} is VALID [2022-04-28 03:29:30,598 INFO L290 TraceCheckUtils]: 48: Hoare triple {15954#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {15768#false} is VALID [2022-04-28 03:29:30,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {15967#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {15954#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 03:29:30,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {15971#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15967#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-28 03:29:30,627 INFO L290 TraceCheckUtils]: 45: Hoare triple {15975#(or (<= (+ 2 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 1) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 4 main_~main__i~0) 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15971#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} is VALID [2022-04-28 03:29:30,637 INFO L290 TraceCheckUtils]: 44: Hoare triple {15979#(or (= (+ (* main_~main__sum~0 2) (* 6 main_~main__i~0) 6) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 3 main_~main__i~0) main_~main__n~0) (not (<= (+ 2 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15975#(or (<= (+ 2 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 1) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 4 main_~main__i~0) 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,647 INFO L290 TraceCheckUtils]: 43: Hoare triple {15983#(or (not (<= (+ 3 main_~main__i~0) main_~main__n~0)) (<= (+ 4 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 8 main_~main__i~0) 12) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15979#(or (= (+ (* main_~main__sum~0 2) (* 6 main_~main__i~0) 6) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 3 main_~main__i~0) main_~main__n~0) (not (<= (+ 2 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,663 INFO L290 TraceCheckUtils]: 42: Hoare triple {15987#(or (<= (+ 5 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) 20 (* 10 main_~main__i~0))) (not (<= (+ 4 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15983#(or (not (<= (+ 3 main_~main__i~0) main_~main__n~0)) (<= (+ 4 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 8 main_~main__i~0) 12) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {15991#(or (= (+ (* main_~main__sum~0 2) (* 12 main_~main__i~0) 30) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 6 main_~main__i~0) main_~main__n~0) (not (<= (+ 5 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15987#(or (<= (+ 5 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) 20 (* 10 main_~main__i~0))) (not (<= (+ 4 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {15995#(or (<= (+ 7 main_~main__i~0) main_~main__n~0) (not (<= (+ 6 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 14 main_~main__i~0) 42) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15991#(or (= (+ (* main_~main__sum~0 2) (* 12 main_~main__i~0) 30) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 6 main_~main__i~0) main_~main__n~0) (not (<= (+ 5 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {15999#(or (= (+ (* main_~main__sum~0 2) 56 (* 16 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 8 main_~main__i~0) main_~main__n~0) (not (<= (+ 7 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15995#(or (<= (+ 7 main_~main__i~0) main_~main__n~0) (not (<= (+ 6 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 14 main_~main__i~0) 42) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,708 INFO L290 TraceCheckUtils]: 38: Hoare triple {16003#(or (not (<= (+ 8 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 72 (* 18 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 9 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15999#(or (= (+ (* main_~main__sum~0 2) 56 (* 16 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 8 main_~main__i~0) main_~main__n~0) (not (<= (+ 7 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {16007#(or (not (<= (+ 9 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 20 main_~main__i~0) 90) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 10 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16003#(or (not (<= (+ 8 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 72 (* 18 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 9 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-28 03:29:30,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {16011#(or (<= (+ 11 main_~main__i~0) main_~main__n~0) (not (<= (+ 10 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 110 (* 22 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16007#(or (not (<= (+ 9 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 20 main_~main__i~0) 90) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 10 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-28 03:29:30,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {16015#(or (not (<= (+ 11 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* main_~main__i~0 24) 132)) (<= (+ 12 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16011#(or (<= (+ 11 main_~main__i~0) main_~main__n~0) (not (<= (+ 10 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 110 (* 22 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {16019#(or (<= (+ 13 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 26 main_~main__i~0) 156) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 12 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16015#(or (not (<= (+ 11 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* main_~main__i~0 24) 132)) (<= (+ 12 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-28 03:29:30,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {16023#(or (= (+ (* main_~main__sum~0 2) (* 28 main_~main__i~0) 182) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 14 main_~main__i~0) main_~main__n~0) (not (<= (+ 13 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16019#(or (<= (+ 13 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 26 main_~main__i~0) 156) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 12 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {16027#(or (not (<= (+ 14 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 30 main_~main__i~0) 210) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 15 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16023#(or (= (+ (* main_~main__sum~0 2) (* 28 main_~main__i~0) 182) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 14 main_~main__i~0) main_~main__n~0) (not (<= (+ 13 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {16031#(or (not (<= (+ 15 main_~main__i~0) main_~main__n~0)) (= (+ (* 32 main_~main__i~0) (* main_~main__sum~0 2) 240) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 16 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16027#(or (not (<= (+ 14 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 30 main_~main__i~0) 210) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 15 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-28 03:29:30,803 INFO L290 TraceCheckUtils]: 30: Hoare triple {16035#(or (not (<= (+ 16 main_~main__i~0) main_~main__n~0)) (<= (+ 17 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 34 main_~main__i~0) 272) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16031#(or (not (<= (+ 15 main_~main__i~0) main_~main__n~0)) (= (+ (* 32 main_~main__i~0) (* main_~main__sum~0 2) 240) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 16 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-28 03:29:30,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {16039#(or (<= (+ 18 main_~main__i~0) main_~main__n~0) (not (<= (+ 17 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 306 (* 36 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16035#(or (not (<= (+ 16 main_~main__i~0) main_~main__n~0)) (<= (+ 17 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 34 main_~main__i~0) 272) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {16043#(or (not (<= (+ 18 main_~main__i~0) main_~main__n~0)) (<= (+ 19 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) 342 (* 38 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16039#(or (<= (+ 18 main_~main__i~0) main_~main__n~0) (not (<= (+ 17 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 306 (* 36 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {16047#(or (not (<= (+ 19 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 40 main_~main__i~0) 380) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 20 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16043#(or (not (<= (+ 18 main_~main__i~0) main_~main__n~0)) (<= (+ 19 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) 342 (* 38 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {16051#(or (<= (+ 21 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 42 main_~main__i~0) 420) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 20 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16047#(or (not (<= (+ 19 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 40 main_~main__i~0) 380) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 20 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-28 03:29:30,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {16055#(or (not (<= (+ 21 main_~main__i~0) main_~main__n~0)) (<= (+ 22 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 44 main_~main__i~0) 462) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16051#(or (<= (+ 21 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 42 main_~main__i~0) 420) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 20 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {16059#(or (= (+ (* main_~main__sum~0 2) (* 46 main_~main__i~0) 506) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 23 main_~main__i~0) main_~main__n~0) (not (<= (+ 22 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16055#(or (not (<= (+ 21 main_~main__i~0) main_~main__n~0)) (<= (+ 22 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 44 main_~main__i~0) 462) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {16063#(or (= (+ (* main_~main__sum~0 2) (* 48 main_~main__i~0) 552) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 23 main_~main__i~0) main_~main__n~0)) (<= (+ main_~main__i~0 24) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16059#(or (= (+ (* main_~main__sum~0 2) (* 46 main_~main__i~0) 506) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 23 main_~main__i~0) main_~main__n~0) (not (<= (+ 22 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {16067#(or (= (+ (* main_~main__sum~0 2) 600 (* main_~main__i~0 50)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 25 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 24) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16063#(or (= (+ (* main_~main__sum~0 2) (* 48 main_~main__i~0) 552) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 23 main_~main__i~0) main_~main__n~0)) (<= (+ main_~main__i~0 24) main_~main__n~0))} is VALID [2022-04-28 03:29:30,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {16071#(or (= (+ (* main_~main__sum~0 2) 650 (* 52 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 25 main_~main__i~0) main_~main__n~0)) (<= (+ 26 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16067#(or (= (+ (* main_~main__sum~0 2) 600 (* main_~main__i~0 50)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 25 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 24) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {16075#(or (not (<= (+ 26 main_~main__i~0) main_~main__n~0)) (<= (+ main_~main__i~0 27) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* main_~main__i~0 54) 702) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16071#(or (= (+ (* main_~main__sum~0 2) 650 (* 52 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 25 main_~main__i~0) main_~main__n~0)) (<= (+ 26 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-28 03:29:30,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {16079#(or (<= (+ 28 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 27) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 756 (* 56 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16075#(or (not (<= (+ 26 main_~main__i~0) main_~main__n~0)) (<= (+ main_~main__i~0 27) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* main_~main__i~0 54) 702) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {16083#(or (<= (+ 29 main_~main__i~0) main_~main__n~0) (not (<= (+ 28 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 812 (* 58 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16079#(or (<= (+ 28 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 27) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 756 (* 56 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {16087#(or (not (<= (+ 29 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 870 (* 60 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 30 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16083#(or (<= (+ 29 main_~main__i~0) main_~main__n~0) (not (<= (+ 28 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 812 (* 58 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {16091#(or (<= (+ 31 main_~main__i~0) main_~main__n~0) (not (<= (+ 30 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 62 main_~main__i~0) 930) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16087#(or (not (<= (+ 29 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 870 (* 60 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 30 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-28 03:29:30,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {16095#(or (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 64 main_~main__i~0) 992)) (<= (+ 32 main_~main__i~0) main_~main__n~0) (not (<= (+ 31 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16091#(or (<= (+ 31 main_~main__i~0) main_~main__n~0) (not (<= (+ 30 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 62 main_~main__i~0) 930) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {16099#(or (not (<= (+ 32 main_~main__i~0) main_~main__n~0)) (<= (+ 33 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) 1056 (* 66 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16095#(or (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 64 main_~main__i~0) 992)) (<= (+ 32 main_~main__i~0) main_~main__n~0) (not (<= (+ 31 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {16103#(or (not (<= (+ 33 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 68 main_~main__i~0) 1122) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 34 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16099#(or (not (<= (+ 32 main_~main__i~0) main_~main__n~0)) (<= (+ 33 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) 1056 (* 66 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:30,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {16107#(or (= (+ (* main_~main__sum~0 2) 1190 (* 70 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 34 main_~main__i~0) main_~main__n~0)) (<= (+ 35 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16103#(or (not (<= (+ 33 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 68 main_~main__i~0) 1122) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 34 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-28 03:29:30,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {16111#(or (<= (+ 36 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 72 main_~main__i~0) 1260) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 35 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16107#(or (= (+ (* main_~main__sum~0 2) 1190 (* 70 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 34 main_~main__i~0) main_~main__n~0)) (<= (+ 35 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-28 03:29:31,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {16115#(or (not (<= (+ 36 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 1332 (* 74 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 37 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16111#(or (<= (+ 36 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 72 main_~main__i~0) 1260) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 35 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:31,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {16119#(or (<= (+ 38 main_~main__i~0) main_~main__n~0) (not (<= (+ 37 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 1406 (* 76 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16115#(or (not (<= (+ 36 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 1332 (* 74 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 37 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-28 03:29:31,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {16123#(or (= (+ 1482 (* main_~main__sum~0 2) (* 78 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 38 main_~main__i~0) main_~main__n~0)) (<= (+ 39 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16119#(or (<= (+ 38 main_~main__i~0) main_~main__n~0) (not (<= (+ 37 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 1406 (* 76 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-28 03:29:31,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {15767#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {16123#(or (= (+ 1482 (* main_~main__sum~0 2) (* 78 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 38 main_~main__i~0) main_~main__n~0)) (<= (+ 39 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-28 03:29:31,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {15767#true} assume !!(1 <= ~main__n~0); {15767#true} is VALID [2022-04-28 03:29:31,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {15767#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {15767#true} is VALID [2022-04-28 03:29:31,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {15767#true} call #t~ret5 := main(); {15767#true} is VALID [2022-04-28 03:29:31,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15767#true} {15767#true} #38#return; {15767#true} is VALID [2022-04-28 03:29:31,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {15767#true} assume true; {15767#true} is VALID [2022-04-28 03:29:31,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {15767#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_80~0 := 0; {15767#true} is VALID [2022-04-28 03:29:31,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {15767#true} call ULTIMATE.init(); {15767#true} is VALID [2022-04-28 03:29:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:29:31,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:29:31,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644833710] [2022-04-28 03:29:31,030 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:29:31,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852666720] [2022-04-28 03:29:31,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852666720] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:29:31,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:29:31,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 84 [2022-04-28 03:29:31,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:29:31,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1363071579] [2022-04-28 03:29:31,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1363071579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:29:31,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:29:31,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 03:29:31,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661040111] [2022-04-28 03:29:31,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:29:31,031 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 03:29:31,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:29:31,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:31,184 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 03:29:31,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 03:29:31,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:29:31,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 03:29:31,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1729, Invalid=5243, Unknown=0, NotChecked=0, Total=6972 [2022-04-28 03:29:31,187 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)